🆘 Technical Interview Prep 🆘

• Revise is the level of how hard it was for me to understand and should revise more on a scale of 1-5, 5 being most difficult
• if there is a question mark I haven't gotten to the question yet
• Also useful to know some useful python functions that will help you solve these, here is a good cheat sheet

📚Arrays📚

Title	Difficulty	Revise	Solution	Completed?
Two Sum	Easy	1	Solution	✅
Best Time to Buy and Sell Stock	Easy	1	Solution	✅
Contains Duplicate	Easy	1	Solution	✅
Product of Array Except Self	Medium	1	Solution	🚫
Max Subarray	Easy	4	Solution	🚫
Maximum Product Subarray	Medium	?	Solution	🚫
Find Minimum in Rotated Sorted Array	Medium	?	Solution	🚫
Three Sum	Medium	?	Solution	🚫
Container with Most Water	Medium	?	Solution	🚫
Extras

🧵Strings🧵

Title	Difficulty	Revise	Solution	Completed?
Longest Substring Without Repeating Characters	Medium	3	Solution	✅
Longest Repeating Character Replacement	Medium	4	Solution	✅
Minimum Window Substring	Hard	?	Solution	🚫
Valid Anagram	Easy	1	Solution	✅
Group Anagrams	Medium	2	Solution	✅
Valid Parentheses	Easy	1	Solution	✅
Valid Palindrome	Easy	1	Solution	✅
Longest Palindromic Substring	Medium	?	Solution	🚫
Palindromic Substrings	Medium	?	Solution	🚫
Extras
Find Anagrams in String	Medium	2	Solution	✅
Permutation in String	Medium	2	Solution	✅

🌲Trees🌲

Title	Difficulty	Revise	Solution	Completed?
Max Depth	Easy	1	Solution	✅
Same Tree	Easy	1	Solution	✅
Invert/Flip Binary Tree	Easy	1	Solution	✅
BT Max Path Sum	Hard	?	Solution	🚫
BT Level Order Traversal	Medium	1	Solution	✅
Serialize and Deserialize Binary Tree	Hard	?	Solution	🚫
Subtree of Another Tree	Easy	4	Solution	✅
Construct BT from preorder and inorder Traversal	Medium	?	Solution	🚫
Validate Binary Search Tree	Medium	4	Solution	✅
Kth Smallest Element in a BST	Medium	2	Solution	✅
Lowest Common Ancestor of BST	Medium	4	Solution	✅
Implement Trie (Prefix Tree)	Medium	?	Solution	🚫
Add and Search Word	Medium	?	Solution	🚫
Word Search II	Medium	?	Solution	🚫
Extras
Max Depth of N-Ary Tree	Easy	1	Solution	✅
Binary Tree Right Side View	Med	1	Solution	✅
Path Sum II	Med	1	Solution	✅
Sum Root to Leaf Numbers	Med	1	Solution	✅
Two Sum IV - Input is a BST	Easy	1	Solution	✅

🔗Linked Lists🔗

Title	Difficulty	Revise	Solution	Completed?
Reverse a Linked List	Easy	1	Solution	✅
Detect a Cycle in a Linked List	Easy	1	Solution	✅
Merge Two Sorted Lists	Easy	1	Solution	✅
Merge K Sorted Lists	Hard	?	Solution	🚫
Remove Nth Node From End Of List	Medium	1	Solution	✅
Reorder List	Medium	?	Solution	🚫
Extras

📈Graph📈

Title	Difficulty	Revise	Solution	Completed?
Keys and Rooms	Medium	3	Solution	✅

🔎Heap🔎

Title	Difficulty	Revise	Solution	Completed?
Merge K Sorted Lists	Hard	?	Solution	🚫
Top K Frequent Elements	Medium	1	Solution	✅
Find Median from Data Stream	Hard	?	Solution	🚫
Extras