Number System, Remainder theorem, Unit Digit

Arithmetic progression, Geometric progression

Finding factors of a number, Shortcuts for finding prime number, Concept of HCF, Problem Solving on HCF, Concept of LCM, Problem Solving on LCM

Order complexity analysis, Theoretical complexity analysis, Time complexity analysis of searching and recursive algorithms, Theoretical space complexity, Space complexity analysis of merge sort

Introduction to Averages, Assumed average approach, Standard Situation in Averages, Concept of Weighted Averages, Standard Situations involving weighted average

Introduction to allegations, Standard problems involving using allegations

Concept of percentages, Concept of percentage change, Percentage Change Graphic, PCG applied to Product change, PCG Applied to Product Constancy, Product Constancy Table, The fractional view to the product constancy table, PCG applied to successive percentage change

Concept of Ratios, Multiplier logic,Concept of proportion, Variation and its types

Basic concept of Profit and loss, Concept of Simple Interest,Concept of Compound Interest

Introduction to Time and Work, Time and work(Man Days), Men, Women and Children

Basics of Probability, Problems on Coins, Problems Based on Dice, Problems Based on Cards, Problems Based on Balls from the Box, Word Based problems on Probability

Introduction to Permutation and Combination, The selection Formula, Distribution of Identical Objects, Formula for Arrangements, Circular arrangement

Introduction to Time, Speed, Distance, The proportionalities in equations, Solving problems on TSD

The concept of Relative Speed, Questions based on Relative Speed

Concept of Circular Motion, Train problems, Boats and Stream problems, Races and Games

Recognising alphabetical patterns, Recognising numerical patterns, Coding Decoding Question Patterns

Introduction to Syllogisms, Problems on Syllogisms

Solving problems on Blood Relations, Concept of Calendar, Problems on Calendar

Reading effectively reading comprehension, How to find main idea, Solving reading comprehension

Theory of Fill Ups/ sentence completion, Questions on sentence completion

Introduction to English, Vocab-Root Words, Synonyms and Antonyms

Introduction to Data interpretation, Problems on Data interpretation

Reading Pie charts, Reading Bar Charts, Reading tables and X-Y Charts, Problems on Charts

Introduction to Set Theory, Problems on Set theory

Introduction to logs, Problems on logs

Cubes and Cuboids, Spheres and Cylinders, Cones, Prisms and Pyramids

Order complexity analysis, Theoretical complexity analysis, Time complexity analysis of searching and recursive algorithms, Theoretical space complexity, Space complexity analysis of merge sort

Introduction to Arrays, How arrays are stored in memory, Arrays & Functions

Introduction to strings, storage of strings and their inbuilt functions

2D arrays, Storage of 2D arrays, Example problems using 2D Arrays

Introduction to recursion, Principle of mathematical induction, Fibonacci numbers, Recursion using arrays, Recursion using strings, Recursion using 2D arrays

Introduction to oops, Creating objects, Getters, and setters, Constructors and related concepts, Inbuilt constructor and destructor, Example classes

Static members, Function overloading and related concepts, Abstraction, Encapsulation, Inheritance, Polymorphism, Virtual functions, Abstract classes, Exception handling

Introduction to Backtracking, Rat in a Maze, Hint: Sudoku, No. of numbers without duplicates, Hint: No. of numbers - duplicates

Introduction to Memoization, Introduction to Dynamic Programming, Fibonacci numbers using recursion, memoization and dynamic programming

Min Steps To 1, Solution - Min Steps to 1, Solution : Min Steps to 1 (Memoization), Alpha Code, LIS, No. of Balanced BTs, Solution : No. of Balanced BTs, No. of Balanced BSTs, Max sum subarray, Min Cost Path, Solution : Min Cost Path (Brute Force), Min Cost Path - Memoization, Min Cost Path - DP, LCS, LCS - Memoization, LCS - DP, Edit Distance, Solution : Edit Distance (Brute Force), Solution : Edit Distance (Memoization), Solution : Edit Distance (DP), Matrix Chain Multiplication, Maximum sub squares with all 0s

Introduction to linked list, Inserting node in linked list, Deleting node from linked list, Midpoint of linked list, Merge two sorted linked lists, merge sort of a linked list, Reversing a linked list

Introduction to stacks, Stack using arrays, Dynamic Stack class,Stack using linked list, Inbuilt stack, Queue using arrays, Dynamic queue class, Queue using linked list, Inbuilt queue

Introduction to Trees, Making a tree node class, Taking a tree as input and printing, Tree traversals, Destructor for tree node class

Introduction to Binary Trees, Taking a binary tree as input and printing, Binary Tree traversals, Diameter of binary tree

Introduction to Binary Search Trees, Searching a node in BST, BST class, Inserting and Deleting nodes in BST, Types of balanced BSTs

Introduction to Priority Queues, Ways to implement priority queues, Introduction to heaps, Introduction to Complete Binary Trees and its implementation, Insert and Delete operations in heaps, Implementing priority queues, Heap sort, Inbuilt Priority Queue

Introduction to Hashmap, Inbuilt Hashmap, Hash Functions, Collision handling, Insert and delete operation implementation in Hashmap, Load factor, Rehashing

Introduction to Tries, Making a Trie Node class, Insert, Search and Remove operation implementation in Tries, Types of Tries, Huffman Coding

Introduction to Graphs, Graph Terminology, Graph implementation, Graph Traversals (DFS and BFS), Weighted and Directed Graphs, Minimum Spanning Trees, Cycle Detection in Graphs, Kruskal's algorithm, Prim's Algorithm, Dijkstra's algorithm

Introduction and shift operators, Remaining bitwise operators, Check ith bit, Flip ith bit, Check odd-even & power of 2, No. of 1s, Clear all bits from LSB