0% found this document useful (0 votes)
95 views

100 Must Do Leet Code Problems

This document provides a guide to practicing 100 must-do Leetcode problems. It lists 14 data structures and algorithms topics to practice, including arrays, strings, searching and sorting, recursion, hashing, matrices, linked lists, bit manipulation, stacks and queues, trees, tries, heaps, graphs, and dynamic programming. Under each topic are instructions to practice multiple problems.

Uploaded by

Johnathn Riziik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
95 views

100 Must Do Leet Code Problems

This document provides a guide to practicing 100 must-do Leetcode problems. It lists 14 data structures and algorithms topics to practice, including arrays, strings, searching and sorting, recursion, hashing, matrices, linked lists, bit manipulation, stacks and queues, trees, tries, heaps, graphs, and dynamic programming. Under each topic are instructions to practice multiple problems.

Uploaded by

Johnathn Riziik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 35

100

Must Do
Leetcode
Problems
*Disclaimer*
Everyone learns uniquely.

What matters is developing the problem


solving ability to solve new problems.

This Doc will help you with the same.

1
 ARRAYS:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice
2
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

3
Practice
Practice

4
 STRINGS:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

5
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

6
Practice
Practice

7
SEARCHING AND SORTING
ALGORITHMS:

Practice
Practice

Practice
Practice

Practice
Practice

8
Practice
Practice

9
 RECURSION:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

10
Practice
Practice

Practice
Practice

Practice
Practice

11
 HASHING:

Practice
Practice

Practice
Practice

Practice
Practice

12
Practice
Practice

13
 MATRICES AND
MULTIDIMENSIONAL ARRAYS:

Practice
Practice

Practice
Practice

Practice
Practice

14
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice
15
LINKED LIST:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

16
Practice
Practice

Practice
Practice

Practice
Practice

17
Practice
Practice

Practice
Practice

Practice
Practice

18
 BIT MANIPULATION & MATH
CONCEPTS:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

19
Practice
Practice

20
STACKS AND QUEUES:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

21
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

22
Practice
Practice

Practice
Practice

23
 TREES & BINARY SEARCH TREES:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice
24
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

25
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

26
 TRIES:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

27
Practice
Practice

28
 HEAPS:

Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

29
 GRAPHS:

Practice
Practice

Practice
Practice

Practice
Practice

30
Practice
Practice

Practice
Practice

Practice
Practice

31
 DYNAMIC PROGRAMMING AND
GREEDY:

Practice
Practice

Practice
Practice

Practice
Practice

32
Practice
Practice

Practice
Practice

Practice
Practice

Practice
Practice

33
Practice
Practice

34

You might also like