notes/collection
engineering notes
212 notes.
dsa162
important notes2
questions157
arrays and search35
- 0 1 Matrix
- 1004. Max Consecutive Ones III
- 1679. Max Number of K Sum Pairs
- 238. Product of Array Except Self
- 283. Move Zeroes
- 3 Sum
- 643. Maximum Average Subarray I
- 724. Find Pivot Index
- overview· arrays and search problems
- Capacity To Ship Packages Within D Days
- Find Minimum in Rotated Sorted Array
- Find Peak Element
- Find the nth Root
- First and Last Position Of An Element In A Sorted Array
- First Bad Version
- First Bad Version [Easy]
- K Sum
- Koko Eating Bananas
- Kth Smallest Number in Multiplication Table
- Maximum Points You Can Obtain from Cards
- Maximum Subarray
- Merge Intervals
- Minimum consecutive cards to pick
- Minimum in rotated sorted array
- Minimum in rotated sorted array II
- Minimum Number of Days to Make m Bouquets
- Minimum Size Subarray Sum
- Number of Sub arrays of Size K and Average Greater than or Equal to Threshold
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array II
- Search Insert Position
- Single Element in a Sorted Array
- Split Array Largest Sum
- Sqrt(x)
- Two Sum 2 Input array is sorted
dynamic programming24
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock II
- Climbing Stairs
- Coin Change II
- Distinct Subsequences
- overview· dynamic programming problems
- Edit Distance
- Friends Pairing Problem
- Frog Jump Codestudio
- House Robber
- House Robber II
- Longest Common Subsequence
- Minimal Cost OR Frog with K distance
- Minimum Falling Path Sum
- Minimum Path Sum
- Ninja Training
- Number of Dice Rolls With Target Sum
- Partition equal Subset Sum
- Rod Cutting
- Shortest Common SuperSequence
- Subset Sum Equal To K
- Unique Paths
- Unique Paths II
- Wildcard Matching
graphs21
- Accounts Merge
- Alien Dictionary
- Bellman Ford
- BFS
- Count the number of complete components
- Course Schedule
- Detect Cycle in a graph
- Dijkstra Algorithm
- DisJoint Set
- Find Eventual Safe States
- Floyd Warshall
- overview· graphs problems
- is Graph Bipartite
- Minimum cost to connect all points
- Minimum Height Trees
- Network Delay
- Number of operations to make a network connected
- Number Of Provinces
- Prims Algorithm (Greedy Algorithm)
- Rotten Oranges
- Topological Sort
strings and sliding window15
- 1071. Greatest Common Divisor of Strings
- 1456. Maximum Number of Vowels in a Substring of Given Length
- 1657. Determine if Two Strings Are Close
- 345. Reverse Vowels of a String
- 443. String Compression
- Find All The Anagrams in a String
- Fruit Into Baskets
- Longest Repeating Character Replacement
- Longest Substring Without Repeating Window
- Maximum Number of occurrences of Substring
- Minimum Window Maximum
- Sliding Window Maximum
- overview· strings and sliding window problems
- Subarrays with K Different Integers
- Substrings of Size K with Distinct Characters
todo17
- Todo - Counting Bits
- Todo - Daily Temperatures
- Todo - Design Add and Search Words Data Structure
- Todo - Implement Queue using Stacks
- Todo - Implement Trie
- Todo - Insert Interval
- Todo - Kth Largest Element in an Array
- Todo - Merge K Sorted Lists
- Todo - Minimum Number of Arrows to Burst Balloons
- Todo - Missing Number
- Todo - Next Greater Element I
- Todo - Non-overlapping Intervals
- Todo - Number of Recent Calls
- Todo - Single Number
- Todo - Top K Frequent Elements
- Todo - Trapping Rain Water
- Todo - Word Search II
trees20
- Amount of Time for Binary Tree to Be Infected
- Binary Tree
- Binary Tree Maximum Path Sum
- Binary Tree Zigzag Level Order Traversal or Spiral Traversal
- Bottom View
- Boundary Order Traversal
- Diameter of a Binary Tree
- Flatten a binary tree
- is Balanced Binary Tree
- Least Common Ancestor
- Left View
- Path Sum 2
- Right View
- Same Tree
- Symmetric Trees
- Top View
- overview· trees problems
- Two Sum IV Input in BST
- Types of Binary Trees
- Vertical Order Traversal
sorting algorithms1
high level design27
hld questions2
theory24
lld_notes21
springboot1