ExamAdda LogoExamAdda
CompilerDSA Animations
JAVASCRIPTMYSQL1MYSQLPYTHONINTERVIEWNODEJSDBMSDBMS1ROADMAPSDSA

Basic DSA

  • DSA RoadMap
  • Introduction of DSA
  • Type of Notations
  • Time Complexity
  • Space Complexity

Arrays

  • Introduction of Array
  • Move Zeroes
  • Majority Element
  • Remove Duplicates
  • Buy and Sell
  • Rotate Array
  • Product of Array
  • Buy and Sell II
  • Zero-Filled Subarrays
  • Increasing Triplet
  • Missing Positive

String

  • Reverse String
  • Valid Palindrome
  • Valid Anagram
  • Longest Common Prefix
  • Rotate String
  • Longest Substring
  • Length of Last Word
  • Decode String
  • All Anagrams in a String
  • Count and Say

Bit Manupulations

  • Number is even or odd
  • Ith bit is set or not.
  • Non-repeating element
  • A number is a power of 2.
  • Swap two numbers
  • Count number of set bits
  • Two numbers have opposite signs
  • The rightmost set bit
  • Set, Clear & Toggle Bit
  • Total set bits

Hash Table

  • Count the frequency
  • First Non-Repeating Character
  • Two strings are anagrams
  • Longest Substring Without Repeating
  • Top K Frequent Elements
  • Subarray Sum Equals K
  • Longest Consecutive Sequence
  • Group Anagrams

Two Pointer

  • Two Sum II
  • Container With Most Water
  • Remove Duplicates from Sorted
  • Valid Palindrome
  • Sort Colors (Dutch National Flag)
  • Move Zeroes
  • 3Sum
  • Squares of a Sorted Array

Prefix Sum

  • Running Sum of 1d Array
  • Range Sum Query - Immutable
  • Find Pivot Index
  • Subarray Sum Equals K
  • Product of Array Except Self
  • Find the Middle Index in Array
  • Contiguous Array
  • Range Sum Query 2D - Immutable
  • Corporate Flight Bookings

Sliding Window

  • Maximum Sum Subarray of size K
  • Contains Duplicate II
  • Longest Substring Without Repeating Characters
  • Longest Repeating Character Replacement
  • Permutation in String
  • Subarrays with K Different Integers
  • Minimum Window Substring
  • Sliding Window Maximum

Kadane’s algorithm

  • Maximum Sum Circular Subarray
  • Maximum Ascending Subarray Sum
  • Best Time to Buy and Sell Stock
  • Longest Turbulent Subarray
  • Maximum Subarray Sum with One Deletion
  • Maximum Product Subarray
  • Smallest Subarray Sum
  • Maximum Sum Circular Subarray
  • Maximum Subarray Sum with One Deletion

Matrix

  • Transpose Matrix
  • Rotate Image (90°)
  • Spiral Matrix
  • Set Matrix Zeroes
  • Matrix Reshape
  • Valid Sudoku
  • Diagonal Traverse
  • Search a 2D Matrix II
  • Toeplitz Matrix
  • Lucky Numbers in a Matrix
  • Matrix Addition
  • Matrix Subtraction
  • Richest Customer Wealth
  • Cells with Odd Values in a Matrix

Linked List

  • Reverse a Linked List
  • Detect a Cycle
  • Middle of the Linked List
  • Merge Two Sorted Lists
  • Remove N-th Node from End
  • Find the Maximum/Minimum Element
  • Insert at the Beginning (Push)
  • Delete the Last Node
  • Delete the Kth Node from the End
  • Remove Duplicates (Unsorted)
  • Remove Duplicates (Sorted)
  • Check if Palindrome

stack

  • Balanced Parentheses
  • Next Greater Element
  • Reverse a String/List using Stack
  • Delete Middle Element of a Stack:
  • Sort a Stack
  • Infix to Postfix Conversion
  • Infix to Postfix Conversion
  • Prefix to Postfix Conversion
  • Implement Queue using Stacks
  • Implement Stack using Queues

queues

  • Implement a Queue using an Array
  • Implement a Queue using a Linked List
  • Implement a Circular Queue
  • Design a Deque (Double-Ended Queue)
  • Queue using Two Stacks
  • Reverse a Queue
  • Reverse First K elements of Queue

Sorting

  • Sort an Array of 0s, 1s, and 2s
  • Sort Even and Odd Numbers
  • Sort Characters in a String
  • Remove Duplicates from Sorted Array
  • Merge Two Sorted Arrays
  • Implement Bubble Sort
  • Implement Insertion Sort
  • Implement Selection Sort
  • Sort an Array in Descending Order
  • Sort Array by Absolute Difference from K
  • Sort a String Alphabetically
  • Sort an Array using Quick Sort
  • Kth Smallest Element using Sorting

Recursion

  • Introduction of Recursion

Backtracking

  • Generate all possible letter combinations.
  • Generate all subsets of an array.
  • Generate all the possible subsets but array contains duplicates.
  • Generate the possible Permutations But ,permutations when duplicates exist.
  • Generate Parenthesis
  • Palindrome Partitioning
  • Combination Sum III
  • Combination Sum II
  • Combination Sum
  • N‑Queens
  • Word Search II

Devide and Conquer

  • Closest Pair of Points
  • Skyline Problem
  • Median of Two Sorted Arrays
  • Kth Largest Element (QuickSelect)
  • Maximum Subarray (Divide & Conquer)
  • Count Inversions in Array
  • Merge Sort
  • Square Root (without library)
  • Find Minimum in Rotated Sorted Array
  • Search in Rotated Sorted Array
  • Search Insert Position

Binary Search

  • Peak Index in Mountain Array
  • Minimum Days to Make Bouquets
  • Split Array Largest Sum
  • Capacity to Ship Packages
  • Valid Perfect Square
  • Sqrt(x)
  • Find Minimum in Rotated Sorted Array
  • Search in Rotated Sorted Array

Binary Tree

  • Invert Binary Tree
  • Symmetric Tree
  • Same Tree
  • Right Side View
  • Average of Levels in Binary Tree
  • Level Order Traversal
  • Level Order Traversal
  • Postorder Traversal
  • Preorder Traversal

Binary Search Tree

  • Recover Binary Search Tree
  • Convert BST to Greater Tree
  • Delete Node in BST
  • Lowest Common Ancestor in BST
  • Convert Sorted Array to BST
  • Kth Smallest Element in BST
  • Validate Binary Search Tree
  • Maximum in BST
  • Minimum in BST
  • Insert into a BST
  • Search in a Binary Search Tree
  • Construct BST from Preorder

Tries

  • Implement Trie
  • Count Words with Prefix
  • Longest Common Prefix (Trie approach)
  • Implement Magic Dictionary
  • Replace Words
  • Map Sum Pairs
  • Word Search II
  • Design Search Autocomplete System
  • Stream of Characters

Heap

  • Kth Smallest Element in an Array
  • Kth Largest Element in an Array
  • Heap Sort
  • op K Frequent Elements
  • K Closest Points to Origin
  • Top K Frequent Words
  • Find Median from Data Stream
  • Kth Largest Element in a Stream
  • Merge K Sorted Lists

Interval

  • Minimum Number of Arrows to Burst Balloons
  • Meeting Rooms II
  • Meeting Rooms
  • Non-Overlapping Intervals
  • Insert Interval
  • Merge Intervals

Greedy

  • Minimum Number of Arrows to Burst Balloons
  • Assign Cookies
  • Activity Selection Problem
  • Jump Game
  • Jump Game II
  • Gas Station

Dynamic Programming

  • Longest Common Subsequence
  • Longest Increasing Subsequence
  • Maximum Subarray
  • Climbing Stairs
  • Fibonacci Number
  • Partition Equal Subset Sum
  • Coin Change
  • Unique Paths
  • Burst Balloons
  • Regular Expression Matching

Graph

  • Network Delay Time
  • Clone Graph
  • Course Schedule
  • Flood Fill
  • Number of Islands
  • Rotting Oranges

Math

  • Integer Break
  • Number of 1 Bits
  • Single Number
  • Missing Number
  • Check Prime Number
  • LCM of Two Numbers
  • GCD of Two Numbers
  • Add Digits (Digital Root)
  • Reverse Integer
  • Palindrome Number
  • Factorial Trailing Zeroes
  • Happy Number
  • Pow(x, n)
  • Sqrt(x)
  • Power of Two

Best Time to Buy and Sell Stock II

DSA Tutorial

Learn DSA with our comprehensive tutorials

Basic DSA

5 topics →

Arrays

11 topics →

String

10 topics →

Bit Manupulations

10 topics →

Hash Table

8 topics →

Two Pointer

8 topics →

Prefix Sum

9 topics →

Sliding Window

8 topics →

Kadane’s algorithm

9 topics →

Matrix

14 topics →

Linked List

12 topics →

stack

10 topics →

queues

7 topics →

Sorting

13 topics →

Recursion

1 topics →

Backtracking

11 topics →

Devide and Conquer

11 topics →

Binary Search

8 topics →

Binary Tree

9 topics →

Binary Search Tree

12 topics →

Tries

9 topics →

Heap

9 topics →

Interval

6 topics →

Greedy

6 topics →

Dynamic Programming

10 topics →

Graph

6 topics →

Math

15 topics →

Best Time to Buy and Sell Stock II

ExamAdda LogoExamAdda Tech

Your comprehensive destination for learning programming, web development, data science, and modern technologies. Master coding with our in-depth tutorials and practical examples.

Support

  • About Us
  • Contact Us
  • Privacy Policy
  • Terms of Service

Connect With Us

Follow us on social media for the latest tutorials, tips, and programming updates.

© 2026 ExamAdda Tech. All rights reserved.

Privacy PolicyTerms of ServiceCookie Policy