- Published on
Given the root of a binary tree, return the length of the longest path, where each node in the path has the same value.
All Posts
All Posts
- python (52)
- algorithm (52)
- dfs (16)
- tree (15)
- graph (10)
- linked-list (8)
- binary-search-tree (6)
- stack (4)
- two-pointers (4)
- hashmap (3)
- bfs (3)
- ai (2)
- machine-learning (2)
- binary-tree (2)
- dijkstras-algorithm (2)
- sorting (2)
- 2024-google-ml-bootcamp (1)
- deep-learning (1)
- mathematics (1)
- books (1)
- courses (1)
- defaultdict (1)
- trie (1)
- palindrome (1)
- heap (1)
- priority-queue (1)
- recursion (1)
- counter (1)
- typing (1)
- deque (1)
- slicing (1)
- Published on
Given the root of a binary tree, return the length of the diameter of the tree.- Published on
Given the root of a binary tree, return its maximum depth.- Published on
Given an integer array nums of unique elements, return all possible cheapest Flights within k Stops (the power set). The solution set must not contain duplicate cheapest Flights within k Stops. Return the solution in any order.- Published on
Given an integer array nums of unique elements, return all possible network Delay Time (the power set). The solution set must not contain duplicate network Delay Time. Return the solution in any order.