📜📓 Leetcode Algorithm and Data Structure code
No | Leetcode Problem Number | Problem Title | Link | Code |
---|---|---|---|---|
1 | 125 | Valid Palindrom | Link | code |
2 | 344 | Reverse String | Link | code |
3 | 937 | Reorder Data in Log Files | Link | code |
4 | 819 | Most Common Word | Link | code |
5 | 49 | Group Anagrams | Link | code |
6 | 5 | Longest Palindromic Substring | Link | code |
7 | 1 | Two Sum | Link | code |
8 | 42 | Trapping Rain Water | Link | code |
9 | 15 | 3Sum | Link | code |
10 | 561 | Array Partition | Link | code |
11 | 238 | Product of Array Except Self | Link | code |
12 | 121 | Best Time to Buy and Sell Stock | Link | code |
13 | 234 | Palindrome Linked List | Link | code |
14 | 21 | Merge Two Sorted Lists | Link | code |
15 | 206 | Reverse Linked List | Link | code |
16 | 2 | Add Two Numbers | Link | code |
17 | 24 | Swap Nodes in Pairs | Link | code |
18 | 328 | Odd Even Linked List | Link | code |
19 | 92 | Reverse Linked List II | Link | code |
20 | 20 | Valid Parentheses | Link | code |
21 | 316 | Remove Duplicate Letters | Link | code |
22 | 739 | Daily Temperatures | Link | code |
23 | 225 | Implement Stack using Queue | Link | code |
24 | 232 | Implement Queue using Stack | Link | code |
25 | 622 | Design Circular Queue | Link | code |
26 | 641 | Design Circular Deque | Link | code |
27 | 23 | Merge k Sorted Lists | Link | code |
28 | 706 | Design HashMap | Link | code |
29 | 711 | Jewels and Stones | Link | code |
30 | 3 | Longest Substring Without Repeating Characters | Link | code |
31 | 347 | Top K Frequent Elements | Link | code |
32 | 200 | Number of Islands | Link | code |
33 | 17 | Letter Combinations of a Phone Number | Link | code |
34 | 46 | Permutations | Link | code |
35 | 77 | Combinations | Link | code |
36 | 39 | Combination Sum | Link | code |
37 | 78 | Subsets | Link | code |
38 | 332 | Reconstruct Itinerary | Link | code |
39 | 207 | Course Schedule | Link | code |
40 | 743 | Network Delay Time | Link | code |
41 | 787 | Cheapest Flights Within K Stops | Link | code |
42 | 104 | Maximum Depth of Binary Tree | Link | code |
43 | 543 | Diameter of Binary Tree | Link | code |
44 | 687 | Longest Univalue Path | Link | code |
45 | 226 | Invert Binary Tree | Link | code |
46 | 617 | Merge Two Binary Trees | Link | code |
47 | 297 | Serialize and Deserialize Binary Tree | Link | code |
48 | 110 | Balanced Binary Tree | Link | code |
49 | 310 | Minimum Height Trees | Link | code |
50 | 108 | Convert Sorted Array To Binary Search Tree | Link | code |
51 | 1038 | Binary Search Tree to Greater Sum Tree | Link | code |
52 | 938 | Range Sum of BST | Link | code |
53 | 783 | Minimum Distance Between BST Nodes | Link | code |
54 | 105 | Construct Binary Tree from Preorder and Inorder Trversal | Link | code |
55 | 215 | Kth Largest Element in an Array | Link | code |
56 | 208 | Implement Trie(Prefix Tree) | Link | code |
57 | 336 | Palindrome Pairs | Link | code |
58 | 148 | Sort List | Link | code |
59 | 56 | Merge Intervals | Link | code |
60 | 147 | Insertion Sort List | Link | code |
61 | 179 | Largest Numbers | Link | code |
62 | 242 | Valid Anagram | Link | code |
63 | 75 | Sort Colors | Link | code |
64 | 973 | K Closest Points to Origin | Link | code |
65 | 704 | Binary Search | Link | code |
66 | 33 | Search in Rotated Sorted Array | Link | !empty |
67 | 349 | Intersection of Two Arrays | Link | code |
68 | 167 | Two Sum II - Input Array Is Sorted | Link | code |
69 | 240 | Search a 2D Matrix II | Link | code |
70 | 136 | Single Number | Link | code |
71 | 461 | Hamming Distance | Link | code |
72 | 371 | Sum of Two Integers | Link | code |
73 | 393 | UTF-8 Validation | Link | code |
74 | 191 | Numbers of 1 Bits | Link | code |
75 | 239 | Sliding Window Maximum | Link | code |
76 | 76 | Minimum Window Substring | Link | code |
77 | 424 | Longest Repeaating Character Replacement | Link | code |
78 | 122 | Best Time to Buy and Sell Stock II | Link | code |
79 | 406 | Queue Reconstruction by Height | Link | code |
80 | 621 | Task Scheduler | Link | code |
81 | 134 | Gas Station | Link | code |
82 | 455 | Assign Cookies | Link | code |
83 | 169 | Majority Element | Link | code |
84 | 239 | Different Ways to Add Paranthesis | Link | code |
85 | 509 | Fibonacci Number | Link | code |
86 | 53 | Maximum Subarray | Link | code |
87 | 70 | Climbing Stairs | Link | code |
88 | 198 | House Robber | Link | code |