Skip to content

jaroslaw-weber/algo-lens

Repository files navigation

algo-vision

Easily visualize and practice Data Structures and Algorithms (DSA). Starting with dynamic programming, we also support bit manipulation, binary search, and more.

Quick Start

Visit algo-lens to explore algorithm visualizations.

What’s Inside

  • Dynamic Programming: See step-by-step visualizations to understand how solutions are built.
  • Bit Manipulation and Binary Search: Visualize and practice these techniques.
  • Interactive Tools: Experiment with algorithms to learn how they work.
  • More to Come: New algorithms are added regularly.

Blind 75 Problems

Array

  • Two Sum
  • Best Time to Buy and Sell Stock
  • Contains Duplicate
  • Product of Array Except Self
  • Maximum Subarray
  • Maximum Product Subarray
  • Find Minimum in Rotated Sorted Array
  • Search in Rotated Sorted Array
  • 3 Sum
  • Container With Most Water

Binary

  • Sum of Two Integers
  • Number of 1 Bits
  • Counting Bits
  • Missing Number
  • Reverse Bits

Dynamic Programming

  • Climbing Stairs
  • Coin Change
  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Word Break Problem
  • Combination Sum
  • House Robber
  • House Robber II
  • Decode Ways
  • Unique Paths
  • Jump Game

Graph

  • Clone Graph
  • Course Schedule
  • Pacific Atlantic Water Flow
  • Number of Islands
  • Longest Consecutive Sequence
  • Alien Dictionary (Leetcode Premium)
  • Graph Valid Tree (Leetcode Premium)
  • Number of Connected Components in an Undirected Graph (Leetcode Premium)

Interval

  • Insert Interval
  • Merge Intervals
  • Non-overlapping Intervals
  • Meeting Rooms (Leetcode Premium)
  • Meeting Rooms II (Leetcode Premium)

Linked List

  • Reverse a Linked List
  • Detect Cycle in a Linked List
  • Merge Two Sorted Lists
  • Merge K Sorted Lists
  • Remove Nth Node From End Of List
  • Reorder List

Matrix

  • Set Matrix Zeroes
  • Spiral Matrix
  • Rotate Image
  • Word Search

String

  • Longest Substring Without Repeating Characters
  • Longest Repeating Character Replacement
  • Minimum Window Substring
  • Valid Anagram
  • Group Anagrams
  • Valid Parentheses
  • Valid Palindrome
  • Longest Palindromic Substring
  • Palindromic Substrings
  • Encode and Decode Strings (Leetcode Premium)

Tree

  • Maximum Depth of Binary Tree
  • Same Tree
  • Invert/Flip Binary Tree
  • Binary Tree Maximum Path Sum
  • Binary Tree Level Order Traversal
  • Serialize and Deserialize Binary Tree
  • Subtree of Another Tree
  • Construct Binary Tree from Preorder and Inorder Traversal
  • Validate Binary Search Tree
  • Kth Smallest Element in a BST
  • Lowest Common Ancestor of BST
  • Implement Trie (Prefix Tree)
  • Add and Search Word
  • Word Search II

Heap

  • Merge K Sorted Lists
  • Top K Frequent Elements
  • Find Median from Data Stream

Preview

2024-05-17.17-05-35.mp4
2024-05-17.17-06-12.mp4
2024-05-17.17-06-43.mp4

Screenshots

Screenshot (11)

About

visualizing algorithms from programming problems

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published