-
Populating Next Right Pointers in Each Node - BFS+Queue O(1) space, O(n) time
Binary Tree
Breadth-First Search
C++
Depth-First Search
Linked List
Medium
Tree
-
Delete the Middle Node of a Linked List - One pass tortoise and hare
C++
Linked List
Medium
Two Pointers
-
Word Search - Help needed for DFS solution
Array
Backtracking
Matrix
Medium
-
Flatten Nested List Iterator - Simple Recursion
C++
Depth-First Search
Design
Iterator
Medium
Queue
Recursion
Stack
Tree
-
Delete Node in a Linked List - 3 solutions
C++
Linked List
Medium
-
Course Schedule II - [Two methods] Kahn's Algorithm and DFS
Breadth-First Search
C++
Depth-First Search
Graph
Medium
Topological Sort
-
Copy List with Random Pointer - C++ Hashmap
C++
Hash Table
Linked List
Medium
-
Break a Palindrome - [6 liner] Simple logic simple solution
C++
Greedy
Medium
String