Skip to content

Commit d587dd8

Browse files
DeathwearDeathwear
committed
Merge remote-tracking branch 'origin/main'
2 parents 8f51d5f + d15bd8c commit d587dd8

16 files changed

Lines changed: 251 additions & 3 deletions

File tree

‎.idea/misc.xml‎

Lines changed: 1 addition & 1 deletion
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎Method/Example.java‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ public static void main(String[] args) {
99
}
1010

1111
static String greet(){
12-
String greeting = "Hello world...!!";
13-
return greeting;
12+
String welcome = "Hello world...!!";
13+
return welcome;
1414
}
1515
}

‎out/production/code/.idea/.gitignore‎

Lines changed: 3 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎out/production/code/.idea/misc.xml‎

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎out/production/code/.idea/modules.xml‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎out/production/code/.idea/vcs.xml‎

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎out/production/code/Calculator.class‎

1.32 KB
Binary file not shown.

‎out/production/code/Method/Example.class‎

707 Bytes
Binary file not shown.

‎out/production/code/README.md‎

Lines changed: 214 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,214 @@
1+
# Java_learning
2+
Here I am practicing Java Programming language in detail.
3+
4+
5+
6+
# Complete Java + DSA Bootcamp Syllabus
7+
8+
## NOTE
9+
- All topics will contain problems from LeetCode Easy to Hard, explained in an easy-to-understand manner.
10+
- Complete custom implementation of all Data Structures and Algorithms.
11+
12+
## Lectures
13+
14+
- Introduction to Programming
15+
- Types of languages
16+
- Memory management
17+
- Flow of the program
18+
- Flowcharts
19+
- Pseudocode
20+
- Introduction to Java
21+
- Introduction
22+
- How it works
23+
- Setup Installation
24+
- Input and Output in Java
25+
- Conditionals & Loops in Java
26+
- if-else
27+
- loops
28+
- Switch statements
29+
- Data-types
30+
- Coding best practices
31+
- Functions
32+
- Introduction
33+
- Scoping in Java
34+
- Shadowing
35+
- Variable Length Arguments
36+
- Overloading
37+
- Arrays
38+
- Introduction
39+
- Memory management
40+
- Input and Output
41+
- ArrayList Introduction
42+
- Searching
43+
- Linear Search
44+
- Binary Search
45+
- Modified Binary Search
46+
- Binary Search on 2D Arrays
47+
- Sorting
48+
- Insertion Sort
49+
- Selection Sort
50+
- Bubble Sort
51+
- Cyclic Sort
52+
- Pattern questions
53+
- Strings
54+
- Introduction
55+
- How Strings work
56+
- Comparison of methods
57+
- Operations in Strings
58+
- StringBuilder in java
59+
- Maths for DSA
60+
- Introduction
61+
- Complete Bitwise Operators
62+
- Range of numbers
63+
- Prime numbers
64+
- Sieve of Eratosthenes
65+
- Newton's Square Root Method
66+
- Factors
67+
- Modulo properties
68+
- Number Theory
69+
- HCF / LCM
70+
- Euclidean algorithm
71+
- Recursion
72+
- Introduction
73+
- Flow of recursive programs - stacks
74+
- Why recursion?
75+
- Tree building of function calls
76+
- Tail recursion
77+
- Sorting
78+
- Merge Sort
79+
- Quick Sort
80+
- Backtracking
81+
- N-Queens
82+
- N-Knights
83+
- Sudoku Solver
84+
- Maze problems
85+
- Recursion String Problems
86+
- Recursion Google, Amazon Questions
87+
- Recursion Array Problems
88+
- Recursion Pattern Problems
89+
- Subset Questions
90+
- Space and Time Complexity Analysis
91+
- Introduction
92+
- Comparisons of various cases
93+
- Solving Linear Recurrence Relations
94+
- Solving Divide and Conquer Recurrence Relations
95+
- Big-O, Big-Omega, Big-Theta Notations
96+
- Little Notations
97+
- Get equation of any relation easily - best and easiest approach
98+
- Complexity discussion of all the problems we do
99+
- Space Complexity
100+
- NP-Completeness Introduction
101+
- Object Oriented Programming
102+
- Introduction
103+
- Classes & its instances
104+
- this keyword in Java
105+
- Properties
106+
- Inheritance
107+
- Abstraction
108+
- Polymorphism
109+
- Encapsulation
110+
- Overloading & Overriding
111+
- Static & Non-Static
112+
- Packages
113+
- Access Control
114+
- Interfaces
115+
- Abstract Classes
116+
- Annotations)
117+
- Singleton Class
118+
- final, finalize, finally
119+
- Object Cloning
120+
- Object Class
121+
- Generics
122+
- Exception Handling
123+
- Collections Framework
124+
- Vector Class
125+
- Lambda Expression
126+
- Enums
127+
- Linked List
128+
- Introduction
129+
- Singly + Doubly + Circlar LinkedList
130+
- Fast and slow pointer
131+
- Cycle Detection
132+
- Reversal of LinkedList
133+
- Linked List + Recursion
134+
- Stacks & Queues
135+
- Introduction
136+
- Interview problems
137+
- Push efficient
138+
- Pop efficient
139+
- Queue using Stack and Vice versa
140+
- Circular Queue
141+
- Trees
142+
- Introduction
143+
- Binary Trees
144+
- Binary Search Trees
145+
- DFS
146+
- BFS
147+
- AVL Trees
148+
- Segment Tree
149+
- Heaps
150+
- Introduction
151+
- Theory
152+
- Priority Queue
153+
- Heapsort
154+
- Two Heaps Method
155+
- k-way merge
156+
- Top k elements
157+
- Interval problems
158+
- HashMap
159+
- Introduction
160+
- Theory - how it works
161+
- Comparisons of various forms
162+
- Limitations and how to solve
163+
- Map using LinkedList
164+
- Map using Hash
165+
- Count Sort
166+
- Radix Sort
167+
- Chaining
168+
- Probing
169+
- Huffman-Encoder
170+
- Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
171+
- Graphs
172+
- Introduction
173+
- BFS
174+
- DFS
175+
- Working with graph components
176+
- Minimum Spanning Trees
177+
- Kruskal Algorithm
178+
- Prims Algorithm
179+
- Dijkstra’s shortest path algorithm
180+
- Topological Sort
181+
- Bellman ford
182+
- A* pathfinding Algorithm
183+
- Dynamic Programming
184+
- Introduction
185+
- Recursion + Recursion DP + Iteration + Iteration Space Optimized
186+
- Complexity Analysis
187+
- 0/1 Knapsack
188+
- Subset Questions
189+
- Unbounded Knapsack
190+
- Subsequence questions
191+
- String DP
192+
- Greedy Algorithms
193+
- Tries
194+
195+
### Advanced concepts apart from interviews
196+
- Fast IO
197+
- File handling
198+
- Bitwise + DP
199+
- Extended Euclidean algorithm
200+
- Modulo Multiplicative Inverse
201+
- Linear Diophantine Equations
202+
- Matrix Exponentiation
203+
- Mathematical Expectation
204+
- Catalan Numbers
205+
- Fermat’s Theorem
206+
- Wilson's Theorem
207+
- Euler's Theorem
208+
- Lucas Theorem
209+
- Chinese Remainder Theorem
210+
- Euler Totient
211+
- NP-Completeness
212+
- Multithreading
213+
- Fenwick Tree / Binary Indexed Tree
214+
- Square Root Decomposition

‎out/production/code/Switch/Example2.class‎

1.12 KB
Binary file not shown.

0 commit comments

Comments
 (0)