0% found this document useful (0 votes)
41 views2 pagesArray Mastery: 5-Day Challenge
The document outlines a five-day training program focused on various array operations and problems. Each day is dedicated to specific topics, including basic array operations, math-based problems, searching techniques, sorting algorithms, and subarray challenges. The content covers essential algorithms and techniques for manipulating and analyzing arrays.
Uploaded by
moghana1025Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views2 pagesArray Mastery: 5-Day Challenge
The document outlines a five-day training program focused on various array operations and problems. Each day is dedicated to specific topics, including basic array operations, math-based problems, searching techniques, sorting algorithms, and subarray challenges. The content covers essential algorithms and techniques for manipulating and analyzing arrays.
Uploaded by
moghana1025Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
/ 2
Day 1: Basic Array Operations
1. Reverse an Array.
2. Find the Maximum and Minimum in an Array.
3. Find the Second Largest Element.
4. Find the Occurrence of an Element.
5. Rotate an Array by K Positions (Clockwise).
6. Rotate an Array by K Positions (Anti-clockwise).
7. Sort an Array (Ascending and Descending).
8. Remove Duplicates from a Sorted Array.
9. Check if an Array is Sorted.
10. Find the Sum of all Elements in an Array.
Day 2: Math-based Array Problems
1. Find the Missing Number in an Array (1 to N).
2. Find Duplicates in an Array (Brute Force + Optimize with Hashing).
3. Count Pairs with a Given Sum.
4. Find the Subarray with a Given Sum (Sliding Window).
5. Kadane's Algorithm (Maximum Subarray Sum).
6. Find Equilibrium Index in an Array.
7. Product of Array Except Self (Without Division).
8. Count Inversions in an Array.
9. Find Leaders in an Array.
10. Find Triplets with a Given Sum.
Day 3: Searching and Frequency Problems
1. Linear Search in an Array.
2. Binary Search (Iterative and Recursive).
3. First and Last Occurrence of an Element (Binary Search-based).
4. Count the Frequency of Each Element in an Array.
5. Find Majority Element (> N/2 Times).
6. Find Elements Occurring More than N/K Times.
7. Find All Distinct Elements in an Array.
8. Intersection of Two Arrays.
9. Union of Two Arrays.
10. Find the Median of Two Sorted Arrays.
Day 4: Sorting and Rearrangement Problems
1. Bubble Sort (Dry Run Manually First).
2. Insertion Sort.
3. Selection Sort.
4. Move All Zeros to the End.
5. Rearrange Array in Alternate Positive and Negative.
6. Sort an Array of 0s, 1s, and 2s (Dutch National Flag Problem).
7. Merge Two Sorted Arrays Without Extra Space.
8. Find Kth Smallest and Kth Largest Element.
9. Segregate Even and Odd Numbers in an Array.
10. Sort an Array by Frequency of Elements.
Day 5: Subarrays and Sliding Window Problems
1. Find All Subarrays with a Given Sum.
2. Maximum Sum Subarray of Size K.
3. Smallest Subarray with a Sum Greater than X.
4. Count Subarrays with a Given XOR.
5. Longest Subarray with Equal 0s and 1s.
6. Longest Subarray with Sum Divisible by K.
7. Find the Length of the Smallest Missing Positive Number.
8. Subarray Sum Equals K.
9. Find Subarrays with a Product Less than K.
10. Count Number of Nice Subarrays.