Skip to content

Latest commit

 

History

History
65 lines (60 loc) · 12.2 KB

File metadata and controls

65 lines (60 loc) · 12.2 KB

Well-structured HackerRank Software Engineer Prep Kit Problem Solutions (JavaScript and Python)

Table of Contents

S.No Title Difficulty
1 Count Elements Greater Than Previous Average Easy
2 Find the Smallest Missing Positive Integer Easy
3 Check Palindrome by Filtering Non-Letters Easy
4 Check for Non-Identical String Rotation Easy
5 Target Index Search Easy
6 Find First Occurrence Easy
7 Maximum Number of Non-Overlapping Intervals Easy
8 Validate Properly Nested Brackets Easy
9 Min-Tracking Stack Implementation Easy
10 One-Pass Removal of k-th Node from End Easy
11 Count Number Pairs Easy
12 Remove Consecutive Duplicates from Sorted Linked List Easy
13 Generate Valid Angle Bracket Sequences Easy
14 Remove Elements Within K Distance Easy
15 Two Sum Easy
16 Check Valid Anagram Easy
17 Lexicographical Letter Combinations of Phone Digits Easy
18 Place N Cameras Without Conflict on Blocked Grid Easy
19 Custom Fibonacci Sequence Easy
20 Ways to Fill Slots with Single or Double Coverage Easy
21 Count Connected Components in Network Easy
22 Height of Binary Search Tree Easy
23 Compare BSTs for Equal Values but Different Structure Easy
24 Detect Cycle in Module Dependency Graph Easy
25 Merge and Sort Intervals Medium
26 Longest Arithmetic Subsequence with Given Difference Medium
27 Pivoted Search Medium
28 Find Peak Element in Bitonic Array Medium
29 Max Unique Substring Length in a Session Medium
30 Task Scheduler with Cooldown and Multiple Machines Medium
31 Next Greater Element with Position Offset Medium
32 Zero-Sum Triplets within Sliding Window Medium
33 Maximize Revenue from Video Streams with Bandwidth Limit Medium
34 Reverse Even-Indexed Nodes and Append Medium
35 Longest Alternating Binary Substring with Limited Flips Medium
36 Find Index Combinations with Target Weight Sum Medium
37 Minimum Plans to Reach Target Bandwidth Medium
38 Longest Increasing Subsequence Length Medium
39 Top K Frequent Events with Order Preservation Medium
40 Peak Concurrent Sessions per User Group Medium
41 Queue from Two Stacks Medium
42 Shortest Path with Processing Delays at Nodes Medium
43 Min Spanning Tree with One Free Edge Medium
44 Subarrays with Given Sum and Bounded Maximum Hard
45 Median of Two Circularly Sorted Logs Hard
46 Maximize Profit with Task Deadlines and Multiple Servers Hard
47 Max Area Under Histogram After Removing One Bar Hard
48 Smallest Substring Containing All Patterns Hard
49 Minimize Task Cancellations to Avoid Server Overlaps Hard
50 Counting Stable Performance Intervals Hard
51 Solve Diagonal Sudoku with 3x3 Blocks Hard
52 Min Cost to Convert String Arrays with Edit Distance Hard
53 Priority-Aware LRU Cache Hard

MIT License

Copyright (c) 2025 Anuj Singh