Created
November 30, 2022 05:10
-
-
Save amirul12/9d55bc4d8b330de1c4bd269ee3332f1b to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
👉Arrays - | |
1. Two Sum | |
2. Container With Most Water | |
3. 3Sum | |
4. Search in Rotated Sorted Array | |
5. Maximum Subarray | |
6. Best Time to Buy and Sell Stock | |
7. Maximum Product Subarray | |
8. Find Minimum in Rotated Sorted Array | |
9. Contains Duplicate | |
10. Product of Array Except Self | |
👉String - | |
1. Longest Substring Without Repeating Characters | |
2. Longest Palindromic Substring | |
3. Valid Parentheses | |
4. Group Anagrams | |
5. Minimum Window Substring | |
6. Valid Palindrome | |
7. Valid Anagram | |
8. Longest Repeating Character Replacement | |
9. Palindromic Substrings | |
👉Matrix - | |
1. Rotate Image | |
2. Spiral Matrix | |
3. Set Matrix Zeroes | |
4. Word Search | |
👉Bit Manipulation - | |
1. Reverse Bits | |
2. Number of 1 Bits | |
3. Missing Number | |
4. Counting Bits | |
5. Sum of Two Integers | |
👉Linked List - | |
1. Remove Nth Node From End of List | |
2. Merge Two Sorted Lists | |
3. Merge k Sorted Lists | |
4. Linked List Cycle | |
5. Reorder List | |
6. Reverse Linked List | |
👉Dynamic Programming - | |
1. Jump Game | |
2. Unique Paths | |
3. Climbing Stairs | |
4. Decode Ways | |
5. Word Break | |
6. House Robber | |
7. House Robber II | |
8. Longest Increasing Subsequence | |
9. Coin Change | |
10. Combination Sum IV | |
11. Ways to Split Array Into Three Subarrays | |
👉Heap - | |
1. Merge k Sorted Lists | |
2. Find Median from Data Stream | |
3. Top K Frequent Elements | |
👉Graphs - | |
1. Longest Consecutive Sequence | |
2. Clone Graph | |
3. Number of Islands | |
4. Course Schedule | |
5. Pacific Atlantic Water Flow | |
👉Tree - | |
1. Validate Binary Search Tree | |
2. Same Tree | |
3. Binary Tree Level Order Traversal | |
4. Maximum Depth of Binary Tree | |
5. Construct Binary Tree from Preorder and Inorder Traversal | |
6. Binary Tree Maximum Path Sum | |
7. Implement Trie (Prefix Tree) | |
8. Word Search II | |
9. Invert Binary Tree | |
10. Kth Smallest Element in a BST | |
11. Lowest Common Ancestor of a Binary Search Tree | |
12. Serialize and Deserialize Binary Tree | |
13. Subtree of Another Tree |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment