ALPHA INTRODUCTION

Prerequisite class 1

Path to Placement class 2

What will you learn class 3

1 What are Flowcharts

2 Flowchart Components

3 Sum of 2 Numbers

4 Calculate Simple Interest

5 Max of 3 Numbers

6 Find if a Number is Prime or not

1 Creating A Java File

2 Boilerplate Code

3 Output In Java

4 Print A Pattern

5 Variables In Java

6 Data Types In Java

7 Sun Of a & b

8 COMMENTS IN JAVA

9 Input In Java

10 Sum Of a&b (Input From User)

11 PRODUCTS OF A & B

12 Area Of Circle

14 Type Casting

15 Type Promotion Expression

2 Types of Operators

3 Arithmetic Operators

5 Relational Operators

2 If Else

3 Print The Largest Of 2 Numbers

4 Print If Number Is Odd Or Even

5 Else If

6 Income Tax Calculator

8 Ternary Operators

9 Check If A Student Is Pass Or Fail

10 Switch Statement

2 Loops Basics

4 Print Number From 1 To 10

5 Print Number From 1 to n

6 Sum Of First n Natural Numbers

7 For Loops

8 Print Square Pattern

9 Print Reverse Of A Number

10 Reverse The Given Number

11 Do While Loop

12 Break Statement

13 Question - Break Statement

15 Question - Continue Keyword

2 Print Star Pattern

3 Print Inverted Star Pattern.mp4

4 Print Half-Pyramid Pattern

5 Print Character Pattern

6 Special Note

1 Hollow Rectangle Pattern

2 Dry run- How Rectangle Pattern

3 Inverted And Rotated Half Pyramid

4 Inverted Half Pyramid Pattern with Numbers

5 Floyd's Triangle Pattern

6 (0-1) Triangle Pattern

7 Butterfly Patter

8 Solid Rhombus Pattern

9 Hollow Rhombus Pattern

10 Diamond Patter

3 Introduction To Function

4 Syntax-Function Code Demo

5 Syntax With Parameters

6 Parameters vs Arguments

7 What Happens In Memory

8 Call By Value

9 Product Of a & b_

11 Find Binomial Coefficent

12 Inbuilt vs User Defined Methods

13 Function Overloading

14 Overloading Using Parameters

15 Overloading Using Data Types - Copy

16 Check If Number Is Prime Or Not

17 Check Prime (Optmised)

18 Prime In Range

19 Binary To Decimal

20 Code - Binary To Decimal

21 Decimal To Binary

22 Code - Decimal To Binary

1 Introduction

2 Arrays-Creation

4 Arrays as Function Argument

5 Linear Search

6 Largest in array

8 Binary Search Code

9 Reverse In Array

10 Pairs In Array

11 Print Sub-Array

12 Max-Subarray Sum - I (Brute Force)

13 Max-Subarray Sum - II (Prifix Sum)

14 Max-Subarray Sum - III (Kadane's Algorithm)

15 Trapping Rainwater

16 Trapping Rainwater - Code

2. What Is Sorting

3. Bubble Sort

4. Bubble Sort Code

5. Selection Sort

6. Selection Sort Code

7. Insertion Sort

8. Insertion Sort Code

9. Counting Sort

2. Introduction To 2D Arrays

3. Real Life Examples

4. Representation Of 2D Arrays

5. Creation Of 2D Arrays

6. 2D Array In Memory

7. Spiral Matrix

8. Spiral Matrix Code

9. Diagonal Sum

10. Search In Sorted Matrix

2. What are Strings

3. InputOutput

4. String Length

5 String Concatenation

6. String char At Method

7. Check If String Is Palindrome

8. Question - Shortest Path

9. String Function - Compare

10.String Function - Substring

11.Print Largest String

12. Why Strings Are Immutable

13. String Builder

14. Convert Letters To Uppercase

1. Introduction To Bit Manipulation

2. Binary Number System

3. Bitwise Operators

4. Binary AND

5. Binary OR

6. Binary XOR

7.. Binary 1's Complement

8. Binary Left Shift

9 - Binary Right Shift

10 - Check If Odd Or Even

11 - Get ith Bit

12 - Set ith Bit

13 - Clear ith Bit

14 - Update ith Bit

15 - Clear Last i Bits

16 -Clear Range Of Bits

17 - Check If A Number Is Power Of 2 Or Not

18. Count Set Bits In Number

19. Fast Exponetiation

1. Classes & Objects

2. Access Modifiers

3. Getters & Setters

4. Encapsulation

5. Constructors

6. Type of Constructors

7. Copy Constructor

8. Copy Constructor

9. Destructors

10. Inheritance

11. Single level Inheritance

12

13 Hierarchial Inheritance

14

15. Polymorphism

16

17. Method Overriding

18

19

20

21

22

23

1.What is Recursion

2.Print numbers in decreasing order

3.Stack overflow video

4. Print numbers in increasing order

5. Find Factorial of N video

6. Print sum of N natural numbers

7.Print Nth Fibonacci number

8.Check if array is sorted or not

9.First Occurrence

10. Last Occurrence

11. Print x to the power n

12. Print x to the power n (Optimized)

13. Tiling Problem

14. Tiling Problem Code

15. Remove Duplicates in a String

16. Friends Pairing Problem

17. Binary Strings Problem

18. Binary Strings Problem Code

1.What is Divide & Conquer

2 Merge sort (basic + space Optimized)

3. Merge Sort Code

4. Quick Sort

5. Quick Sort Code

6. Worst Case in Quick Sort

7. Sorted & Rotated Array Search

4.Big O Notation

10.Nested Loop 2 Analysis

11.Nested Loop 3 Analysis video

12.Bubble Sort Analysis video

1 Introduction

2 Types of Backtracking

3 Backtracking on Arrays

4 Find Subsets

5 Find Subsets Code

6 Find Permutations

7 Find Permutations Code

8 N Queens - all ways

9 N Queens - Time Complexity

10 N Queens - count ways

11 N Queens - print one solution

12 Grid Ways

13 Grid Ways Code

14 Grid Ways Trick

15 Sudoku

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

Part 2

1 Detecting Cycle in LL

2 Detecting Cycle Code

3 Removing Cycle in LL

4 Removing Cycle Code

5 Removing Cycle Explanation (Math)

6 Java Collections Framework

7 LL in Collections Framework

8 Merge Sort on LL

9 Merge Sort on LL (Code)

10 Zig Zag Linked List

11 Zig Zag LL Code

12 Doubly LL

13 Reverse a Doubly LL

1

2

3

4

5

6

7

8

9

1

2

3

4

5

6

7

8

9

1

2

3

4

5

6

7

8

9

10

11

1.Introduction to Binary Trees

5 Build Tree Preorder Code

6 Preorder Traversal

8Postorder Traversal

9 Level order Traversal

10 Height of a Tree

11 Count Nodes of a Tree

13 Diameter of a Tree (Approach1)

Part 2

1 Diameter of a Tree (Approach1)

2 Diameter of a Tree (Approach2)

3 Subtree of another tree

4 Subtree of another tree Code

5 Top View of a Tree (Basics)

6 Top View of a Tree (Approach)

7 Top View of a Tree (Code)

Part 3

1 Kth Level video

2 Lowest Common Ancestor (Approach1)

3 Lowest Common Ancestor (Approach2)

4Minimum Distance between 2 Nodes

5Kth ancestor of Node

1 Introduction_1

2 Concept of Search in BST

3 Build a BST

4 Search in a BST

5 Delete a Node

6 Print in range

7 Root to Leaf Path

8 Validate BST

1

2

3

4

5

1 Introduction to Priority Queues

2 PQ in JCF

3 PQ for Objects

4 Introduction to Heaps

5 Heap Implementation (using CBT)

6 Insert in Heap

7 Peek From Heap

8 Remove from Heap

9 Heap Sort

10 Nearby Cars

11 Connect N Ropes with Minimum Cost

12 Weakest Soldier

1

2

3

4

5

6

7

8

9

10a Tree map

10b Comparison Table

11

12

13

14

15

17

18

19

1 Tries Introduction

2

3

4

5

6

1

2

3

4

5

6

7

8

6 Extra Read

1

2

3

4