DSA tracker

DSA solved0 of 249

Solved, Rev 1, Rev 2, Rev 3 and a confidence score (1–5) for each topic, as in the planner spreadsheet. A topic counts as complete once it is marked solved.

Saved in this browser only. Back it up from the study planner page.

DSA tracker
#	Topic	Category	Level
1	Majority Element	Arrays	Easy
2	Find Pivot Index	Arrays	Easy
3	Product of Array Except Self	Arrays	Medium
4	Subarray Sum Equals K	Arrays	Medium
5	Subarray Sums Divisible by K	Arrays	Medium
6	Contiguous Array	Arrays	Medium
7	Shortest Subarray with Sum at Least K	Arrays	Hard
8	Maximum Subarray	Arrays	Medium
9	Maximum Product Subarray	Arrays	Medium
10	Maximum Subarray Sum with One Deletion	Arrays	Medium
11	Maximum Absolute Sum of Any Subarray	Arrays	Medium
12	Maximum Sum Circular Subarray	Arrays	Medium
13	Rotate Image	Arrays	Medium
14	Spiral Matrix	Arrays	Medium
15	Set Matrix Zeroes	Arrays	Medium
16	Missing Number	Arrays	Easy
17	Find All Numbers Disappeared in an Array	Arrays	Easy
18	Set Mismatch	Arrays	Easy
19	Find All Duplicates in an Array	Arrays	Medium
20	First Missing Positive	Arrays	Hard
21	Contains Duplicate	Hashing	Easy
22	Valid Anagram	Hashing	Easy
23	Two Sum	Hashing	Easy
24	First Unique Character in a String	Hashing	Easy
25	Longest Palindrome	Hashing	Easy
26	Ransom Note	Hashing	Easy
27	Valid Sudoku	Hashing	Medium
28	Group Anagrams	Hashing	Medium
29	Longest Consecutive Sequence	Hashing	Medium
30	Longest Common Prefix	Strings	Easy
31	Reverse String	Strings	Easy
32	Encode and Decode Strings	Strings	Medium
33	String to Integer (atoi)	Strings	Medium
34	Number of 1 Bits	Bit Manipulation	Easy
35	Reverse Bits	Bit Manipulation	Easy
36	Single Number	Bit Manipulation	Easy
37	Counting Bits	Bit Manipulation	Easy
38	Complement of Base 10 Integer	Bit Manipulation	Easy
39	Sum of Two Integers	Bit Manipulation	Medium
40	Single Number III	Bit Manipulation	Medium
41	Valid Palindrome II	Two Pointers	Easy
42	Valid Palindrome	Two Pointers	Easy
43	Move Zeroes	Two Pointers	Easy
44	Remove Duplicates from Sorted Array	Two Pointers	Easy
45	Squares of a Sorted Array	Two Pointers	Easy
46	Segregate 0s and 1s	Two Pointers	Easy
47	Backspace String Compare	Two Pointers	Easy
48	Two Sum II Input Array Is Sorted	Two Pointers	Medium
49	3Sum	Two Pointers	Medium
50	Container With Most Water	Two Pointers	Medium
51	Sort Colors	Two Pointers	Medium
52	3Sum Closest	Two Pointers	Medium
53	Triplets with Smaller Sum	Two Pointers	Medium
54	Subarray Product Less Than K	Two Pointers	Medium
55	4Sum	Two Pointers	Medium
56	Shortest Unsorted Continuous Subarray	Two Pointers	Medium
57	Trapping Rain Water	Two Pointers	Hard
58	Implement Stack using Queues	Queue	Easy
59	Implement Queue using Stacks	Queue	Easy
60	Number of Recent Calls	Queue	Easy
61	Design Circular Queue	Queue	Medium
62	Best Time to Buy and Sell Stock	Sliding Window	Easy
63	Maximum Average Subarray I	Sliding Window	Easy
64	Max Sum Subarray of Size K	Sliding Window	Easy
65	Longest Substring Without Repeating Characters	Sliding Window	Medium
66	Longest Repeating Character Replacement	Sliding Window	Medium
67	Permutation in String	Sliding Window	Medium
68	Minimum Size Subarray Sum	Sliding Window	Medium
69	Longest K unique characters substring	Sliding Window	Medium
70	Fruit Into Baskets	Sliding Window	Medium
71	Max Consecutive Ones III	Sliding Window	Medium
72	Find All Anagrams in a String	Sliding Window	Medium
73	Minimum Window Substring	Sliding Window	Hard
74	Sliding Window Maximum	Sliding Window	Hard
75	Substring with Concatenation of All Words	Sliding Window	Hard
76	Valid Parentheses	Stack	Easy
77	Remove All Adjacent Duplicates In String	Stack	Easy
78	Min Stack	Stack	Medium
79	Evaluate Reverse Polish Notation	Stack	Medium
80	Remove All Adjacent Duplicates in String II	Stack	Medium
81	Simplify Path	Stack	Medium
82	Next Greater Element I	Stack	Easy
83	Daily Temperatures	Stack	Medium
84	Car Fleet	Stack	Medium
85	Next Greater Element II	Stack	Medium
86	Remove Nodes From Linked List	Stack	Medium
87	Remove K Digits	Stack	Medium
88	132 Pattern	Stack	Medium
89	Largest Rectangle in Histogram	Stack	Hard
90	Binary Search	Binary Search	Easy
91	Ceil in Sorted Array	Binary Search	Easy
92	Time Based Key-Value Store	Binary Search	Medium
93	Find First and Last Position	Binary Search	Medium
94	Number of Occurrence	Binary Search	Medium
95	Median of Two Sorted Arrays	Binary Search	Hard
96	Find Rotation Count	Binary Search	Easy
97	Find Minimum in Rotated Sorted Array	Binary Search	Medium
98	Search in Rotated Sorted Array	Binary Search	Medium
99	Peak Index in a Mountain Array	Binary Search	Medium
100	Find Peak Element	Binary Search	Medium
101	Koko Eating Bananas	Binary Search	Medium
102	Minimum Number of Days to Make m Bouquets	Binary Search	Medium
103	Aggressive Cows	Binary Search	Medium
104	Maximum Candies Allocated to K Children	Binary Search	Medium
105	Capacity To Ship Packages Within D Days	Binary Search	Medium
106	Split Array Largest Sum	Binary Search	Hard
107	Search a 2D Matrix	Binary Search	Medium
108	Search a 2D Matrix II	Binary Search	Medium
109	Kth Smallest Element in a Sorted Matrix	Binary Search	Medium
110	Merge Two Sorted Lists	Linked List	Easy
111	Remove Nth Node From End of List	Linked List	Medium
112	Copy List with Random Pointer	Linked List	Medium
113	Add Two Numbers	Linked List	Medium
114	LRU Cache	Linked List	Medium
115	Linked List Cycle	Linked List	Easy
116	Happy Number	Linked List	Easy
117	Middle of the Linked List	Linked List	Easy
118	Palindrome Linked List	Linked List	Easy
119	Reorder List	Linked List	Medium
120	Find the Duplicate Number	Linked List	Medium
121	Linked List Cycle II	Linked List	Medium
122	Circular Array Loop	Linked List	Medium
123	Reverse Linked List	Linked List	Easy
124	Reverse Linked List II	Linked List	Medium
125	Swap Nodes in Pairs	Linked List	Medium
126	Rotate List	Linked List	Medium
127	Reverse Nodes in k-Group	Linked List	Hard
128	Invert Binary Tree	Trees	Easy
129	Maximum Depth of Binary Tree	Trees	Easy
130	Diameter of Binary Tree	Trees	Easy
131	Balanced Binary Tree	Trees	Easy
132	Same Tree	Trees	Easy
133	Subtree of Another Tree	Trees	Easy
134	Count Good Nodes in Binary Tree	Trees	Medium
135	Construct Tree from Preorder and Inorder	Trees	Medium
136	Lowest Common Ancestor of Binary Tree	Trees	Medium
137	Binary Tree Maximum Path Sum	Trees	Hard
138	Serialize and Deserialize Binary Tree	Trees	Hard
139	Binary Tree Level Order Traversal	Trees	Medium
140	Binary Tree Right Side View	Trees	Medium
141	Implement Trie (Prefix Tree)	Trees	Medium
142	Design Add and Search Words	Trees	Medium
143	Extra Characters in a String	Trees	Medium
144	Search Suggestions System	Trees	Medium
145	Word Search II	Trees	Hard
146	Convert Sorted Array to BST	BST	Easy
147	Validate Binary Search Tree	BST	Medium
148	Kth Smallest Element in a BST	BST	Medium
149	Lowest Common Ancestor of a BST	BST	Medium
150	Insert into a BST	BST	Medium
151	Delete Node in a BST	BST	Medium
152	Kth Largest Element in a Stream	Heap	Easy
153	Last Stone Weight	Heap	Easy
154	Top K Frequent Elements	Heap	Medium
155	K Closest Points to Origin	Heap	Medium
156	Kth Largest Element in an Array	Heap	Medium
157	Task Scheduler	Heap	Medium
158	Min Cost to Connect Ropes	Heap	Medium
159	Sort Characters By Frequency	Heap	Medium
160	Find K Closest Elements	Heap	Medium
161	Reorganize String	Heap	Medium
162	Maximum Frequency Stack	Heap	Hard
163	Maximum Sum Combination	Heap	Medium
164	Find Median from Data Stream	Heap	Hard
165	Sliding Window Median	Heap	Hard
166	IPO	Heap	Hard
167	Design Twitter	Heap	Medium
168	Merge k Sorted Lists	Heap	Hard
169	Smallest Range Covering Elements from K Lists	Heap	Hard
170	Jump Game	Greedy	Medium
171	Jump Game II	Greedy	Medium
172	Gas Station	Greedy	Medium
173	Hand of Straights	Greedy	Medium
174	Merge Triplets to Form Target	Greedy	Medium
175	Partition Labels	Greedy	Medium
176	Valid Parenthesis String	Greedy	Medium
177	Maximum Length of Pair Chain	Greedy	Medium
178	Minimum Add to Make Parentheses Valid	Greedy	Medium
179	Remove Duplicate Letters	Greedy	Medium
180	Meeting Rooms	Greedy	Easy
181	Merge Intervals	Greedy	Medium
182	Insert Interval	Greedy	Medium
183	Non-overlapping Intervals	Greedy	Medium
184	Interval List Intersections	Greedy	Medium
185	Meeting Rooms II	Greedy	Medium
186	My Calendar I	Greedy	Medium
187	Generate Parentheses	Backtracking	Medium
188	Subsets	Backtracking	Medium
189	Permutations	Backtracking	Medium
190	Subsets II	Backtracking	Medium
191	Letter Combinations of a Phone Number	Backtracking	Medium
192	Letter Case Permutation	Backtracking	Medium
193	Combination Sum	Backtracking	Medium
194	Combination Sum II	Backtracking	Medium
195	Word Search	Backtracking	Medium
196	Palindrome Partitioning	Backtracking	Medium
197	N-Queens	Backtracking	Hard
198	Sudoku Solver	Backtracking	Hard
199	Find if Path Exists in Graph	Graph	Easy
200	Clone Graph	Graph	Medium
201	Number of Provinces	Graph	Medium
202	Word Ladder	Graph	Hard
203	Reconstruct Itinerary	Graph	Hard
204	Flood Fill	Graph	Easy
205	Island Perimeter	Graph	Easy
206	Number of Islands	Graph	Medium
207	Max Area of Island	Graph	Medium
208	Pacific Atlantic Water Flow	Graph	Medium
209	Surrounded Regions	Graph	Medium
210	Rotting Oranges	Graph	Medium
211	Number of Closed Islands	Graph	Medium
212	Course Schedule	Graph	Medium
213	Course Schedule II	Graph	Medium
214	Topological Sort	Graph	Medium
215	Minimum Height Trees	Graph	Medium
216	Alien Dictionary	Graph	Hard
217	Graph Valid Tree	Graph	Medium
218	Number of Connected Components	Graph	Medium
219	Redundant Connection	Graph	Medium
220	Is Graph Bipartite?	Graph	Medium
221	Path With Minimum Effort	Graph	Medium
222	Network Delay Time	Graph	Medium
223	Cheapest Flights Within K Stops	Graph	Medium
224	Min Cost to Connect All Points	Graph	Medium
225	Swim in Rising Water	Graph	Hard
226	Climbing Stairs	Dynamic Programming	Easy
227	Min Cost Climbing Stairs	Dynamic Programming	Easy
228	House Robber	Dynamic Programming	Medium
229	House Robber II	Dynamic Programming	Medium
230	Decode Ways	Dynamic Programming	Medium
231	Coin Change	Dynamic Programming	Medium
232	Word Break	Dynamic Programming	Medium
233	Longest Increasing Subsequence	Dynamic Programming	Medium
234	Best Time to Buy/Sell with Cooldown	Dynamic Programming	Medium
235	Partition Equal Subset Sum	Dynamic Programming	Medium
236	Coin Change II	Dynamic Programming	Medium
237	Target Sum	Dynamic Programming	Medium
238	0 - 1 Knapsack Problem	Dynamic Programming	Medium
239	Subset Sum Problem	Dynamic Programming	Medium
240	Count Subsets with Sum	Dynamic Programming	Medium
241	Partition Into 2 Subsets with Min Sum Diff	Dynamic Programming	Hard
242	Longest Palindromic Substring	Dynamic Programming	Medium
243	Palindromic Substrings	Dynamic Programming	Medium
244	Unique Paths	Dynamic Programming	Medium
245	Longest Common Subsequence	Dynamic Programming	Medium
246	Interleaving String	Dynamic Programming	Medium
247	Edit Distance	Dynamic Programming	Medium
248	Burst Balloons	Dynamic Programming	Hard
249	Regular Expression Matching	Dynamic Programming	Hard

Popular technologies

DSA tracker

No topics match these filters

Other trackers