Loading…
The most-attempted HackerEarth practice problems across every track — strong on classic algorithm theory (MST, segment trees, DP) that university and product-company tests love.
About this plan
HackerEarth is the platform of choice for many campus hiring drives and competitive-programming-flavoured interviews. Its practice tracks lean harder into classic algorithm theory than LeetCode — minimum spanning trees, segment trees, modular arithmetic, and the full DP zoo. This 150-problem set collects the highest-attempt problems across Basic Programming, Arrays, Strings, Sorting/Searching, Greedy, DP, Graphs, Trees, Math, Bit Manipulation, and Recursion.
Every problem links to an InterviewExplainer walkthrough in the same brute-force → optimal, line-by-line Java and Python format. Problems not yet authored show as "Queued"; the list stays stable so progress carries over.
Why this sheet
How to use it
The problem set
Warm-up implementation, simulation, and number basics.
Prefix sums, scanning, and order statistics.
Pattern matching, hashing, and transformation.
Binary search on the answer and order statistics.
Exchange-argument and scheduling problems.
Knapsack family, grids, and string DP.
BFS, DFS, MST, and shortest paths.
Traversals, LCA, and range-query trees.
Sieve, modular arithmetic, and combinatorics.
Masks, XOR tricks, and subset enumeration.
Generate, prune, and classic recursion.
Keep exploring