Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    DSA Training 2K25 Batch - Third Semester

    Uploaded by

    Pankaj Singh

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd

    DSA Training 2K25 Batch - Third Semester

    Uploaded by

    Pankaj Singh
    11 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    11 views4 pages

    DSA Training 2K25 Batch - Third Semester

    Uploaded by

    Pankaj Singh

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    of 4

    Session Problem

    Design Linked List


    Remove Duplicates from Sorted List
    1 Remove Duplicates from Sorted List II
    Palindrome Permutation
    Intersection of Two Arrays
    Find Common Characters
    2 Unique Email Addresses
    Two Sum
    4Sum II
    3 Pairs of Songs With Total Durations Divisible by 60
    Contains Duplicate
    Kth Largest Element in an Array
    4 Valid Anagram
    Majority Element
    Group Anagrams
    5 Longest Consecutive Sequence
    Subarray Sum Equals K
    Subarray Sums Divisible by K
    6 Continuous Subarray Sum
    Contiguous Array
    Make Sum Divisible by P
    Partition Array into Disjoint Intervals
    7 Minimum Value to Get Positive Step by Step Sum
    Binary Search
    Search Insert Position
    8 Find Smallest Letter Greater Than Target
    Find First and Last Position of Element in Sorted Array
    Search a 2D Matrix
    9 Guess Number Higher or Lower
    First Bad Version
    Valid Perfect Square
    10 Sqrt(x)
    Peak Index in a Mountain Array
    Find Peak Element
    11 Arranging Coins
    Valid Palindrome
    Valid Palindrome II
    12 Reverse String
    Reverse Vowels of a String
    Reverse Only Letters
    13
    13 Squares of a Sorted Array
    Add Strings
    Check if Word Equals Summation of Two Words
    14 Intersection of Two Linked Lists
    Implement strStr()
    Substrings of Size Three with Distinct Characters
    15 Maximum Average Subarray I
    Contains Duplicate II
    Contains Duplicate III
    Merge Sorted Array
    16 Merge Two Sorted Lists
    Insertion Sort List
    Partition List
    Subsets
    17 Reverse Linked List
    Printing a linked list in reverse order
    Swap Nodes in Pairs
    Sort List
    18 Add Two Numbers
    Add Two Numbers II
    Linked List Cycle
    Linked List Cycle II
    19 Rotate List
    Greater than All
    Running Sum of 1d Array
    20 Range Sum Query - Immutable
    Maximum Depth of Binary Tree
    Maximum Depth of N-ary Tree
    21 Minimum Depth of Binary Tree
    Increasing Order Search Tree
    Invert Binary Tree
    22 Merge Two Binary Trees
    Binary Tree Level Order Traversal
    Binary Tree Level Order Traversal II
    23 Binary Tree Right Side View
    Populating Next Right Pointers in Each Node
    Minimum Depth of Binary Tree
    24 Cousins in Binary Tree
    Solution Strategies Efficiency

    Map
    Map
    Map
    Map
    Map
    Map
    Map
    Brute Force, Presorting, Hash Table (Set)
    Presorting
    Presorting, Hash Table (Frequency Map)
    Presorting, Hash Table (Frequency Map)
    Presorting and Hash Table (Map)
    Presorting, Hash Table (Set)
    Prefix Sum, Unordered Set (Hash Table)
    Prefix Sum, Unordered Set (Hash Table)
    Prefix Sum, Unordered Set (Hash Table)
    Prefix Sum, Unordered Set (Hash Table)
    Prefix Sum, Unordered Set (Hash Table)
    Prefix Max (Input Enhancement)
    Prefix Sum
    Binary Search, Tail Recursion
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Binary Search
    Two Pointers at same speed (p++ and q--) O(n)
    Two Pointers at same speed (p++ and q--) O(n)
    Two Pointers at same speed (p++ and q--) O(n)
    Two Pointers at same speed (p++ and q--) O(n)
    Two Pointers at same speed (p++ and q--) O(n)
    Two Pointers at same speed (p++ and q--) O(n)
    Two Pointers at same speed (p1++ and p2++) O(n1+n2)
    Two Pointers at same speed (p1++ and p2++) O(n1 + n2)
    Two Pointers at same speed (p1++ and p2++) O(n1+n2)
    Two Pointers (Fixed-width Sliding Window, p++ and O(nm) worst-case
    Two Pointers (Fixed-width Sliding Window, p++ and O(n)
    Two Pointers (Fixed-width Sliding Window, p++ and O(n)
    Two Pointers (Fixed-width Sliding Window, p++ and O(n)
    Two Pointers (Fixed-width Sliding Window, p++ and O(n logn)
    Two Pointers (p1++ or p2++) O(n1+n2)
    Two Pointers (p1++ or p2++) O(n1+n2)
    Head Recursion Linked List
    Two Pointer Technique Linked List
    Head Recursion Array Jagged
    Head Recursion Linked List
    Head Recursion Linked List
    Head Recursion Linked List
    Recursion (Merge Sort) Linked List
    Recursion Linked List
    Recursion Linked List
    Two Pointer Technique Linked List
    Two Pointer Technique Linked List
    Two Pointer Technique Linked List
    Prefix Max
    Prefix Sum
    Prefix Sum
    Multiple Recursion Binary Tree
    Multiple Recursion N-ary Tree
    Multiple Recursion Binary Tree
    Multiple Recursion Binary Tree
    Multiple Recursion Binary Tree
    Multiple Recursion Binary Tree
    BFS
    BFS
    BFS
    BFS
    BFS
    BFS

    You might also like