~/lc-grind

Merge k sorted linked-lists into a single sorted list efficiently using divide-and-conquer, heaps, or merge sort techniques—a must-know hard problem for mastering linked lists and algorithms!

Learn how to merge two sorted linked lists into one sorted list efficiently using iterative or recursive approaches—perfect for mastering linked list manipulation!

Detect if a linked list has a cycle using efficient two-pointer traversal or a hash table for tracking visited nodes.

Learn how to reverse a singly linked list both iteratively and recursively in this easy LeetCode problem, perfect for mastering linked list manipulation!

Learn how to efficiently find the minimum number of intervals to remove for a non-overlapping schedule using greedy sorting—perfect for optimizing time-based conflicts!

Learn how to efficiently merge overlapping intervals in an array by sorting and iterating, producing a concise set of non-overlapping ranges—perfect for mastering array manipulation and sorting techniques!

Learn how to efficiently insert and merge a new interval into a sorted list of non-overlapping intervals while maintaining order and resolving overlaps.

Find the length of the longest consecutive sequence in an unsorted array in O(n) time using clever hash table or union find techniques.

Count the number of islands in a 2D grid where each island is a group of adjacent '1's connected horizontally or vertically, surrounded by '0's (water).

Solve the Pacific Atlantic Water Flow problem by finding all cells in a matrix from which water can flow to both the Pacific and Atlantic oceans using DFS/BFS to traverse adjacent cells with equal or lower heights.