All Problems1151 problems
Medium Clear all
StatusProblemDifficultySubmissionsAccuracy
Indexes of Subarray Sum
MEDIUM2M16.5%
Kadane's Algorithm
MEDIUM1M36.28%
Minimum Jumps
MEDIUM1M11.91%
Sort 0s, 1s and 2s
MEDIUM880K50.58%
Longest Subarray with Sum K
MEDIUM856K24.64%
Majority Element
MEDIUM850K27.82%
Kth Smallest
MEDIUM842K35.17%
Count Inversions
MEDIUM794K16.93%
Minimize the Heights II
MEDIUM793K15.06%
Rotate Array
MEDIUM772K37.06%
Undirected Graph Cycle
MEDIUM763K30.13%
Minimum Platforms
MEDIUM678K26.84%
Count Subsets with Sum
MEDIUM663K20.58%
Peak element
MEDIUM648K38.86%
Check for BST
MEDIUM614K25.37%
0 - 1 Knapsack Problem
MEDIUM609K31.76%
Directed Graph Cycle
MEDIUM607K27.88%
Activity Selection
MEDIUM590K36.21%
Tree Boundary Traversal
MEDIUM577K23.33%
Union of 2 Sorted Arrays
MEDIUM565K31.39%
Remove Cycle in Linked List
MEDIUM564K27.66%
Next Greater Element
MEDIUM540K32.95%
Detect Loop in linked list
MEDIUM537K43.49%
Maximum Product Subarray
MEDIUM522K18.09%
Subset Sum Problem
MEDIUM489K32.0%
K Sized Subarray Maximum
MEDIUM487K26.04%
Largest subarray with 0 sum
MEDIUM483K41.84%
Smallest Positive Missing
MEDIUM481K25.13%
Top View of Binary Tree
MEDIUM479K38.43%
Row with Max 1s in Rowwise Sorted
MEDIUM454K33.09%
All Problems1151 problems
Medium Clear all
StatusProblemDifficultySubmissionsAccuracy
Indexes of Subarray Sum
MEDIUM2M16.5%
Kadane's Algorithm
MEDIUM1M36.28%
Minimum Jumps
MEDIUM1M11.91%
Sort 0s, 1s and 2s
MEDIUM880K50.58%
Longest Subarray with Sum K
MEDIUM856K24.64%
Majority Element
MEDIUM850K27.82%
Kth Smallest
MEDIUM842K35.17%
Count Inversions
MEDIUM794K16.93%
Minimize the Heights II
MEDIUM793K15.06%
Rotate Array
MEDIUM772K37.06%
Undirected Graph Cycle
MEDIUM763K30.13%
Minimum Platforms
MEDIUM678K26.84%
Count Subsets with Sum
MEDIUM663K20.58%
Peak element
MEDIUM648K38.86%
Check for BST
MEDIUM614K25.37%
0 - 1 Knapsack Problem
MEDIUM609K31.76%
Directed Graph Cycle
MEDIUM607K27.88%
Activity Selection
MEDIUM590K36.21%
Tree Boundary Traversal
MEDIUM577K23.33%
Union of 2 Sorted Arrays
MEDIUM565K31.39%
Remove Cycle in Linked List
MEDIUM564K27.66%
Next Greater Element
MEDIUM540K32.95%
Detect Loop in linked list
MEDIUM537K43.49%
Maximum Product Subarray
MEDIUM522K18.09%
Subset Sum Problem
MEDIUM489K32.0%
K Sized Subarray Maximum
MEDIUM487K26.04%
Largest subarray with 0 sum
MEDIUM483K41.84%
Smallest Positive Missing
MEDIUM481K25.13%
Top View of Binary Tree
MEDIUM479K38.43%
Row with Max 1s in Rowwise Sorted
MEDIUM454K33.09%