Interview Preparation

Arrays

• [ ] Sieve
• [ ] Catalan Numbers
• [x] Sliding Window Technique
• [ ] Recursion and Backtracking
• [ ] Binary Search (TopCoder)
• [ ] BacktoBackSWE Playlist
• [x] Tortoise and Hare Pointer

Trees

• [x] Flatten Tree
• [x] Height of Tree
• [x] Iterative Traversals
• [x] Lowest Common Ancestor
• [x] Level Order Traversal
• [x] Diameter of a Binary Tree
• [x] Recursive Traversals
• [x] Diagonal Traversal
• [x] Vertical Traversal
• [x] Serialize and Deserialize Trees
• [x] Other BackToBackSWE Ones

Graphs

• [x] BFS Problems
• [ ] Graph coloring/Bipartition
• [x] DFS Problems
• [ ] Topological Sort
• [ ] Union Find
• [ ] Find Shortest Path (Dijkstra's/Bellman Ford
• [ ] BackToBackSWE Playlist
• [ ] LeetCode Graphs Patterns

Searching and Sorting

• [ ] Bubble Sort
• [ ] Insertion Sort
• [ ] Quick Sort
• [ ] Merge Sort
• [ ] Inversion Count
• [ ] Count Numbers Larger and Smaller than Self
• [ ] Radix Sort
• [ ] Count Sort
• [ ] Heap Sort
• [ ] Binary Search
• [ ] BackToBackSWE Playlist

Linked Lists

• [x] Insert
• [x] Delete Nth Node
• [x] Reverse
• [x] Merge Two Sorted Linked List
• [x] Fast Pointer, Slow Pointer technique
• [ ] Doubly Linked List
• [ ] BackToBackSWE Playlist

Hashing

• [x] Various Types of Hashing

Bit Manipulation

• [x] Basics
• [x] BitMasking
• [x] Powerset and Find tha nums

One Month Challenge :')

Difficulty Levels solved :

🟢 Easy: 70
🟡 Medium: 60
🔴 Hard:2
⚫️ Very Hard: 0
🌟 Good to review

Total - 132

Day 0

Adding solutions to all problems I have completed today

Focus for today: Arrays, Strings

LeetCode

41. 🟢 Remove Duplicates from Sorted Array Notes: Use Hash Map!
42. 🟢 Rotate Array Notes: Recursion or (i+k)%n Index!
43. 🟢 Reverse String Notes: Recursion!

AlgoExpert

44. 🟢 Palindrome Check Notes: 2 Pointer's (Best)!

Educative

Sliding Window Technique Pattern

45. 🟢 Average of all contiguous subarrays of size ‘K’

Day 1

Focus for today: STL/ Linked Lists

LeetCode

46. 🟡 Remove Nth Node From End of List Notes: 🌟 use fast and slow pointer's
47. 🟢 Delete Node in a Linked List Notes: free(temp) doesn't works!

AlgoExpert

48. 🟡 Linked List Construction Notes: Nothing 😆

Educative

Sliding Window Technique Pattern Notes: Mostly use HashMaps or HashSets!

49. 🟡 Longest Substring with K Distinct Characters
50. 🟢 Maximum Sum Subarray of Size K
51. 🟢 Smallest Subarray with a given sum

Day 2

Focus for today: Linked Lists/Contest

LeetCode

52. 🟡 Minimum Operations to Make Array Equal Notes: take average
53. 🟢 Three Consecutive Odds Notes: cakeWalk!
54. 🟢 Reverse Linked List

Day 3

Focus for today: Linked Lists

LeetCode

55. 🟢 Linked List Cycle Notes: unordered set or 2 pointers
56. 🟢 Palindrome Linked List Notes: divide into 2 equal parts and use 2 pointers

AlgoExpert

57. 🔴 Merge Linked Lists Notes: 🌟 3 pointers

Day 4

Focus for today: Trees

LeetCode

58. 🟡 Binary Tree Inorder Traversal Notes:🌟 use stack
59. 🟡 Validate Binary Search Tree Notes: inorder has to be in sorted
60. 🟡 Kth Smallest Element in a BST Notes: think of inorder
61. 🟢 Find Mode in Binary Search Tree Notes: think of preorder

AlgoExpert

62. 🟡 BST Construction Notes: 🌟 basics

Day 5

Focus for today: Trees

LeetCode

63. 🟡 Binary Tree Level Order Traversal Notes:🌟 use queue
64. 🟢 Convert Sorted Array to Binary Search Tree Notes: 🌟binary search
65. 🟢 Maximum Depth of Binary Tree Notes: Either BFS/DFS

AlgoExpert

66. 🟢 Find Closest Value in BST Notes: helper function

Day 6

Focus for today: Trees

LeetCode

67. 🟢 Invert Binary Tree Notes: 🌟 queue/recursion
68. 🟢 Thousand Seperator Notes: Brute-Force
69. 🟢 Valid Parentheses Notes: use stack

Day 7

Focus for today: Contest

LeetCode

70. 🟢 Most Visited Sector in a Circular Track Notes: circular => f = f%n
71. 🟡 Maximum Number of Coins You Can Get Notes: reverse and give you first

Day 8

Focus for today: Trees

LeetCode

72. 🟡 Check Completeness of a Binary Tree Notes: 🌟use flag
73. 🟡 Sum Root to Leaf Numbers Notes: recursion
74. 🟢 Symmetric Tree Notes: recursion(best)

Day 9

Focus for today: Trees

LeetCode

75. 🟡 Path Sum II Notes: careful of callstack
76. 🟢 Range Sum of BST Notes: Do any DFS - Cakewalk

Educative

Depth First Search Pattern

77. 🟢 Binary Tree Path Sum
78. 🟡 All Paths for a Sum
79. 🟡 Sum of Path Numbers

Day 10

Focus for today: Trees

Educative

Depth First Search Pattern

80. 🟡 Path With Given Sequence
81. 🟡 Count Paths for a Sum Notes: 🌟Careful of count in recursion

Day 11

Focus for today: Graphs

LeetCode

82. 🟡 Number of Connected Components in an Undirected Graph Notes: dfs pattern
83. 🟡 Number of Islands Notes: dfs in all 4 dirs

AlgoExpert

84. 🟢 Depth First Search Notes: helper recursive function

Day 12

Focus for today: Algorithms

LeetCode

85. 🟡 Maximum Length of Subarray With Positive Product Notes: 🌟🌟careful of zeroes
86. 🟢 Merge Two Binary Trees Notes: Update the Node, after every step for backtracking!

AlgoExpert

87. 🟡 Kadane's Algorithm Notes: used for finding maxSubArray
88. 🟢 Nth Fibonacci Notes: Iterative method best among all!

Day 13

Focus for today: Everything

LeetCode

89. 🟢 Majority Element Notes: Moore's Voting Algorithm
90. 🟢 Valid Anagram Notes: take care of t.c and s.c

Day 14

Focus for today: Everything

LeetCode

91. 🟢 Excel Sheet Column Number Notes: use map
92. 🟢 First Unique Character in a String

Day 15

Focus for today: Everything

LeetCode

93. 🟢 Repeated Substring Pattern Notes: make duplicate and ignore 1st and last

Day 16

Focus for today: Recursions, Contest

LeetCode

94. 🟡 Permutations Notes: 🌟 use backtracking
95. 🟡 Subsets Notes: backtracking
96. 🟢 Matrix Diagonal Sum
97. 🟡 Subsets II Notes: backtraking

Day 17

Focus for today: Backtracking

LeetCode

98. 🟡 Combinations
99. 🟡 Combination Sum
100. 🟡 Combination Sum II

Day 18

Focus for today: Analysing Patterns

Educative

Sub Sets Pattern Notes: Follows BFS in every Approach

101. 🟡 String Permutation
102. 🟡 Playing With Permutations
103. 🟡 Combination of Subsets 2
104. 🟢 Combination of Subset

Day 19

Focus for today: September Challenge

LeetCode

105. 🟡 Compare Version Numbers Notes: use istringstream and stoi stl
106. 🟡 Word Pattern Notes: use unordered maps

Day 20

Focus for today: Strings

AlgoExpert

107. 🟢 Caesar Ciphor Encryptor
108. 🟡 Longest Palindromic Substring

Day 21

Focus for today: Strings

AlgoExpert

109. 🟡 Group Anagrams _Bucket Everything in hashmap and take care of TC and SC.
110. 🔴 Longest Substring Without Duplication

Day 22

Focus for today: Arrays

AlgoExpert

111. 🟡 Three Sum Notes: Take Care of Duplicates
112. 🟡 Smallest Difference Notes: Two Pointers

Day 23

Focus for today: Arrays

AlgoExpert

113. 🟡 Move Element To End Notes: Two Pointers
114. 🟡 Monotonic Array Notes: One Pass 🔥

LeetCode

115. 🟢 Monotonicity

Day 24

Focus for today: Contest, Miscellaneous

LeetCode

116. 🟡 XOR Queries of a Subarray Notes: xorSum vector and manupalate
117. 🟢 Decrypt String from Alphabet to Integer Mapping Notes: general

Day 25

Focus for today: Interview Questions

LeetCode

118. 🟢 Intersection of Two Arrays II Notes: set-intersection stl
119. 🟢 Power of 3 Notes: log2(n) / log2(3)
120. 🟢 Prime Numbers Notes: Sieve of eratosthenes

Day 26

121. 🟡 Spiral Traversal Notes: Make Sure of 4 variables and dir
122. 🟡 Longest Peak Notes: Binary Search

Day 27

123. 🟢 Cyclic Rotate
124. 🟢 Find the maximum and minimum element in an array
125. 🟢 Find the "Kth" max and min element of an array
126. 🟢 Move all the negative elements to one side of the array

Day 28

127. 🟡 Find duplicate in an array of N+1 Integers
128. 🟡 Find Largest sum contiguous Subarray
129. 🟡 Longest Consecutive Subsequence
130. 🟡 Merge Intervals
131. 🟡 Find maximum product subarray
132. 🟡 Smallest subarray with sum greater than a given value

Inspired by DeepakTalwar/interview-prep-cpp