Diwali Offer!Flat 20% OFF
Enroll Now
PrakalpanaLive online tech training

Top 200 DSA Problems for Placements

The coding problems most asked in campus placements and product company interviews, as a 60-day plan. Write your code, run it against real test cases, then read a detailed solution in Python, JavaScript, Java and C++.

200
problems
60
day plan
4
languages
49/131/20
easy/medium/hard

Asked at

  • Amazon
  • Microsoft
  • Google
  • Adobe
  • Flipkart
  • Goldman Sachs
  • TCS
  • Infosys
1. Read Problem, examples and constraints.
2. Try Code in Python, JavaScript, Java or C++. Take a hint if stuck.
3. Test Run Python or JavaScript against every test case in your browser.
4. Learn Intuition, steps, complexity and code in 4 languages.
Your progress0 / 200 solved
Start: Day 1, Two SumProgress and code are saved in this browser. No sign-up needed.

Day 1

Arrays & Hashing0/4

Day 2

Arrays & Hashing0/4

Day 3

Arrays & Hashing0/4

Day 4

Arrays & Hashing0/4

Day 5

Arrays & Hashing0/3

Day 6

Arrays & Hashing0/3

Day 7

Two Pointers0/4

Day 8

Two Pointers0/3

Day 9

Two Pointers0/3

Day 10

Revision day

Revision: re-solve every problem from days 1 to 9 that you could not finish without a hint. Time yourself: 20 minutes for Easy, 35 for Medium.

Day 11

Sliding Window0/4

Day 12

Sliding Window0/3

Day 13

Sliding Window0/3

Day 14

Strings0/4

Day 15

Strings0/4

Day 16

Strings0/4

Day 17

Binary Search0/5

Day 18

Binary Search0/4

Day 19

Binary Search0/4

Day 20

Revision day

Revision: Strings and Binary Search. Write the binary search template from memory and explain both boundary cases out loud.

Day 21

Linked List0/4

Day 22

Linked List0/4

Day 23

Linked List0/4

Day 24

Linked List0/3

Day 25

Stack & Queue0/5

Day 26

Stack & Queue0/4

Day 27

Stack & Queue0/4

Day 28

Recursion & Backtracking0/4

Day 29

Recursion & Backtracking0/3

Day 30

Revision day

Revision: Linked List and Stack. Practice explaining pointer changes on paper before you code.

Day 31

Recursion & Backtracking0/3

Day 32

Recursion & Backtracking0/3

Day 33

Trees & BST0/4

Day 34

Trees & BST0/4

Day 35

Trees & BST0/4

Day 36

Trees & BST0/4

Day 37

Trees & BST0/3

Day 38

Trees & BST0/3

Day 39

Heap / Priority Queue0/5

Day 40

Revision day

Revision: Backtracking and Trees. Draw the recursion tree for two problems and state the complexity.

Day 41

Heap / Priority Queue0/4

Day 42

Graphs0/4

Day 43

Graphs0/4

Day 44

Graphs0/4

Day 45

Graphs0/4

Day 46

Graphs0/4

Day 47

Dynamic Programming0/4

Day 48

Dynamic Programming0/4

Day 49

Dynamic Programming0/4

Day 50

Revision day

Revision: Heap and Graphs. Re-solve Number of Islands, Course Schedule and Network Delay Time without looking.

Day 51

Dynamic Programming0/4

Day 52

Dynamic Programming0/3

Day 53

Dynamic Programming0/3

Day 54

Dynamic Programming0/3

Day 55

Greedy & Intervals0/4

Day 56

Greedy & Intervals0/3

Day 57

Greedy & Intervals0/3

Day 58

Bit Manipulation & Math0/3

Day 59

Bit Manipulation & Math0/3

Day 60

Final mock

Mock interview day: pick 3 random unsolved or hard problems, 45 minutes each, talk through your approach as if an interviewer is listening.

Want a mentor to review your code and run mock interviews? Join the live DSA course with an industry engineer.

See the DSA course

Frequently asked questions

Is the DSA practice free?

Yes. All 200 problems, tests and solutions are free and need no sign-up. Your progress and code are saved in your own browser.

Which languages can I use?

You can write in Python, JavaScript, Java or C++, and every problem has a full solution in all four. Python and JavaScript run against the test cases directly in your browser; for Java and C++ you write your code and compare it with the reference solution.

Are these the problems companies actually ask?

The list is built from the problems most often reported in campus placement and product company interviews (Amazon, Microsoft, Google, Adobe, Flipkart, Goldman Sachs, TCS, Infosys and others). Each problem lists the companies where it is frequently asked.

How many hours a day does the 60-day plan need?

About 2 to 3 hours: three or four problems a day, with a revision day after every nine study days and a mock interview on day 60.

I am a complete beginner. Can I start here?

Start once you know one language well enough to write loops, functions and use lists and maps. Day 1 begins with easy array problems and the difficulty rises slowly within each topic.

Not sure what to learn next?

A 1-on-1 session with an industry mentor and a roadmap built for you. How it works

  1. 1Discuss your goals
  2. 2Get a personal plan
  3. 3Start learning
Book for β‚Ή200/ 30 min