Scribd
Upload
11 views4 pages

Programming Fundamentals and Challenges

The document outlines a two-week programming curriculum focusing on fundamental concepts and problem-solving techniques. It includes daily topics such as input/output, arrays, strings, searching, sorting, recursion, and dynamic programming, with specific exercises for each day. The second week progresses to intermediate-level problems, including backtracking and mock contests to apply learned skills.

Uploaded by

Megha Baitha
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
11 views4 pages

Programming Fundamentals and Challenges

The document outlines a two-week programming curriculum focusing on fundamental concepts and problem-solving techniques. It includes daily topics such as input/output, arrays, strings, searching, sorting, recursion, and dynamic programming, with specific exercises for each day. The second week progresses to intermediate-level problems, including backtracking and mock contests to apply learned skills.

Uploaded by

Megha Baitha
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

Week 1: Fundamentals and Problem-Solving

Day 1: Input/Output and Loops


1. Print a pattern:
o Input: 5
o Output:
markdown
Copy code
*
**
***
****
*****
2. Sum of integers:
o Given N, find the sum of all integers from 1 to N.
3. Find whether a number is even or odd.

Day 2: Arrays (Basics)


1. Find the largest and smallest number in an array.
2. Count the frequency of each element in an array.
3. Reverse an array.

Day 3: Strings (Basics)


1. Check if a string is a palindrome.
2. Count the vowels and consonants in a string.
3. Find the first non-repeating character in a string.

Day 4: Searching and Sorting


1. Implement linear search for a number in an array.
2. Sort an array using Bubble Sort.
3. Use [Link]() to sort an array and find the median.

Day 5: Recursion
1. Find the factorial of a number using recursion.
2. Print the Fibonacci sequence up to N terms using recursion.
3. Check if a string is a palindrome using recursion.

Day 6: Hashing (Maps and Sets)


1. Find the frequency of elements in an array using HashMap.
2. Check if two strings are anagrams using HashMap.
3. Find the first repeating element in an array.

Day 7: Practice Mix


1. Rotate an array by K positions.
2. Check if a given number is a prime number.
3. Find the GCD (Greatest Common Divisor) of two numbers.

Week 2: Intermediate-Level Problems


Day 8: Sliding Window/Two Pointers
1. Find the maximum sum of a subarray of size K (sliding window).
2. Check if a string has all unique characters (two pointers).
3. Find the pair in an array that sums up to a target.

Day 9: Dynamic Programming (Easy)


1. Climbing Stairs: Find the number of ways to climb N stairs if you can take
1 or 2 steps at a time.
2. Coin Change Problem: Minimum coins needed to make a sum X.
3. Longest Increasing Subsequence.

Day 10: Backtracking


1. Solve the N-Queens problem for a 4x4 board.
2. Print all subsets of a given set.
3. Word Search in a 2D grid.

Day 11: More Arrays


1. Merge two sorted arrays without using extra space.
2. Find the intersection of two arrays.
3. Find the subarray with the given sum.

Day 12: Strings and Hashing


1. Longest substring without repeating characters.
2. Count substrings with equal numbers of 0s and 1s.
3. Group anagrams together using HashMap.

Day 13: Practice Mix


1. Find the maximum product of two numbers in an array.
2. Implement binary search on a sorted array.
3. Find the longest palindrome in a string.

Day 14: Mock Contest


1. Solve 3 problems within 2 hours from any competitive programming
platform like LeetCode or Codeforces.
o Easy: Sum of digits in a number.
o Medium: Subarray sum divisible by K.
o Medium: Find the missing number in an array of size N-1 (1 to N).

You might also like