~/lc-grind

Transform a binary tree into a right-skewed linked list in-place, following the node order of a pre-order traversal.

Connect every node in a binary tree to its next right node, efficiently linking level-order neighbors even when the tree is imperfect, using BFS or an optimized constant-space approach.

Master the classic tree construction challenge where you'll cleverly leverage the last element of postorder as the root and strategically divide the inorder array to recursively build a binary tree from its traversal sequences.

Determine if a binary tree is a mirror image of itself by exploring its structure both recursively and iteratively.

Design an O(1) time LRU Cache that efficiently evicts the least recently used item when capacity is exceeded, using a combination of hash map and doubly-linked list.

Partition a linked list around a value x, preserving the original relative order of nodes in both the "less than" and "greater than or equal" partitions.

Shift a linked list to the right by `k` places by cleverly connecting its tail to its head and finding the new break point.

Given a sorted linked list, completely remove all nodes with duplicate values, preserving only the elements that appear exactly once.

Master the art of reversing every k nodes in a linked list in-place, a challenging recursion and pointer manipulation problem that demands precision.

Master the art of surgically reversing a specific sublist within a singly linked list, from position `left` to `right`, in a single pass.