LeetCode Interval Problems: Merge, Insert, and Schedule
Master interval problems on LeetCode: sorting, merging, inserting, and scheduling with templates, visual walkthroughs, and complexity analysis.
·6 min read · #leetcode#intervals#algorithms
#sorting
7 posts · page 1 of 1
Car Fleet Problem — Stack-Based Arrival Time Solution
Solve LeetCode 853 Car Fleet using a stack. Sort by position, compare arrival times, and count fleets. Python solution with visual trace.
·5 min read · #dsa#stacks#sorting
Counting, Radix, and Bucket Sort: Beyond O(n log n)
Break the comparison sort barrier with counting sort, radix sort (LSD and MSD), and bucket sort — Python implementations, stability analysis, and when to use each non-comparison sort.
·14 min read · #dsa#sorting#intermediate
Merge Sort Deep Dive: Divide, Conquer, and Count
Master merge sort — recursive splitting, merging sorted halves, counting inversions, merge sort on linked lists, stability analysis, and O(n log n) guaranteed performance with Python.
·13 min read · #dsa#sorting#intermediate
Quick Sort Deep Dive: Partition, Pivot, and QuickSelect
Master quick sort — Lomuto and Hoare partitions, pivot strategies, worst case analysis, Dutch National Flag, QuickSelect for kth element, and comparison with merge sort.
·13 min read · #dsa#sorting#intermediate
Merge Intervals — Sort and Sweep
Walk through Merge Intervals step by step. Brute force vs the optimal sort-and-sweep approach, edge cases, and clean code you can ship in an interview.
·5 min read · #dsa#leetcode#intervals
Sorting Algorithms: Bubble, Insertion, Merge, Quick, Heap
A tour of the five sorting algorithms every programmer should know — their ideas, Big-O time and space, stability, and Python implementations, plus when to just use sort().
·8 min read · #dsa#sorting#intermediate