Courses
Sale
Tutorials
Interview Prep
Search
Explore & Practice
Step by Step DSA
Selected
Learn DSA step by step
Start Now
GfG 160
Selected
Beginner to Advanced
Start Now
All Problems
1151 problems
Topic
Difficulty
Company
Sort
Medium
Clear all
Status
Problem
Difficulty
Submissions
Accuracy
Indexes of Subarray Sum
MEDIUM
2M
16.5%
Kadane's Algorithm
MEDIUM
1M
36.28%
Minimum Jumps
MEDIUM
1M
11.91%
Sort 0s, 1s and 2s
MEDIUM
880K
50.58%
Longest Subarray with Sum K
MEDIUM
856K
24.64%
Majority Element
MEDIUM
850K
27.82%
Kth Smallest
MEDIUM
842K
35.17%
Count Inversions
MEDIUM
794K
16.93%
Minimize the Heights II
MEDIUM
793K
15.06%
Rotate Array
MEDIUM
772K
37.06%
Undirected Graph Cycle
MEDIUM
763K
30.13%
Minimum Platforms
MEDIUM
678K
26.84%
Count Subsets with Sum
MEDIUM
663K
20.58%
Peak element
MEDIUM
648K
38.86%
Check for BST
MEDIUM
614K
25.37%
0 - 1 Knapsack Problem
MEDIUM
609K
31.76%
Directed Graph Cycle
MEDIUM
607K
27.88%
Activity Selection
MEDIUM
590K
36.21%
Tree Boundary Traversal
MEDIUM
577K
23.33%
Union of 2 Sorted Arrays
MEDIUM
565K
31.39%
Remove Cycle in Linked List
MEDIUM
564K
27.66%
Next Greater Element
MEDIUM
540K
32.95%
Detect Loop in linked list
MEDIUM
537K
43.49%
Maximum Product Subarray
MEDIUM
522K
18.09%
Subset Sum Problem
MEDIUM
489K
32.0%
K Sized Subarray Maximum
MEDIUM
487K
26.04%
Largest subarray with 0 sum
MEDIUM
483K
41.84%
Smallest Positive Missing
MEDIUM
481K
25.13%
Top View of Binary Tree
MEDIUM
479K
38.43%
Row with Max 1s in Rowwise Sorted
MEDIUM
454K
33.09%
Explore & Practice
Step by Step DSA
Selected
Learn DSA step by step
Start Now
GfG 160
Selected
Beginner to Advanced
Start Now
All Problems
1151 problems
Topic
Difficulty
Company
Sort
Medium
Clear all
Status
Problem
Difficulty
Submissions
Accuracy
Indexes of Subarray Sum
MEDIUM
2M
16.5%
Kadane's Algorithm
MEDIUM
1M
36.28%
Minimum Jumps
MEDIUM
1M
11.91%
Sort 0s, 1s and 2s
MEDIUM
880K
50.58%
Longest Subarray with Sum K
MEDIUM
856K
24.64%
Majority Element
MEDIUM
850K
27.82%
Kth Smallest
MEDIUM
842K
35.17%
Count Inversions
MEDIUM
794K
16.93%
Minimize the Heights II
MEDIUM
793K
15.06%
Rotate Array
MEDIUM
772K
37.06%
Undirected Graph Cycle
MEDIUM
763K
30.13%
Minimum Platforms
MEDIUM
678K
26.84%
Count Subsets with Sum
MEDIUM
663K
20.58%
Peak element
MEDIUM
648K
38.86%
Check for BST
MEDIUM
614K
25.37%
0 - 1 Knapsack Problem
MEDIUM
609K
31.76%
Directed Graph Cycle
MEDIUM
607K
27.88%
Activity Selection
MEDIUM
590K
36.21%
Tree Boundary Traversal
MEDIUM
577K
23.33%
Union of 2 Sorted Arrays
MEDIUM
565K
31.39%
Remove Cycle in Linked List
MEDIUM
564K
27.66%
Next Greater Element
MEDIUM
540K
32.95%
Detect Loop in linked list
MEDIUM
537K
43.49%
Maximum Product Subarray
MEDIUM
522K
18.09%
Subset Sum Problem
MEDIUM
489K
32.0%
K Sized Subarray Maximum
MEDIUM
487K
26.04%
Largest subarray with 0 sum
MEDIUM
483K
41.84%
Smallest Positive Missing
MEDIUM
481K
25.13%
Top View of Binary Tree
MEDIUM
479K
38.43%
Row with Max 1s in Rowwise Sorted
MEDIUM
454K
33.09%
Rate New Design