Mastering Data Structures & Algorithms in Swift & iOS

Discover how binary search achieves O(log n) time on a sorted ascending array by halving the search space with left and right pointers, and implement it in Swift.

Remove duplicates from a sorted array in place using a single-pointer technique to keep only the first k unique elements in their original order with constant space.

Master stacks and queues through practical push, pop, enqueue, and dequeue operations. Learn how these structures solve problems, including using them for the first medium difficulty task, merging intervals.

Learn to merge overlapping intervals by sorting the input, using a stack with last in, first out order, merging overlaps to return non overlapping intervals.

Explore solving the LeetCode palindrome problem using a two-pointer approach on a lowercase, alphanumeric string, skipping non-alphanumeric characters to determine if a string is a palindrome.

Explore linked lists, a dynamic data structure of nodes with next pointers, how they differ from arrays, enable efficient insertions and deletions, and appear in playlists and undo/redo.

Merge two sorted linked lists into a single ascending list by using two pointers and a dummy head, appending the smaller node each step and returning the merged head.

Explore binary trees, where each node has at most two children—the left and right—with a root and leaves, and see a basic class built with a value and optional children.