SIGMA-9-JAVA
Learn SIGMA - 9 JAVA DSA by Apna college with comprehensive video tutorials and hands-on projects.
Meet Your Instructor: Apna-College
Apna College stands as one of India's most influential and accessible programming education platforms, founded by the visionary educator Aman Dhattarwal. With a mission to democratize quality coding education, Apna College has transformed the lives of hundreds of thousands of students through their comprehensive, career-oriented curriculum. The platform's signature Sigma series courses cover everything from foundational programming in Java and C++ to advanced MERN stack development and aptitude preparation. Apna College is renowned for breaking down complex technical concepts into simple, engaging lessons that students can follow regardless of their prior experience. Their unique teaching approach combines practical projects, real-world applications, and industry insights, ensuring students are well-prepared for both academic excellence and professional success in the competitive tech industry.
Java ProgrammingC++ ProgrammingMERN Stack
Experience: 5+ years
Students Helped: 200000+
Specialization: Complete Programming Education
Course Overview
This comprehensive course is designed to take you from foundational concepts to advanced implementation in complete programming education. You'll learn through comprehensive curriculum designed with career focus, emphasizing hands-on learning, project-based assignments, and industry-relevant skills, building real-world projects that demonstrate your skills and enhance your portfolio.
Whether you're looking to start a new career in technology or advance your current skills, this course provides the structured learning path and practical experience you need to succeed in today's competitive tech industry.
Course Curriculum
Master Java programming fundamentals and data structures
Learn object-oriented programming concepts and collections
Implement arrays, linked lists, trees, and graphs in Java
Master sorting and searching algorithms with complexity analysis
Solve competitive programming problems using Java
Understand Java memory management and advanced features
Course Content
1
Orientation Session (Recording)
2
Aman Sir's Mentorship Session
3
Coding Platforms Mentorship Session
4
Resume Building Session
5
GSoC - 2025 Live Mentorship Session
6
Special Mentorship Session by Aman Sir
7
Off campus Placement/Internships Session
8
Practice Session 1 (Recording)
9
Practice Session 2 (Recording)
10
Practice Session 3 (Recording)
11
Practice Session 4 (Recording)
12
Sunday Live Doubt Session
13
Practice Session 5 (Recording)
14
Practice Session 6 (Recording)
15
Practice Session 7 (Recording)
16
Practice Session 8 (Recording)
17
Practice Session 9 (Recording)
18
Practice Session 10 (Recording)
19
Sunday Live Doubt Session
20
Practice Session 11 (Recording)
21
Practice Session 12 (Recording)
22
Practice Session 13 (Recording)
23
Sunday Live Doubt Session
24
Practice Session 14 (Recording)
25
Practice Session 15 (Recording)
26
Practice Session 16 (Recording)
27
Sunday Live Doubt Session
28
Practice Session 17 (Recording)
29
Practice Session 18 (Recording)
30
Practice Session 19 (Recording)
31
Practice Session 20 (Recording)
32
Practice Session 21 (Recording)
33
Practice Session 22 ( Recording)
34
Sunday Live Doubt Session
35
Practice Session 23 (Recording)
36
Practice Session 24 ( Recording)
37
Sunday Live Session
38
Practice Session 25 (Recording)
39
Practice Session 26 (Recording)
40
Practice Session 27 (Recording)
41
Sunday Live Session
42
Practice Session 28 (Recording)
43
Practice Session 29 (Recording)
44
Practice Session 30 (Recording)
45
Sunday Live Session
46
Practice Session 31 (Recording)
47
Practice Session 32 (Recording)
48
Practice Session 33 (Recording)
49
Sunday Live Session
50
Practice Session 34 (Recording)
51
Practice Session 35 (Recording)
52
Practice Session 36 (Recording)
53
Sunday Live Session
54
Practice Session 37 (Recording)
55
Practice Session 38 (Recording)
56
Practice Session 39 (Recording)
57
Sunday Live Session
58
Practice Session 40 (Recording)
59
Practice Session 41 (Recording)
60
Practice Session 42 (Recording)
61
Sunday Live Session
62
Practice Session 43 (Recording)
63
Practice Session 44 (Recording)
64
Practice Session 45 (Recording)
65
Sunday Live Session
66
Practice Session 46(Recording)
67
Practice Session 47(Recording)
68
Sunday Live Session
69
Path to Placement
70
What will you learn?
71
Prerequisites
72
What to Install? (on your laptop/computer)
73
What are Flowcharts?
74
Flowchart Components
75
Sum of 2 Numbers
76
Calculate Simple Interest
77
Max of 3 Numbers
78
Find if a Number is Prime or not
79
Sum of first N natural numbers
80
Creating a Java File
81
Boilerplate Code
82
Output in Java
83
Print a Pattern
84
Variables in Java
85
Data Types in Java
86
Sum of a & b
87
Comments in Java
88
Input in Java
89
Sum of a & b (Input from User)
90
Product of a & b
91
Area of a Circle
92
Type Conversion
93
Type Casting
94
Type Promotion in Expression
95
How does Java code run?
96
Types of Operators
97
Arithmetic Operators
98
Unary Operators
99
Relational Operators
100
Logical Operators
101
Assignment Operators
102
if else
103
Print the largest of 2 numbers
104
Print if number is Odd or Even
105
else if
106
Income Tax Calculator
107
Print the largest of 3 numbers
108
Ternary Operator
109
Check if a student will Pass or Fail
110
Switch statement
111
Calculator
112
Loops Basics
113
while Loop
114
Print numbers from 1 to 10
115
Print numbers from 1 to n
116
Sum of first N natural numbers
117
for Loop
118
Print Square pattern
119
Print reverse of a number
120
Reverse the given number
121
do while Loop
122
Break statement
123
Question - break keyword
124
Continue statement
125
Question - continue keyword
126
Check if a number is Prime or not
127
Intro to Nested Loops (Star Pattern)
128
Inverted Star Pattern
129
Half Pyramid Pattern
130
Character Pattern
131
Special Note
132
Introduction to Functions
133
Syntax - Function Code Demo
134
Syntax with Parameters
135
Parameters v/s Arguments
136
What happens in memory? (Call Stack)
137
Call by Value (in Java)
138
Product of a & b
139
Find Factorial
140
Find Binomial Coefficient
141
Inbuilt v/s User defined Methods
142
Function Overloading
143
Overloading using Parameters
144
Overloading using Data Types
145
Check if a number is Prime or not
146
Check Prime (Optimized)
147
Primes in Range
148
Binary to Decimal
149
Code - Binary to Decimal
150
Decimal to Binary
151
Code - Decimal to Binary
152
Method Scope
153
Block Scope
154
Hollow Rectangle Pattern
155
Dry Run - Hollow Rectangle Pattern
156
Inverted & Rotated Half Pyramid
157
Inverted Half Pyramid Pattern with Numbers
158
Floyd's Triangle Pattern
159
0-1 Triangle Pattern
160
Butterfly Pattern
161
Butterfly Pattern Code (explanation continued as well)
162
Solid Rhombus Pattern
163
Hollow Rhombus Pattern
164
Diamond Pattern
165
Introduction
166
Arrays - Creation
167
Arrays - Input, Output & Update
168
Arrays as Function Arguments
169
Linear Search
170
Largest in Array
171
Binary Search
172
Binary Search Code
173
Reverse an Array
174
Pairs in Array
175
Print Subarrays
176
Max Subarray Sum - I (Brute Force)
177
Max Subarray Sum - II (Prefix Sum)
178
Max Subarray Sum - III (Kadane's Algorithm)
179
Trapping Rainwater
180
Trapping Rainwater - Code
181
Best Time to Buy & Sell Stock
182
What is sorting?
183
Bubble Sort
184
Bubble Sort Code
185
Selection Sort
186
Selection Sort Code
187
Insertion Sort
188
Insertion Sort Code
189
Inbuilt Sort
190
Counting Sort
191
Counting Sort Code
192
Introduction to 2D Arrays
193
Real life examples
194
Representation of 2D Arrays
195
Creation of 2D Arrays
196
2D Arrays in Memory
197
Spiral Matrix
198
Spiral Matrix Code
199
Diagonal Sum
200
Search in Sorted Matrix
201
Search in Sorted Matrix Code
202
What are Strings?
203
Input/Output
204
String Length
205
String Concatenate
206
String charAt Method
207
Check if a String is Palindrome
208
Question - Shortest Path
209
String Functions - compare
210
String Functions - substring
211
Print Largest String
212
Why Strings are Immutable?
213
StringBuilder
214
Convert Letters to Uppercase
215
String Compression
216
Introduction to Bit Manipulation
217
Binary Number System
218
Bitwise Operators
219
Binary AND
220
Binary OR
221
Binary XOR
222
Binary 1's Complement
223
Binary Left Shift
224
Binary Right Shift
225
Check if Odd or Even
226
Get ith Bit
227
Set ith Bit
228
Clear ith Bit
229
Update ith bit
230
Clear last i bits
231
Clear range of bits
232
Check if a number is power of 2 or not
233
Count set bits in a number
234
Fast Exponentiation
235
Fast Exponentiation Code
236
Classes & Objects
237
Access Modifiers
238
Getters & Setters
239
Encapsulation
240
Constructors
241
Type of Constructors
242
Copy Constructor
243
Shallow & Deep Copy
244
Destructors
245
Inheritance
246
Single level Inheritance
247
Multi level Inheritance
248
Hierarchial Inheritance
249
Hybrid Inheritance
250
Polymorphism
251
Method Overloading
252
Method Overriding
253
Packages in Java
254
Abstraction
255
Abstract Classes
256
Interfaces
257
Static keyword
258
Super keyword
259
Solved Questions Practice
260
What is Recursion?
261
Print numbers in decreasing order
262
Stack overflow
263
Print numbers in increasing order
264
Find Factorial of N
265
Print sum of N natural numbers
266
Print Nth Fibonacci number
267
Check if array is sorted or not
268
First Occurrence
269
Last Occurrence
270
Print x to the power n
271
Print x to the power n (Optimized)
272
Tiling Problem
273
Tiling Problem Code
274
Remove Duplicates in a String
275
Friends Pairing Problem
276
Binary Strings Problem
277
Binary Strings Problem Code
278
Stack Analysis - Binary Strings
279
What is Divide & Conquer?
280
Merge Sort (Basic + Space Optimized)
281
Merge Sort Code
282
Quick Sort
283
Quick Sort Code
284
Worst Case in Quick Sort
285
Sorted & Rotated Array Search
286
Sorted & Rotated Array Code
287
Introduction
288
What is Time Complexity?
289
Constant Time Complexity
290
Big O Notation
291
Big Omega & Theta Notation
292
Common Complexities
293
Space Complexity
294
Simple Loop Analysis
295
Nested Loop 1 Analysis
296
Nested Loop 2 Analysis
297
Nested Loop 3 Analysis
298
Bubble Sort Analysis
299
Binary Search Analysis
300
Recursive Complexity Analysis (Factorial)
301
Sum of N numbers Analysis
302
Fibonacci Analysis
303
Merge Sort Analysis
304
Recurrence Relation - Merge Sort
305
Power Function I - Analysis
306
Power Function II - Analysis
307
Power Function III - Analysis
308
How to approach Coding Questions?
309
Introduction
310
Types of Backtracking
311
Backtracking on Arrays
312
Find Subsets
313
Find Subsets Code
314
Find Permutations
315
Find Permutations Code
316
N Queens - all ways
317
N Queens - Time Complexity
318
N Queens - count ways
319
N Queens - print one solution
320
Grid Ways
321
Grid Ways Code
322
Grid Ways Trick
323
Sudoku
324
Sudoku Code
325
Introduction to ArrayList
326
Operations on ArrayList
327
Size of ArrayList
328
Print Reverse
329
Find Maximum
330
Swap 2 Numbers
331
Sorting an ArrayList
332
ArrayList (Implementation in Java)
333
Multi-dimensional ArrayLists
334
Container with Most Water (Brute Force)
335
Container with Most Water (2 Pointer Approach)
336
Container wMW v/s Trapping Rainwater
337
Pair Sum - 1 (Brute Force)
338
Pair Sum - 1 (2 Pointer Approach)
339
Pair Sum - 2
340
Pair Sum - 2 (Code)
341
Introduction to Linked List
342
Head & Tail in LL
343
Add First in LL
344
Add Last in LL
345
Print a LL
346
Add in the Middle of LL
347
Size of a LL
348
Remove First in LL
349
Remove Last in LL
350
Iterative Search
351
Recursive Search
352
Reverse a Linked List
353
Find and Remove Nth Node from End
354
Check if LL is Palindrome
355
Check if LL is Palindrome (Code)
356
Detecting Cycle in LL
357
Detecting Cycle Code
358
Removing Cycle in LL
359
Removing Cycle Code
360
Removing Cycle Explanation (Math)
361
Java Collections Framework
362
LL in Collections Framework
363
Merge Sort on LL
364
Merge Sort on LL (Code)
365
Zig Zag Linked List
366
Zig Zag LL Code
367
Doubly LL
368
Reverse a Doubly LL
369
Circular LL (Approach)
370
Stack Introduction
371
Stack using ArrayList
372
Stack using Linked List
373
Stack using Collections Framework
374
Push at Bottom of Stack
375
Reverse a String using a Stack
376
Reverse a Stack
377
Stock Span Problem
378
Next greater element
379
Next greater element Code
380
Valid Parentheses
381
Valid Parentheses Code
382
Duplicate Parentheses
383
Duplicate Parentheses Code
384
Maximum Rectangular Area in Histogram
385
Max Rectangular Area in Histogram (Code)
386
Introduction to Queues
387
Queues using Arrays
388
Circular Queue using Arrays
389
Queue using LL
390
Queue using JCF
391
Queue using Two Stacks
392
Stack using 2 Queues
393
First Non-Repeating Letter
394
Interleave two halves of a Queue
395
Queue Reversal
396
Deque (Double Ended Queue)
397
Deque in JCF
398
Implement Stack using Deque
399
Implement Queue using Deque
400
Introduction to Greedy
401
Activity Selection
402
Activity Selection Code
403
Activity Selection Explanation
404
Fractional Knapsack
405
Fractional Knapsack Code
406
Minimum Sum absolute difference pairs
407
Maximum length chain of pairs
408
Indian Coins
409
Job Sequencing Problem
410
Chocola Problem
411
Chocola Problem Code
412
Introduction to Binary Trees
413
Levels & Sub-trees in a Tree
414
Pop Quiz
415
Build Tree Preorder
416
Build Tree Preorder Code
417
Preorder Traversal
418
Inorder Traversal
419
Postorder Traversal
420
Level order Traversal
421
Height of a Tree
422
Count of Nodes of a Tree
423
Sum of Nodes
424
Diameter of a Tree (Approach1)
425
Diameter of a Tree (Approach2)
426
Subtree of another tree
427
Subtree of another tree Code
428
Top View of a Tree (Basics)
429
Top View of a Tree (Approach)
430
Top View of a Tree (Code)
431
Kth Level
432
Lowest Common Ancestor (Approach1)
433
Lowest Common Ancestor (Approach2)
434
Minimum Distance between 2 Nodes
435
Kth ancestor of Node
436
Transform to Sum Tree
437
Introduction
438
Concept of Search in BST
439
Build a BST
440
Search in a BST
441
Delete a Node
442
Print in Range
443
Root to Leaf Path
444
Validate BST
445
Mirror a BST
446
Sorted Array to Balanced BST
447
Convert BST to Balanced BST
448
Size of Largest BST in BT
449
Size of Largest BST in BT (Code)
450
Merge 2 BSTs
451
AVL Trees
452
Introduction to Priority Queues
453
PQ in JCF
454
PQ for Objects
455
Introduction to Heaps
456
Heap Implementation (using CBT)
457
Insert in Heap
458
Peek from Heap
459
Remove from Heap
460
Heap Sort
461
Nearby Cars
462
Connect N Ropes with Minimum Cost
463
Weakest Soldier
464
Sliding Window Maximum
465
Hashing Introduction
466
HashMap
467
HashMap Operations
468
Iteration on HashMaps
469
HashMap Implementation
470
HashMap Implementation Code
471
Special Note
472
LinkedHashMap
473
TreeMap
474
Majority Element
475
Valid Anagram
476
HashSet
477
Iteration on HashSets
478
LinkedHashSet
479
TreeSet
480
Count Distinct Elements
481
Union & Intersection
482
Find Itinerary for Tickets
483
Largest Subarray with Sum 0
484
Subarray Sum Equal to K
485
Tries Introduction
486
What is a Trie?
487
Creating a Trie
488
Insertion
489
Searching
490
Word Break Problem
491
Prefix Problem
492
startsWith Problem
493
Unique Substrings
494
Longest Word with all Prefixes
495
Introduction to Graphs
496
Types of Graphs (Based on Edge)
497
Graph Representations
498
Graph Applications
499
Creating a Graph (Adjacency List)
500
BFS (Breadth First Search)
501
DFS (Depth First Search)
502
Has Path? (using DFS)
503
Connected Components
504
Cycle in Graphs
505
Cycle Detection (Undirected Graph) - DFS
506
Bipartite Graph
507
Cycle Detection (Directed graph) - DFS
508
Extra Read
509
Topological Sorting (using DFS)
510
Topological Sort using BFS (Kahn's Algorithm)
511
Topological Sort using BFS (Code)
512
All Paths from Source to Target
513
Dijkstra's Algorithm
514
Dijkstra's Algorithm (Code)
515
Bellman Ford Algorithm
516
Bellman Ford (Code)
517
What is MST?
518
Prim's Algorithm
519
Prim's Code
520
Cheapest Flights within K Stops
521
Cheapest Flights within K Stops (Code)
522
Connecting Cities
523
Connecting Cities (Code)
524
Disjoint Set Union
525
Kruskal's Algorithm
526
Flood Fill Algorithm
527
Strongly Connected Components (Kosaraju's Algorithm)
528
Bridge in Graph (Tarjan's Algorithm)
529
Articulation Point (Tarjan's Algorithm)
530
Introduction to DP
531
What is DP? (Definition)
532
Ways of DP
533
7 Important Concepts
534
Climbing Stairs (Recursion)
535
Climbing Stairs (Memoization DP)
536
Climbing Stairs Variation
537
Climbing Stairs (Tabulation DP)
538
Types of Knapsack problems
539
0-1 Knapsack (Recursion)
540
0-1 Knapsack (Memoization)
541
0-1 Knapsack (Tabulation)
542
Target Sum Subset (Tabulation)
543
Target Sum Subset (Code)
544
Unbounded Knapsack (Tabulation)
545
Coin Change (Live Class)
546
Rod Cutting
547
Longest Common Subsequence (Recursion)
548
LCS (Memoization)
549
LCS (Tabulation)
550
Longest Common Substring
551
Longest Increasing Subsequence
552
Edit Distance (Explanation)
553
Edit Distance (Code)
554
String Conversion
555
Wildcard Matching - Hard (Explanation)
556
Wildcard Matching (Code)
557
Catalan's Number (Recursion + Memoization)
558
Catalan's Number (Tabulation)
559
Count BSTs
560
Mountain Ranges
561
Basics of Matrices (Math)
562
Matrix Chain Multiplication (Recursion)
563
MCM (Memoization)
564
MCM (Tabulation)
565
Minimum Partitioning
566
Minimum Array Jumps (Explanation)
567
Minimum Array Jumps (Code)
568
Segment Trees Introduction
569
Count & Meaning of Nodes
570
Creation of ST
571
Queries on ST
572
Update on ST
573
Max/Min Segment Tree (Creation)
574
Max/Min Segment Tree (Query/Update)
Requirements
- Basic computer knowledge
- Internet connection for video streaming
- Code editor (VS Code recommended)
- Motivation to learn and practice
Course Features
Lifetime Access
Certificate of Completion
Mobile and Desktop Access
Downloadable Resources
Community Support
₹0
View Course4.5 (572 reviews)
Course Details
Duration6h 28m
LevelAdvanced
LanguageHindi
Students544
Updated2025-10-20
Similar Courses in this Category
Namaste DSA
From zero to hero in Data Structures & Algorithms. Structured, hands-on, problem-solving heavy course which aims at giving you huge conceptual clarity and interview-readiness. :contentReference[oaicite:2]{index=2}
Akshay Saini4.9
Strivers-A2Z-DSA
Learn Strivers A2Z-DSA Course | DSA Playlist | Placements by take U forward with comprehensive video tutorials and hands-on projects.
Take U Forward4.9
Rohit-Negi-DSA
Learn Rohit Negi DSA Course with comprehensive video tutorials and hands-on projects.
Rohit Negi5.0
SIGMA-9-CPP
SIGMA-9 CPP DSA by Apna college video tutorials and hands-on projects.
Apna College4.9
Ready to Start Learning?
Join thousands of students who have already enrolled in this course.
Start Learning Now