-
Convert BST to Greater Tree - Easy HashMap solution
Binary Search Tree
Binary Tree
C++
Depth-First Search
Medium
Tree
-
Binary Search Tree to Greater Sum Tree - Easy HashMap solution
Binary Search Tree
Binary Tree
C++
Depth-First Search
Medium
Tree
-
Trim a Binary Search Tree - Recursive C++ solution
Binary Search Tree
Binary Tree
C++
Depth-First Search
Medium
Tree
-
Find Median from Data Stream - Classical solution two heaps
C++
Data Stream
Design
Hard
Heap (Priority Queue)
Sorting
Two Pointers
-
Top K Frequent Words - 3 line simplest O(n log n ) solution by sorting
Bucket Sort
Counting
Hash Table
Heap (Priority Queue)
Medium
Python
Sorting
String
Trie
-
Number of Steps to Reduce a Number in Binary Representation to One - Simply simulate the steps
Bit Manipulation
C++
Medium
String
-
Delete and Earn - House Robber
Array
C++
Dynamic Programming
Hash Table
Medium
-
Arithmetic Slices - Faster than 100% C++ solutions and also very easy to understand
Array
C++
Dynamic Programming
Medium