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