Instructors
Prof. Ravindrababu Ravula&nbsp;is a dedicated Teacher with 15+ years of experience and a deep passion for computer science. Students call him&nbsp;RBR Sir and he&nbsp;did his&nbsp;Masters&#39; degree in Computer Science from IISc Bangalore.
<img alt="" src="https://appxcontent.kaxa.in/paperimages/17067008401706700840_thump.jpg" style="height:125px; width:123px" />
Jay Bansal (AIR 2)&nbsp;did his MTech from&nbsp;IIT Bombay&nbsp;(Specialising in deep networks and image processing). Working as an ML Engineer at&nbsp;Google, working on making cool products using state-of-the-art LLMs like Bard and Gemini.
<img alt="" src="https://appxcontent.kaxa.in/paperimages/17067009681706700968_thump.png" style="height:125px; width:123px" />
Syllabus
1. Python Programming
Basics of Python programming 
Data types, variables, and operators 
Control flow 
Functions 
Modules 
Object-Oriented Programming 
Classes and objects 
Inheritance and polymorphism 
Encapsulation and abstraction 
&nbsp;
2. Data Structures
Stacks 
Queues 
Linked Lists 
Doubly and Circular linked lists 
Operations on linked lists 
Binary trees 
Binary search trees 
Tree traversals 
Hash Tables 
Hash functions and collision resolution&nbsp; 
Tries
3. Algorithms
Linear Search 
Binary Search 
Selection Sort 
Bubble Sort 
Insertion Sort 
Divide and Conquer 
Mergesort 
Quicksort 
Dynamic Programming
 
4. Graph Theory
Basics of Graph Theory 
Graphs, vertices, and edges 
Types of Graphs 
Graph representations 
Graph traversals 
Depth First Search 
Breadth-First Search 
Shortest path algorithms 
Dijkstra&#39;s algorithm 
Bellman-Ford algorithm 
&nbsp;
5. DSA Problems
Note:&nbsp;Some problems will be solved in the classroom, while the remaining ones will be assigned as homework.
Arrays
<ol>
	<li>Two Sum</li>
	<li>Contains Duplicate</li>
	<li>Best Time to Buy and Sell Stock</li>
	<li>Merge Sorted Array</li>
	<li>Majority Element</li>
	<li>Remove Duplicates from a Sorted Array</li>
	<li>Max Consecutive Ones</li>
	<li>Check if an array is sorted and rotated</li>
	<li>Move Zeroes</li>
	<li>Single Number</li>
	<li>Pascal&#39;s Triangle</li>
	<li>Rotate Array</li>
	<li>Majority Element II</li>
	<li>Product of Array Except for Self</li>
	<li>Maximum Subarray/ Maximum Sum Subarray/ Kadanes Algorithm</li>
	<li>Maximum Product Subarray</li>
	<li>Container With Most Water</li>
	<li>Missing Number</li>
	<li>Longest Consecutive Sequence</li>
	<li>Set Matrix Zeroes</li>
	<li>Spiral Matrix</li>
	<li>Rotate Image</li>
	<li>Rearrange array elements by sign</li>
	<li>Next Permutation</li>
	<li>Sort Colors</li>
	<li>Subarray sum equals k</li>
	<li>Merge Intervals</li>
	<li>Find the Duplicate Number</li>
	<li>Repeat and Missing Number Array</li>
	<li>Count Inversions</li>
	<li>Search in a 2D Matrix</li>
	<li>Pow(x, n)</li>
	<li>Unique Paths</li>
	<li>3Sum</li>
	<li>4Sum</li>
	<li>Largest Subarray with Sum 0</li>
	<li>Subarray with given XOR</li>
	<li>Trapping Rain Water</li>
</ol>
Strings
<ol>
	<li>Valid Palindrome</li>
	<li>Valid Anagram</li>
	<li>Roman To Integer</li>
	<li>Longest Common Prefix</li>
	<li>Find the index of the first occurrence in a string</li>
	<li>Remove Outermost Parentheses</li>
	<li>Isomorphic Strings</li>
	<li>Largest Odd Number in String</li>
	<li>Rotate String</li>
	<li>Maximum Nesting Depth of the Parentheses</li>
	<li>Sum of beauty of all substrings</li>
	<li>Minimum add to make parentheses valid</li>
	<li>Group Anagrams</li>
	<li>Longest Palindromic Substring</li>
	<li>Palindromic Substrings</li>
	<li>Encode and Decode Strings</li>
	<li>Reverse words in a string</li>
	<li>Minimum Characters required to make a string palindromic</li>
	<li>String to Integer Atoi</li>
	<li>Count and Say</li>
	<li>Compare Version Numbers</li>
	<li>Sort Characters by Frequency</li>
	<li>Shortest Palindrome</li>
	<li>Longest Happy Prefix</li>
</ol>
Backtracking
<ol>
	<li>Permutations</li>
	<li>Rat in a Maze</li>
	<li>Combination Sum</li>
	<li>Combination Sum II</li>
	<li>Palindrome Partitioning</li>
	<li>Word Search</li>
	<li>N Queens</li>
	<li>Sudoku Solver</li>
</ol>
Bit Manipulation
<ol>
	<li>Number of 1 Bits/ Brian Kernighan&#39;s Algorithm/ Number of set Bits/ Hamming Weight/ Population Count</li>
	<li>Counting Bits</li>
	<li>Reverse Bits</li>
	<li>Power of Two</li>
	<li>Single Number</li>
	<li>Minimum Bit Flips to Convert Number</li>
	<li>Divide Two Integers</li>
	<li>Subsets</li>
	<li>Sum of Two Integers</li>
	<li>Count Primes</li>
	<li>Pow(x, n)</li>
</ol>
Heaps
<ol>
	<li>Kth Largest Element in a Stream</li>
	<li>Kth Largest Element in an array</li>
	<li>Top K Frequent Elements</li>
	<li>Task Scheduler</li>
	<li>Hand of Straights</li>
	<li>Design Twitter</li>
	<li>Maximum Sum Combinations</li>
	<li>Merge K-Sorted Lists</li>
	<li>Find Median from Data Stream</li>
</ol>
LinkedList
<ol>
	<li>Reverse a Linked List</li>
	<li>Detect Cycle in a Linked List</li>
	<li>Middle of the Linked List</li>
	<li>Merge Two Sorted Lists</li>
	<li>Intersection of two linked lists</li>
	<li>Palindrome Linked List</li>
	<li>Delete the middle node of a linked list</li>
	<li>Odd Even Linked List</li>
	<li>Delete Node in a Linked List</li>
	<li>Linked List Cycle II</li>
	<li>Add Two Numbers</li>
	<li>Remove Nth Node From End Of List</li>
	<li>Reorder List</li>
	<li>Flattening a Linked List</li>
	<li>Copy List with Random Pointer</li>
	<li>Sort List</li>
	<li>Rotate List</li>
	<li>Reverse Nodes in K Group</li>
	<li>Merge K-Sorted Lists</li>
</ol>
Stack
<ol>
	<li>Valid Parentheses</li>
	<li>Implement Stack using Queues</li>
	<li>Next Greater Element I</li>
	<li>Nearest Smaller Element</li>
	<li>The sum of Subarray Minimums</li>
	<li>Next Greater Element II</li>
	<li>Min Stack</li>
	<li>Online Stock Span</li>
	<li>Asteroid Collision</li>
	<li>The sum of subarray ranges</li>
	<li>Remove K Digits</li>
	<li>LRU Cache</li>
	<li>Largest Rectangle in Histogram</li>
	<li>Maximal Rectangle</li>
	<li>LFU Cache</li>
</ol>
Binary Search
<ol>
	<li>Binary Search</li>
	<li>Search Insert Position</li>
	<li>Kth Missing Positive Number</li>
	<li>Find the first and last position of an element in a sorted array</li>
	<li>Search in a rotated sorted array</li>
	<li>Search in a rotated sorted array II</li>
	<li>Find Minimum in Rotated Sorted Array</li>
	<li>Single Element in a Sorted Array</li>
	<li>Allocate Books</li>
	<li>Aggressive Cows</li>
	<li>Kth Element of Two-Sorted Array</li>
	<li>Longest Increasing Subsequence</li>
	<li>Median of Two Sorted Arrays</li>
	<li>Find Peak Element</li>
	<li>Koko Eating Bananas</li>
	<li>Minimum Number of days to make m bouquets</li>
	<li>Find the smallest divisor given a threshold</li>
	<li>Capacity to ship packages within D Days</li>
	<li>Find a peak element II</li>
	<li>Search in a 2D matrix</li>
	<li>Search in a 2D matrix II</li>
	<li>Split Array Largest Sum</li>
</ol>
Dynamic Programming
<ol>
	<li>Climbing Stairs (Count ways to reach the n-th stairs)</li>
	<li>Best Time to Buy and Sell Stock</li>
	<li>Best Time to Buy and Sell Stock II</li>
	<li>Unique Paths</li>
	<li>Unqiue Paths II</li>
	<li>Longest Increasing Subsequence</li>
	<li>0/1 Knapsack</li>
	<li>Word Break Problem</li>
	<li>House Robber</li>
	<li>House Robber II</li>
	<li>Decode Ways</li>
	<li>Egg Dropping Puzzle</li>
	<li>Maximum Sum Increasing Subsequence</li>
	<li>Word Break</li>
	<li>Minimum Path Sum</li>
	<li>Coin Change</li>
	<li>Triangle</li>
	<li>Target Sum</li>
	<li>Minimum Failing Path Sum</li>
	<li>Partition Equal Subset Sum</li>
	<li>Edit Distance</li>
	<li>Delete Operation for Two Strings</li>
	<li>Largest divisible subset</li>
	<li>Number of longest increasing subsequence</li>
	<li>Count Square Submatrices with all ones</li>
	<li>Longest Common Subsequence</li>
	<li>Best time to buy and sell stock with cooldown</li>
	<li>Partition array for maximum sum</li>
	<li>Best time to buy and sell stock with transaction free</li>
	<li>Best time to buy and sell stock III</li>
	<li>Best time to buy and sell stocok IV</li>
	<li>Palindromic Partitioning</li>
	<li>Matrix Chain Multiplication</li>
	<li>Minimum Cost to Cut a Stick</li>
	<li>Paritition Array into two arrays to minimize sum difference</li>
	<li>Minimum Insertion Steps to make a string palindrome</li>
	<li>Shortest Common Supersequence</li>
	<li>Distinct Subsequence</li>
	<li>Wildcard Matching</li>
	<li>Burst Balloons</li>
	<li>Parsing a boolean expression</li>
	<li>Palindrome Partitioning II</li>
	<li>Maximal Rectangle</li>
</ol>
Greedy
<ol>
	<li>N Meetings in One Room</li>
	<li>Lemonade Change</li>
	<li>Assign Cookies</li>
	<li>JUMP Game</li>
	<li>Jump Game II</li>
	<li>Valid Parenthesis String</li>
	<li>Insert Interval</li>
	<li>Merge Intervals</li>
	<li>Non-overlapping intervals</li>
	<li>Meeting Rooms 1</li>
	<li>Meeting Rooms 2</li>
	<li>Minimum Platforms</li>
	<li>Job Sequencing Problem</li>
	<li>Candy</li>
</ol>
Sliding Window
<ol>
	<li>Valid Anagram</li>
	<li>Longest Repeating Character Replacement</li>
	<li>Longest substring without repeating characters</li>
	<li>Max Consecutive Ones III</li>
	<li>Binary Subarrays with Sum</li>
	<li>Count Number of Nice Subarrays</li>
	<li>Maximum Points you can obtain from cards</li>
	<li>Number of substrings containing all three characters</li>
	<li>Minimum Window Substring</li>
	<li>Sliding Window Maximum</li>
	<li>Subarrays with K different Integers</li>
</ol>
Trees
<ol>
	<li>Invert/Flip Binary Tree / Mirror Tree</li>
	<li>Inorder Traversal</li>
	<li>Preorder Traversal</li>
	<li>Postorder Traversal</li>
	<li>Count Complete Tree Nodes</li>
	<li>Subtree of Another Tree</li>
	<li>Same Tree</li>
	<li>Symmetric Tree</li>
	<li>Maximum Depth of Binary Tree</li>
	<li>Diameter of Binary Tree</li>
	<li>Balanced Binary Tree</li>
	<li>Search in a Binary Search Tree</li>
	<li>Insert into a Binary Search Tree</li>
	<li>Two Sum IV Input is a BST</li>
	<li>Floor From BST</li>
	<li>Ceil From BST</li>
	<li>Left View of Binary Tree</li>
	<li>Bottom View of Binary Tree</li>
	<li>Top View of a Binary Tree</li>
	<li>Right Side View</li>
	<li>Level Order Travesal</li>
	<li>Lowest Common Ancestor of a Binary Tree</li>
	<li>Binary Tree Zigzag Level Order Traversal</li>
	<li>Convert Sorted Array to Binary Search Tree</li>
	<li>Delete Node in a BST</li>
	<li>Maximum Width of Binary Tree</li>
	<li>Binary Tree Maximum Path Sum</li>
	<li>Construct Binary Tree from Preorder and Inorder Traversal</li>
	<li>Binary Tree Level Order Traversal</li>
	<li>Validate Binary Search Tree</li>
	<li>Flatten Binary Tree to Linked List</li>
	<li>Populating next right pointers in each node</li>
	<li>Kth Largest Element in a BST</li>
	<li>Kth Smallest Element in a BST</li>
	<li>All Nodes Distance K in Binary Tree</li>
	<li>Predecessor and Successor</li>
	<li>Lowest Common Ancestor of a Binary Search Tree</li>
	<li>Recover Binary Search Tree</li>
	<li>Vertical Order Traversal of a Binary Tree</li>
	<li>Serialize and Deserialize Binary Tree</li>
</ol>
Graph
<ol>
	<li>DFS of Graph</li>
	<li>BFS of Graph</li>
	<li>Flood Fill</li>
	<li>Clone Graph Link</li>
	<li>Course Schedule I</li>
	<li>Topological Sort</li>
	<li>Number of Provinces</li>
	<li>Pacific Atlantic Water Flow</li>
	<li>Rotting Oranges</li>
	<li>Number of Islands</li>
	<li>Is Graph Bipartite</li>
	<li>Implement Dijkstra Algorithm</li>
	<li>Graph Valid Tree</li>
	<li>Number of Provinces</li>
	<li>Minimum Spanning Tree</li>
	<li>Surrounded Regions</li>
	<li>Number of Enclaves</li>
	<li>Find Eventual Safe States</li>
	<li>01 Matrix</li>
	<li>Shortest Path in BInary Matrix</li>
	<li>Path with Minimum Effort</li>
	<li>Cheapest Flights within K Stops</li>
	<li>Network Delay Time</li>
	<li>Number of Ways to Arrive at destination</li>
	<li>Number of Operations to make network connected</li>
	<li>Most stones removed with same row or columns</li>
	<li>Accounts Merge</li>
	<li>Alien Dictionary</li>
	<li>Word Ladder</li>
	<li>Word Ladder II</li>
	<li>Making a large island</li>
	<li>Swim in rising water</li>
</ol>
Trie
<ol>
	<li>Implement Trie (Prefix Tree)</li>
	<li>Implement Trie II</li>
	<li>Power Set&nbsp;</li>
	<li>Count Distinct Substrings</li>
	<li>Maximum Xor of Two Numbers in an Array</li>
	<li>Complete String</li>
	<li>Maximum Xor with an element from an array</li>
</ol>
HashMap + Doubly LinkedList
&nbsp;
Note: No Refund
&nbsp;

Digital Products

₹4,999
₹9,999
51% off

Quick Links

Download App

Digital Products

₹4,999 ₹9,99951% off

Quick Links

Download App

₹4,999
₹9,999
51% off