BASIC JAVA

Introduction to java
Complete history of java
C vs Java vs Python
Setting up the environment
MODULE - 1 JDK in java
How JVM works - JVM architecture
OVERVIEW OF Difference between JDK , JRE & JVM
JAVA Just In Time Compiler
Difference between JIT & JVM
Diff between byte & machine code
how Java is Platform Independent ?
CONTEST - 1 ( MODULE : 1 )

Basic syntax
MODULE - 2 Hello World program
BASICS OF Variables
JAVA Data types
Primitive Vs Object data type
Rules of identifier
How to get input from user
Scanner class
[Link] class
MODULE - 3
Dif between Scanner & BufferReader
INPUT / Ways to read input from console
OUTPUT Dif between print() & println()
Formated output using printf()
Compile time & Run time initialization
CONTEST - 2 ( MODULE : 2 & 3 )

Arithmetic operator
Relational operator
MODULE - 4 Assignment operator
OPERATORS Logical operator
Unary operator
Ternary operator
Bitwise operator ( Detailed in DSA )
if statement
if-else statement
MODULE - 5 else if ladder
switch statement
 BASIC JAVA
nested if - else statement
DECISION while loop
MAKING OR do-while loop
FLOW for loop
CONTROL
break , continue , return
keywords in java
STATEMENTS
CONTEST - 3 ( MODULE : 4 & 5 )

Introduction to function
Types of function
MODULE - 6 Types of user defined function
FUNCTIONS & Introduction to recursion
RECURSION Basic problems on functions and
recursion
CONTEST - 4 ( MODULE : 6 )

Introduction to Arrays
Ways to Declare & Initialize 1 d Array
MODULE - 7 Ways to Declare & Initialize 2-d Array
ARRAYS Passing Arrays to function
Problems on Arrays
CONTEST - 5 ( MODULE : 7 )

Introduction to characters
Character class & methods
Introduction to strings
MODULE - 8 String class and methods
CHARACTER & [Link] class
STRINGS
Why java strings are immutable?
StringBuffer class with examples
String Builder class with examples
String vs StringBuilder vs StringBuffer
CONTEST - 6 ( MODULE : 8 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
 CORE JAVA
Object oriented Programming (OOPs)
Why Java is not a purely Object-
Oriented Language?
Classes and Objects
Naming Conventions
Methods
Access Modifiers
MODULE - 1 Consructors
OOPS
Four Main Object Oriented
Programming Concepts
Inheritance
Abstraction
Encapsulation
Polymorphism
Interfaces
'this' reference
Understanding Classes and Objects
MODULE - 2 Singleton Method Design Pattern
CLASSES Object Class
Inner Class
Throwable Class with Example
Inheritance and Constructors
MODULE - 3 Java and Multiple Inheritance
INHERITANCE Interfaces and Inheritance
Association, Composition,Aggregation
abstract keyword
MODULE - 4 Abstract Class
ABSTRACTION Dif between Abtstract Class & Interface
Control Abstraction in Java
Dif between Data Hiding & Abstraction
ENCAPSULATION Difference between Abstraction and
Encapsulation with Examples
Difference between Inheritance and
MODULE - 5
Polymorphism
Dynamic Method Dispatch or Runtime
POLYMORPHISM Polyporphism
Difference between Compile-time and
Run-time Polymorphism
CONTEST - 1 ( MODULE : 1 To 5)
 CORE JAVA
Static Methods vs Instance Methods
MODULE - 6
Abstract Method with Examples
Overriding
METHODS Method Overloading
Difference between Method
Overloading and Method Overriding
Copy Constructor
MODULE - 7 Constructor Overloading
CONSTRUCTOR Constructor Chaining with Examples
Private Constructors & Singleton Classes
CONTEST - 2 ( MODULE : 6 & 7 )

Collections in Java
Collections Class
List Interface
MODULE - 8 ArrayList
Stack Class
COLLECTIONS LinkedList
Queue Interface
PriorityQueue
HashMap
HashSet
CONTEST - 3 ( MODULE : 8 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
 ADVANCE JAVA
Need of Wrapper Classes
Different Ways to Create the Instances
of Wrapper Classes
Character Class
[Link] Class
[Link] Class
MODULE - 1 [Link] Class
WRAPPER
[Link] Class
[Link] Class
CLASS
[Link] Class
[Link] Class
Autoboxing and Unboxing
Type Conversion with Examples
CONTEST - 1 ( MODULE : 1 )

Differences between Interface and Class

Functional Interfaces
Nested Interface
MODULE - 2 Marker Interface
INTERFACES Comparator Interface with Eamples
CONTEST - 2 ( MODULE : 2 )

Java Keywords
Important Keywords in Java
Super Keyword
final Keyword
MODULE - 3
static Keyword
KEYWORDS enum
transient Keyword
volatile Keyword
final, finally and finalize
Public vs Protected vs Package vs
MODULE - 4 Private Access Modifier
ACCESS Access and Non-Access Modifier
MODIFIER
CONTEST - 3 ( MODULE : 3 & 4 )

Packages in Java
MODULE - 5 How to create a Package in Java?
PACKAGES [Link] Package
[Link] Package
[Link] Package
 ADVANCE JAVA
Java Memory Management
How Java objects stored in memory?
Stack vs Heap Memory Allocation
MODULE - 6 Types of memory areas
Garbage Collection
MEMORY
Types of JVM Garbage Collectors
ALLOCATION
Memory leaks
Java Virtual Machine(JVM) Stack Area
CONTEST - 4 ( MODULE : 5 & 6 )

Exceptions in Java
Types of Exception
Checked vs Unchecked Exceptions
MODULE - 7 Try Catch Block
Flow Control in Try Catch Finally
EXCEPTION
throw and throws
HANDLING User-defined custom Exception
Null Pointer Exception
Exception Handling Method Overriding
CONTEST - 5 ( MODULE : 7 )

Multithreading in Java
Lifecycle and States of a thread
Java Thread Priority in Multithreading
Main thread
[Link] Class
MODULE - 8 Runnable Interface
Naming & fetching thread
MULTI What does start() function do in
THREADING multithreading?
Dif between [Link]()&[Link]()
[Link]() Method
CONTEST - 6 ( MODULE : 8 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
BASIC PYTHON
Introduction to Python
The Complete History of Python
Why Python?
C vs Java vs Python
MODULE - 1 Applications of Python
Career Opertunities
OVERVIEW OF Setting up the environment in Python
PYTHON Python Interpreter
Compiler Vs Interpreter
How Python is platform independent?
Case-Sensitive Language
CONTEST - 1 ( MODULE : 1 )

Why Python is syntax free language?

Hello World Program
MODULE - 2
Variables
BASICS OF Data Types
PYTHON Primitive Data type vs Non-Primitive
Identifiers
How to take Input from User ?
"input()" Function
types of "input()" Function
MODULE - 3 Ways to read input from console
INPUT / OUTPUT Diff between print() & print with end
Formatted Output using print()
Compile Time & Run Time Intilaization
CONTEST - 2 ( MODULE : 2 & 3 )

Arithmetic Operators with Examples

Relational Operators with Examples
MODULE - 4 Assignment Operators with Examples
OPERATORS Logical Operators with Examples
Unary Operator with Examples
Ternary Operator with Examples
Bitwise Operators with Examples
if statement
if-else statement
MODULE - 5
else if ladder
switch statement
nested if - else statement
while loop
BASIC PYTHON
DECISION
do-while loop
for loop
MAKING OR
break , continue , pass
FLOW CONTROL exit()
STATEMENTS
CONTEST - 3 ( MODULE : 4 & 5 )

Introduction to Function
Types of Function
MODULE - 6 Built-in Functions
FUNCTIONS & User-defined Functions
RECURSION Lambda Functions
Recursive Functions
CONTEST - 4 ( MODULE : 6 )

Introduction to String
String Methods and Functions
MODULE - 7 String Slicing
Why Python Strings are Immutable?
CHARACTER & Why Java Strings are immutable?
STRINGS String Manipulation and Formatting
Problems on String

CONTEST - 5 ( MODULE : 7 )

Introduction to Python Data Structures

MODULE - 8 Introduction to List
PYTHON LIST List Operations and Methods
Nested Lists
Problems on List
Introduction to Tuples
MODULE - 9 Tuple Operations and Methods
TUPLES Nested Tuples
Problems on Tuples
CONTEST - 6 ( MODULE : 8 & 9 )

Introduction to Set
MODULE - 10
Set Operation
SET IN PYTHON Set Methods
Problems on set
BASIC PYTHON
Introduction to Dictionaries
Dictionary Key Value Mutability
MODULE - 11 Dictionary Operations and Methods
DICTIONARIES Nested Dictionaries
Problems on Dictionaries
CONTEST - 7 ( MODULE : 10 & 11 )

Study Materials to Final Contest

prepare
1-1 Mock Interview Certification of
With Expert Completion
[Link] Days Required To Complete : 7 days or 42 hrs
 CORE PYTHON
Introduction to (OOP) Concept
Why Python is not a purely Object-
Oriented Language?
Classes and Objects
Naming Conventions
Methods
Access Modifiers
MODULE - 1 Constructors
OOPS
Four Main Object-Oriented
Programming Concepts
Inheritance
Abstraction
Encapsulation
Polymorphism
Interfaces
"self" reference
Understanding Classes and Objects
MODULE - 2 Singleton Method Design Pattern
CLASSES Object Class (if referring to the base
object class in Python)
Inner Class
Inheritance and Constructors in Python
MODULE - 3 Multiple Inheritance
INHERITANCE Interfaces and Inheritance
Association, Composition & Aggregation
abstract keyword in Python
MODULE - 4 Abstract Class in Python
ABSTRACTION Diff between Abstract Class & Interface
Control Abstraction in Python
Diff between Data Hiding & Abstraction
ENCAPSULATION Encapsulation in Python & Principles
Encapsulation vs. Data Hiding in Python
Difference between Inheritance and
MODULE - 5
Polymorphism in Python
Dynamic Method Dispatch or Runtime
POLYMORPHISM Polymorphism
Difference between Compile-time and
Run-time Polymorphism
CONTEST - 1 ( MODULE : 1 To 5)
 CORE PYTHON
Static Methods vs Instance Methods
MODULE - 6
Abstract Method with Examples
Overriding
METHODS Method Overloading
Difference between Method
Overloading and Method Overriding
Copy Constructor
MODULE - 7 Constructor Overloading
CONSTRUCTOR Constructor Chaining with Examples
Private Constructors & Singleton Classes
CONTEST - 2 ( MODULE : 6 & 7 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion

[Link]
Days Required To Complete : 7 days or 42 hrs
ADVANCE PYTHON
Need of Wrapper Classes in Python
Different Ways to Create Instances of
Wrapper Classe
MODULE - 1 "str" Class
WRAPPER "int" Class
CLASS "float" Class
"bool" Class
Autoboxing and Unboxing in Python
Type Conversion with Examples
CONTEST - 1 ( MODULE : 1 )

Differences between Interface and Class

Functional Interfaces
MODULE - 2
Nested Interface
Marker Interface
INTERFACES Comparator Interface with Eamples
CONTEST - 2 ( MODULE : 2 )

Python Keywords
Important Keywords in Python
"Super" Keyword
"final" Keyword
MODULE - 3 "staticmethod" and "classmethod"
KEYWORDS Keywords
enum
"transient" Keyword
"volatile" Keyword
final, finally and finalize

MODULE - 4
Public vs Protected vs Package vs
Private Access Modifier
ACCESS Access and Non-Access Modifier
MODIFIER CONTEST - 3 ( MODULE : 3 & 4 )

Packages in Python
MODULE - 5 How to create a Package in Python?
PACKAGES "math" Module
"random" Module
ADVANCE PYTHON
Python Memory Management
How Python objects stored in memory?
Stack vs Heap Memory Allocation
MODULE - 6 Memory Areas allocated by interpreter
Garbage Collection
MEMORY
Types of Python Garbage Collectors
ALLOCATION
Memory leaks & how to avoid them
Virtual Machine (PVM) Stack Area
CONTEST - 4 ( MODULE : 5 & 6 )

Exceptions in Python
Types of Exception
Checked vs Unchecked Exceptions
MODULE - 7 Try Except Block
Flow Control in Try Except Finally
EXCEPTION
"raise" and "except" in Python
HANDLING User-defined Custom Exceptions
"NoneType" Error
CONTEST - 5 ( MODULE : 7 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
 DSA BEGINNER
Sum Of Natural Numbers-1
Count Digits -With Input Destruction
Sum Of digits -With Input Destruction
Reverse The Number -W.I Destruction
Number Palindrome -W.I Destruction
Count Digits -W.I Destruction
Reverse The Number -W.I Destruction
Armstrong Number
Print All Divisors
MODULE - 1
Prime Number
Perfect Number
GETTING Factorial
STARTED / Fibonacci Series
BASIC MATHS Rotate a Number
Sum Of Natural Numbers-2
Number Palindrome - W.I Destruction
Count All Divisors
Prime Numbers in Range
Perfect Number in GFG
Perfect Number in LeetCode
Sum Palindrome
Is Sum of Digit Palindrome?
CONTEST - 1 ( MODULE : 1 )

Hourglass Star Pattern

Diagonally Expanding V shape Star
Pattern
Arrow Pattern
Various Symmetrical Star Patterns
Z & M & W Pattern
Diamond Border Pattern
MODULE - 2 Hourglass With Sand Flow
PATTERNS Divotional Symbol
Basic Number & Character Pattern
Fibonacci Pattern
Diagonally Expanding V shape Number
Pattern
Number Aligned with Diamond Shape
GFG Pattern-1
GFG Pattern-2
CONTEST - 2 ( MODULE : 2 )
 DSA BEGINNER
Character into Strings
Delete Character at odd Index
Counting Different Types Of Charcters
String Palindrome
Make It PascalCase
Extract Integer from String
MODULE - 3 Fascinating Number
Reversing Vowels
CHARACTER & Reciprocal of the String
STRINGS Converting the First Letter as
UpperCase
Check Equality
Split Strings
Is String Binary?
Remove Vowels
Counting CamelCase
CONTEST - 3 ( MODULE : 3 )

Find the Maximum and Minimum

Element
Print alternate Elements in an array
Find the Sum of All Elements
Find the Second Largest Element
Check if Array is Sorted
Print Leftover Elements
Finding value equal to their index
position
MODULE - 4
Matrix Addition
Matrix Subraction
ARRAYS Matrix Transpose
Print Specific element in an array
Multiplying all elements in an array
Sum of Elements in a Matrix
Print Diagonals of a Matrix
Finding the median of array
Sum of odd and even numbers in an
array

CONTEST - 4 ( MODULE : 4 )
 DSA BEGINNER
Function’s Introduction
Type’s of Function
Recursion Introduction
Print ‘N’ To 1
MODULE - 5 Print 1 To ‘N’
FUNCTIONS Find Factorial
AND
Find n-th Fibonacci Number
Find Sum of Digit
RECURSION
Implement Power Function
Check Palindrome
Find K-th Symbol
Find Magic Number
CONTEST - 5 ( MODULE : 5 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 10 days or 60 hrs
 DSA BEGINNER
Sum Of Natural Numbers-1
Count Digits -With Input Destruction
Sum Of digits -With Input Destruction
Reverse The Number -W.I Destruction
Number Palindrome -W.I Destruction
Count Digits -W.I Destruction
Reverse The Number -W.I Destruction
Armstrong Number
Print All Divisors
MODULE - 1
Prime Number
Perfect Number
GETTING Factorial
STARTED / Fibonacci Series
BASIC MATHS Rotate a Number
Sum Of Natural Numbers-2
Number Palindrome - W.I Destruction
Count All Divisors
Prime Numbers in Range
Perfect Number in GFG
Perfect Number in LeetCode
Sum Palindrome
Is Sum of Digit Palindrome?
CONTEST - 1 ( MODULE : 1 )

Hourglass Star Pattern

Diagonally Expanding V shape Star
Pattern
Arrow Pattern
Various Symmetrical Star Patterns
Z & M & W Pattern
Diamond Border Pattern
MODULE - 2 Hourglass With Sand Flow
PATTERNS Divotional Symbol
Basic Number & Character Pattern
Fibonacci Pattern
Diagonally Expanding V shape Number
Pattern
Number Aligned with Diamond Shape
GFG Pattern-1
GFG Pattern-2
CONTEST - 2 ( MODULE : 2 )
 DSA BEGINNER
Character into Strings
Delete Character at odd Index
Counting Different Types Of Charcters
String Palindrome
Make It PascalCase
Extract Integer from String
MODULE - 3 Fascinating Number
Reversing Vowels
CHARACTER & Reciprocal of the String
STRINGS Converting the First Letter as
UpperCase
Check Equality
Split Strings
Is String Binary?
Remove Vowels
Counting CamelCase
CONTEST - 3 ( MODULE : 3 )

Find the Maximum and Minimum

Element
Print alternate Elements in an array
Find the Sum of All Elements
Find the Second Largest Element
Check if Array is Sorted
Print Leftover Elements
Finding value equal to their index
position
MODULE - 4
Matrix Addition
Matrix Subraction
ARRAYS Matrix Transpose
Print Specific element in an array
Multiplying all elements in an array
Sum of Elements in a Matrix
Print Diagonals of a Matrix
Finding the median of array
Sum of odd and even numbers in an
array

CONTEST - 4 ( MODULE : 4 )
 DSA BEGINNER
Function’s Introduction
Type’s of Function
Recursion Introduction
Print ‘N’ To 1
MODULE - 5 Print 1 To ‘N’
FUNCTIONS Find Factorial
AND
Find n-th Fibonacci Number
Find Sum of Digit
RECURSION
Implement Power Function
Check Palindrome
Find K-th Symbol
Find Magic Number
CONTEST - 5 ( MODULE : 5 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 10 days or 60 hrs
DSA INTERMEDIATE
Introduction of Time & Space
Complexity
Finding No Of Iteration With Basic
Maths Properties
Finding No Of Iteration With Log Basics
Finding No Of Iteration With Nested
MODULE - 1
Loops
TIME & SPACE Arithmetic Progression
COMPLEXITY Geometric Progresssion
Comparing Algorithms
Big O | Asymptotic Analysis of
Algorithms
Space Complexity
Important Product Based MCQ's
Solving
MODULE - 2 Count All Divisors
OPTIMIZED Prime Number
PROBLEM SOLVING
Perfect Number
Print All Divisors
Array Reverse-c
Array Palindrome-c
Array rotation-c
MODULE - 3 Vertical Bar Chart-c
NUMBER
MODULE - 3
Sum Of Two Array-c
SYSTEM plus one-c
INTRODUCTION Find Median-c
TO ARRAY Find Second Largest Element-1-c
Find Second Largest Element-2-c
Sum Of Array-c
Max & Min of Array-c
Linear Search-c
Array Reverse in Range-c
Difference of Two Array-c
Introduction To Prefix-Sum Technique-c
Range-Sum Query-c
MODULE - 4 In-Place Prefix Sum-c
ARRAY-PREFIX Pivot Index-c
SUM Pick From Both The sides-c
Even Numbers in Range-c
Product Array Except Itself-c
DSA INTERMEDIATE
Heighest Altitude
Find the Middle Index
MODULE - 5 Leaders In An Array-c
ARRAY-CARRY
A Special Subsequence 'AG'-c
Bulb Problem-c
FORWARD
Best Time To Buy & Sell Stocks-1-c
Closet Min-Max Subarray-c
Amazing Subarrays-c
Even SubArrays(Even-Length Subarrays
with Even Ends)-c
MODULE - 6 Print All the Subarray-c
Maximum Subarrays Sum-c
SUB ARRAYS Counting Subarrays Sum < B-c
Maximum Subarrays Sum < B
Good Sub-Arrays(Special Subarrays
Finder)-c
sum of all subarray-c
SubArray With Given Sum & Length-c
MODULE - 7
Minimum Swaps-c
SLIDING K SIze SubArray With Least Average-c
WINDOW Minimum Swaps to Require Bring All 1's
Together-c
Col Sum-c
Row Sum-c
Matrix Multiplication-c
Main Diagonal Sum-c
Minor Diagonal Sum-c
Main & Minor Diagonal Sum-c
Anti Diagonals-c
MODULE - 8 Transpose Of Any Matrix-c
2D ARRAY Transpose Of Square Matrix-c
Rotate Matrix by 90 degree-c
Row To Column Zero-c
Wave Traversal-c
Spiral Traversal-c
Matrix Addition-c
Matrix Subtraction-c
Upper & Lower Bound Sum-c
DSA INTERMEDIATE
Sum of Even Index Elements-c
MODULE - 9 Balance Array-c
INTERVIEW Majority Element(N/2 Repeat)
PROBLEMS Majority Element(N/3 Repeat)
ON ARRAY &
Exit Point Of Matrix-c
Saddle Point
2D ARRAY
CONTEST - 1 ( MODULE : 1 To 9 )

Introduction To Number System

Decimal To Anybase-1
Anybase To Decimal-1
MODULE - 10 Anybase To Decimal-2
NUMBER Anybase Addition
SYSTEM Anybase Suubtraction
Anybase Multiplication
Decimal To Anybase-2
AnyBase To Anybase
Introduction to Bitwise Operators
Single Number
Xor Sum
Interesting Arrays
Subarrays with Bitwise OR
Check Bit
MODULE - 11
Set Bit
Set/Unset the rightmost unset bit
BIT Unset ith Bit
MANIPULATION - 1 Number of 1 bits
Toggle ith bit
Help From Sam
Finding Good Days
Find Nth Magic Number
Reverse Bits
Unset x Bits from right
Swap two numbers
Introduction To Modulas
Properties of Modulas
MODULE - 12 Modular Operations
Divisibility Rules
MODULAR
Power With Modulas
ARITHMATIC Mod Array
INTRODUCTION Divisibility by 3
Divisibility by 4
DSA INTERMEDIATE
Divisibility by 9
is Leap Year
Concatenate 3 Numbers
Introduction To Sorting
MODULE - 13 Min Cost To Remove All Elements
Nobal Integer-1
INBUILD Nobal Integer-2
SORTING & Introduction To Comparators
COMPARATORS Factors Sort
& CUSTOM Tens Digit Sorting
SORTING Largest Number
Sort By Color
Is Arithmatic Progression?
Length Of Longest Consecutive 1's
MODULE - 14
Count Increasing Triplets
Josephus Problem
INTERVIEW Multiple Left Rotation Of The Array
PROBLEMS Wave Array
B Closest Points To Orgin
MODULE - 15 Longest Palindromic Substring
STRING
Longest Common Prefix
Add Binary Strings
Frequency Of Element Query
First Repeating Elements
Change Character
Check Anagrams
Subarray With 0 Sum
Subarray with Given Sum
MODULE - 16 Common Elements
Subarray sum Equal to K
HASHING | Distinct Numbers in Window
HASHMAP | Check Pair Sum
HASHSET Count Pair Sum
Longest Subarray Zero sum
Pairs With given Xor
Is Dictionary?
Shaggy & Distance
Sort Array In Given Order
Longest Substring Without Repeat
Count Subarrays
DSA INTERMEDIATE
Count Distinct Elements
Count Subarray 0 sum
Pair With Given Difference
Subsequence Of String
Subset
Key Pad Combination
MODULE - 17 Staircase Paths
Generate Grid Paths
RESCURSION Permutation Of String
AND Encodings Of String
BACKTRACKING Generate All Parenthesis
Tower Of Honoi
Flood Fill Algorithm
Rat In Maze
N-Queens
CONTEST - 2 ( MODULE : 10 To 17 )

Bubble Sort
Selection Sort
Insertion Sort
MODULE - 18 Partition an Array
SORTING
quick Sort
Count Sort
Radix Sort
Merge Sort [will cover in Advanced
Module]
CONTEST - 3 ( MODULE : 18 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion

[Link] Days Required To Complete : 14 days or 84 hrs

 DSA ADVANCE
Max Sum Contiguous Subarray
MODULE - 1 Begger Outside Temple
Rain Water Trapped
1D ARRAY Add One To Number
Flip
MODULE - 2 Count All Divisors
2D ARRAY
Prime Number
Perfect Number
Print All Divisors
Merge Intervals
MODULE - 3 Merge Overlapping Intervals
INTERVIEW First Missing Positive Integer
PROBLEMS Next Permutation
Number Of Digit One
Single Number-1
Single Number-2
MODULE - 4
Single Number-3
Find Two Missing Numbers
BIT Maximum And Pair
MANIPULATION - II Strange Equality
Subarray OR
Min Xor Value
Sum Of Xor Of All Pairs
Pair Sum Divisible by M
MODULE - 5 Greatest Common Divisor | GCD
Delete One
MATHS - I A,B and Modulo
MODULAR Mod Sum
ARITHMETIC & GCD Largest Coprime Divisor
Divisor Game
Sorted Permutation Rank
MODULE - 6
Excel Column Title
Pascal Triangle
MATHS - II Compute nCr % m
COMBINATORICS Sorted Permutation Rank With
BASIC Repeates
Excel Column Number
Consecutive Number Sum
 DSA ADVANCE
MODULE - 7
Find All Primes
Count Of Divisors
MATHS - III Prime Sum
SEIVE OF Lucky Numbers
ERATOSTHENES Prime Factorization
Factorial Array
Merge Two Sorted Arrays
MODULE - 8 Merge Sort
Count Inversions
MERGE SORT Unique Elements
Max Sum To Make Sorted
Minimum Absolute Difference
Binary Search
Sorted Insert Position
MODULE - 9 Find Peak Element
Find Floor & Ceil | Search in a Range
BINARY SEARCH - I Single Element in Sorted Array
Matrix Search
Max Height Of Staircase
Minimum Difference
Square Root Of Integer
MODULE - 10 Rotated Sorted Array Search
Median Of An Array
BINARY Ath Magical Number
SERACH - II Add Or Not
Find Smallest Again
Matrix Median
MODULE - 11 Painter Partitions Problem
Agressive Cows
BINARY
Allocate Books
SERACH - III Special Integer
Pairs With Given Sum
Pairs With Given Difference
Subarray With Given Sum
MODULE - 12 Container With Most Water
TWO 3 Sum
POINTERS
Closet Pair From Sorted Arrays
Another Count Rectangle
Max Continuous Series Of 1's
Array 3 Pointer
 DSA ADVANCE
CONTEST - 1 ( MODULE : 1 To 12)

Linked List
Implementation(Print,Insert,Delete,Size)
Reverse Linked List-1
MODULE - 13 Reverse Linked List-2
LINKED LIST - I K reverse Linked List
Remove Nth Node From List End
Remove Duplicates From Sorted List
Longest Palindromic List
Middle Element Of Linked List
MODULE - 14 Remove Loop From Linked List
LINKED LIST - II Merge Two Sorted Linked List
SORTING & Sort Linked List
DETECTING LOOP
Swap List Nodes in Pairs
Add Two Numbers as Lists
Reorder List
MODULE - 15 Copy List
LRU Cache
LINKED LIST - III Partition List
DOUBLY Flattern a Linked List
LINKED LIST Intersection of Linked List
Implementation of Stack
Passing Game
MODULE - 16
Valid Pranthesis
Double Character Trouble
STACK - I Redundant Braces
Ckeck Two Bracket Expression
Min Stack
MODULE - 17 Infix to Prefix Evaluation & Expression
STACK II Infix to Postfix Evaluation & Expression
EXPRESSION Prefix to Infix Evaluation & Expression
EVALUATION &
Prefix to Postfix Evaluation & Expression
Postfix to Infix Evaluation & Expression
CONVERSION
Postfix to Prefix Evaluation & Expression
Next Greater on The Left
MODULE - 18 Next Smaller On The Right
NEXT
Max & Min
Largest Rectangle In Histogram
GREATER /
Max Rectangle in Binary Matrix
 DSA ADVANCE
SMALLER Next Greater On The Right
ELEMENT Next Smaller on The Left
Sort Stack Using Another Stack
Introduction To Queue
MODULE - 19 Queue Using Stack
Perfect Numbers
QUEUE Parking Ice Cream Truck
Reversing Elements Of Queue
Unique Letter
N Integers Containing Only 1 & 2 & 3
Pre Order Traversal
In Order Traversal
MODULE - 20 Post Order Traverssal
TREE - I
Height of the Binary Tree
Nodes Count
STRUCTURED &
Sum Of Nodes Of Binary Tree
TRAVERSAL
Sum Of Left Leaves
Binary Tree From Inorder & Postorder
Binary Tree From Preorder & Postorder
Level Order Traversal
Right View Of The Binary Tree
MODULE - 21 Vertical Order Traversal
TREE - II Top View Of Binary Tree
VIEWS & TYPES
Serialize Binary Tree
Deserialize Binary Tree
Zig-Zag Level Order Traversal
Balanced Binary Tree
Left View Of The Binary Tree
Search In BST
Delete a Node in BST
MODULE - 22 Sorted Array To Balanced BST
Valid BST
TREE III BST Check for BST With One Child
BST Nodes in Range
Two Sum BST
MODULE - 23 Kth Smallest Element in BST
TREE IV - LCA Morris Inorder Traversal
MORRIES INORDER Recover BST
TRAVERSAL Common Nodes In BST
Distance Between Nodes Of BST
DSA ADVANCE
Invert The Binary Tree
Identical Binary Tree
MODULE - 24 Equal Tree Partition
INTERVIEW Next Pointer Binary Tree
PROBLEMS ON Path Sum
TREE Sum Binary Tree Or Not
Diameter Of Binary Tree
CONTEST - 2 ( MODULE : 13 To 24 )

Introduction To Min Heap/Max Heap

MODULE - 25 Connect Ropes
HEAP - I Merge K Sorted List
INTODUCTION
Mish & Candies
Max Array Sum After B Negations
Minimum Largest Element
Build Own Heap
K Places Apart
MODULE - 26
Ath Largest Element
Kth Smallest Element in Sorted Matrix
HEAP - II Rnunning Median
Product Of 3
Ways To Form Max Heap
Flipcart Challenge
MODULE - 27
Finish Maximum Job
Distribute Candy
GREEDY Another Coin Problem
Assign Mice To Holes
Seats
Introduction To Graph
Types of Graph
Storing Graph
DFS
MODULE - 28 Paths in Directed Graph
GRAPH - I Cycle in Directed Graph
DFS & CYCLE Cycle in Undirected Graph
DETECTION
No Of Island
Capture Regions On Board
Black Shapes
First Depth First Search
Maximum Depth
 DSA ADVANCE
BFS
Topological Sort
MODULE - 29
Disjoint Set Union
Possibility of Finishing
GRAPH - II Shortest Distance in Maze
BFS & Another BFS
TOPOLOGICAL Knite On Chess Board
SORT Valid Path
Largest Distance Between Nodes of
Tree
Introduction To MST
MODULE - 30 Dijkstra
GRAPH - III Commutable Island
MST & DIGKSTRA Construction Cost
ALGO
Damaged Road
Edge In MST
Fibonacci
Stairs
MODULE - 31 Climb Stairs With Variable Jumps
DYNAMIC Minimum Number Of Squares
PROGRAMMING - I Max Sum Without Adjacent Elements
Max Product Subarray
Maximum Sum Value
Ways To Decode
Unique Paths in Grid
MODULE - 32 Dungeon & Princes
Min Sum Path in Matrix
DYNAMIC Min Sum Path in Triangle
PROGRAMMING - II N digit Number
Unique BST
Intersecting Chords in Circle
Fractional Kanpsack
MODULE - 33 0-1 Knapsack-1
DYNAMIC Unbounded Knapsack
PROGRAMMING - III Flip Array
(KNAPSACK) Buying Candies
Thusar's Birthday Party
Ways To Send The Signal
 DSA ADVANCE
MODULE - 34 Cutting a rod
DYNAMIC
Coin Sum Infinite
Distinct Subsequence
PROGRAMMING - IV
Length of Longest Fibonacci
(APPLICATION OF Subsequence
KNAPSACK) Let's Party
0-1 Knapsack-2
Check for subset with sum K
MODULE - 35 Min Jumps Required to reach arr[n-1]
INTERVIEW No of A digit numbers wiith sum=B
PROBLEMS
Max Profit Possible from Stock
CONTEST - 3 ( MODULE : 25 To 35 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link] Days Required To Complete : 28 days or 168 hrs
 DSA CORE
Array vs Linked list
MODULE - 1 Types of linked list
LINKED LIST Linked List - Implementation &
Applications
Problems on Linked List

Stack Model
Array implementation of Stack
Linked list implementation of Stack
MODULE - 2 Applications of Stack
STACK Infix, Prefix and Postfix expressions
Infix to Postfix conversion
Expression Evaluation
Balancing Parenthesis
Problems on Stack

Queue Model
MODULE - 3 Array implementation of Queue
QUEUE Linked list implementation of Queue
Priority Queue - implementation and
Applications of Queue
CONTEST - 1 ( MODULE : 1 To 3)

Binary Tree
Binary Search Tree
BST implementation
MODULE - 4 BST Insertion
TREE BST Deletion
Tree Traversal
Inorder, Preorder, Postorder, Level order
traversal
Problems on Tree
 DSA CORE
Weighted Graph
Unweighted Graph
Directed graph
MODULE - 5 Undirected graph
Adjacency matrix and list
GRAPH implementation
Graph Traversal
Breadth First Search & Depth First
Search
Problems on graph

Direct Address Table

Hash function
Collision resolution techniques
MODULE - 6 Linear Probing
HASHING Quadratic probing
Double hashing
Problems on Hahsing
CONTEST - 2 ( MODULE : 4 To 6)

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
 DBMS & SQL
MODULE - 1
What is Database?
Why are we studying it?
INTRO TO Types of Databases
DBMS Introduction to RDBMS
Introduction to Keys
Super Key
Candidate Key
MODULE - 2 Primary Key
KEYS Composite Key
Foreign Key
CONTEST - 1 ( MODULE : 1 & 2 )

CRUD Operations
Create
MODULE - 3 Read (Distinct, Where)
CRUD-1 Order By
AND, OR, NOT
IN Operator
Like
Is Null
MODULE - 4 Limit, Offset
CRUD-2 Update
Delete
Delete vs Truncate vs Drop
CONTEST - 2 ( MODULE : 3 & 4 )

Self Joins
MODULE - 5 Left Join
JOINS & Right Join
UNIONS
Cross Join
Natural Join
Implicit Join
Unions
CONTEST - 3 ( MODULE : 5 )

MODULE - 6 Aggregate Queries

AGGREGATE Group By
QUERIES Having
 DBMS & SQL
IN
Where
From
MODULE - 7 All, Any
Corelated Subqueries
SUBQUERIES
Exists
& VIEWS
Views
CONTEST - 4 ( MODULE : 6 & 7 )

How Indexes Work?

MODULE - 8 Cons of Indexes
INDEXING Indexes on Multiple Columns
Index on Strings
ACID Properties
Commit & Rollback
Isolation Levels
MODULE - 9 Read Uncommited
TRANSACTION Read Commited
Repeatable Reads
Serializable
CONTEST - 5 ( MODULE : 8 & 9 )

What is Schema Design?

How to approach Schema Design?
Cardinality
MODULE - 10 Sparse Relations
SCHEMA
Numbers when representing Relations
Complete JTM's Schema
DESIGN
Try Netflix's Schema
CONTEST - 6 ( MODULE : 10 )

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
 HTML & CSS
History of HTML
What you need to do to get going and
MODULE - 1
make your first HTML page
What are HTML Tags and Attribute
INTRO TO HTML Tag vs Element
HTML HTML Attributes
How to differentiate HTML Document
Version
FORMATTING Basic Tags
TAGS
Formatting Tags
Color Coding
GROUPING Div & Span Tags for Grouping
Unordered List
HTML-LIST Ordered List
Definition List
IMAGE Image & Image Mapping
URL URL-Uniform Resource Locator
URL Encoding
<table>
<th>
<tr>
<td>
MODULE - 2
<caption>
TABLE <thead>
<tbody>
<tfoot>
<colgroup>
<col>
<row-span>
<col-span>
<input>
<textarea>
FORM <button>
<select>
<lable>
CONTEST - 1 ( MODULE : 1 & 2 )
 HTML & CSS
Benefits of CSS
MODULE - 3
CSS Versions & History
CSS Syntax
INTRO TO External Style Sheet Using <link>
CSS Multiple Style Sheet
Value Length & Percentage
ID Selectors
Class Selectors
SELECTORS Grouping Selector
Universal Selector
Child Selector
Attribute Selector
background image
COLOR
background repeat
BACKGROUND background position
CURSOR CSS Cursor
color
background-color
text-decoration
text-align
vertical-align
MODULE - 4 text-indent
CSS text-transform
TEXT-FONTS white-space
letter-space
word-spacing
line-height
font-family
font-size
font-style
font-variant
font-weight
CONTEST - 3 ( MODULE : 3 & 4 )

MODULE - 5
list-style-type
list-style-position
LISTS TABLES list-style-image
list-style
 HTML & CSS
border
width & height
CSS TABLES text-align
vertical-align
padding
color
Border & Outline
BOX MODEL Margin & Padding
Height & Width
CSS dimentions
CSS Visibility
CSS Display
CSS Scrollbars
DISPLAY
Static Positioning
POSITIONING Fixed Positioning
Relative Positioning
Absolute Positioning
CSS Layers With Z-Index

float property
CSS
clear property
TEXT-FONTS The Clearfix Hack
CONTEST - 4 ( MODULE : 5 )

Creating Portfolio and Hoisting Into Github

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 7 days or 42 hrs
 JAVASCRIPT
History and Evolution of JavaScript
JavaScript in the Browser vs. Server
([Link])
JavaScript Syntax and Basic Structure
MODULE - 1 Variables and Data Types
INTRO TO Operators and Expressions
JAVASCRIPT
Control Flow (Conditionals and Loops)
Functions: Declaration, Expression,
Arrow Functions
Introduction to ES6 Features (let, const,
template literals, etc.)
MODULE - 2 Execution Context
Global vs. Local Execution Context
CODE
Variable Hoisting
EXECUTION & Function Hoisting
HOISTING The Call Stack and Event Loop
Understanding Scope in JavaScript
MODULE - 3
Lexical vs. Dynamic Scoping
LEXICAL Scope Chain and Closures
SCOPE Block-level Scoping (let, const)
Global, Local, and Block Scope
What are Closures?
CLOSURES Creating Closures in JavaScript
Real-world Use Cases for Closures
Memory Management with Closures
First-class Functions in JavaScript
Higher-order Functions
MODULE - 4 Pure Functions
FUNCTIONAL Immutability and Side Effects
PROGRAM Function Composition
Recursion
CONTEST - 1 ( MODULE : 1 To 4 )

MODULE - 5 Understanding Asynchronous

ASYN- JavaScript
CHRONOUS
Callback Functions
Callback Hell and How to Avoid It
CALLBACKS
Error Handling with Callbacks
 JAVASCRIPT
What are Promises?
MODULE - 6
States of a Promise (Pending, Fulfilled,
Rejected)
PROMISES Creating and Consuming Promises
Chaining Promises
Handling Errors with Promises
Understanding Async/Await Syntax
MODULE - 7
Converting Promises to Async/Await
Error Handling with Try/Catch in
ASYNC/AWAIT Async/Await
Sequential vs. Parallel Execution with
Async/Await
CONTEST - 2 ( MODULE : 5 To 7 )

What is the DOM?

DOM Tree Structure
MODULE - 8 Selecting Elements (getElementById,
INTRO TO
querySelector, etc.)
Manipulating DOM Elements (add,
DOM
remove, update)
Working with Attributes and Properties
DOM Events and Event Listeners
Understanding Events in JavaScript
MODULE - 9 Adding and Removing Event Listeners
EVENTS IN
Event Object and Event Properties
JAVASCRIPT
Event Delegation
Preventing Default Behavior
Stopping Event Propagation
Event Bubbling vs. Event Capturing
Understanding Event Propagation
Phases
MODULE - 10 Practical Examples of Event
Propagation
EVENT Machine Coding Challenges
PROPAGATION (Implementing Common UI
Components)
Applying Event Propagation Concepts
in Machine Coding
 JAVASCRIPT
What is Debouncing?
Implementing Debounce in JavaScript
Use Cases for Debouncing (e.g., Search
MODULE - 11 Input)
DEBOUNCING What is Throttling?
& THROTTLING Implementing Throttle in JavaScript
Use Cases for Throttling (e.g., Scroll
Events)
CONTEST - 3 ( MODULE : 8 To 11 )

Understanding the this Keyword

MODULE - 12
this in Global Context vs. Function
THE “this” Context
KEYWORD this in Arrow Functions
this in Object Methods
Binding this with Call, Apply, Bind
Differences between call, apply, and
bind
Use Cases for call, apply, and bind
Creating Polyfills for call, apply, and bind
MODULE - 13 Practical Examples and Applications
POLYFILLS
17. Polyfills of Higher-Order Methods
Introduction to Higher-Order Array
Methods (map, filter, reduce)
Creating Polyfills for map, filter, reduce,
forEach
Understanding the Internals of Each
Method
CONTEST - 4 ( MODULE : 12 & 13 )

Creating Realtime Weather App

Study Materials to Final Contest

prepare

1-1 Mock Interview Certification of

With Expert Completion
[Link]
Days Required To Complete : 14 days or 84 hrs