Data Structure

• Arrays
  • Array Data Structure
  • Array Memory Representation
  • Array Operations and Time Complexity
  • Advantages and Disadvantages of Arrays
  • Arrays in C
  • Vector in C++ STL
  • Arrays and ArrayList in Java
  • JavaScript Arrays
  • Binary Search on Arrays
  • Two Pointers Technique
  • Prefix Sum Technique
  • Sliding Window Technique
  • Basics of Hashing for Arrays
  • Traverse an Array
  • Find the Sum of All Elements in an Array
  • Find the Maximum Element in an Array
  • Find the Minimum Element in an Array
  • Count Even and Odd Numbers in an Array
  • Search an Element in an Array (Linear Search)
  • Copy One Array into Another
  • Reverse an Array
  • Print Alternate Elements of an Array
  • Find the Length of an Array
  • Check if an Array is Sorted
  • Find the First Element of an Array
  • Find the Last Element of an Array
  • Count the Number of Positive and Negative Elements in an Array
  • Replace All Elements with Zero in an Array
  • Sum of Elements at Even Indices
  • Sum of Elements at Odd Indices
  • Find the Average of Array Elements
  • Print Array Elements in Reverse Order
  • Count the Number of Zeros in an Array
  • Remove Duplicate Elements from an Array
  • Move All Zeros to the End of an Array
  • Rotate an Array by K Positions
  • Rotate an Array by One Position
  • Check if Two Arrays Are Equal
  • Merge Two Sorted Arrays
  • Find Missing Number in an Array
  • Find Duplicate Elements in an Array
  • Count Frequency of Each Element
  • Find the Majority Element in an Array
  • Find All Unique Elements in an Array
  • Insert an Element at a Given Position in an Array
  • Delete an Element from a Given Position in an Array
  • Find the Index of an Element in an Array
  • Find Union of Two Arrays
  • Find Intersection of Two Arrays
  • Sort an Array of 0s and 1s
  • Find the Largest Sum Contiguous Subarray (Kadane’s Algorithm – Intro)
  • Kadane’s Algorithm (Maximum Subarray Sum)
  • Two Sum Problem
  • Subarray with Given Sum
  • Longest Subarray with Sum K
  • Rearrange Array Alternately (Max–Min)
  • Leaders in an Array
  • Equilibrium Index of an Array
  • Stock Buy and Sell (Single Transaction)
  • Stock Buy and Sell (Multiple Transactions)
  • Sort an Array of 0s, 1s, and 2s
  • Find the Majority Element (Moore’s Voting Algorithm)
  • Find All Pairs with Given Sum
  • Longest Consecutive Sequence
  • Product of Array Except Self
  • Maximum Product Subarray
  • Find the First Missing Positive Integer
  • Count Inversions in an Array
  • Rearrange Array by Sign (Positive and Negative)
  • Check if Array Can Be Divided into Equal Sum Subarrays
  • Trapping Rain Water
  • Maximum Circular Subarray Sum
  • Find Minimum in Rotated Sorted Array
  • Search in Rotated Sorted Array
  • Median of Two Sorted Arrays
  • Merge Intervals
  • Count Reverse Pairs
  • Longest Subarray with Equal 0s and 1s
  • Largest Rectangle in Histogram
  • Maximum Sum Rectangle in 2D Matrix
  • Subarray Sum Equals K
  • Count Distinct Elements in Every Window
  • Sliding Window Maximum
  • Find K Maximum Elements
  • Minimum Number of Jumps to Reach End
  • Chocolate Distribution Problem
  • Find All Triplets With Zero Sum (3Sum)
  • Kth Smallest Element in an Array
  • Maximum Length Bitonic Subarray
  • Smallest Subarray with Sum Greater Than X
  • Maximum Sum Submatrix
  • Count Subarrays with XOR Equal to K
  • Longest Arithmetic Subarray
  • Find the Median in a Stream of Integers
  • Split Array Largest Sum
  • Minimum Cost to Make Array Equal
  • Maximum Product of Three Numbers
  • Longest Subarray with At Most K Distinct Elements
  • Subarray with Maximum Bitwise AND
  • Find All Subarrays with Equal Sum
  • Partition Array into K Equal Sum Subsets
  • Maximum Absolute Difference of Subarrays
  • Smallest Missing Number in Sorted Array
  • Find Repeating and Missing Numbers
  • Maximum Length Subarray with Given GCD
  • Count Subarrays with Product Less Than K
  • Kth Largest Element in a Stream
  • Minimum Operations to Make Array Alternating
  • Find Lexicographically Smallest Array After Operations
  • Find the Second Smallest Element in an Array
  • Find the Second Largest Element in an Array
• Linked List
  • Introduction to Linked List
  • Length of a Singly Linked List
  • Remove Every K-th Node in a Linked List
  • Middle of a Linked List
  • Count Occurrences in a Linked List
  • Circular Linked List Traversal
  • Check if a Linked List is Circular
  • Count Nodes in a Circular Linked List
  • Deletion from a Circular Linked List
  • Singly to Circular Linked List Conversion
  • Exchange First and Last Nodes in a Circular Linked List
  • Deletion in a Doubly Linked List
  • Print a Singly Linked List
  • Search in a Singly Linked List
  • Linked List Insertion in a Singly Linked List
  • Deleting a Given Key from a Singly Linked List
  • Deleting a Node at a Given Position in a Singly Linked List
  • Delete Entire Linked List in Data Structures
  • Nth Node from Start
  • Nth Node from End
  • Size of Doubly Linked List
  • Reverse a Singly Linked List
  • Reverse a Doubly Linked List
  • Insert at Beginning of Doubly Linked List
  • Insert at End of Doubly Linked List
  • Delete First Node of Linked List
  • Check if Linked List is Empty
  • Copy a Linked List
  • Swap Nodes in Pairs
  • Detect Loop in a Linked List
  • Length of Loop in Linked List
  • Design Browser History
• String
  • Reverse a String