ไอต้าวแว่นทำ LeetCode - JS Special Editions

Hi everyone, this repository is used for storing the solutions for LeetCode in Javascript. The support resources for my video playlist for support learners.

Video Playlist

LeetCode questions by pattern

Array & HashTable

• Two Sum
• Best Time to Buy and Sell Stock
• Maximum Subarray
• Contains Duplicate
• Longest Consecutive Sequence

Two-Pointers

• Move Zeroes
• Two Sum II - Input Array Is Sorted
• Squares of a Sorted Array
• Container With Most Water

Sliding Windows

• Longest Substring Without Repeating Characters
• Fruit Into Baskets
• Minimum Size Subarray Sum

String

• Valid Palindrome
• Valid Anagram
• Reverse Vowels of a String
• Reverse Words in a String III
• Group Anagrams

Linked List

• Remove Linked List Elements
• Remove Duplicates from Sorted List
• Add Two Numbers
• Odd Even Linked List
• Remove Nth Node From End of List
• LRU Cache

Fast & Slow Pointers

• Linked List Cycle
• Middle of the Linked List
• Linked List Cycle II
• Find the Duplicate Number

Modified Binary Search

• First Bad Version
• Find First and Last Position of Element in Sorted Array
• Search a 2D Matrix

Stack & Queue

• Valid Parentheses
• Evaluate Reverse Polish Notation
• Find the Winner of the Circular Game

Monotonic Stack

• Next Greater Element I
• Next Greater Element II
• Daily Temperatures
• Online Stock Span

Backtracking

• Subsets
• Permutations
• Combination Sum
• Generate Parentheses
• Letter Combinations of a Phone Number

Merge Interval

• Merge Intervals
• Insert Interval
• Non-overlapping Intervals

Cyclic Sort

• Missing Number
• Find All Numbers Disappeared in an Array
• First Missing Positive

Tree - DFS

• Maximum Depth of Binary Tree
• Path Sum
• Merge Two Binary Trees
• Validate Binary Search Tree
• Sum Root to Leaf Numbers
• Path Sum II
• Binary Tree Maximum Path Sum

Tree - BFS

• Minimum Depth of Binary Tree
• Average of Levels in Binary Tree
• Binary Tree Level Order Traversal
• Binary Tree Zigzag Level Order Traversal
• Binary Tree Right Side View

Trie

• Implement Trie (Prefix Tree)
• Replace Words
• Design Add and Search Words Data Structure
• Search Suggestions System

Top K Elements

• Kth Largest Element in an Array
• Kth Smallest Element in a BST
• K Closest Points to Origin
• Top K Frequent Elements
• Sort Characters By Frequency
• Find K Closest Elements
• Reorganize String

K-way Merge

• Merge Two Sorted Lists
• Merge k Sorted Lists
• Find K Pairs with Smallest Sums
• Kth Smallest Element in a Sorted Matrix

2 Heaps

• Find Median from Data Stream

Graph

• Clone Graph
• Find if Path Exists in Graph - DFS
• Find if Path Exists in Graph - BFS
• All Paths From Source to Target
• Keys and Rooms
• Word Search
• Word Search II
• Number of Islands
• Surrounded Regions
• Max Area of Island
• 01 Matrix
• Word Ladder

Union-Find

• Find if Path Exists in Graph - Union Find
• Number of Provinces
• Number of Operations to Make Network Connected

Topological Sort

• Course Schedule
• Course Schedule II

Minimum Spanning Tree

• Min Cost to Connect All Points [Kruskal]
• Min Cost to Connect All Points [Prim]

Single-Source-Shortest Path

• Network Delay Time [Djisktra]
• Network Delay Time [Bellman-ford]

Dynamic Programming

0/1 Knapsack

• Target Sum
• Partition Equal Subset Sum
• House Robber

Unbound Knapsack

• Coin Change
• Coin Change II

Fibonacci

• Fibonacci Number
• Min Cost Climbing Stairs

Longest Palindromic Subsequence (LPS)

• Longest Palindromic Subsequence
• Palindromic Substrings
• Longest Palindromic Substring

Longest Common Subsequence (LCS)

• Longest Common Subsequence
• Shortest Common Supersequence
• Edit Distance
• Longest Increasing Subsequence

General

• Unique Paths
• Perfect Squares
• Triangle
• Word Break
• Word Break II
• Concatenated Words
• Longest Increasing Path in a Matrix

Bitwise

• Number of 1 Bits
• Hamming Distance
• Counting Bits
• Total Hamming Distance