New batches start 11 August 2026. Enrol now →

← Programming & Computer Science Foundations

Programming & Computer Science Foundations

DSA With Java

Data structures and algorithms in Java — from arrays and HashMaps to graphs and DP

Get hands-on with DSA in Java — covering data types, loops, functions, arrays, strings, and object-oriented programming before moving into stacks, queues, linked lists, and HashMaps. You'll work through recursion, sorting, binary search, trees, graphs, and dynamic programming, building strong problem-solving habits along the way.

68h
of content
18
modules
95
lessons
Fees from
₹4,000

per level · 3 levels · complete programme ₹17,000

Duration
5 mo
Enrol now Talk to us first

Fees by level

Start at any level, or take the complete programme. The fee you pay for a level is locked for you.

LevelWhat it coversDurationFee
Beginner Start from zero 1 mo ₹4,000
Intermediate Build working projects 2 mo ₹5,500
Advanced Get job-ready 2 mo ₹7,500
Complete programme (all levels) ₹17,000

All fees are in Indian Rupees and include applicable taxes. See our pricing & payment terms.

The complete curriculum

This is the entire syllabus — all 18 modules and 95 lessons, in the order you'll learn them. Nothing hidden.

↓ Download full curriculum (PDF)
01 Introduction 2 lessons
  1. 1.1Introduction to DSA with Java
  2. 1.2Introduction and setup
02 Data Types 2 lessons
  1. 2.1Data Types And flow chart 1
  2. 2.2Data Types And flow chart 2
03 Loops 1 lesson
  1. 3.1Loops
04 Questions 2 lessons
  1. 4.1Question (Prime & Reverse)
  2. 4.2Question (Inverse & Rotate a number)
05 Functions 1 lesson
  1. 5.1Functions
06 Array 9 lessons
  1. 6.1Introduction to Array
  2. 6.2Array Question
  3. 6.3Array Ques
  4. 6.42 D Array
  5. 6.5Question 1
  6. 6.6Questions 2
  7. 6.7Two Pointer Sliding Window
  8. 6.8KMP Algorithm, Stack
  9. 6.9Kadens Aalgo Python
07 String 2 lessons
  1. 7.1String
  2. 7.2String Questions
08 Obect Oriented Programming 6 lessons
  1. 8.1oops
  2. 8.2static, encapsultaion, inheritance
  3. 8.3Inheritance, Polymorphism, Anstraction
  4. 8.4Shallow, deep copy, this
  5. 8.5Dynamic Method Dispatch
  6. 8.6Toll Booth
09 Time Space 1 lesson
  1. 9.1Time and Space
10 Stack Queues 6 lessons
  1. 10.1Stack Questins
  2. 10.2Nge, Largest Rectangle Histogram
  3. 10.3Stock Span, Trapping Rain Water
  4. 10.4Queue
  5. 10.5Sliding Window Max
  6. 10.6Conversions
11 Linked List 10 lessons
  1. 11.1Linked List
  2. 11.2Reverse Middle
  3. 11.3Remove nth node, Merge ll
  4. 11.4Odd even delete node
  5. 11.5Remove duplicate, Delete middle
  6. 11.6Question, Cycle detection
  7. 11.7Intersection Reorder
  8. 11.8Add, Subtract
  9. 11.9Double Linked List
  10. 11.10Copy Random Pointer
12 HashMap 5 lessons
  1. 12.1Introduction to HashMap in Java
  2. 12.2Priority Queue
  3. 12.3Contains Duplicate Problems Java
  4. 12.4Hashing Problems in Java
  5. 12.5Subarray Sum Problems Java Hashing
13 Recursion 7 lessons
  1. 13.1Recursion Intro
  2. 13.2Backtracking Problems Palindrome Partitioning, Rat in a Maze & Word Search
  3. 13.3Merge Sort Divide and Conquer Algorithm
  4. 13.4Recursion & Backtracking Problems Subsets II, N-Queens & Sudoku Solver
  5. 13.5Recursion Example Quick Sort
  6. 13.6Recursion Problems Combination Sum I & II, Subset Sum
  7. 13.7Recursion Problems Generate Parentheses & Permutations
14 Sorting 1 lesson
  1. 14.1Sorting Algorithms
15 Binary Search 3 lessons
  1. 15.1Aggressive Cows, Heaters & Chocolate Distribution
  2. 15.2Binary Search Problems Rotated Array & Allocation Problems
  3. 15.3Binary Search Problems Union, 2D Matrix & Pivot Index
16 Trees 8 lessons
  1. 16.1Binary Search Tree
  2. 16.2Heap Questrions
  3. 16.3Heap Questions 1
  4. 16.4Binary Tree Basics & Traversals
  5. 16.5Binary Tree Practice Problems Part 1
  6. 16.6Binary Tree Practice Problems Part 2
  7. 16.7Binary Tree Practice Problems Part 3
  8. 16.8Binary Tree Practice Problems Part 4
17 Graphs 16 lessons
  1. 17.1Graph Introduction
  2. 17.2Traversals(BFS&DFS)
  3. 17.3Number of province& Number of island
  4. 17.4Flood Fill Algo & Rotten Oranges
  5. 17.5Detect Cycle(bfs & dfs)
  6. 17.6Surrounded Regions & Number of enclave
  7. 17.7Bi-partite graph& directed graph cycle
  8. 17.8Topological Sort(dfs & bfs)
  9. 17.9Detect cycel in directed graph(bfs) &find eventual safe States
  10. 17.10Shortest path(DAG)&Undirected graph
  11. 17.11Word Ladder(I &II)
  12. 17.12Dijkstra Algo
  13. 17.13Bellman ford & Floyd Warshel Algo
  14. 17.14Prims Algo
  15. 17.15Disjoint Set
  16. 17.16Kruskal
18 Dynamic Programining 13 lessons
  1. 18.1Introduction dp
  2. 18.2Climbing Stairs&Frog Jump
  3. 18.3Frog K Jump
  4. 18.4House Robber 1&2
  5. 18.5Unique Paths(1&2)
  6. 18.6Minimum Path Sum&Falling Path Sum
  7. 18.7Cheery pick(1&2)
  8. 18.8Dungen Game & Knight Dialer
  9. 18.9Target Sum & partition
  10. 18.10Min sum partition&perfect sum
  11. 18.11Coin change&unbounded knapsack
  12. 18.12Minimum cost for tickets
  13. 18.13Lcs

Tools you'll use

PythonJava

Every course includes

Live, instructor-led classes Course materials & lab access Doubt-clearing sessions Final assessment + one free re-attempt Verifiable certificate

How certification works