Table of Contents
Summary
- Easy : 15
- Medium : 22
- Hard : 3
Day 1 to 100 interview question preparation
| 1 | Palindrome Number | Easy | Math |
| 2 | Power of Two | Easy | Math |
| 3 | Fibonacci Number | Easy | DP, Iterative |
| 4 | N-th Tribonacci Number | Easy | Iterative |
| 5 | Water Bottles | Easy | Array |
| 6 | Two Sum | Easy | Array |
| 7 | Add to Array-Form of Integer Add Two Numbers in Linked List format | Easy | Array |
| 8 | Maximum Product of Two Elements in an Array | Easy | Array |
| 9 | TBD | ||
| 10 | Median of Two Sorted Arrays | Hard | Array |
| 11 | Reverse Linked List | Easy | Linked List |
| 12 | Reverse Linked List II (between i & j) | Medium | Linked List |
| 13 | Reverse Nodes in k-Group | Hard | Linked List |
| 14 | Remove Nth Node From End of List | Medium | Linked List |
| 15 | Palindrome Linked List | Easy | Linked List |
| 16 | Detecting Loop in a Linked List | Easy | Linked List |
| 17 | Starting node of cycle in Linked List | Medium | Linked List |
| 18 | Delete the Middle Node of a Linked List | Medium | Linked List |
| 19 | Find the Duplicate Number | Hard | Array |
| 20 | Find Minimum in Rotated Sorted Array | Medium | Array |
| 21 | Search in Rotated Sorted Array | Medium | Array |
| 22 | Search in Rotated Sorted Array II with Duplicates | Medium | Array |
| 23 | Find Minimum in Rotated Sorted Array II With Duplicates | Hard | Array |
Leet Code 75
| Array / String | ||
| 1. | Merge Strings Alternately | Easy |
| 2. | Greatest Common Divisor of Strings | Medium |
| 3. | Can Place Flowers | Easy |
| 4. | Reverse Vowels of a String | Medium |
| 5. | Reverse words in string | Medium |
| 6. | Product of Array Except Self | Medium |
| 7. | Increasing Triplet Subsequence | Medium |
| 8. | Find the Maximum Subarray Sum (Kadane’s Algorithm) | Medium |
| 9. | Rotate Array | Medium |
| 10. | Trapping Rain Water (Kadane’s on both directions) | Hard |
| 11. | Missing Number | Easy |
| 12. | Best Time to Buy and Sell Stock | Easy |
| 13. | Maximum Product Subarray (Kadane’s + Products) | Medium |
| 14. | Find Minimum in Rotated Sorted Array | Medium |
| 15. | Search in Rotated Sorted Array | Medium |
| 16. | 3Sum | Medium |
| 17. | Container With Most Water | Medium |
| 18. | (KMP) Print all occurrences of a string as a substring in another string | Medium |
| 19. | Kth Largest Element in an Array | Medium |
| 20. | 2215. Find the Difference of Two Arrays | Easy |
Topics
Graph
| Graph | ||
| 1. | Rotting Oranges (BFS) | Medium |
| 2. | Number of Islands (BFS) | Medium |
| 3. | Course Schedule (Topological sort) | Medium |
| 4. | Find Eventual Safe States (TBD) | Medium |
Trees
| Trees | ||
| 1. | Lowest Common Ancestor of a Binary Tree | Medium |
Tries
| Tries | ||
| 1. | Longest Common Prefix | Medium |
Hash Table
| Hash Table | ||
| 1. | Longest Substring Without Repeating Characters (Sliding window) | Medium |
| 2. | (TBD)Longest Consecutive Sequence | Medium |
Two Pointers & Window Sliding
| 1. | Max Sum of K Window | Medium |
| 2. | Maximum Points You Can Obtain from Cards | Medium |
| 3. | Container With Most Water | Medium |
| 4. | Maximum Number of Vowels in a Substring of Given Length | Medium |
| 5. | Max Consecutive Ones III | Medium |
| 4. | LongestSubArrayWithSumK | Easy |
Intervals
Heap (Priority Queue)
Linked List
| 1. | LRU Cache | Medium |
Design
| 1. | Design Twitter | Hard |
| 2. | Design Memory Allocator | Hard |
| 3. | Design Browser History | Medium |
| 4. | Design Authentication Manager | Medium |
| 5. | Design an ATM Machine | Medium |
| 6. | LRU Cache | Hard |
| 7. | Min Stack | Medium |
String
| 1. | Valid Anagram | Medium |
| 2. | Group all Anagram | Medium |
| 3. | Count occurrences of Anagrams | Medium |
| 4. | Multiply Strings | Hard |
| 5. | Longest Palindromic Substring | Medium |
Hard Problems
Below problems are not so straight forward.
Advice: Try solving for some time, but don’t take it to your heart.
Please visit https: https://codeandalgo.com for more such contents.