First Time Problem Name ConfideDifficulty

Language
13-07-22 1 Two Sum 1 E C#
14-07-22 121 Best time to buy ans dell stock 1 E C#
15-07-22 88 Merge two sorted array 1 E C#
16-07-22 118 Pascal's Triangle 1 E C#
17-07-22 136 Single Number 1 E C#
17-07-22 217. Contains Duplicate 1 E C#
17-07-22 169. Majority Element 1 E C#
17-07-22 283. Move Zeroes 1 E C#
17-07-22 1672. Richest Customer Wealth 1 E C#
17-07-22 1572. Matrix Diagonal Sum 1 E C#
18-07-22 832. Flipping an Image 1 E C#
18-07-22 1351. Count Negative Numbers in a Sorted Matrix 1 E C#
18-07-22 1380. Lucky Numbers in a Matrix 1 E C#
18-07-22 566. Reshape the Matrix 1 E C#
19-07-22 883. Projection Area of 3D Shapes 1 E C#
19-07-22 999. Available Captures for Rook 1 E C#
19-07-22 766. Toeplitz Matrix 1 E C#
19-07-22 1582. Special Positions in a Binary Matrix 1 E C#
20-07-22 771. Jewels and Stones 1 E C#
20-07-22 1859. Sorting the Sentence 1 E C#
20-07-22 709. To Lower Case 1 E C#
20-07-22 1704. Determine if String Halves Are Alike 1 E C#
20-07-22 344. Reverse String 1 E C#
20-07-22 541. Reverse String II 1 E C#
20-07-22 704. Binary Search 1 E C#
20-07-22 367. Valid Perfect Square 1 E C#
21-07-22 374. Guess Number Higher or Lower 1 E C#
22-07-22 162. Find Peak Element 1 E C#
22-07-22 69. Sqrt(x) 1 E C#
23-07-22 231. Power of Two 1 E C#
23-07-22 50. Pow(x, n) 1 M C#
24-07-22 206. Reverse Linked List 1 E C#
25-07-22 Merge Two sorted array using recursion 0 E C#
25-07-22 Reverse string using recursion 0 E C#
25-07-22 237. Delete Node in a Linked List 1 E C#
25-07-22 876. Middle of the Linked List 1 E C#
26-07-22 1290. Convert Binary Number in a Linked List to Integer 1 E C#
29-07-22 Remove duplicates from an unsorted linked list 1 E C#
30-07-22 21. Merge Two Sorted Lists 1 E C#
30-07-22 141. Linked List Cycle 1 E C#
31-07-22 160. Intersection of Two Linked Lists 1 E C#
02-08-22 234. Palindrome Linked List 1 M C#
02-08-22 203. Remove Linked List Elements 1 e C#
5-08/22 1472. Design Browser History 1 m C#
09-08-22 496. Next Greater Element I 1 M C#
10-08-22 155. Min Stack 1 M C#
10-08-22 225. Implement Stack using Queues 1 M C#
10-08-22 1111. Maximum Nesting Depth of Two Valid Parentheses Strings 0 M C#
10-08-22 Reverse the array 1 E JS
10-08-22 Find the maximum and minimum element in an array 1 E JS
12-08-22 215. Kth Largest
Kth smallest Element in an Array
element 1 E JS
12-08-22 1 E JS
12-08-22 75. Sort Colors 1 M C#
13-08-22 Move all negative numbers to beginning and positive to end 1 M C#
13-08-22 Union of two arrays 1 M JS
13-08-22 349. Intersection of Two Arrays 1 M JS
13-08-22 Remove Consecutive Characters 0
15-08-22 189. Rotate Array 1 M C#
15-08-22 532. K-diff Pairs in an Array 0
06-09-2022 53. Maximum Subarray 1 M C#
07-09-22 523. Continuous Subarray Sum 1 M C#
12-09-22 1749. Maximum Absolute Sum of Any Subarray 1 M C#
13-09-22 73. Set Matrix Zeroes 1 M C#
13-09-22 31. Next Permutation 1 M C#
14-09-22 48. Rotate Image 1 M C#
14-09-22 56. Merge Intervals 1 M C#
16-09-22 287. Find the Duplicate Number 1 M C#
18-09-22 74. Search a 2D Matrix 1 M C#
18-09-22 229. Majority Element II 1 M C#
19-09-22 62. Unique Paths 1 M C#
0
0
0
0
23-09-22 128. Longest Consecutive Sequence 1 M C#
23-09-22 Largest subarray with 0 sum 1 M java
23-09-22 Subarray with given XOR 1 M java
26-09-22 3. Longest Substring Without Repeating Characters 1 M java
26-09-22 19. Remove Nth Node From End of List 1 M C#
26-09-22 2. Add Two Numbers 1 M C#
27-09-22 25. Reverse Nodes in k-Group 1 H C#
30-09-22 142. Linked List Cycle II 1 M C#
02-10-22 Flattening a Linked List 1 M java
04-10-22 61. Rotate List 1 M C#
04-10-22 138. Copy List with Random Pointer 1 M C#
10-10-22 15. 3Sum 1 M C#
10-10-22 485. Max Consecutive Ones 1 E C#
10-10-22 42. Trapping Rain Water 1 H C#
10-10-22 26. Remove Duplicates from Sorted Array 1 E C#
12-10-22 N meetings in one room 1 E C#
13-10-22 Minimum Platforms 1 M java
13-10-22 Job Sequencing Problem 1 M java
26-10-22 Fractional Knapsack 1 M java
26-10-22 Find minimum number of coins 1 E java
26-10-22 Subset Sums 1 M java
03-11-22 90. Subsets II 1 M java
39. Combination Sum 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
 Category Website-1 Solutions TC
Array https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ O(n) , O(n^2) , O(nlogn)
Array https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ O(n)
Array https://leetcode.com/problems/merge-sorted-array/ O(n)
Array https://leetcode.com/problems/pascals-triangle/ o(n^2)
Array https://leetcode.com/problems/single-number/ O(n)
Array https://leetcode.com/problems/contains-duplicate/ o(n) , O(nLogn)
Array https://leetcode.com/problems/majority-element/ O(nLogn) , O(n)
Array https://leetcode.com/problems/move-zeroes/ O(n)
MAtrix https://leetcode.com/problems/richest-customer-wealth/ o(n^2)
matrix https://leetcode.com/problems/matrix-diagonal-sum/ O(n)
matrix https://leetcode.com/problems/flipping-an-image/ O(n)
matrix https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/ O(m+n)
matrix https://leetcode.com/problems/lucky-numbers-in-a-matrix/ O(m*n)
matrix https://leetcode.com/problems/reshape-the-matrix/ O(r*c)
matrix https://leetcode.com/problems/projection-area-of-3d-shapes/ o(n^2)
matrix https://leetcode.com/problems/available-captures-for-rook/
matrix https://leetcode.com/problems/toeplitz-matrix/ O(m*n)
matrix https://leetcode.com/problems/special-positions-in-a-binary-matrix/ O(r*c)
String https://leetcode.com/problems/jewels-and-stones/ O(j+s)
String https://leetcode.com/problems/sorting-the-sentence O(n*m)
String https://leetcode.com/problems/to-lower-case O(n)
String https://leetcode.com/problems/determine-if-string-halves-are-alike/
String https://leetcode.com/problems/reverse-string/ O(n)
String https://leetcode.com/problems/reverse-string-ii/ O(n)
Binary Search https://leetcode.com/problems/binary-search/ O(logn)
Binary Search https://leetcode.com/problems/valid-perfect-square/ O(logn)
Binary Search https://leetcode.com/problems/guess-number-higher-or-lower/ O(logn)
Binary Search https://leetcode.com/problems/find-peak-element/ O(logn)
Binary Search https://leetcode.com/problems/sqrtx/ O(logn)
Recursion https://leetcode.com/problems/power-of-two/ O(1)
Recursion https://leetcode.com/problems/powx-n/ O(logn)
Recursion https://leetcode.com/problems/reverse-linked-list/ https://www.youtube.com/watch?v=i
O(n)
Recursion
Recursion
LINKED LIST https://leetcode.com/problems/delete-node-in-a-linked-list/ https://www.youtube.com/watch?v=i
O(1)
LINKED LIST https://leetcode.com/problems/middle-of-the-linked-list/ https://www.youtube.com/watch?v=s
O(n)
LINKED LIST https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/
O(n)
LINKED LIST https://practice.geeksforgeeks.org/problems/remove-duplicates-from-an-unsorted-linked-list/1
O(n)
LINKED LIST https://leetcode.com/problems/merge-two-sorted-lists/ https://www.youtube.com/watch?v=X
O(n1 + n2)
LINKED LIST https://leetcode.com/problems/linked-list-cycle/ https://www.youtube.com/watch?v=3
O(n)
 LINKED LIST https://leetcode.com/problems/intersection-of-two-linked-lists/ O(m+n)
https://www.youtube.com/watch?v=u
LINKED LIST https://leetcode.com/problems/palindrome-linked-list/ https://www.youtube.com/watch?v=-
o(n/2)
LINKED LIST https://leetcode.com/problems/remove-linked-list-elements/ O(n)
Doubly Linked Listhttps://leetcode.com/problems/design-browser-history/
Stack and Queu https://leetcode.com/problems/next-greater-element-i/ O(n)
Stack and Queu https://leetcode.com/problems/min-stack/ O(1)
Stack and Queu https://leetcode.com/problems/implement-stack-using-queues/ O(n)
Stack and Queu https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/

Array https://leetcode.com/problems/kth-largest-element-in-an-array/ O(nlogn)

Array https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1 O(nlogn)
Array https://leetcode.com/problems/sort-colors/
Array https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-spac
O(n)
Array https://practice.geeksforgeeks.org/problems/union-of-two-arrays3538/1 O(n)
Array https://leetcode.com/problems/intersection-of-two-arrays/ O(n)
https://practice.geeksforgeeks.org/problems/consecutive-elements2306/1
Array https://leetcode.com/problems/rotate-array/ O(n)
Array https://leetcode.com/problems/k-diff-pairs-in-an-array/
Array https://leetcode.com/problems/maximum-subarray/ O(n)
Array https://leetcode.com/problems/continuous-subarray-sum/ O(n)
Array https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/ O(n)
Array https://leetcode.com/problems/set-matrix-zeroes/ 2(nxm)
Array https://leetcode.com/problems/next-permutation/ O(n)
Array https://leetcode.com/problems/rotate-image/ o(n^2)
Array https://leetcode.com/problems/merge-intervals/ O(nlogn)
Array https://leetcode.com/problems/find-the-duplicate-number/ O(n)
Array https://leetcode.com/problems/search-a-2d-matrix/ O log2(nxm)
Array https://leetcode.com/problems/majority-element-ii/ O(n)
Array https://leetcode.com/problems/unique-paths/ O(m-1) or O(n-1)
https://leetcode.com/problems/reverse-pairs/ https://www.youtube.com/watch?v=S
https://www.codingninjas.com/codestudio/problems/count-inversions_615
https://www.youtube.com/watch?v=k
https://www.interviewbit.com/problems/repeat-and-missing-number-array/
https://www.youtube.com/watch?v=5
https://leetcode.com/problems/4sum/ https://www.youtube.com/watch?v=4
Array https://leetcode.com/problems/longest-consecutive-sequence/https://www.youtube.com/watch?v=q
O(3n)
Array O(nlogn)
https://practice.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1
https://www.youtube.com/watch?v=x
Array https://www.interviewbit.com/problems/subarray-with-given-xor/ O(nlogn)
https://www.youtube.com/watch?v=l
Array https://leetcode.com/problems/longest-substring-without-repeating-characters/
https://www.youtube.com/watch?v=q
O(n)
Linked List https://leetcode.com/problems/remove-nth-node-from-end-of-list/
https://www.youtube.com/watch?v=L
O(n)
Linked List https://leetcode.com/problems/add-two-numbers/ O(max(n1,n2
https://www.youtube.com/watch?v=L
Linked List https://leetcode.com/problems/reverse-nodes-in-k-group/submissions/
https://www.youtube.com/watch?v=O
O(n)
Linked List https://leetcode.com/problems/linked-list-cycle-ii/ https://www.youtube.com/watch?v=Q
O(n)
Linked List https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1 O(submission
https://www.youtube.com/watch?v=y
Linked List https://leetcode.com/problems/rotate-list/ https://www.youtube.com/watch?v=9
O(n)
Linked List https://leetcode.com/problems/copy-list-with-random-pointer/ https://www.youtube.com/watch?v=V
O(n)
Linked List https://leetcode.com/problems/3sum/ https://www.youtube.com/watch?v=o
o(n^2)
Array https://leetcode.com/problems/max-consecutive-ones/ https://www.youtube.com/watch?v=M
O(n)
Array https://leetcode.com/problems/trapping-rain-water/ https://www.youtube.com/watch?v=m
O(n)
Array https://leetcode.com/problems/remove-duplicates-from-sorted-array/
https://www.youtube.com/watch?v=F
O(n)
Greedy https://practice.geeksforgeeks.org/problems/n-meetings-in-one-room-1587115620/1
https://www.youtube.com/watch?v=I
O(nlogn)
Greedy https://practice.geeksforgeeks.org/problems/minimum-platforms-1587115620/1#
O(2nLogn)
Greedy https://practice.geeksforgeeks.org/problems/job-sequencing-problem-1587115620/1#
https://www.youtube.com/watch?v=L
Greedy https://practice.geeksforgeeks.org/problems/fractional-knapsack-1587115620/1
https://www.youtube.com/watch?v=F
nlogN + n
Greedy https://www.youtube.com/watch?v=m
O(n)
Recursion https://practice.geeksforgeeks.org/problems/subset-sums2234/1 https://www.youtube.com/watch?v=r
2^n + 2^n log(2^n)
Recursion https://leetcode.com/problems/subsets-ii/ https://www.youtube.com/watch?v=R
 SC Approach Next SolvingNext Solving Next Solving Done/PendVideo Sol Lin
O(1) 2for/hash/Dictionary https://www.youtube.com/w
O(1)
O(1)
O(n^2)
O(1) using XOR gate
O(1)
O(1)
O(1) 2- pointer tech
O(1)
O(1)
O(1)
O(1)
O(n)
O(r*c)
O(1)

O(1)
O(r+c)
O(1)
O(n*m)
O(1)

O(1)
O(n)
O(1)
O(1)
O(1)
O(1)
O(1)
O(1)
O(logn)
O(n)

extract first char using substring and placed that char at 0 index
O(1) swap with next node and delete the next node
O(n) hare and turtoise
O(1)
O(n)
O(1)
O(1) fast and slow
 O(1)
O(1) fast and slow
O(1)

O(1)
O(1)
ntheses-strings/

arr.sort(b-a)
arr.sort(a-b)
1) Partition approach
O(1) 2) Two pointer approach
O(1) using SET
O(1) using SET

O(1) First reverse then flip

O(1) Kadane's algorithm (when sum is below 0 reasign sum to 0 )

O(1) Kadane's algorithm (when sum is below 0 reasign sum to 0 )
O(n) Kadane's algorithm (when sum is below 0 reasign sum to 0 )
O(1)
O(1)
O(1) Transpose and then reverse
o(n)
O(1) slow + fast pointer
O(1) using binary search
O(1) Boyer moore voting algorithm
O(1) NCR
.youtube.com/watch?v=S6rsAlj_iB4&list=PLgUwDviBIf0rPG3Ictpu74YWBQ1CaBkm2&index=20
.youtube.com/watch?v=kQ1mJlwW-c0
.youtube.com/watch?v=5nMGY4VUoRY&list=PLgUwDviBIf0rPG3Ictpu74YWBQ1CaBkm2&index=4
.youtube.com/watch?v=4ggF3tXIAp0&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=22
O(n)
O(n) Kadane's algorithm (when sum is below 0 reasign sum to 0 )
O(n) Kadane's algorithm (when sum is below 0 reasign sum to 0 )
O(1)
O(1) slow + fast pointer
O(1)
O(1)
 O(1) slow + fast pointer
O(1)
O(1)
O(1)
O(1) two pointer approach
O(1)
O(1) two pointer approach
O(1) two pointer approach
o(n)
O(1) two pointer approach
O(M)
O(1)
O(1) https://takeuforward.org/data-structure/find-minimum-number-of-coins/
2^n
.youtube.com/watch?v=RIn3gOkbhQE&list=PLgUwDviBIf0p4ozDR_kJJkONnb1wdx2Ma&index=57
Notes
https://onedrive.live.com/redir?resid=645C2CB35646E41D%21112&page=Edit&wd=target%28Leet%20Code%20Qu
-number-of-coins/
%28Leet%20Code%20Questions.one%7Ca5fe7ad4-a502-41f3-b18e-965b58449d6b%2FTwo%20Sum%7Cdce26ac3-5249-4110-a
%7Cdce26ac3-5249-4110-a7c0-6d6c5c05137c%2F%29&wdorigin=NavigationUrl
First Time solved Date Problem Name
13-07-2022 Two Sum
15-07-2022 buy and sell
15-07-2022 merge two Sorted
15-07-2022 pascal Triangle
16-07-2022 Single Number
16-07-2022 Contains Duplicate
16-07-2022 Majority Element
17-07-2022 Move zeros
17-07-2022 Richest Customer
19-07-2022 Matrix Diagonal Sum
23-07-2022 Reshape the Matrix
23-07-2022 Toeplitz matrix
23-07-2022 Projection area of 3d shape(will do later)
23-07-2022 Special Position in Binary matrix
19-07-2022 Flipping an Image
19-07-2022 Count negative numbers in sorted array
19-07-2022 Lucky numbers in matrix
20-07-2022 Jewels and Stones
20-07-2022 Sorting the sentence
20-07-2022 Lower case
21-07-2022 Strings halves are alike
21-07-2022 Reverse Strings
21-07-2022 Binary Search
21-07-2022 Valid Perfect Square
21-07-2022 Reverse Strings II

23-07-2022 Guess number

24-07-2022 Sqrt root
25-07-2022 Peak Element
25-07-2022 Power of 2
26-06-2022 Power of (x,n)
27-07-2022 Intersection of two arrays
28-07-2022 Search in 2D matrix
28-07-2022 First Unique character in string
28-07-2022 Ransom Note
28-07-2022 Valid Anagram
31-07-2022 Reverse a linked List
31-07-2022 Linked List Cycle
01-08-2022 Merge two sorted LinkedLists
01-08-2022 Remove Linked list elements
01-08-2022 Remove Duplicates from linked list
02-08-2022 Delete node in a linked list
02-08-2022 Middle of linked List
02-08-2022 Remove Duplicates from unsorted linked list
03-08-2022 Intersection of two linked lists
05-08-2022 Check pallindrome linked list
05-08-2022 Convert Binary Number in linked list to integer
06-08-2022 Valid paranthesis
06-08-2022 Implement queue using stack
09-08-2022 Next Greater Element
09-08-2022 Min Stack
10-08-2022 Implement stack using queue
12-08-2022 Maximum and Minimum element in an array
13-08-2022 Kth maximum and minimum element in an array
18-08-2022 Sort colors
21-08-2022 Move all negative negative number to left and positive to right.
21-08-2022 Union of two arrays
21-08-2022 Intersection of two arrays
15-09-2022 Cyclic rotation of array
19-09-2022 Largest subarray sum
19-09-2022 Set Matrix zero
10-10-2022 Reverse words in string
15-10-2022 Next Permutation
15-10-2022 Find the duplicate with N+1 integers
7-11-2022 Merge intervals
8-11-2022 Majority element n/3
Confidence Difficulty Category Website-1 Website-2
1 Easy Array https://leetcode.com/problems/two-sum/
1 Easy Array https://leetcode.com/problems/best-time-to-buy-and-sell-
1 Easy Array https://leetcode.com/problems/merge-sorted-array/
1 Easy Array https://leetcode.com/problems/pascals-triangle/
1 Easy Array https://leetcode.com/problems/single-number/
1 Easy Array https://leetcode.com/problems/contains-duplicate/
1 Easy Array https://leetcode.com/problems/majority-element/
1 Easy Array https://leetcode.com/problems/move-zeroes/
1 Easy MAtrix https://leetcode.com/problems/richest-customer-wealth/
1 Easy matrix https://leetcode.com/problems/matrix-diagonal-sum/
1 Less than mediu matrix https://leetcode.com/problems/reshape-the-matrix/
1 Less than mediu matrix https://leetcode.com/problems/toeplitz-matrix/
0 matrix https://leetcode.com/problems/projection-area-of-3d-sha
1 Less than mediu matrix https://leetcode.com/problems/special-positions-in-a-bina
1 Easy matrix https://leetcode.com/problems/flipping-an-image/
1 Easy matrix https://leetcode.com/problems/count-negative-numbers-i
1 less than mediu matrix https://leetcode.com/problems/lucky-numbers-in-a-matri
1 Easy String https://leetcode.com/problems/jewels-and-stones/
1 Easy string https://leetcode.com/problems/sorting-the-sentence/
1 Very Easy string https://leetcode.com/problems/to-lower-case/
1 Easy string https://leetcode.com/problems/determine-if-string-halves
1 Very Easy String https://leetcode.com/problems/reverse-string/
1 Easy Binary Search https://leetcode.com/problems/binary-search/
1 Easy Binary Search https://leetcode.com/problems/valid-perfect-square/
1 less than mediu String https://leetcode.com/problems/reverse-string-ii/

1 Easy Binary Search https://leetcode.com/problems/guess-number-higher-or-l

1 Easy Binary Search https://leetcode.com/problems/sqrtx/
1 Easy Binary Search https://leetcode.com/problems/find-peak-element/
1 Easy Math https://leetcode.com/problems/power-of-two/
1 less than mediu Math https://leetcode.com/problems/powx-n/
1 Easy Array https://leetcode.com/problems/intersection-of-two-arrays
1 Medium Array https://leetcode.com/problems/search-a-2d-matrix/
1 Easy String https://leetcode.com/problems/first-unique-character-in-a
1 Easy String https://leetcode.com/problems/ransom-note/
1 Easy String https://leetcode.com/problems/valid-anagram/
1 Less than mediu Linked List https://leetcode.com/problems/reverse-linked-list/
1 Less than mediu Linked List https://leetcode.com/problems/linked-list-cycle/
1 Less than mediu Linked List https://leetcode.com/problems/merge-two-sorted-lists/
1 Easy Linked List https://leetcode.com/problems/merge-two-sorted-lists/
1 Easy Linked List https://leetcode.com/problems/remove-duplicates-from-s
1 Easy Linked List https://leetcode.com/problems/delete-node-in-a-linked-li
1 Easy Linked List https://leetcode.com/problems/middle-of-the-linked-list/
1 Easy Linked List https://practice.geeksforgeeks.org/problems/remove-dup
1 Less than mediu Linked List https://leetcode.com/problems/intersection-of-two-linked
1 Medium Linked List https://leetcode.com/problems/palindrome-linked-list/
1 Easy Linked List https://leetcode.com/problems/convert-binary-number-in
1 EAsy Stack and Queue https://leetcode.com/problems/valid-parentheses/
1 Easy Stack and Queue https://leetcode.com/problems/implement-queue-using-s
1 Less than mediu Stack and Queue https://leetcode.com/problems/next-greater-element-i/
1 Easy Stack and Queue https://leetcode.com/problems/min-stack/
1 Easy Stack and Queue https://leetcode.com/problems/implement-stack-using-qu
1 Easy Array https://practice.geeksforgeeks.org/problems/max-min/1
1 Easy Array https://practice.geeksforgeeks.org/problems/kth-smallest
1 Easy Array https://leetcode.com/problems/sort-colors/
1 Easy Array https://www.geeksforgeeks.org/move-negative-numbers-b
1 Easy Array https://practice.geeksforgeeks.org/problems/union-of-two
1 Easy Array https://leetcode.com/problems/intersection-of-two-arrays
1 Easy Array https://leetcode.com/problems/rotate-array/
1 Medium Array https://leetcode.com/problems/maximum-subarray/
1 Medium Array https://leetcode.com/problems/set-matrix-zeroes/
1 Medium String https://leetcode.com/problems/reverse-words-in-a-string
1 Medium Array https://leetcode.com/problems/next-permutation/
1 Medium Array https://leetcode.com/problems/find-the-duplicate-numbe
1 Medium Array https://leetcode.com/problems/merge-intervals/
1 Medium Array https://leetcode.com/problems/majority-element-ii/
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
 Time Complexity Space Complexity
O(n) O(1)
O(n) O(1)
O(n) O(1)
O(n^2) - due to 2d array O(n^2) - extra space for res
O(n) - with xor O(1)
O(n) and O(nlogn) - using sortO(1)
O(n) and O(nlogn) - using sortO(1)
O(n) O(1)
O(n^2) - due to 2d array O(1)
O(n^2) - due to 2d array O(1)
O(m*n) O(1)
O(m*n) O(1)
ems/projection-area-of-3d-shapes/
O(m*n) O(1)
O(n^2) - due to 2d array O(1)
O(m+n) O(1)
O(n^2) - due to 2d array O(1)
O(s+j) O(1)
O(S) O(1)
O(n) O(1)
O(n) O(1)
O(n) O(1)
O(logn) O(1)
O(logn)- using binary search O(1)
O(n) O(1)

O(n) O(1)
O(logn) O(1)
O(logn) O(1)
O(logn) O(1)
O(logn) O(1)
O(n) - using hashmap O(1)
O(m+n) using Binary search O(1)
O(n) O(1)
O(n) O(1)
O(n) O(1)
O(n) O(1)
O(n) O(1)
O(n1+n2) O(1) using in place and O(n1
O(n) O(1)
O(n) O(1)
O(1) O(1)
O(n) O(1)
O(n) O(1)
O(n)
O(n) - using stack O(1)
and O(n/2) - using reverse theO(n)
list and O(1)
O(n) O(1)
O(s) O(1)
O(n) O(n) -used extra stack
O(n) O(n) - used extra stack
O(n) O(1)
O(n) O(n) - used extra queue
O(n) O(1)
O(nlogn) -using sort O(1)
O(n) O(1) sort
O(n) - using two pointer and quick
partition apporach O(1)
O(n) O(n) and O(1)
O(n) O(1)
O(n) O(1)
O(n) O(1)
O(n*m) O(n*m)
O(n) On)
O(n) O(1)
O(n) O(1)
O(nLogn) -using sort O(1)
O(n) - using maps O(1)
Link of problem solved Next Solving Date
https://drive.google.com/file/d/1UV0CHq0fZpUk_5aZo6-Mb_JKzLclr395/view?usp=sharing
26-07-2022
https://drive.google.com/file/d/1YclnBngwjNXTswyKCJLX_VBaSHyhCKGw/view?usp=sharing
https://drive.google.com/file/d/1I-9QUgev3iG0Gu7wIIguWC_2X84kiDSk/view?usp=sharing
26-07-2022
https://drive.google.com/file/d/1-7eOphRpjj-g1x4H8Tx5A24b1UxI4kwG/view?usp=sharing
https://drive.google.com/file/d/1U8Z_DiTsIrz_mLJTJMq4ZuKnAKGQnty2/view?usp=sharing
https://drive.google.com/file/d/1W2a5MCrdzvlFqVi0CcL7pP8wM2FqVOOs/view?usp=sharing
https://drive.google.com/file/d/1JugDznVlQTEpennTcz_J71OxNmZ7DTuJ/view?usp=sharing
https://drive.google.com/file/d/1bCt-qxJU-WzSL5IKhHuY94q3z9R3jv92/view?usp=sharing
https://drive.google.com/file/d/1r6IH0VIwpFA488wbtmWAQquk8gQUNP0E/view?usp=sharing
https://drive.google.com/file/d/1iLVEbBOgKBLaHPMtgIIjIDG-MocAuTNj/view?usp=sharing
https://drive.google.com/file/d/11dtIcTkXh2WPPhvb0xti2465ZjKXoD_j/view?usp=sharing
https://drive.google.com/file/d/1Vk_k-PVkQL0SebVqQ17HHjVZwxyqSxCK/view?usp=sharing

https://drive.google.com/file/d/1itPZk9kgdtEGM4bhPIIQC-nZdTJd1qs-/view?usp=sharing
https://drive.google.com/file/d/16YoH0-2Mld6fpRxZuCUW2xjdsV0ilaje/view?usp=sharing
https://drive.google.com/file/d/112jCoT_H7TOTSExF_nN70SwHeUZsKMKi/view?usp=sharing
https://drive.google.com/file/d/1XT7MCJ5rEBhaDCBgiBhPl_HaTOEP9m2g/view?usp=sharing
https://drive.google.com/file/d/1usYnKlAbr2SeKNsMF2tqn9LiTEkwL2mz/view?usp=sharing
https://drive.google.com/file/d/1_SoNoHlOKXV358gb2LiOVjqCcHv9GWOX/view?usp=sharing

https://drive.google.com/file/d/15sLSSTTaz8D119AKRmDFwYI5K_iVJVL3/view?usp=sharing
https://drive.google.com/file/d/17Z9Be06PHHOdHFJTETtomVSxvKPu75EH/view?usp=sharing
https://drive.google.com/file/d/1F-lCSdm6W1jhDczKvY29rfKI_6FFjsOJ/view?usp=sharing
https://drive.google.com/file/d/15agmhlfx4aWuECLd4NeA6fM_CDZbFTol/view?usp=sharing
https://drive.google.com/file/d/1NGc3ska2niAKuTJF3NUmu4TdIH18keiY/view?usp=sharing

https://drive.google.com/file/d/11pHSiQavgABH6CilVdRtbXl_unEbt9Lz/view?usp=sharing
https://drive.google.com/file/d/1j0zsiR9k3av2L5BekNIHvBTNqwDcKhHk/view?usp=sharing
https://drive.google.com/file/d/1UOuXPPqbAjg-CsqB9g181XJKh0Hopq-k/view?usp=sharing
https://drive.google.com/file/d/1twONft1dJ_1oAkYP0iUer83U8r9qdrld/view?usp=sharing
https://drive.google.com/file/d/1-uyOjg7fnnYpzp0BabLD7d_MN2rzSN4c/view?usp=sharing
https://drive.google.com/file/d/18MVDYc1QRtOhbJKAq9h8wIypBXEtOmCH/view?usp=sharing
https://drive.google.com/file/d/13delz4fGV6ORJbM9xqZo8XS5WlDicaVd/view?usp=sharing
https://drive.google.com/file/d/141jpAvtGPhlINnNzIhWrOOkPh-1AvLwl/view?usp=sharing
https://drive.google.com/file/d/1nsfwqixR6sy1Nhq1Vz9b_uWYQDMNzQQG/view?usp=sharinghttps://drive.google.co
https://drive.google.com/file/d/1G7QbPkRpa7B2iGICKMHM4rBQ9_pRlWW5/view?usp=sharing
https://drive.google.com/file/d/1SLTKUcWDLFids_PcvfZ4uE6PgSXrAGp6/view?usp=sharing
https://drive.google.com/file/d/1Mz0LQAwiQBmkOMbP2obQey6EeVeUbyui/view?usp=sharing
https://drive.google.com/file/d/1X76jnJzGdaT9kFvhEeoo5G4cutuQWKyQ/view?usp=sharing
https://drive.google.com/file/d/1CxGV4RQkHWTPonoHQ0LkDJ_da7TPpi_2/view?usp=sharing
https://drive.google.com/file/d/15AZrNVSl2tDLznKev-iKhmGCDIulwPn1/view?usp=sharing
https://drive.google.com/file/d/1REuYg2Ukkclx8Pc4caIDSgdHi5vwL-WT/view?usp=sharing
https://drive.google.com/file/d/1CU2nM30N-eBR0rbzFenMMi9DcKnJpzhU/view?usp=sharing
https://drive.google.com/file/d/1AOLPhjg7OmiBmI6XG9wQfIHRdRuGKLAJ/view?usp=sharing
https://drive.google.com/file/d/1qQL3w0sWMKECXtzgJE059As2obs2UmbL/view?usp=sharing
https://drive.google.com/file/d/1CBZ1Sfbfl0SYgAmxpnDf1YyfWAmr9f_M/view?usp=sharing
https://drive.google.com/file/d/1YEsCwfjY4AjKMMZA6t920nCpcv8Q49Ql/view?usp=sharing
https://drive.google.com/file/d/1Z7nLHsDfagPbXg3BN4ZsTmuA03BYMoR5/view?usp=sharing
https://drive.google.com/file/d/1S4E0wPB9BLGVae0aLcs0mAUKL-vsPNFN/view?usp=sharing
https://drive.google.com/file/d/1sGh3Eocmsot0_921Bpc9Q_TWO_RDH1HI/view?usp=sharing
https://drive.google.com/file/d/1Qka8vS1JWK-hmQKVTAyIq2AWlbiR3L1t/view?usp=sharing
https://drive.google.com/file/d/14vpSe92hNIyyTS03d1c3XkKpyzGxstvJ/view?usp=sharing
https://drive.google.com/file/d/1lgIymCe0Y2-FX4hRglwSNO0DfN0qsZh5/view?usp=sharing
https://drive.google.com/file/d/12QB6IyKAaSYunCaZTiOc8WK_8J1alRVg/view?usp=sharing
https://drive.google.com/file/d/1o9fH4zVCLk6t4F3radZZBW641i6k2KS4/view?usp=sharing
https://drive.google.com/file/d/17VouHp-2dDXPGZqXFTWqNRPWighX-xaM/view?usp=sharinghttps://drive.google.co
https://drive.google.com/file/d/1UbAHxY0SymiyJ5CL3mHPz4nQa3SCwnWd/view?usp=sharing
https://drive.google.com/file/d/1uD-iT6vwo8daiMwGFJE0zA0Aqg9vdL-s/view?usp=sharing
https://drive.google.com/file/d/1IMD_ZiSNOE3iitBa0f-eVJZu_mGgOggK/view?usp=sharing
https://drive.google.com/file/d/1D0W1FAGpvZE366uFWwFp4z1fdEhlvfV8/view?usp=sharing
https://drive.google.com/file/d/1nRo8ZzrEf_UVKaDY0_eWAnv_GCkosCIo/view?usp=sharing
https://drive.google.com/file/d/1hBsK940Wbt5tMPcwFZJKOdUXQjO9OPIk/view?usp=sharing
https://drive.google.com/file/d/1VNxUvlWnK9_ypYEltsxI0S3Sko4rXsYV/view?usp=sharing
https://drive.google.com/file/d/1CoRomlopmaofbCnqYjdoRuqAqTpesnq3/view?usp=sharing
https://drive.google.com/file/d/1PTuCOeVQiuHBlbzRuUg7ts4YInuzXsgk/view?usp=sharing
https://drive.google.com/file/d/1i7IIwG-1yfVLK69PvQy-paMUnsyAEXBl/view?usp=sharing
xt Solving Date Next Solving Next Solving Done/PendingVideo Sol LinCategory Notes

usp=sharing

usp=sharing

sp=sharinghttps://drive.google.com/file/d/1Gv0OI2-5aFz00KTWy27dm5ZhzNdtahZt/view?usp=sharing
usp=sharing

usp=sharing
usp=sharinghttps://drive.google.com/file/d/1XIAajvBLR-QAjuOJ7o-icOGMeOULiKJ8/view?usp=sharing
usp=sharing
 N B Questions by Love Babbar:
0 0 Youtube Channel: https://www.youtube.com/channel/UCQHLxxBFrbfdrk1jF0moTpw
0 0
Topic: 0 0 Problem:
0 0
Array 1 1 Reverse the array
Array 1 1 Find the maximum and minimum element in an array
Array 1 1 Find the "Kth" max and min element of an array
Array 0 1 Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo
Array 0 1 Move all the negative elements to one side of the array
Array 0 1 Find the Union and Intersection of the two sorted arrays.
Array 0 1 Write a program to cyclically rotate an array by one.
Array 0 1 find Largest sum contiguous Subarray [V. IMP]
Array 0 0 Minimise the maximum difference between heights [V.IMP]
Array 0 0 Minimum no. of Jumps to reach end of an array
Array 0 0 find duplicate in an array of N+1 Integers
Array 0 0 Merge 2 sorted arrays without using Extra space.
Array 0 0 Kadane's Algo [V.V.V.V.V IMP]
Array 0 0 Merge Intervals
Array 0 0 Next Permutation
Array 0 0 Count Inversion
Array 0 0 Best time to buy and Sell stock
Array 0 0 find all pairs on integer array whose sum is equal to given number
Array 0 0 find common elements In 3 sorted arrays
Array 0 0 Rearrange the array in alternating positive and negative items with O(1) extra space
Array 0 0 Find if there is any subarray with sum equal to 0
Array 0 0 Find factorial of a large number
Array 0 0 find maximum product subarray
Array 0 0 Find longest coinsecutive subsequence
Array 0 0 Given an array of size n and a number k, fin all elements that appear more than " n/k " times.
Array 0 0 Maximum profit by buying and selling a share atmost twice
Array 0 0 Find whether an array is a subset of another array
Array 0 0 Find the triplet that sum to a given value
Array 0 0 Trapping Rain water problem
Array 0 0 Chocolate Distribution problem
Array 0 0 Smallest Subarray with sum greater than a given value
Array 0 0 Three way partitioning of an array around a given value
Array 0 0 Minimum swaps required bring elements less equal K together
Array 0 0 Minimum no. of operations required to make an array palindrome
Array 0 0 Median of 2 sorted arrays of equal size
Array 0 0 Median of 2 sorted arrays of different size
0 0
0 0
Matrix 0 0 Spiral traversal on a Matrix
Matrix 0 0 Search an element in a matriix
Matrix 0 0 Find median in a row wise sorted matrix
Matrix 0 0 Find row with maximum no. of 1's
Matrix 0 0 Print elements in sorted order using row-column wise sorted matrix
Matrix 0 0 Maximum size rectangle
Matrix 0 0 Find a specific pair in matrix
Matrix 0 0 Rotate matrix by 90 degrees
Matrix 0 0 Kth smallest element in a row-cpumn wise sorted matrix
Matrix 0 0 Common elements in all rows of a given matrix
0 0
0 0
String 0 0 Reverse a String
String 0 0 Check whether a String is Palindrome or not
String 0 0 Find Duplicate characters in a string
String 0 0 Why strings are immutable in Java?
String 0 0 Write a Code to check whether one string is a rotation of another
String 0 0 Write a Program to check whether a string is a valid shuffle of two strings or not
String 0 0 Count and Say problem
String 0 0 Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring]
String 0 0 Find Longest Recurring Subsequence in String
String 0 0 Print all Subsequences of a string.
String 0 0 Print all the permutations of the given string
String 0 0 Split the Binary string into two substring with equal 0’s and 1’s
String 0 0 Word Wrap Problem [VERY IMP].
String 0 0 EDIT Distance [Very Imp]
String 0 0 Find next greater number with same set of digits. [Very Very IMP]
String 0 0 Balanced Parenthesis problem.[Imp]
String 0 0 Word break Problem[ Very Imp]
String 0 0 Rabin Karp Algo
String 0 0 KMP Algo
String 0 0 Convert a Sentence into its equivalent mobile numeric keypad sequence.
String 0 0 Minimum number of bracket reversals needed to make an expression balanced.
String 0 0 Count All Palindromic Subsequence in a given String.
String 0 0 Count of number of given string in 2D character array
String 0 0 Search a Word in a 2D Grid of characters.
String 0 0 Boyer Moore Algorithm for Pattern Searching.
String 0 0 Converting Roman Numerals to Decimal
String 0 0 Longest Common Prefix
String 0 0 Number of flips to make binary string alternate
String 0 0 Find the first repeated word in string.
String 0 0 Minimum number of swaps for bracket balancing.
String 0 0 Find the longest common subsequence between two strings.
String 0 0 Program to generate all possible valid IP addresses from given string.
String 0 0 Write a program tofind the smallest window that contains all characters of string itself.
String 0 0 Rearrange characters in a string such that no two adjacent are same
String 0 0 Minimum characters to be added at front to make string palindrome
String 0 0 Given a sequence of words, print all anagrams together
String 0 0 Find the smallest window in a string containing all characters of another string
String 0 0 Recursively remove all adjacent duplicates
String 0 0 String matching where one string contains wildcard characters
String 0 0 Function to find Number of customers who could not get a computer
String 0 0 Transform One String to Another using Minimum Number of Given Operation
 String 0 0 Check if two given strings are isomorphic to each other
String 0 0 Recursively print all sentences that can be formed from list of word lists
0 0
0 0
Searching & Sorting 0 0 Find first and last positions of an element in a sorted array
Searching & Sorting 0 0 Find a Fixed Point (Value equal to index) in a given array
Searching & Sorting 0 0 Search in a rotated sorted array
Searching & Sorting 0 0 square root of an integer
Searching & Sorting 0 0 Maximum and minimum of an array using minimum number of comparisons
Searching & Sorting 0 0 Optimum location of point to minimize total distance
Searching & Sorting 0 0 Find the repeating and the missing
Searching & Sorting 0 0 find majority element
Searching & Sorting 0 0 Searching in an array where adjacent differ by at most k
Searching & Sorting 0 0 find a pair with a given difference
Searching & Sorting 0 0 find four elements that sum to a given value
Searching & Sorting 0 0 maximum sum such that no 2 elements are adjacent
Searching & Sorting 0 0 Count triplet with sum smaller than a given value
Searching & Sorting 0 0 merge 2 sorted arrays
Searching & Sorting 0 0 print all subarrays with 0 sum
Searching & Sorting 0 0 Product array Puzzle
Searching & Sorting 0 0 Sort array according to count of set bits
Searching & Sorting 0 0 minimum no. of swaps required to sort the array
Searching & Sorting 0 0 Bishu and Soldiers
Searching & Sorting 0 0 Rasta and Kheshtak
Searching & Sorting 0 0 Kth smallest number again
Searching & Sorting 0 0 Find pivot element in a sorted array
Searching & Sorting 0 0 K-th Element of Two Sorted Arrays
Searching & Sorting 0 0 Aggressive cows
Searching & Sorting 0 0 Book Allocation Problem
Searching & Sorting 0 0 EKOSPOJ:
Searching & Sorting 0 0 Job Scheduling Algo
Searching & Sorting 0 0 Missing Number in AP
Searching & Sorting 0 0 Smallest number with atleastn trailing zeroes infactorial
Searching & Sorting 0 0 Painters Partition Problem:
Searching & Sorting 0 0 ROTI-Prata SPOJ
Searching & Sorting 0 0 DoubleHelix SPOJ
Searching & Sorting 0 0 Subset Sums
Searching & Sorting 0 0 Findthe inversion count
Searching & Sorting 0 0 Implement Merge-sort in-place
Searching & Sorting 0 0 Partitioning and Sorting Arrays with Many Repeated Entries
0 0
0 0
LinkedList 0 0 Write a Program to reverse the Linked List. (Both Iterative and recursive)
LinkedList 0 0 Reverse a Linked List in group of Given Size. [Very Imp]
LinkedList 0 0 Write a program to Detect loop in a linked list.
LinkedList 0 0 Write a program to Delete loop in a linked list.
LinkedList 0 0 Find the starting point of the loop. 
LinkedList 0 0 Remove Duplicates in a sorted Linked List.
LinkedList 0 1 Remove Duplicates in a Un-sorted Linked List.
LinkedList 0 0 Write a Program to Move the last element to Front in a Linked List.
LinkedList 0 0 Add “1” to a number represented as a Linked List.
LinkedList 0 0 Add two numbers represented by linked lists.
LinkedList 0 0 Intersection of two Sorted Linked List.
LinkedList 0 0 Intersection Point of two Linked Lists.
LinkedList 0 0 Merge Sort For Linked lists.[Very Important]
LinkedList 0 0 Quicksort for Linked Lists.[Very Important]
LinkedList 0 0 Find the middle Element of a linked list.
LinkedList 0 0 Check if a linked list is a circular linked list.
LinkedList 0 0 Split a Circular linked list into two halves.
LinkedList 0 0 Write a Program to check whether the Singly Linked list is a palindrome or not.
LinkedList 0 0 Deletion from a Circular Linked List.
LinkedList 0 0 Reverse a Doubly Linked list.
LinkedList 0 0 Find pairs with a given sum in a DLL.
LinkedList 0 0 Count triplets in a sorted DLL whose sum is equal to given value “X”.
 LinkedList 0 0 Sort a “k”sorted Doubly Linked list.[Very IMP]
LinkedList 0 0 Rotate DoublyLinked list by N nodes.
LinkedList 0 0 Rotate a Doubly Linked list in group of Given Size.[Very IMP]
LinkedList 0 0 Can we reverse a linked list in less than O(n) ?
LinkedList 0 0 Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ?
LinkedList 0 0 Flatten a Linked List
LinkedList 0 0 Sort a LL of 0's, 1's and 2's
LinkedList 0 0 Clone a linked list with next and random pointer
LinkedList 0 0 Merge K sorted Linked list
LinkedList 0 0 Multiply 2 no. represented by LL
LinkedList 0 0 Delete nodes which have a greater value on right side
LinkedList 0 0 Segregate even and odd nodes in a Linked List
LinkedList 0 0 Program for n’th node from the end of a Linked List
LinkedList 0 0 Find the first non-repeating character from a stream of characters
0 0
0 0
Binary Trees 0 0 level order traversal
Binary Trees 0 0 Reverse Level Order traversal
Binary Trees 0 0 Height of a tree
Binary Trees 0 0 Diameter of a tree
Binary Trees 0 0 Mirror of a tree
Binary Trees 0 0 Inorder Traversal of a tree both using recursion and Iteration
Binary Trees 0 0 Preorder Traversal of a tree both using recursion and Iteration
Binary Trees 0 0 Postorder Traversal of a tree both using recursion and Iteration
Binary Trees 0 0 Left View of a tree
Binary Trees 0 0 Right View of Tree
Binary Trees 0 0 Top View of a tree
Binary Trees 0 0 Bottom View of a tree
Binary Trees 0 0 Zig-Zag traversal of a binary tree
Binary Trees 0 0 Check if a tree is balanced or not
Binary Trees 0 0 Diagnol Traversal of a Binary tree
Binary Trees 0 0 Boundary traversal of a Binary tree
 Binary Trees 0 0 Construct Binary Tree from String with Bracket Representation
Binary Trees 0 0 Convert Binary tree into Doubly Linked List
Binary Trees 0 0 Convert Binary tree into Sum tree
Binary Trees 0 0 Construct Binary tree from Inorder and preorder traversal
Binary Trees 0 0 Find minimum swaps required to convert a Binary tree into BST
Binary Trees 0 0 Check if Binary tree is Sum tree or not
Binary Trees 0 0 Check if all leaf nodes are at same level or not
Binary Trees 0 0 Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ]
Binary Trees 0 0 Check if 2 trees are mirror or not
Binary Trees 0 0 Sum of Nodes on the Longest path from root to leaf node
Binary Trees 0 0 Check if given graph is tree or not. [ IMP ]
Binary Trees 0 0 Find Largest subtree sum in a tree
Binary Trees 0 0 Maximum Sum of nodes in Binary tree such that no two are adjacent
Binary Trees 0 0 Print all "K" Sum paths in a Binary tree
Binary Trees 0 0 Find LCA in a Binary tree
Binary Trees 0 0 Find distance between 2 nodes in a Binary tree
Binary Trees 0 0 Kth Ancestor of node in a Binary tree
Binary Trees 0 0 Find all Duplicate subtrees in a Binary tree [ IMP ]
Binary Trees 0 0 Tree Isomorphism Problem
0 0
0 0
Binary Search Trees 0 0 Fina a value in a BST
Binary Search Trees 0 0 Deletion of a node in a BST
Binary Search Trees 0 0 Find min and max value in a BST
Binary Search Trees 0 0 Find inorder successor and inorder predecessor in a BST
Binary Search Trees 0 0 Check if a tree is a BST or not
Binary Search Trees 0 0 Populate Inorder successor of all nodes
Binary Search Trees 0 0 Find LCA of 2 nodes in a BST
Binary Search Trees 0 0 Construct BST from preorder traversal
Binary Search Trees 0 0 Convert Binary tree into BST
Binary Search Trees 0 0 Convert a normal BST into a Balanced BST
Binary Search Trees 0 0 Merge two BST [ V.V.V>IMP ]
Binary Search Trees 0 0 Find Kth largest element in a BST
Binary Search Trees 0 0 Find Kth smallest element in a BST
Binary Search Trees 0 0 Count pairs from 2 BST whose sum is equal to given value "X"
Binary Search Trees 0 0 Find the median of BST in O(n) time and O(1) space
Binary Search Trees 0 0 Count BST ndoes that lie in a given range
Binary Search Trees 0 0 Replace every element with the least greater element on its right
Binary Search Trees 0 0 Given "n" appointments, find the conflicting appointments
Binary Search Trees 0 0 Check preorder is valid or not
Binary Search Trees 0 0 Check whether BST contains Dead end
Binary Search Trees 0 0 Largest BST in a Binary Tree [ V.V.V.V.V IMP ]
Binary Search Trees 0 0 Flatten BST to sorted list
0 0
0 0
Greedy 0 0 Activity Selection Problem
Greedy 0 0 Job SequencingProblem
Greedy 0 0 Huffman Coding
Greedy 0 0 Water Connection Problem
Greedy 0 0 Fractional Knapsack Problem
Greedy 0 0 Greedy Algorithm to find Minimum number of Coins
Greedy 0 0 Maximum trains for which stoppage can be provided
Greedy 0 0 Minimum Platforms Problem
Greedy 0 0 Buy Maximum Stocks if i stocks can be bought on i-th day
Greedy 0 0 Find the minimum and maximum amount to buy all N candies
Greedy 0 0 Minimize Cash Flow among a given set of friends who have borrowed money from each other
Greedy 0 0 Minimum Cost to cut a board into squares
Greedy 0 0 Check if it is possible to survive on Island
Greedy 0 0 Find maximum meetings in one room
Greedy 0 0 Maximum product subset of an array
Greedy 0 0 Maximize array sum after K negations
Greedy 0 0 Maximize the sum of arr[i]*i
Greedy 0 0 Maximum sum of absolute difference of an array
Greedy 0 0 Maximize sum of consecutive differences in a circular array
 Greedy 0 0 Minimum sum of absolute difference of pairs of two arrays
Greedy 0 0 Program for Shortest Job First (or SJF) CPU Scheduling
Greedy 0 0 Program for Least Recently Used (LRU) Page Replacement algorithm
Greedy 0 0 Smallest subset with sum greater than all other elements
Greedy 0 0 Chocolate Distribution Problem
Greedy 0 0 DEFKIN -Defense of a Kingdom
Greedy 0 0 DIEHARD -DIE HARD
Greedy 0 0 GERGOVIA -Wine trading in Gergovia
Greedy 0 0 Picking Up Chicks
Greedy 0 0 CHOCOLA –Chocolate
Greedy 0 0 ARRANGE -Arranging Amplifiers
Greedy 0 0 K Centers Problem
Greedy 0 0 Minimum Cost of ropes
Greedy 0 0 Find smallest number with given number of digits and sum of digits
Greedy 0 0 Rearrange characters in a string such that no two adjacent are same
Greedy 0 0 Find maximum sum possible equal sum of three stacks
0 0
0 0
BackTracking 0 0 Rat in a maze Problem
BackTracking 0 0 Printing all solutions in N-Queen Problem
BackTracking 0 0 Word Break Problem using Backtracking
BackTracking 0 0 Remove Invalid Parentheses
BackTracking 0 0 Sudoku Solver
BackTracking 0 0 m Coloring Problem
BackTracking 0 0 Print all palindromic partitions of a string
BackTracking 0 0 Subset Sum Problem
BackTracking 0 0 The Knight’s tour problem
BackTracking 0 0 Tug of War
BackTracking 0 0 Find shortest safe route in a path with landmines
BackTracking 0 0 Combinational Sum
BackTracking 0 0 Find Maximum number possible by doing at-most K swaps
BackTracking 0 0 Print all permutations of a string
 BackTracking 0 0 Find if there is a path of more than k length from a source
BackTracking 0 0 Longest Possible Route in a Matrix with Hurdles
BackTracking 0 0 Print all possible paths from top left to bottom right of a mXn matrix
BackTracking 0 0 Partition of a set intoK subsets with equal sum
BackTracking 0 0 Find the K-th Permutation Sequence of first N natural numbers
0 0
0 0
Stacks & Queues 0 0 Implement Stack from Scratch
Stacks & Queues 0 0 Implement Queue from Scratch
Stacks & Queues 0 0 Implement 2 stack in an array
Stacks & Queues 0 0 find the middle element of a stack
Stacks & Queues 0 0 Implement "N" stacks in an Array
Stacks & Queues 0 0 Check the expression has valid or Balanced parenthesis or not.
Stacks & Queues 0 0 Reverse a String using Stack
Stacks & Queues 0 0 Design a Stack that supports getMin() in O(1) time and O(1) extra space.
Stacks & Queues 0 0 Find the next Greater element
Stacks & Queues 0 0 The celebrity Problem
Stacks & Queues 0 0 Arithmetic Expression evaluation
Stacks & Queues 0 0 Evaluation of Postfix expression
Stacks & Queues 0 0 Implement a method to insert an element at its bottom without using any other data structure.
Stacks & Queues 0 0 Reverse a stack using recursion
Stacks & Queues 0 0 Sort a Stack using recursion
Stacks & Queues 0 0 Merge Overlapping Intervals
Stacks & Queues 0 0 Largest rectangular Area in Histogram
Stacks & Queues 0 0 Length of the Longest Valid Substring
Stacks & Queues 0 0 Expression contains redundant bracket or not
Stacks & Queues 0 0 Implement Stack using Queue
Stacks & Queues 0 0 Implement Stack using Deque
Stacks & Queues 0 0 Stack Permutations (Check if an array is stack permutation of other)
Stacks & Queues 0 0 Implement Queue using Stack
Stacks & Queues 0 0 Implement "n" queue in an array
Stacks & Queues 0 0 Implement a Circular queue
Stacks & Queues 0 0 LRU Cache Implementationa
Stacks & Queues 0 0 Reverse a Queue using recursion
Stacks & Queues 0 0 Reverse the first “K” elements of a queue
Stacks & Queues 0 0 Interleave the first half of the queue with second half
Stacks & Queues 0 0 Find the first circular tour that visits all Petrol Pumps
Stacks & Queues 0 0 Minimum time required to rot all oranges
Stacks & Queues 0 0 Distance of nearest cell having 1 in a binary matrix
Stacks & Queues 0 0 First negative integer in every window of size “k”
Stacks & Queues 0 0 Check if all levels of two trees are anagrams or not.
Stacks & Queues 0 0 Sum of minimum and maximum elements of all subarrays of size “k”.
Stacks & Queues 0 0 Minimum sum of squares of character counts in a given string after removing “k” characters.
Stacks & Queues 0 0 Queue based approach or first non-repeating character in a stream.
Stacks & Queues 0 0 Next Smaller Element
0 0
0 0
Heap 0 0 Implement a Maxheap/MinHeap using arrays and recursion.
Heap 0 0 Sort an Array using heap. (HeapSort)
Heap 0 0 Maximum of all subarrays of size k.
Heap 0 0 “k” largest element in an array
Heap 0 0 Kth smallest and largest element in an unsorted array
Heap 0 0 Merge “K” sorted arrays. [ IMP ]
Heap 0 0 Merge 2 Binary Max Heaps
Heap 0 0 Kth largest sum continuous subarrays
Heap 0 0 Leetcode- reorganize strings
Heap 0 0 Merge “K” Sorted Linked Lists [V.IMP]
Heap 0 0 Smallest range in “K” Lists
Heap 0 0 Median in a stream of Integers
Heap 0 0 Check if a Binary Tree is Heap
Heap 0 0 Connect “n” ropes with minimum cost
Heap 0 0 Convert BST to Min Heap
Heap 0 0 Convert min heap to max heap
Heap 0 0 Rearrange characters in a string such that no two adjacent are same.
Heap 0 0 Minimum sum of two numbers formed from digits of an array
0 0
0 0
Graph 0 0 Create a Graph, print it
Graph 0 0 Implement BFS algorithm
Graph 0 0 Implement DFS Algo
Graph 0 0 Detect Cycle in Directed Graph using BFS/DFS Algo
Graph 0 0 Detect Cycle in UnDirected Graph using BFS/DFS Algo
Graph 0 0 Search in a Maze
Graph 0 0 Minimum Step by Knight
Graph 0 0 flood fill algo
Graph 0 0 Clone a graph
Graph 0 0 Making wired Connections
Graph 0 0 word Ladder
Graph 0 0 Dijkstra algo
Graph 0 0 Implement Topological Sort
Graph 0 0 Minimum time taken by each job to be completed given by a Directed Acyclic Graph
Graph 0 0 Find whether it is possible to finish all tasks or not from given dependencies
Graph 0 0 Find the no. of Isalnds
Graph 0 0 Given a sorted Dictionary of an Alien Language, find order of characters
Graph 0 0 Implement Kruksal’sAlgorithm
Graph 0 0 Implement Prim’s Algorithm
Graph 0 0 Total no. of Spanning tree in a graph
Graph 0 0 Implement Bellman Ford Algorithm
Graph 0 0 Implement Floyd warshallAlgorithm
Graph 0 0 Travelling Salesman Problem
Graph 0 0 Graph ColouringProblem
Graph 0 0 Snake and Ladders Problem
Graph 0 0 Find bridge in a graph
Graph 0 0 Count Strongly connected Components(Kosaraju Algo)
Graph 0 0 Check whether a graph is Bipartite or Not
Graph 0 0 Detect Negative cycle in a graph
 Graph 0 0 Longest path in a Directed Acyclic Graph
Graph 0 0 Journey to the Moon
Graph 0 0 Cheapest Flights Within K Stops
Graph 0 0 Oliver and the Game
Graph 0 0 Water Jug problem using BFS
Graph 0 0 Water Jug problem using BFS
Graph 0 0 Find if there is a path of more thank length from a source
Graph 0 0 M-ColouringProblem
Graph 0 0 Minimum edges to reverse o make path from source to destination
Graph 0 0 Paths to travel each nodes using each edge(Seven Bridges)
Graph 0 0 Vertex Cover Problem
Graph 0 0 Chinese Postman or Route Inspection
Graph 0 0 Number of Triangles in a Directed and Undirected Graph
Graph 0 0 Minimise the cashflow among a given set of friends who have borrowed money from each other
Graph 0 0 Two Clique Problem
0 0
0 0
Trie 0 0 Construct a trie from scratch
Trie 0 0 Find shortest unique prefix for every word in a given list
Trie 0 0 Word Break Problem | (Trie solution)
Trie 0 0 Given a sequence of words, print all anagrams together
Trie 0 0 Implement a Phone Directory
Trie 0 0 Print unique rows in a given boolean matrix
0 0
0 0
Dynamic Programming 0 0 Coin ChangeProblem
Dynamic Programming 0 0 Knapsack Problem
Dynamic Programming 0 0 Binomial CoefficientProblem
Dynamic Programming 0 0 Permutation CoefficientProblem
Dynamic Programming 0 0 Program for nth Catalan Number
Dynamic Programming 0 0 Matrix Chain Multiplication 
Dynamic Programming 0 0 Edit Distance
Dynamic Programming 0 0 Subset Sum Problem
Dynamic Programming 0 0 Friends Pairing Problem
Dynamic Programming 0 0 Gold Mine Problem
Dynamic Programming 0 0 Assembly Line SchedulingProblem
Dynamic Programming 0 0 Painting the Fenceproblem
Dynamic Programming 0 0 Maximize The Cut Segments
Dynamic Programming 0 0 Longest Common Subsequence
Dynamic Programming 0 0 Longest Repeated Subsequence
Dynamic Programming 0 0 Longest Increasing Subsequence
Dynamic Programming 0 0 Space Optimized Solution of LCS
Dynamic Programming 0 0 LCS (Longest Common Subsequence) of three strings
Dynamic Programming 0 0 Maximum Sum Increasing Subsequence
Dynamic Programming 0 0 Count all subsequences having product less than K
Dynamic Programming 0 0 Longest subsequence such that difference between adjacent is one
Dynamic Programming 0 0 Maximum subsequence sum such that no three are consecutive
Dynamic Programming 0 0 Egg Dropping Problem
Dynamic Programming 0 0 Maximum Length Chain of Pairs
Dynamic Programming 0 0 Maximum size square sub-matrix with all 1s
Dynamic Programming 0 0 Maximum sum of pairs with specific difference
Dynamic Programming 0 0 Min Cost PathProblem
Dynamic Programming 0 0 Maximum difference of zeros and ones in binary string
Dynamic Programming 0 0 Minimum number of jumps to reach end
Dynamic Programming 0 0 Minimum cost to fill given weight in a bag
Dynamic Programming 0 0 Minimum removals from array to make max –min <= K
Dynamic Programming 0 0 Longest Common Substring
Dynamic Programming 0 0 Count number of ways to reacha given score in a game
Dynamic Programming 0 0 Count Balanced Binary Trees of Height h
Dynamic Programming 0 0 LargestSum Contiguous Subarray [V>V>V>V IMP ]
Dynamic Programming 0 0 Smallest sum contiguous subarray
Dynamic Programming 0 0 Unbounded Knapsack (Repetition of items allowed)
Dynamic Programming 0 0 Word Break Problem
Dynamic Programming 0 0 Largest Independent Set Problem
Dynamic Programming 0 0 Partition problem
Dynamic Programming 0 0 Longest Palindromic Subsequence
Dynamic Programming 0 0 Count All Palindromic Subsequence in a given String
Dynamic Programming 0 0 Longest Palindromic Substring
Dynamic Programming 0 0 Longest alternating subsequence
Dynamic Programming 0 0 Weighted Job Scheduling
Dynamic Programming 0 0 Coin game winner where every player has three choices
Dynamic Programming 0 0 Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ]
Dynamic Programming 0 0 Maximum profit by buying and selling a share at most twice [ IMP ]
Dynamic Programming 0 0 Optimal Strategy for a Game
Dynamic Programming 0 0 Optimal Binary Search Tree
Dynamic Programming 0 0 Palindrome PartitioningProblem
Dynamic Programming 0 0 Word Wrap Problem
Dynamic Programming 0 0 Mobile Numeric Keypad Problem [ IMP ]
Dynamic Programming 0 0 Boolean Parenthesization Problem
Dynamic Programming 0 0 Largest rectangular sub-matrix whose sum is 0
Dynamic Programming 0 0 Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]
Dynamic Programming 0 0 Maximum sum rectangle in a 2D matrix
Dynamic Programming 0 0 Maximum profit by buying and selling a share at most k times
Dynamic Programming 0 0 Find if a string is interleaved of two other strings
Dynamic Programming 0 0 Maximum Length of Pair Chain
0 0
0 0
Bit Manipulation 0 0 Count set bits in an integer
Bit Manipulation 0 0 Find the two non-repeating elements in an array of repeating elements
Bit Manipulation 0 0 Count number of bits to be flipped to convert A to B
Bit Manipulation 0 0 Count total set bits in all numbers from 1 to n
Bit Manipulation 0 0 Program to find whether a no is power of two
Bit Manipulation 0 0 Find position of the only set bit
Bit Manipulation 0 0 Copy set bits in a range
Bit Manipulation 0 0 Divide two integers without using multiplication, division and mod operator
Bit Manipulation 0 0 Calculate square of a number without using *, / and pow()
Bit Manipulation 0 0 Power Set
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
 LeetCode Link Done [yes or no]
<->
<->
<->
<->
https://leetcode.com/problems/sort-colors/ <->
https://leetcode.com/problems/sort-colors/ <->
https://leetcode.com/problems/intersection-of-two-arrays/<->
https://leetcode.com/problems/rotate-array/ <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
" n/k " times. <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
 <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
om each other <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
 <->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
data structure. <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
 <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
” characters. <->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
 <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
from each other <->
<->

<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
 <->
<->
<->
<->
<->
<->
<->
position) [ IMPORTANT ] <->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
nisha Bhushan
1 1
1 1
1 0
1 0
1 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 0
0 0
0 1
0 1
0 1
0 1
0 1
0 0
0 0
0 0
0 0
0 1
0 1
0 1
0 1
0 1
0 0
0 0
0 1
0 1
0 1
0 0
0 0
0 0
0 0
0 0
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 0
0 0
0 1
0 1
0 1
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
Beginner's Question

ARRAY 10
https://www.codingninjas.com/codestudio/problems/two-sum_839653
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
https://www.codingninjas.com/codestudio/problems/ninja-and-sorted-arrays_1214628
https://www.codingninjas.com/codestudio/problems/pascal-s-triangle_1089580
https://www.codingninjas.com/codestudio/problems/occurs-once_1214969
https://leetcode.com/problems/contains-duplicate/
https://www.codingninjas.com/codestudio/problems/majority-element_842495
https://www.codingninjas.com/codestudio/problems/move-zeros-to-left_1094877

MATRIX 10
https://leetcode.com/problems/richest-customer-wealth/
https://leetcode.com/problems/matrix-diagonal-sum/
https://leetcode.com/problems/flipping-an-image/
https://www.codingninjas.com/codestudio/problems/total-negative-numbers-in-a-sorted-matrix_3161878
https://leetcode.com/problems/lucky-numbers-in-a-matrix/
https://leetcode.com/problems/reshape-the-matrix/
https://www.codingninjas.com/codestudio/problems/buildings-projection_1466964
https://leetcode.com/problems/available-captures-for-rook/
https://leetcode.com/problems/toeplitz-matrix/
https://leetcode.com/problems/special-positions-in-a-binary-matrix/

STRING 5
https://leetcode.com/problems/jewels-and-stones/
https://leetcode.com/problems/sorting-the-sentence/
https://leetcode.com/problems/to-lower-case/
https://leetcode.com/problems/determine-if-string-halves-are-alike/
https://www.codingninjas.com/codestudio/problem-details/reverse-the-string_799927

Note :- Basic sorting and searching is done now lets go for Binary search

BINARY SEARCH 5
https://www.codingninjas.com/codestudio/problem-details/binary-search_972
https://www.codingninjas.com/codestudio/problems/valid-perfect-square_1082552
https://leetcode.com/problems/guess-number-higher-or-lower/
https://www.codingninjas.com/codestudio/problem-details/find-peak-element_1081482
https://www.codingninjas.com/codestudio/problems/square-root-integral_893351
 RECURSION 5
https://www.codingninjas.com/codestudio/problem-details/power-of-two_893061
https://www.codingninjas.com/codestudio/problems/find-power-of-a-number_893198
https://www.codingninjas.com/codestudio/problems/reverse-the-singly-linked-list_799897
https://www.codingninjas.com/codestudio/problems/ninja-and-sorted-arrays_1214628
https://www.codingninjas.com/codestudio/problem-details/reverse-the-string_799927
Note :- You can refer this video for more practice on recursion

LINKED LIST 10
https://www.codingninjas.com/codestudio/problems/delete-node-in-ll_5881
https://www.codingninjas.com/codestudio/problems/middle-of-linked-list_973250
https://www.codingninjas.com/codestudio/problems/binary-to-integer_2421938
https://www.codingninjas.com/codestudio/problems/remove-duplicates-from-unsorted-linked-list_1069331
https://www.codingninjas.com/codestudio/problems/merge-two-sorted-linked-lists_800332
https://www.codingninjas.com/codestudio/problem-details/cycle-detection-in-a-singly-linked-list_628974
https://www.codingninjas.com/codestudio/problems/intersection-of-linked-list_630457
https://www.codingninjas.com/codestudio/problems/palindrom-linked-list_799352?leftPanelTab=0
https://www.codingninjas.com/codestudio/problems/remove-all-nodes-with-value-k_1262145
https://www.codingninjas.com/codestudio/problems/browser_2427908

STACK/QUEUE 5
https://leetcode.com/problems/next-greater-element-i/
https://leetcode.com/problems/min-stack/
https://leetcode.com/problems/implement-stack-using-queues/
https://www.codingninjas.com/codestudio/problems/maximum-nesting-depth-of-two-valid-parentheses-strings_1461
 Theory Lecture
https://youtu.be/iEokYFZu3og

https://youtu.be/jVhQ9YaXLbs

https://youtu.be/IHLq6eJPBNM
https://youtu.be/MsIRa740mQY
Already done in arrays, now do it using recursion
Already done in string, now do it using recursion
https://youtu.be/AcwbGTyXhcU

https://youtu.be/m6rUsGNRYPg
https://youtu.be/5blSG0JZNbg
https://youtu.be/rPbzUW7usJE
https://youtu.be/_Dc1IqY2WpQ
https://youtu.be/0QPpgAsd4IY
https://youtu.be/nbQUEN3IRFk
https://youtu.be/DGEqY5rLyVc
https://youtu.be/XYY2tc_8KDM
https://youtu.be/JrRoR7ycM8U
https://youtu.be/SPDhPuMsM9A

https://youtu.be/TunTV2-griM
 LeetCode Advanced

Arrays
EASY
https://leetcode.com/problems/two-sum/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
https://leetcode.com/problems/plus-one/
https://leetcode.com/problems/move-zeroes/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
https://leetcode.com/problems/running-sum-of-1d-array/
https://leetcode.com/problems/find-pivot-index/
https://leetcode.com/problems/majority-element/
https://leetcode.com/problems/fibonacci-number/
https://leetcode.com/problems/squares-of-a-sorted-array/
https://leetcode.com/problems/pascals-triangle/
https://leetcode.com/problems/remove-duplicates-from-sorted-array/

MEDIUM
https://leetcode.com/problems/merge-intervals/
https://leetcode.com/problems/3sum/
https://leetcode.com/problems/product-of-array-except-self/
https://leetcode.com/problems/insert-delete-getrandom-o1/
https://leetcode.com/problems/subarray-sum-equals-k/
https://leetcode.com/problems/next-permutation/
https://leetcode.com/problems/spiral-matrix/
https://leetcode.com/problems/container-with-most-water/
https://leetcode.com/problems/rotate-image/
https://leetcode.com/problems/word-search/
https://leetcode.com/problems/3sum-closest/
https://leetcode.com/problems/game-of-life/
https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/
https://leetcode.com/problems/4sum/
https://leetcode.com/problems/find-the-duplicate-number/
https://leetcode.com/problems/combination-sum/
https://leetcode.com/problems/jump-game-ii/
https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/
https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/
https://leetcode.com/problems/max-area-of-island/
https://leetcode.com/problems/find-all-duplicates-in-an-array/
https://leetcode.com/problems/k-diff-pairs-in-an-array/
https://leetcode.com/problems/subsets/
https://leetcode.com/problems/invalid-transactions/
https://leetcode.com/problems/jump-game/
https://leetcode.com/problems/subarray-sums-divisible-by-k/
HARD
https://leetcode.com/problems/first-missing-positive/
https://leetcode.com/problems/largest-rectangle-in-histogram/
https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/
https://leetcode.com/problems/max-value-of-equation/

RECURSION
1- What is recursion
2- How Recursion Works
3- What is a recursion tree
4- https://leetcode.com/problems/powx-n/
5- https://leetcode.com/problems/valid-palindrome/
6- General Steps to recursion problems
7- https://leetcode.com/problems/subsets/
8- https://leetcode.com/problems/permutations/
9- https://leetcode.com/problems/permutations-ii/
10- https://leetcode.com/problems/subsets-ii/
11- https://leetcode.com/problems/combinations/
12- https://leetcode.com/problems/combination-sum/
13- https://leetcode.com/problems/combination-sum-ii/
14- https://leetcode.com/problems/combination-sum-iii/
15- https://leetcode.com/problems/letter-combinations-of-a-phone-number/
16- https://leetcode.com/problems/partition-to-k-equal-sum-subsets/
17- https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/
18- https://leetcode.com/problems/flood-fill/
19- https://leetcode.com/problems/word-search/
20- Rat in a Maze
21- https://leetcode.com/problems/n-queens/

DYNAMIC PROGRAMING
EASY
https://leetcode.com/problems/maximum-subarray/
https://leetcode.com/problems/climbing-stairs
https://leetcode.com/problems/divisor-game/
https://leetcode.com/problems/counting-bits/
MEDIUM
https://leetcode.com/problems/decode-ways/
https://leetcode.com/problems/word-break/
https://leetcode.com/problems/delete-and-earn/
https://leetcode.com/problems/maximal-square/
https://leetcode.com/problems/coin-change/
https://leetcode.com/problems/maximum-product-subarray/
https://leetcode.com/problems/maximum-length-of-repeated-subarray/
https://leetcode.com/problems/palindromic-substrings/
https://leetcode.com/problems/house-robber/
https://leetcode.com/problems/continuous-subarray-sum/
https://leetcode.com/problems/knight-dialer/
https://leetcode.com/problems/longest-increasing-subsequence/
https://leetcode.com/problems/unique-paths/
https://leetcode.com/problems/count-square-submatrices-with-all-ones/
https://leetcode.com/problems/range-sum-query-2d-immutable/
https://leetcode.com/problems/longest-arithmetic-subsequence/

HARD
https://leetcode.com/problems/trapping-rain-water/
https://leetcode.com/problems/word-break-ii/
https://leetcode.com/problems/regular-expression-matching/
https://leetcode.com/problems/maximal-rectangle/
https://leetcode.com/problems/longest-valid-parentheses/
https://leetcode.com/problems/edit-distance/
https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/
https://leetcode.com/problems/frog-jump/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/
https://leetcode.com/problems/burst-balloons/
https://leetcode.com/problems/minimum-cost-to-merge-stones/
https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/
https://leetcode.com/problems/super-egg-drop/
https://leetcode.com/problems/count-different-palindromic-subsequences/
https://leetcode.com/problems/minimum-cost-to-cut-a-stick/

STRINGS
EASY
https://leetcode.com/problems/add-strings/
https://leetcode.com/problems/longest-common-prefix/
https://leetcode.com/problems/valid-palindrome-ii/
https://leetcode.com/problems/roman-to-integer/
https://leetcode.com/problems/implement-strstr/

MEDIUM
https://leetcode.com/problems/longest-substring-without-repeating-characters/
https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/
https://leetcode.com/problems/longest-palindromic-substring/

https://leetcode.com/problems/group-anagrams/
https://leetcode.com/problems/generate-parentheses/
https://leetcode.com/problems/basic-calculator-ii/
https://leetcode.com/problems/integer-to-roman/
https://leetcode.com/problems/reverse-words-in-a-string/
https://leetcode.com/problems/simplify-path/
https://leetcode.com/problems/zigzag-conversion/

HARD
https://leetcode.com/problems/text-justification/
https://leetcode.com/problems/integer-to-english-words/
https://leetcode.com/problems/minimum-window-substring/
https://leetcode.com/problems/valid-number/
https://leetcode.com/problems/distinct-subsequences/
https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/
https://leetcode.com/problems/substring-with-concatenation-of-all-words/

MATHS
EASY
https://leetcode.com/problems/reverse-integer/
https://leetcode.com/problems/add-binary/
https://leetcode.com/problems/palindrome-number/
https://leetcode.com/problems/minimum-moves-to-equal-array-elements/
https://leetcode.com/problems/happy-number/
https://leetcode.com/problems/excel-sheet-column-title/
https://leetcode.com/problems/missing-number/
https://leetcode.com/problems/maximum-product-of-three-numbers/
https://leetcode.com/problems/power-of-two/

MEDIUM
https://leetcode.com/problems/encode-and-decode-tinyurl/
https://leetcode.com/problems/string-to-integer-atoi/
https://leetcode.com/problems/multiply-strings/
https://leetcode.com/problems/angle-between-hands-of-a-clock/
https://leetcode.com/problems/integer-break/
https://leetcode.com/problems/valid-square/
https://leetcode.com/problems/the-kth-factor-of-n/

HARD
https://leetcode.com/problems/basic-calculator/
https://leetcode.com/problems/max-points-on-a-line/
https://leetcode.com/problems/permutation-sequence/
https://leetcode.com/problems/number-of-digit-one/

GREEDY
EASY
THAT WOULD BE TOO EASY FOR YOU , LETS DO MEDIUM

MEDIUM
https://leetcode.com/problems/task-scheduler/
https://leetcode.com/problems/gas-station/
https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters/
https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/
https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/
https://leetcode.com/problems/remove-k-digits/
https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/
https://leetcode.com/problems/non-overlapping-intervals/

HARD
https://leetcode.com/problems/candy/
https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/
https://leetcode.com/problems/create-maximum-number/

DFS
MEDIUM
https://leetcode.com/problems/letter-combinations-of-a-phone-number/
https://leetcode.com/problems/course-schedule-ii/
https://leetcode.com/problems/decode-string/
https://leetcode.com/problems/number-of-provinces/
https://leetcode.com/problems/clone-graph/
https://leetcode.com/problems/shortest-bridge/
https://leetcode.com/problems/all-paths-from-source-to-target/
https://leetcode.com/problems/surrounded-regions//
https://leetcode.com/problems/house-robber-iii/
HARD
https://leetcode.com/problems/critical-connections-in-a-network/
https://leetcode.com/problems/remove-invalid-parentheses/
https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
https://leetcode.com/problems/concatenated-words/
https://leetcode.com/problems/making-a-large-island/
https://leetcode.com/problems/contain-virus/
https://leetcode.com/problems/24-game/
https://leetcode.com/problems/remove-boxes/

TREE
EASY
https://leetcode.com/problems/diameter-of-binary-tree/
https://leetcode.com/problems/invert-binary-tree/
https://leetcode.com/problems/subtree-of-another-tree/
https://leetcode.com/problems/range-sum-of-bst/
https://leetcode.com/problems/symmetric-tree/
https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
https://leetcode.com/problems/merge-two-binary-trees/
https://leetcode.com/problems/maximum-depth-of-binary-tree/
https://leetcode.com/problems/binary-tree-paths/
https://leetcode.com/problems/same-tree/
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
https://leetcode.com/problems/path-sum/
https://leetcode.com/problems/minimum-absolute-difference-in-bst/
https://leetcode.com/problems/sum-of-left-leaves/
https://leetcode.com/problems/balanced-binary-tree/
https://leetcode.com/problems/binary-tree-inorder-traversal/ (USING STACK TOO)

MEDIUM
https://leetcode.com/problems/count-good-nodes-in-binary-tree/
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
https://leetcode.com/problems/binary-tree-right-side-view/
https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/
https://leetcode.com/problems/validate-binary-search-tree/
https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/
https://leetcode.com/problems/binary-search-tree-iterator/
https://leetcode.com/problems/binary-tree-level-order-traversal/
https://leetcode.com/problems/path-sum-iii/
https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/
https://leetcode.com/problems/unique-binary-search-trees/
https://leetcode.com/problems/recover-binary-search-tree/
https://leetcode.com/problems/populating-next-right-pointers-in-each-node/
https://leetcode.com/problems/flatten-binary-tree-to-linked-list/
https://leetcode.com/problems/maximum-width-of-binary-tree/
https://leetcode.com/problems/unique-binary-search-trees-ii/
https://leetcode.com/problems/kth-smallest-element-in-a-bst/
https://leetcode.com/problems/redundant-connection/

HARD
https://leetcode.com/problems/serialize-and-deserialize-binary-tree/
https://leetcode.com/problems/binary-tree-maximum-path-sum/
https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/
https://leetcode.com/problems/binary-tree-cameras/
https://leetcode.com/problems/sum-of-distances-in-tree/
https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree/
https://leetcode.com/problems/redundant-connection-ii/

HASH TABLE
EASY
https://leetcode.com/problems/verifying-an-alien-dictionary/
https://leetcode.com/problems/design-hashmap/

MEDIUM
https://leetcode.com/problems/top-k-frequent-elements/
https://leetcode.com/problems/design-twitter/

BINARY SEARCH
EASY
https://leetcode.com/problems/sqrtx/
https://leetcode.com/problems/binary-search/
https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/
https://leetcode.com/problems/peak-index-in-a-mountain-array/

MEDIUM
https://leetcode.com/problems/time-based-key-value-store/
https://leetcode.com/problems/search-in-rotated-sorted-array/
https://leetcode.com/problems/powx-n/
https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
https://leetcode.com/problems/find-peak-element/
https://leetcode.com/problems/search-a-2d-matrix/
https://leetcode.com/problems/divide-two-integers/
https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/
https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/

HARD
https://leetcode.com/problems/median-of-two-sorted-arrays/
https://leetcode.com/problems/count-of-smaller-numbers-after-self/
https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/
https://leetcode.com/problems/split-array-largest-sum/
https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/

BFS
MEDIUM
https://leetcode.com/problems/number-of-islands/
https://leetcode.com/problems/rotting-oranges/
https://leetcode.com/problems/snakes-and-ladders/
https://leetcode.com/problems/is-graph-bipartite/
https://leetcode.com/problems/minimum-jumps-to-reach-home/

HARD
https://leetcode.com/problems/word-ladder/
https://leetcode.com/problems/word-ladder-ii/
https://leetcode.com/problems/cut-off-trees-for-golf-event/
https://leetcode.com/problems/reachable-nodes-in-subdivided-graph/

TWO POINTER
MEDIUM / HARD
https://leetcode.com/problems/partition-labels/
https://leetcode.com/problems/sort-colors/
https://leetcode.com/problems/longest-repeating-character-replacement/
https://leetcode.com/problems/maximum-number-of-visible-points/
https://leetcode.com/problems/subarrays-with-k-different-integers/

STACK
EASY
https://leetcode.com/problems/min-stack/
https://leetcode.com/problems/next-greater-element-i/
https://leetcode.com/problems/backspace-string-compare/
https://leetcode.com/problems/implement-queue-using-stacks/
PRE , POST , INORDER TRAVERSALS OF BINARY TREE
https://leetcode.com/problems/implement-stack-using-queues/
MEDIUM
https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/
https://leetcode.com/problems/daily-temperatures/
https://leetcode.com/problems/flatten-nested-list-iterator/
https://leetcode.com/problems/online-stock-span/
https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/
https://leetcode.com/problems/sum-of-subarray-minimums/
https://leetcode.com/problems/evaluate-reverse-polish-notation/

DESIGN
MEDIUM / HARD
https://leetcode.com/problems/lru-cache/
https://leetcode.com/problems/find-median-from-data-stream/
https://leetcode.com/problems/design-underground-system/
https://leetcode.com/problems/lfu-cache/
https://leetcode.com/problems/tweet-counts-per-frequency/
https://leetcode.com/problems/all-oone-data-structure/
https://leetcode.com/problems/design-browser-history/

GRAPH
EASY
https://leetcode.com/problems/employee-importance/
https://leetcode.com/problems/find-the-town-judge/

MEDIUM
https://leetcode.com/problems/evaluate-division/
https://leetcode.com/problems/accounts-merge/
https://leetcode.com/problems/network-delay-time/
https://leetcode.com/problems/find-eventual-safe-states/
https://leetcode.com/problems/keys-and-rooms/
https://leetcode.com/problems/possible-bipartition/
https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/
https://leetcode.com/problems/regions-cut-by-slashes/
https://leetcode.com/problems/satisfiability-of-equality-equations/
https://leetcode.com/problems/as-far-from-land-as-possible/
https://leetcode.com/problems/number-of-closed-islands/
https://leetcode.com/problems/number-of-operations-to-make-network-connected/
https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/
https://leetcode.com/problems/time-needed-to-inform-all-employees/

BIT MANIPULATION
https://leetcode.com/problems/sum-of-two-integers/discuss/84278/A-summary%3A-how-to-use-bit-manipulation-to-

LINKED LIST

1- Uses of Linked List ( Real Life )

2- Representation of Linked List
3- https://leetcode.com/problems/delete-node-in-a-linked-list/
4- Arrays vs Linked List
5- https://leetcode.com/problems/middle-of-the-linked-list/
6- https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/
7- Doubly Linked List and STLs
8- https://leetcode.com/problems/design-hashset/
9- https://leetcode.com/problems/design-hashmap/
10- https://leetcode.com/problems/reverse-linked-list/
11- Reverse Nodes in k-Group [ https://leetcode.com/problems/reverse-nodes-in-k-group/ ]
12- Reverse Nodes in k-Group (NO EXTRA SPACE)
13- https://leetcode.com/problems/merge-two-sorted-lists/
14- https://leetcode.com/problems/merge-k-sorted-lists/
15- https://leetcode.com/problems/remove-duplicates-from-sorted-list/
16- https://leetcode.com/problems/linked-list-cycle/
17- https://leetcode.com/problems/linked-list-cycle-ii/
18- https://leetcode.com/problems/intersection-of-two-linked-lists/
19- https://leetcode.com/problems/palindrome-linked-list/
20- https://leetcode.com/problems/remove-linked-list-elements/
21- https://leetcode.com/problems/design-browser-history/
22- https://leetcode.com/problems/lru-cache/
23- Copy List with Random Pointer ( with extra space ) [ https://leetcode.com/problems/copy-list-with-random-pointe
24- Copy List with Random Pointer ( NO extra space )

HEAP
MEDIUM
https://leetcode.com/problems/k-closest-points-to-origin/
https://leetcode.com/problems/kth-largest-element-in-an-array/
https://leetcode.com/problems/reorganize-string/
https://leetcode.com/problems/furthest-building-you-can-reach/
https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/
https://leetcode.com/problems/cheapest-flights-within-k-stops/
https://leetcode.com/problems/find-the-most-competitive-subsequence/
https://leetcode.com/problems/ugly-number-ii/

HARD
https://leetcode.com/problems/merge-k-sorted-lists/
https://leetcode.com/problems/sliding-window-maximum/
https://leetcode.com/problems/the-skyline-problem/
https://leetcode.com/problems/trapping-rain-water-ii/
https://leetcode.com/problems/minimum-number-of-refueling-stops/
https://leetcode.com/problems/swim-in-rising-water/
https://leetcode.com/problems/shortest-path-to-get-all-keys/
https://leetcode.com/problems/minimum-cost-to-hire-k-workers/
https://leetcode.com/problems/k-th-smallest-prime-fraction/

SLIDING WINDOW
MEDIUM/HARD
https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/
https://leetcode.com/problems/max-consecutive-ones-iii/
https://leetcode.com/problems/grumpy-bookstore-owner/
https://leetcode.com/problems/sliding-window-median/

TRIE
https://leetcode.com/explore/learn/card/trie/
SEGMENT TREE
https://leetcode.com/articles/a-recursive-approach-to-segment-trees-range-sum-queries-lazy-propagation/
 Editorials

https://www.youtube.com/watch?v=o2WOhGSfx_8
https://www.youtube.com/watch?v=XIWykOHE1SE
https://www.youtube.com/watch?v=FyzWXlSMNoI
https://www.youtube.com/watch?v=mgzcjQ1x9Mw
https://www.youtube.com/watch?v=3gtcRtvDCpA
https://leetcode.com/problems/running-sum-of-1d-array/discuss/686261/JavaC%2B%2BPython-Array-Time-O(N)-S
https://leetcode.com/problems/find-pivot-index/discuss/411318/Java%3A-beats100-1ms-easy-understanding-solutio
https://www.youtube.com/watch?v=PqU48t80rn8
https://www.youtube.com/watch?v=MyFe2W2nIEE&list=PLKZaSt2df1gxtem7J8QqY8m2bHliz8mPt
https://leetcode.com/problems/squares-of-a-sorted-array/discuss/495394/C%2B%2B%3A-Simplest-one-pass-two-p
https://leetcode.com/problems/pascals-triangle/discuss/38125/Solution-in-Java
https://leetcode.com/problems/remove-duplicates-from-sorted-array/discuss/11782/Share-my-clean-C%2B%2B-cod

https://leetcode.com/problems/merge-intervals/discuss/21222/A-simple-Java-solution
https://www.youtube.com/watch?v=TeegtfmEhTY
https://www.youtube.com/watch?v=3X9-qs1Lwe4
(Check the comment section of this post) https://leetcode.com/problems/insert-delete-getrandom-o1/discuss/85422
https://leetcode.com/problems/subarray-sum-equals-k/discuss/301242/General-summary-of-what-kind-of-problem-c

https://www.youtube.com/watch?v=UG1C-otvF2U

https://www.youtube.com/watch?v=yEAHwSS8HN0
https://www.youtube.com/watch?v=1DkVU2i3sOA

nd-vertical-cuts/
https://www.youtube.com/watch?v=6BPurabdAl4

https://www.youtube.com/watch?v=YAWRyWJalM0
https://www.youtube.com/watch?v=hOTpn8jE9jI

https://youtu.be/LgaFY8WyTX8
https://youtu.be/dWsQroffE-U
https://youtu.be/2l3cSfE885g
https://youtu.be/an9WRz8QhkA
https://youtu.be/m5Cx_AQnpfE
https://youtu.be/quqHd8UHbzs
https://youtu.be/0N3RCWa8jFM
https://youtu.be/jRyQVVvYBAM
https://youtu.be/lQaNrfA86B0
https://youtu.be/u40eYbmT9zg
https://youtu.be/DTFy9spEQGo
https://youtu.be/Hca7284gCpI
https://youtu.be/6fARitpO0p8
https://youtu.be/xNeLP5RDY-c
https://youtu.be/qyHlIdxk820
https://youtu.be/h_6MldQ8vB8
https://youtu.be/DIJQ8zLeVEk
https://youtu.be/RjO-HDjRMpM
https://youtu.be/hPyR1un7_hw
https://youtu.be/XiJ0Qq1LD5g
https://youtu.be/VrySrTVAI3Y

https://www.youtube.com/watch?v=UbE4-ONpJcc
https://www.youtube.com/watch?v=N5i7ySYQcgM
https://www.youtube.com/watch?v=_iIK7Gu7MNo

https://www.youtube.com/watch?v=8BdXDakKZEs

https://www.youtube.com/watch?v=mFwf1YbH-Jk
https://www.youtube.com/watch?v=NVIm5_TIqUs

https://www.youtube.com/watch?v=ocDwEjRVDAk
https://www.youtube.com/watch?v=TunTV2-griM

https://www.youtube.com/watch?v=B9bSSOnc0CQ,https://www.youtube.com/watch?v=oUbZurIKnsY ,
 https://www.youtube.com/watch?v=9-TXIVEXX2w

at-a-threshold-distance/
-how-to-use-bit-manipulation-to-solve-problems-easily-and-efficiently

https://youtu.be/fxuVD1e66QA
https://youtu.be/Xtvo7Y2q4NA
https://youtu.be/m6rUsGNRYPg
https://youtu.be/KMc-B051ne8
https://youtu.be/5blSG0JZNbg
https://youtu.be/rPbzUW7usJE
https://youtu.be/cTm0AR5_O54
https://youtu.be/IjxkD8L2cOM
https://youtu.be/xVEGczCJCHs
https://youtu.be/MsIRa740mQY
https://youtu.be/TeDcLjOOiK4
https://youtu.be/dbRJFnQoKTI
https://youtu.be/0QPpgAsd4IY
https://youtu.be/RYJ3vs8qx10
https://youtu.be/_Dc1IqY2WpQ
https://youtu.be/nbQUEN3IRFk
https://youtu.be/tsQT0MT73Og
https://youtu.be/DGEqY5rLyVc
https://youtu.be/XYY2tc_8KDM
https://youtu.be/JrRoR7ycM8U
https://youtu.be/SPDhPuMsM9A
https://youtu.be/nN36SSIMn1k
https://youtu.be/ctFmFbeyTVU
https://youtu.be/uBjpRedaNKQ
eries-lazy-propagation/
2BPython-Array-Time-O(N)-Space-O(1)
ms-easy-understanding-solution

m2bHliz8mPt
%3A-Simplest-one-pass-two-pointers

are-my-clean-C%2B%2B-code

getrandom-o1/discuss/85422/AC-C%2B%2B-Solution.-Unordered_map-%2B-Vector
ary-of-what-kind-of-problem-can-cannot-solved-by-Two-Pointers
v=oUbZurIKnsY ,
 Road Map for DSA

Learn Time Complexity:

https://youtu.be/luXiytGnYpY

Topic-wise links:

1. Arrays

-Bare Minimum
a. https://www.geeksforgeeks.org/top-50-...

-Bonus
a. https://www.interviewbit.com/courses/...
b. https://leetcode.com/tag/array/

2. Strings
-Bare Minimum
a. https://www.interviewbit.com/courses/...

-Bonus
a. https://leetcode.com/tag/string/
b. https://www.hackerrank.com/domains/al...

3. Linked Lists
-Bare Minimum
a. https://www.interviewbit.com/courses/...

-Bonus
a. https://leetcode.com/tag/linked-list/
b. https://www.geeksforgeeks.org/top-20-...

4. Stacks and Queues

-Theory:
a. https://www.geeksforgeeks.org/stack-d...
b. https://www.geeksforgeeks.org/queue-s...
-Bare Minimum
a. https://www.interviewbit.com/courses/...

-Bonus
a. https://leetcode.com/tag/stack/
b. https://leetcode.com/tag/queue/
c. https://www.geeksforgeeks.org/queue-d...
d. https://www.geeksforgeeks.org/stack-d...

5. Tree-based data structures:

-Theory:
a. https://www.geeksforgeeks.org/binary-...
b. https://www.geeksforgeeks.org/binary-...
c. https://www.geeksforgeeks.org/trie-in...
d. https://www.geeksforgeeks.org/heap-da...
e. https://www.geeksforgeeks.org/hashing...

-Bare minimum:
a. https://www.interviewbit.com/courses/...
b. https://www.interviewbit.com/courses/...
c. https://www.interviewbit.com/courses/...

-Bonus
a. https://leetcode.com/tag/tree/
b. https://leetcode.com/tag/heap/
c. https://leetcode.com/tag/trie/
d. https://leetcode.com/tag/hash-table/

6. Graphs:
-Theory:
a. https://www.geeksforgeeks.org/graph-a...

-Standard Algos:
a. BFS - https://www.geeksforgeeks.org/breadth...
b. DFS - https://www.geeksforgeeks.org/depth-f...
c. Dijkstra - https://www.geeksforgeeks.org/dijkstr...
d. Prim's - https://www.geeksforgeeks.org/prims-m...
e. Kruskal - https://www.geeksforgeeks.org/kruskal...
f. Floyd-Warshall - https://www.geeksforgeeks.org/floyd-w...
g. Union Find - https://www.geeksforgeeks.org/union-f...

-Bare Minimum:
a. https://leetcode.com/tag/graph/ (Easy and Medium)

-Bonus:
a. https://www.interviewbit.com/courses/...

7. Dynamic Programming:
-Video lectures:
a. Lec 1 - https://www.youtube.com/watch?v=OQ5js...
b. Lec 2 - https://www.youtube.com/watch?v=ENyox...
c. Lec 3 - https://www.youtube.com/watch?v=ocZMD...

-Bare minimum (Standard problems):

a. https://www.geeksforgeeks.org/program...
b. https://www.geeksforgeeks.org/0-1-kna...
c. https://www.geeksforgeeks.org/coin-ch...
d. https://www.geeksforgeeks.org/compute...
e. https://www.geeksforgeeks.org/longest...
f. https://www.geeksforgeeks.org/longest...
g. https://www.geeksforgeeks.org/longest...

-Bonus:
a. https://www.interviewbit.com/courses/...
b. https://leetcode.com/tag/dynamic-prog...
Topic Name
Link
Notes