Category: DSA

Array Problems

Problem 1: Remove Duplicates from Sorted Array Explanation: Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Approach: Time & Space Complexity: Java Implementation: Example: Input: Output: Edge Cases Considered: Problem 2: Maximum Subarray Explanation: Given an integer array nums, find the contiguous subarray (containing at least…

Searching Problems

Problem 1: Search Insert Position Explanation: Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be inserted in order. Approach: Time & Space Complexity: Java Implementation: Example: Input: Output: Edge Cases Considered: Problem 2: Binary Search Explanation: Given a sorted array of integers and a target value, return the index of the…

Sorting Problems

Problem 1: Sort Array By Parity Explanation: Given an integer array nums, we need to rearrange the elements so that all even numbers appear before all odd numbers. The order among even or odd numbers does not matter. Approach: Time & Space Complexity: Java Implementation: Example: Input: Output: (or any other valid order where even numbers come first) Edge Cases Considered: Problem 2: Squares of a Sorted Array Explanation: Given…

DSA

1️⃣ Sorting & Searching Problems 2️⃣ Array & Matrix Problems 3️⃣ Linked List Problems 4️⃣ String Problems 5️⃣ Tree & Graph Problems 6️⃣ Dynamic Programming Problems 7️⃣ Stack & Queue Problems 8️⃣ Miscellaneous Problems