Rohit Negi (Coder Army)

Rohit Negi DSA Sheet

An extensive problem set covering DSA topics in depth, from Coder Army.

By Rohit Negi (Coder Army) · 725 Problems

Total Problems: 725Difficulty Levels:BasicEasyMediumHard

Loading your progress…0/725
Array Search
GeeksforGeeksBasic
Check Equal Arrays
GeeksforGeeksEasy
Missing element of AP
GeeksforGeeksMedium
Rotate Array by One
GeeksforGeeksBasic
Min and Max in Array
GeeksforGeeksBasic
Binary Array Sorting
GeeksforGeeksMedium
Move all negative elements to end
GeeksforGeeksEasy
Missing number
GeeksforGeeksEasy
Search a 2D Matrix
LeetCodeMedium
Find the fine
GeeksforGeeksBasic
Greater on right side
GeeksforGeeksEasy
Remove Duplicates Sorted Array
GeeksforGeeksEasy
Indexes of Subarray Sum
GeeksforGeeksMedium
Sort 0s, 1s and 2s
GeeksforGeeksMedium
Equilibrium Point
GeeksforGeeksEasy
Peak element
GeeksforGeeksMedium
Find Transition Point
GeeksforGeeksEasy
Alternate Positive Negative
GeeksforGeeksEasy
Union of 2 Sorted Arrays
GeeksforGeeksMedium
Three way partitioning
GeeksforGeeksEasy
Frogs and Jumps
GeeksforGeeksEasy
Min Subsets with Consecutive Numbers
GeeksforGeeksEasy
Missing And Repeating
GeeksforGeeksEasy
Rearrange Array Alternately
GeeksforGeeksMedium
Pythagorean Triplet
GeeksforGeeksMedium
Rearrange an array with O(1) extra space
GeeksforGeeksMedium
Triplets with Smaller Sum
GeeksforGeeksMedium
Boolean Matrix
GeeksforGeeksMedium
Row with max 1s
GeeksforGeeksMedium
Container With Most Water
GeeksforGeeksMedium
Maximum Triplet product
GeeksforGeeksMedium
Coins of Geekland
GeeksforGeeksMedium
Next Permutation
LeetCodeMedium
Rotate Image
LeetCodeMedium
Count Primes
LeetCodeMedium
Watering Plants
LeetCodeMedium
Arithmetic Subarrays
LeetCodeMedium
Majority Element
GeeksforGeeksEasy
Max Circular Subarray Sum
GeeksforGeeksHard
Subarrays Product Less than K
GeeksforGeeksMedium
Maximum subset XOR
GeeksforGeeksHard
Next Smallest Palindrome
GeeksforGeeksHard
Count the number of subarrays
GeeksforGeeksHard
Largest rectangle of 1s with swapping of columns allowed
GeeksforGeeksHard
N/3 Repeat Number
InterviewBitMedium

Log in to save your progress, favorites, and notes to your account.

Frequently asked questions

What is the Rohit Negi DSA Sheet?

An extensive data structures and algorithms problem set created by Rohit Negi of Coder Army, covering topics in depth across 17 sections.

How many problems does it have?

725 problems, the largest of the sheets on this site.

Is it free to use?

Yes. Browsing every problem on this page is completely free, with no account required. Creating a free DevsUnite account lets you save your checked-off progress, star favorites, and add personal notes that sync across devices.

Do I need an account to track my progress?

You can read and solve every problem without logging in. An account is only required to mark a problem as done, star it, or add a note. Those actions save to your account instead of resetting on refresh.