Skip to content

Commit c39a344

Browse files
Updated in java Syllabus
1 parent fae2a90 commit c39a344

File tree

1 file changed

+21
-36
lines changed

1 file changed

+21
-36
lines changed

README.md

+21-36
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,13 @@
1-
# Complete Java + DSA Syllabus
1+
# <p align="center"> Complete Java + DSA Syllabus </p>
22

3-
4-
## Syallbus...
3+
## Syallbus
54

6-
- Functions
7-
- Introduction
5+
- ### Functions
86
- Scoping in Java
97
- Shadowing
108
- Variable Length Arguments
119
- Overloading
12-
- Arrays
13-
- Introduction
10+
- ### Arrays
1411
- Memory management
1512
- Input and Output
1613
- ArrayList Introduction
@@ -24,15 +21,13 @@
2421
- Selection Sort
2522
- Bubble Sort
2623
- Cyclic Sort
27-
- Pattern questions
28-
- Strings
29-
- Introduction
24+
- ### Pattern questions(Self Practice)
25+
- ### Strings
3026
- How Strings work
3127
- Comparison of methods
3228
- Operations in Strings
3329
- StringBuilder in java
34-
- Maths for DSA
35-
- Introduction
30+
- ### Maths for DSA
3631
- Complete Bitwise Operators
3732
- Range of numbers
3833
- Prime numbers
@@ -43,8 +38,7 @@
4338
- Number Theory
4439
- HCF / LCM
4540
- Euclidean algorithm
46-
- Recursion
47-
- Introduction
41+
- ### Recursion
4842
- Flow of recursive programs - stack
4943
- Tree building of function calls
5044
- Tail recursion
@@ -61,8 +55,7 @@
6155
- Recursion Array Problems
6256
- Recursion Pattern Problems
6357
- Subset Questions
64-
- Space and Time Complexity Analysis
65-
- Introduction
58+
- ### Space and Time Complexity Analysis
6659
- Comparisons of various cases
6760
- Solving Linear Recurrence Relations
6861
- Solving Divide and Conquer Recurrence Relations
@@ -72,8 +65,7 @@
7265
- Complexity discussion of all the problems we do
7366
- Space Complexity
7467
- NP-Completeness Introduction
75-
- Object Oriented Programming
76-
- Introduction
68+
- ### Object Oriented Programming
7769
- Classes & its instances
7870
- this keyword in Java
7971
- Properties
@@ -98,39 +90,34 @@
9890
- Vector Class
9991
- Lambda Expression
10092
- Enums
101-
- Linked List
102-
- Introduction
93+
- ### Linked List
10394
- Singly + Doubly + Circular LinkedList
10495
- Fast and slow pointer
10596
- Cycle Detection
10697
- Reversal of LinkedList
10798
- Linked List + Recursion
108-
- Stacks & Queues
109-
- Introduction
99+
- ### Stacks & Queues
110100
- Push efficient
111101
- Pop efficient
112102
- Circular Queue
113103
- Queue using Stack and Vice versa
114104
- Interview problems
115-
- Trees
116-
- Introduction
105+
- ### Trees
117106
- Binary Trees
118107
- Binary Search Trees
119108
- DFS
120109
- BFS
121110
- AVL Trees
122111
- Segment Tree
123-
- Heaps
124-
- Introduction
112+
- ### Heaps
125113
- Theory
126114
- Priority Queue
127115
- Heapsort
128116
- Two Heaps Method
129117
- k-way merge
130118
- Top k elements
131119
- Interval problems
132-
- HashMap
133-
- Introduction
120+
- ### HashMap
134121
- Theory - how it works
135122
- Comparisons of various forms
136123
- Limitations and how to solve
@@ -141,9 +128,8 @@
141128
- Chaining
142129
- Probing
143130
- Huffman-Encoder
144-
- Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
145-
- Graphs
146-
- Introduction
131+
- ### Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
132+
- ### Graphs
147133
- BFS
148134
- DFS
149135
- Working with graph components
@@ -154,19 +140,18 @@
154140
- Topological Sort
155141
- Bellman ford
156142
- A* pathfinding Algorithm
157-
- Dynamic Programming
158-
- Introduction
143+
- ### Dynamic Programming
159144
- Recursion + Recursion DP + Iteration + Iteration Space Optimized
160145
- Complexity Analysis
161146
- 0/1 Knapsack
162147
- Subset Questions
163148
- Unbounded Knapsack
164149
- Subsequence questions
165150
- String DP
166-
- Greedy Algorithms
167-
- Tries
151+
- ### Greedy Algorithms
152+
- ### Tries
168153

169-
### Advanced concepts apart from interviews
154+
## Advanced concepts apart from interviews
170155
- Fast IO
171156
- File handling
172157
- Bitwise + DP

0 commit comments

Comments
 (0)