Scribd
Upload
8 views3 pages

Week 1

The document outlines a week-long training schedule focusing on data structures and algorithms, divided into five days with specific topics. Each day covers various levels of difficulty for problems related to arrays, strings, searching and sorting, quantitative aptitude, and mock problem-solving. The problems range from easy to hard, including tasks like finding maximum subarray sums, checking for anagrams, and calculating profit and loss percentages.

Uploaded by

Vansh negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views3 pages

Week 1

The document outlines a week-long training schedule focusing on data structures and algorithms, divided into five days with specific topics. Each day covers various levels of difficulty for problems related to arrays, strings, searching and sorting, quantitative aptitude, and mock problem-solving. The problems range from easy to hard, including tasks like finding maximum subarray sums, checking for anagrams, and calculating profit and loss percentages.

Uploaded by

Vansh negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

WEEK 1

Day 1: Arrays

1. Easy:

o Find the maximum subarray sum (Kadane’s Algorithm).

o Find the second largest and second smallest elements in an array./ kth largest
element in an array.

o Rotate an array by k positions (Cyclic Rotation).

2. Medium:

o Find the missing number in an array of size n with numbers 1 to n.

o Find the majority element in an array (appears more than n/2 times).

o Rearrange the array in alternating positive and negative elements.

3. Hard:

o Find the number of subarrays with a given XOR.

o Merge two sorted arrays without using extra space.

o Find the longest consecutive subsequence in an array.

Day 2: Strings

1. Easy:

o Check if two strings are anagrams of each other.

o Reverse words in a given string (e.g., "I love coding" → "coding love I").

o Remove all duplicates from a string.

2. Medium:

o Longest Palindromic Substring.

o Count the occurrences of a substring in a string.

o Check if a string is a valid palindrome (ignoring spaces and special characters).

3. Hard:

o Implement wildcard pattern matching (? and * as wildcards).

o Minimum insertions to make a string palindrome.

o Find the longest common subsequence between two strings.


Day 3: Searching and Sorting

1. Easy:

o Binary Search: Find the first occurrence of a number in a sorted array.

o Find the square root of a number using binary search.

o Sort an array of 0s, 1s, and 2s without using extra space (Dutch National Flag
Problem).

2. Medium:

o Count inversions in an array (using merge sort).

o Find the median of two sorted arrays.

o Search in a rotated sorted array.

3. Hard:

o Find the smallest window in an array that must be sorted to make the entire array
sorted.

o Find all pairs in an array whose sum is equal to k (using sorting and two-pointer
approach).

o Find the kth smallest/largest element in an array.

Day 4: Quantitative Aptitude Basics

1. Number System:

o Find the LCM and GCD of two numbers.

o Count the number of trailing zeros in a factorial of a number.

o Check if a number is prime.

2. Percentages and Ratios:

o Calculate profit and loss percentage.

o Solve problems on mixtures and alligations.

o Find the ratio of two numbers when their product and sum are given.

3. Miscellaneous:

o Solve a quadratic equation.

o Find the sum of the digits of a number raised to a power.

Day 5: Mock Problem Solving

Solve a mixed bag of 8-10 questions from the topics above, such as:
1. Find the longest palindromic substring (Strings).

2. Sort an array of 0s, 1s, and 2s (Arrays).

3. Check if two strings are anagrams (Strings).

4. Count inversions in an array (Sorting).

5. Rotate an array by k positions (Arrays).

6. Search in a rotated sorted array (Searching).

7. Calculate profit and loss percentage (Aptitude).

8. Find the kth smallest/largest element (Sorting).

You might also like