Day Wise Syllabus
Day Wise Syllabus
Session 1,2 :
Q 1. sum of two integer
Q 2. Relation between integer and string
Q 3. sum and message
—type coercion.
—Greet the User
Q 4. Accept and print the answer
Q 5. Swap two variables via 3 methods
—Operators and their questions
— Arithmetic - ‘+ , - , * , % , /’
—Relational operator - ‘> , < , ≥ , ≤ , ≠’
—logical operator - ‘&& , ||’
—Unary operator - ‘++, —’
Math functions
—-Math.round()
—-Math.ceil()
—-Math.floor()
—-Math trunc() // remove the decimal part
—-Math.pow()
—-Math.sqrt()
—-Math.cbrt()
—-Math.abs()
—-Math.max()
->Math problems :
Q 6. calculate compound interest
Q 7. Generate OTP
Q 8. Area of triangle by heron’s formula
Q 9. Circumference of circle
Session 3,4 :
→ IF-ELSE :
Q 10.Accept two numbers and print the greatest between them
Q 11.Accept an integer and check whether it is an even number or odd.
Q 12.Accept name and age from the user. Check if the user is a valid voter or not.
Q 13. Accept three numbers and print the greatest among them
Q 14. Accept a year and check if it a leap year or not (google to find out what's a
leap year)
Q 15. Shop discount - Description on Graphic
Q 16. Bijli Bill - Description on Graphic
Session 5,6,7 :
—Loop
—For loop
Q 27.sum of digit
Q 28.reverse of number
Q 29.strong number
Q 30.Automorphic number
—Switch Case
—do-while
Session 7:
—Nested Looping
—Pattern programming
Q 36.
1
12
123
1234
12345
Q 37.
A
AB
ABC
ABCD
ABCDE
Q 41.
* *
* *
* *
**
*
Q 42.
* *
* *
*
* *
* *
Session 8 , 9:
— Array
— Introduction
— Q 50. Linear Search an array - If element found print the index else -1
— Binary Search
Session 10:
—Sorting algorithm → Bubble sort , Insertion sort , selection sort
—Complexity
—Time Complexity
—Handling for large input
—Complexity Representation
—Space Complexity
—Questions
Session 11 , 12:
—Multi D-Array
—Questions
Session 13 , 14:
—Introduction of String
—methods of string
— Q 55. Accept a string from user and print its each character on a new line
— Q 56. Accept a string and print it in reverse order
— Q 57. Pallindromic String using Two pointer algorithm (hint: Array reverse algo)
— Q 58. Toggle each alphabet of String
In - AcgDfD Output - aCGdFd
— Q 59. Take an array of strings words and a String Prefix. Print the number of
strings
in words that contain pref as a prefix.
Example - Input: words = ["pay","attention","practice","attend"], pref = "at"
Output: 2
-- Q 60. Capitalize first & last character of each word
in the sentence and print the new sentence
Ex - Hello bhai Kaise ho a
HellO BhaI KaisE HO A
Q 61.- Accept a string and print the frequency of each character
present in the string
— Q 62. Check Two Strings are Anagram or Not
Anagrams words have the same word length & same character count
Examples of anagram words are arc and car, state and taste,
night and thing etc.
Session 16,17:
—Set
— Q 63.Jewels and Stones
—Map
Session 18:
—Bitwise operator
—Q 70.Swap two integers without using third variable
Session 19:
—Introduction on Recursion
Session 20,21,22:
—Q 73.Print hello n times
—Q 74.Print natural number 1-n / n-1
—Q 75.Factorial / Sum
—Q 76.Fibonacci series
—Maths
—Q 77.GCD
—Q 78.1979.Find the greatest Common divisor
—Q 82. 50.Pow(x,n)
Session 26,27:
—Sorting algorithm → Merge Sort , quick sort , cyclic sort
—Problem on question
Session 28,29,30:
—Binary Search
Session 31,32:
—Advance problem on Hashing
--Q 106. 349. Intersection of Two Arrays
--Q 107. 560. Subarray Sum Equals K - BQ -> 3,9,-2,4,1,-7,2,6,-5,8,-3,-7,6,2,1 k =5
--Q 108. Longest Sub-Array with Sum K
https://practice.geeksforgeeks.org/problems/longest-sub-array-with-sum-
k0809/1/
--Q 109. 525. Contiguous Array
--Q 110. 128. Longest Consecutive Sequence
--Q 111. Count distinct elements in every window
https://practice.geeksforgeeks.org/problems/count-distinct-elements-in-every-
window/1/
Session 33,34:
—class and object
—constructor
—prototype object
—design problems
—Q 112. Q 113. Q 114. Q 115.
Session 35,36,37:
—Introduction on Linkedlist
—Operation on LL
Session 38,39,40:
—Implementation of Queue
https://practice.geeksforgeeks.org/problems/queue-reversal/1/
--Q 123. 20. Valid Parentheses
--Q 124. 232. Implement Queue using Stacks
--Q 125. 225. Implement Stack using Queues
--Q 126. Next Larger Element
https://practice.geeksforgeeks.org/problems/next-larger-element-1587115620/1/
--Q 127. Stock Span Problem
https://practice.geeksforgeeks.org/problems/stock-span-problem-1587115621/1
Session 41,42,43,44:
—Advance recursion and backtracking
--Q 130. Tower of Hanoi
--Q 131. Josephus Problem
--Q 132. 1823. Find the Winner of the Circular Game
--Q 133. Power Set
https://practice.geeksforgeeks.org/problems/power-set4302/1
--Q 134. 78. Subsets
--Q 135. 46. Permutations
--Q 136. 90. Subsets II
--Q 137. 17. Letter Combinations of a Phone Number
--Q 138. 39. Combination Sum
Session 45,46,47,48:
—Introduction of Binary tree
—Implementation
https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1
--Q 153. Top View
https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1
--Q 154. 236. Lowest Common Ancestor of a Binary Tree
--Q 155. 437. Path Sum III
--Q 156. 105. Construct Binary Tree from Preorder and Inorder Traversal