Tags

bfs

• Shortest Path in Binary Matrix
• 01 Matrix
• All Nodes Distance K in Binary Tree
• Cheapest Flights Within K Stops
• Swim in Rising Water
• Jump Game III

binary search

• Zero Array Transformation II
• Binary Search in Sorted Array
• First and Last Position in a Sorted Array
• Find Minimum in Rotated Sorted Array
• Minimum Limit of Balls in a Bag
• Split Array Largest Sum
• Swim in Rising Water

binary tree

• Check Completeness of a Binary Tree
• All Nodes Distance K in Binary Tree

dfs

• Reconstruct Itinerary

dijkstra sssp

• Dijkstra Algorithm
• Cheapest Flights Within K Stops

dsu

• Number of Connected Components in an Undirected Graph

dynamic programming

• Word break

eulerian path

• Reconstruct Itinerary

greedy

• Best Time to Buy and Sell Stock
• Best Time to Buy and Sell Stock II
• Min Meeting Rooms
• Minimum Number of Arrows to Burst Balloons
• Gas Station
• Max Chunks To Make Sorted
• Jump Game
• Jump Game II

heap

• Median in a Stream

intervals

• Merge Intervals
• Insert Interval
• Min Meeting Rooms
• Smallest Range Covering Elements from K Lists
• Minimum Number of Arrows to Burst Balloons

knapsack

• Coin Change
• Coin Change II

line sweep

• Line Sweep Technique
• Zero Array Transformation I
• Zero Array Transformation II
• Smallest Range Covering Elements from K Lists

linked list

• Reverse Linked List

monotonic stack

• Monotonic Stack
• Largest Rectangle in Histogram
• Sum of Subarray Minimums
• Daily Temperatures

mst

• Kruskals algorithm
• Min Cost to Connect All Points
• Prims Algorithm

optimisers

• 02a Optimisers

palindromes

• Longest Palindromic Substring
• Count Palindromic Substrings
• Manacher Algorithm
• Palindromic Partition

permutation

• Next Permutation
• Permutation Sequence

self attention

• 03a Implementing Self Attention

sliding window

• Longest Substring Without Repeating Characters
• String Compression
• Take K of Each Character From Left and Right
• Partition Labels

stack

• Asteroid Collision

string

• Reorganize String

topological sort

• Topological Sort
• Find Eventual Safe States

transformers

• 03a Implementing Self Attention

trie

• Word break

two pointers

• Containers with Most Water
• Longest Substring Without Repeating Characters
• String Compression