217. Contains Duplicate

Master the fundamental array problem of detecting duplicates using Hash Sets, Sorting, and Brute Force approaches.

49. Group Anagrams

Master the art of grouping anagrams using hash maps and canonical representations to solve LeetCode 49 efficiently.

Binary search

In computer science, binary search, also known as half-interval search,logarithmic search,or binary chop,is a search algorithm that finds the position of a target value within a sorted array.

Bubble Sort

Bubble sort (sometimes called sinking sort) is usually the first sorting algorithm you'll encounter when learning to code. It's simple, easy to wrap your head around, stable, and in-place. The catch? Its quadratic time complexity makes it painfully slow for large datasets.