Flowcharts

Pseudocode

Introduction

How it works?

Setup Installation

Input and Output in Java

Conditionals & Loops in Java

if-else

loops

Switch Statements

Data-Types

Coding best practices

Introduction

Scoping in Java

Shadowing

Variable Length Arguments

Overloading

Introduction

Memory Management

Input and Output

ArrayList Introduction

Searching

Sorting

Insertion Sort

Selection Sort

Bubble Sort

Count Sort

Radix Sort

Cyclic Sort

Sliding Window

Two Pointer

Subarray Questions

Introduction

How Strings work?

Comparison of Methods

Operations in Strings

StringBuilder in Java

Introduction

Complete Bitwise Operators

Prime Numbers

HCF / LCM

Sieve of Eratosthenes

Newton's Square Root Method

Number Theory

Euclidean Algorithm

Advanced Concepts for CP

Bitwise + DP

Extended Euclidean algorithm

Modulo Properties

Modulo Multiplicative Inverse

Linear Diophantine Equations

Fermat’s Theorem

Wilson's Theorem

Lucas Theorem

Chinese Remainder Theorem

Introduction

Why recursion?

Flow of recursive programs - stacks

Convert recursion to iteration

Tree building of function calls

Tail recursion

Sorting:

Merge Sort

Quick Sort

Backtracking

Soduku Solver

N-Queens

N-Knights

Maze problems

Recursion String Problems

Recursion Array Problems

Recursion Pattern Problems

Subset Questions

Introduction

Comparisons of various cases

Solving Linear Recurrence Relations

Solving Divide and Conquer Recurrence Relations

Big-O, Big-Omega, Big-Theta Notations

Best and easiest approach to get equation of any relation

Complexity discussion of all the problems

Space Complexity

Memory Allocation of various languages

NP-Completeness and Hardness

Classes & its instances

'this' keyword in Java

Properties

Inheritance

Abstraction

Polymorphism

Encapsulation

Overloading & Overriding

Static & Non-Static

Access Control

Interfaces

Abstract Classes

Singleton Class

final, finalize, finally

Object Class

Generics

Exception Handling

Collections Framework

Lambda Expressions

Enums

Fast IO

Introduction

Interview problems

Push efficient

Pop efficient

Queue using Stack and Vice versa

Circular Queue

Introduction

Fast and slow pointer

Cycle Detection

Single and Doubly LinkedList

Reversal of LinkedList

Introduction

Recursion + Recursion DP + Iteration + Iteration Space Optimized

Complexity Analysis

0/1 Knapsack

Subset Questions

Unbounded Knapsack

Subsequence questions

String DP

Introduction

Binary Trees

Binary Search Trees

DFS

BFS

AVL trees

Segment Tree

Fenwick Tree / Binary Indexed Tree

Introduction

Theory

Priority Queue

Two Heaps Method

k-way merge

Top k elements

Interval problems

Introduction

Theory - how it works

Comparisons of various forms

Limitations and how to solve

Map using LinkedList

Map using Hash

Chaining

Probing

Huffman-Encoder

Introduction

BFS

DFS

Working with graph components

Minimum Spanning Trees

Kruskal Algorithm

Prims Algorithm

Dijkstra’s shortest path algorithm

Topological Sort

Bellman ford

A* pathfinding Algorithm