Data Structure / Algorithm
Understand abstract data types, object-oriented programming, and analysis of algorithms.
Related Posts
Project Updates
-
Data Structures: Hash Table
A foundational dictionary data structure allowing for $O(1)$ average associative lookups.
-
Leetcode 121: Best Time to Buy and Sell Stock
Iteratively updating minimums and maximum profits in a single pass
-
Leetcode 704: Binary Search
A foundational $O(\log n)$ search algorithm for sorted arrays.
-
Leetcode 392: Is Subsequence
A two-pointer approach to check if one string is a subsequence of another
-
Leetcode 125: Valid Palindrome
A two-pointer approach to check if a string is a valid palindrome
-
Leetcode 283: Move Zeroes
A two-pointer approach to move all non-zero elements to the front of an array
-
Leetcode 13: Roman to Integer
-
Leetcode 69: Sqrt(x)
Computing the integer square root of a number using Binary Search.
-
Leetcode 1134: Armstrong Number
Determining if a number is an Armstrong number by extracting its digits.
-
Leetcode 169: Majority Element
Finding the majority element in an array using a Hash Map frequency table.
-
Leetcode 242: Valid Anagram
Checking if two strings are anagrams of each other using a Hash Map.
-
Leetcode 1: Two Sum
Finding a pair of numbers that add up to a target dynamically using a one-pass Hash Map.
-
Leetcode 141: Linked List Cycle
Detecting a cycle in a linked list using Floyd's Tortoise and Hare algorithm.
-
Leetcode 914: X of a Kind in a Deck of Cards
Grouping elements by checking the Greatest Common Divisor (GCD) of their frequencies.
-
Data Structures: Binary Search Tree
A node-based binary tree data structure with properties that make it highly efficient for searching, inserting, and deleting elements.
-
Introduction to Two Pointers
A comprehensive guide to the two-pointer algorithmic pattern
-
Leetcode 26: Remove Duplicates from Sorted Array
A two-pointer approach to remove duplicates in-place from a sorted array
-
Leetcode 27: Remove Element
A two-pointer approach to remove a specific element in-place from an array
-
Leetcode 160: Intersection of Two Linked Lists
Finding the node at which the intersection of two singly linked lists begins using the Two Pointers technique.
-
Leetcode 202: Happy Number
Determining if a number is a happy number using Hash Set and Two Pointers techniques.
-
Leetcode 938: Range Sum of BST
Calculating the sum of all nodes in a given range by traversing a Binary Search Tree.
-
Leetcode 977. Squares of a Sorted Array
Solving the Squares of a Sorted Array problem using a Two Pointers approach.