DSA-251 Sheet by Parikh Jain — 251 DSA Problems, Basics to Advanced

DSA-251 is Parikh Jain's DSA sheet on ProPeers: 251 problems arranged into four levels so you can go from the basics to advanced topics in order, and track your progress as you solve them.

What's in the DSA-251 sheet

  1. 1. Basic DSA

    51 problems

    Covers topics like Arrays, Strings, Maps/Sets, Two Pointers, Basic Algorithms.

  2. 2. Intermediate DSA

    75 problems

    Covers topics like Binary Search, Recursion Basics, Linked List, Stacks & Queues, Binary Trees, BST.

  3. 3. Advanced DSA

    100 problems

    Covers topics like Greedy Techniques, Tries, Sliding Window, Priority Queues/Heaps, Advanced Recursion/ Backtracking, Dynamic Programming, Graphs.

  4. 4. Miscellaneous DSA

    25 problems

    Covers topics like Bit Manipulation, String Algorithms, Segment Trees, Number Theory, DP With Trees.

What you'll learn

  • Understanding of basic DSA.
  • Improve problem-solving skills with intermediate topics such as recursion.
  • Master advanced DSA like dynamic programming and graphs.
  • Get to know unique topics like bit manipulation and number theory.

How to use the sheet

Work through the levels in order — Basic, then Intermediate, Advanced and finally Miscellaneous. Open the DSA-251 roadmap to see every problem, mark them done and keep your streak going.