DSA Notes

Search CTRL + K

DSA Notes

Search CTRL + K

DSA REV

root

Content

0-1 knapsack Theory

Add digits till the result has one digit

Add Two Numbers

Alien - Dictionary

Arrays , Strings and Hashing - (Theory)

Backspace String Compare

Balance a Binary Search Tree

Balanced Binary Tree

Bee Hive Problem

Best time to Buy and Sell Stock II

Binary Search and Patterns - (Theory)

Binary Subarrays with sum

Binary Tree - (Theory)

Binary Tree Right Side View

Binary Tree ZigZag level order traversal

Bipartite - BFS and DFS

Bit Manipulation - (Theory)

Bit wise odd or even

Boundary Traversal of Binary Tree

Cheapest Flight within k Stops

Check Given Matrix is magic square or not

Check whether kth bit is set or not

Children Sum Parent

Combination Sum

Construct Binary Tree from Postorder and Inorder Traversal

Construct Binary Tree from Preorder and Inorder Traversal

Construct Binary Tree from Preorder and Postorder Traversal

Container with most water

Contains Duplicate

Contiguous Array

Copy List with Random pointer

Count Number of subsets and given difference

Count of subsets of a given sum

Count total set bits

Course Schedule II

Course Schedule

Decimal to Binary Conversion

Delete Node in a BST

Delete node in a Linked List

Detect Cycle in an undirected Graph

Detect Cycle in directed graph

Diameter of Binary Tree

Dijkstra’s Algorithm - Theory

Dijkstra’s Algorithm

Divide two integers

Dynamic Programming - (Theory)

Dynamic Programming - Patterns and Questions

Fibonacci Number

Find a peak element II

Find all Anagrams in a String

Find all Subsets

Find Element in Sorted array of infinite Numbers

Find Eventual Safe states

Find Maximum Sum Triplet Array

Find Nth root of m

Find Peak Element

Find Pivot index

Find the index of the first occurrence in String

Find the longest substring with k unique characters

First and Last position of an element in a sorted array

Fractional Knapsack

Generate Parentheses

Generic Problems

Given a number n find sum of All Digits in n

Graph Algorithms and Problems

Graph Basics and Theory

Greedy Algorithm-(Theory)

Greedy Problems

Implement queue using stacks

Implement stack using queues

Implementing Dijkstra

Inorder Successor in BST

Insert into a Binary Search Tree

Insertion of two Linked Lists

Invert Binary Tree

Isomorphic Strings

Kadane's Algorithm

Koko eating bananas

Kth - missing positive number

Kth closest points to origin

Kth largest Element in an Array

Kth Smallest element in a BST

Kth Smallest element in a sorted matrix

Largest odd number in string

Letter Combinations of a Phone Number

Linear Search and Patterns - (Theory)

Linked List - (Theory)

Linked List Cycle I

Linked List Cycle II

Linked List Cycle III

Longest Common Subsequence

Longest Common Substring

Longest Palindromic Subsequence

Longest palindromic substring

Longest repeating character replacement

Longest repeating subsequence

Longest substring without repeating characters

Longest Valid Parentheses

Lowest Common Ancestor of a Binary Search Tree

Lowest Common Ancestor of a Binary Tree

Majority Element - (Boyer-Moore-Voting-Algo)

Max and Min element in binary tree

Max Consecutive ones

Max Sum Subarray of size k

Maximize the profit after selling the tickets

Maximum Activities

Maximum Average Subarray - I

Maximum depth of Binary Tree

Maximum nesting depth of the Parentheses

Maximum Width of Binary Tree

Merge K sorted Arrays

Merge Sorted Arrays

Merge two sorted Lists

Middle of Linked List

Minimum bit flip to convert number

Minimum Meeting Room Required

Minimum number of Days to make m Bouquets

Minimum number of deletions in a string to make it palindrome

Minimum number of insertions and deletions to convert string from one to another

Minimum number of insertions in a string to make it a palindrome

Minimum Size Subarray Sum

Minimum subset sum difference

Next - Larger - Element

Next Permutation

Nth Tribonacci Number

Number of Islands

Number of Provinces

Number of Students unable to eat Lunch

Number of ways to Arrive at Destination

Number Palindrome

Palindrome Partitioning

Palindromic Permutation

Partition equal subset sum

Path with minimum Effort

Permutation in String

Prefix Sum Pattern - (Theory)

Printing Longest Common Subsequence

Problems on Binary Search

Problems on Binary tree

Problems on Bit Manipulation

Problems on BST

Problems on Dijkstra's Algorithm

Problems on Graph Traversals

Problems on Heaps

Problems on Linked List

Problems on Prefix Sum

Problems on Recursion

Problems on Sliding Window

Problems on Stacks and Queues

Problems on Strings

Problems on Two Pointers

Product of Array except Self

Range Sum Query Immutable

Recursion and Backtracking - (Theory)

Remove Duplicates From Sorted List

Remove Nth Node from end of List

Remove Outermost Parentheses

Reveal Cards in increasing order

Reverse Linked List

Reverse words in a string

Roman to Integer

Rotate Array By K

Running Sum of 1D Array

Search in 2D matrix II

Search in 2D matrix

Search in a Binary Search Tree

Search in rotated sorted array II

Search in rotated sorted array

Search Insert Position

Sequence pattern matching

Set Matrix Zeros

Set the rightmost unset bit

Shortest Common Super Sequence

Shortest Path in Binary Maze

Shortest Path in Weighted Undirected Graph

Sieve-of-eratosthenes

Single Number I

Single Number II

Single Number III

Size of a Binary Tree

Sliding Window and Pattern - (Theory)

Sort characters by frequency

Sorted Insert For Circular Linked List

Sorting Algos and Patterns - (Theory)

Stacks and Queues - (Theory)

String to Integer ATOI

Subarray sum equals k

Theory - Fibonacci

Theory - Longest Common Subsequence

Theory - Traversals

Time needed to Buy and tickets

Top View of Binary Tree

Topological Sort - BFS and DFS (Kahn’s Algorithm)

Topological Sort - Problems

Topological Sort - Theory

Traversals - BFS and DFS

Two Pointers or N Pointers - (Theory)

Two Sum Unsorted

Unbounded Knapsack - Theory

Unbounded Knapsack

Valid Palindrome

Valid Parentheses

Validate Binary Search Tree

Topics

Arrays, Strings and Hashing

Bit Manipulation

Dynamic Programming

Greedy Algorithm

Recursion and Backtracking

Stacks and Queues

Trees - BT and BST

Enter to select

to navigate

ESC to close

Topological Sort - BFS and DFS (Kahn’s Algorithm)

Topological Sort - Theory
Topological Sort - Problems

Connected Pages

Depth

Pages mentioning this page

Graph Algorithms and Problems