Sarthak GuptaLC #220: Contains Duplicate-3; learn height-balanced BST data structures for Python coding…Question Link : Contains Duplicate-3May 13, 2023May 13, 2023
Sarthak GuptaLC #173: Binary Search Tree Iterator but use only average O(1) Time & O(1) spaceProblem link : Binary Search Tree IteratorMay 11, 2023May 11, 2023
Sarthak GuptaLC #95: Unique Binary Search Trees-2 but solve via Bottom-up DPProblem link : Unique Binary Search Trees IIMay 10, 2023May 10, 2023
Sarthak GuptaTest your Python Deep_Copy vs Shallow Copy knowledge for coding interviewsCopying a list into a new list is a very standard operation in Coding interviews. So for all my awesome Python LeetCoders out here, let’s…May 9, 2023May 9, 2023
Sarthak GuptaMorris Traversal : Traverse/ Flatten Tree into LinkedList in O(1) spaceIf I ask you to traverse a Binary Tree : you will either do it recursively or by using a stack. In both cases you use O(tree_ht) space…May 7, 2023May 7, 2023
Sarthak GuptaMastering Monotonic StackMonotonic Stack is a pretty tough data structure to master and is asked very frequently in all FAANG coding interviews.May 7, 2023May 7, 2023
Sarthak GuptaMonotonic Stack vs Monotonic DequeBoth of these are pretty important data structures and are frequently asked in coding interviews.May 7, 2023May 7, 2023