Closed kunal-kushwaha closed 3 years ago
Nice
Really helpful!
This is the best DSA Course ever.....
Yes I know. This is the BEST.
On Wed, Aug 25, 2021, 11:22 PushkarAdhyapak @.***> wrote:
This is the best DSA Course ever.....
— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/kunal-kushwaha/DSA-Bootcamp-Java/issues/55#issuecomment-905203759, or unsubscribe https://github.com/notifications/unsubscribe-auth/AKRGRRDFFJ2MAKNJZN3QDZ3T6SAIDANCNFSM5BXDQFCA . Triage notifications on the go with GitHub Mobile for iOS https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675 or Android https://play.google.com/store/apps/details?id=com.github.android&utm_campaign=notification-email .
how can I create the same issue in my forked repo to record my own progress? Thanks in advance and keep up the good work you are doing✨
It's showing amazing growth in a little time.
Excited to learn more
View it on github
On Sun, Aug 29, 2021, 4:39 AM tuba-mouqeem @.***> wrote:
Excited to learn more
— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/kunal-kushwaha/DSA-Bootcamp-Java/issues/55#issuecomment-907701041, or unsubscribe https://github.com/notifications/unsubscribe-auth/AVIWCSOCJ6BEHMEGCBS26QTT7FUCXANCNFSM5BXDQFCA . Triage notifications on the go with GitHub Mobile for iOS https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675 or Android https://play.google.com/store/apps/details?id=com.github.android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3Dgithub.
@kunal-kushwaha bhaiya your content is amazing. I am a second year student CSE and when have i studied from your contents then i left my online classes and now i am studying from your content. Huge respect++ of your works. A little bit Thank you @kunal-kushwaha bhaiya ....!
It's really amazing.. It helps me lot!
Best DSA course I have seen till now🔥🔥🔥
ufff.. man of his words
Excited to learn more. This is the best DSA course I have seen till now. Thank you @kunal-kushwaha for these amazing contents.
Kunal Bhaiya! All the best!
Thanks for this wonderful course. But Kunal if I may ask you, do you mind continuing on making courses on JAVA and not just stopping on DSA? Front-End and Backend with Spring, SpringBoot, Spring DATA JPA, JAVA essentials and so on.
I understand asking of you for more such courses for free sounds a bit greedy, but if I don't want to stop Learning, hope you understand.
Edit P.S : Please don't go by my name. I'm a different guy !!!
@kunal-kushwaha thanks alot :)
When will next class will come
Oh man ... Excited for the upcoming
Well Structured. Thanks a lot! :)
@kunal-kushwaha one of the best free dsa course I have ever seen. Apart from clearing concepts, The main thing which i got from this course is the confidence in attempting medium and hard questions on leetcode and also being able to solve. Thank you for such a great course. Excited for the upcoming.
🔥🔥
Thanks brother
Really Excited for the upcoming days
If God exists, then they may bless you.
Thank you so much !
What is this is Kunal not making another videos?
On Fri, 10 Sep 2021, 23:08 Kazi Abdur Rakib @.*** wrote:
Thank you so much !
— You are receiving this because you commented. Reply to this email directly, view it on GitHub https://github.com/kunal-kushwaha/DSA-Bootcamp-Java/issues/55#issuecomment-917087979, or unsubscribe https://github.com/notifications/unsubscribe-auth/AVPWIFCJJTA2G3RBP6X2EU3UBI7CTANCNFSM5BXDQFCA . Triage notifications on the go with GitHub Mobile for iOS https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675 or Android https://play.google.com/store/apps/details?id=com.github.android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3Dgithub.
What is this is Kunal not making another videos? … On Fri, 10 Sep 2021, 23:08 Kazi Abdur Rakib @.*** wrote: Thank you so much ! — You are receiving this because you commented. Reply to this email directly, view it on GitHub <#55 (comment)>, or unsubscribe https://github.com/notifications/unsubscribe-auth/AVPWIFCJJTA2G3RBP6X2EU3UBI7CTANCNFSM5BXDQFCA . Triage notifications on the go with GitHub Mobile for iOS https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675 or Android https://play.google.com/store/apps/details?id=com.github.android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3Dgithub.
Do you have no patience?
Wonderful brother❤
Are nhi Kunal Bhaiya mai Puchrha tha ki next video Kav aaegi I really apologize for writing like this maine kuch galat tarike se leleiya Kunal Bahiya sorry principle mera Galat nhi tha bolne ka but thoda Galat tarike se likh diya sorry Kunal bhaiya ik bar or
hey, @Jaihogggggg you need to keep patience otherwise you won't succeed.
Support someone who is doing good for you in return of nothing. @kunal-kushwaha you dont need to rush, take your time properly to make good videos as well as give time to your other ideas as well.
superb✌🤟👍🥰
Thank you so much kunal, this is amazing!!
i cant find the dates where are they
Thank u so much brother for this amazing learning opportunity.
i cant find the dates where are they
Same here, can anyone tell where to look for them?
- [x] Complete Git & GitHub Course
[x] Introduction to Programming
- [x] Types of languages
- [x] Memory management
[x] Flow of the program
- [x] Flowcharts
- [x] Pseudocode
[x] Introduction to Java
[x] Introduction
[x] How it works
[x] Setup Installation
[x] Input and Output in Java
[x] Conditionals & Loops in Java
[x] if else
[x] loops
[x] Switch statements
[x] Data types
[x] Coding best practices
[x] Functions
- [x] Introduction
- [x] Scoping in Java
- [x] Shadowing
- [x] Variable Length Arguments
- [x] Overloading
[x] Arrays
[x] Introduction
[x] Memory management
[x] Input and Output
[x] ArrayList Introduction
[x] Sorting
[x] Insertion Sort
[x] Selection Sort
[x] Bubble Sort
[x] Cyclic Sort
[x] (More ahead)
[x] Searching
[x] Linear Search
[x] Binary Search
[x] Modified Binary Search
[x] 11th Binary Search on 2D Arrays
- [x] 11th Pattern questions
[x] Strings
- [x] Introduction
- [x] How Strings work
- [x] Comparison of methods
- [x] Operations in Strings
- [x] StringBuilder in java
[ ] 12th Maths for DSA
- [ ] Introduction
- [ ] Complete Bitwise Operators
- [ ] Prime numbers
- [ ] HCF / LCM
- [ ] Sieve of Eratosthenes
- [ ] Newton's Square Root Method
- [ ] Number Theory
- [ ] Euclidean algorithm
- [ ] Modulo Properties (of -ve also)
[ ] 12th, 13th Recursion
[x] Introduction
[x] Why recursion?
[x] Flow of recursive programs stacks
[x] Tree building of function calls
[x] Tail recursion
[ ] Sorting:
[ ] Merge Sort
[ ] Quick Sort
[ ] Backtracking
[ ] Sudoku Solver
[ ] N Queens
[ ] N Knights
[ ] Maze problems
[ ] Recursion String Problems
[ ] Recursion Array Problems
[ ] Recursion Pattern Problems
[ ] Subset Questions
[ ] 14th Space and Time Complexity Analysis
- [ ] Introduction
- [ ] Comparisons of various cases
- [ ] Solving Linear Recurrence Relations
- [ ] Solving Divide and Conquer Recurrence Relations
- [ ] Big O, Big Omega, Big Theta Notations
- [ ] Get equation of any relation easily best and easiest approach
- [ ] Complexity discussion of all the problems we do
- [ ] Space Complexity
- [ ] Memory Allocation of various languages
- [ ] NP Completeness and Hardness
[ ] 15th, 16th Object Oriented Programming
[ ] Introduction
[ ] Classes & its instances
[ ] this keyword in Java
[ ] Properties
[ ] Inheritance
[ ] Abstraction
[ ] Polymorphism
[ ] Encapsulation
[ ] Overloading & Overriding
[ ] Static & Non Static
[ ] Access Control
[ ] Interfaces
[ ] Abstract Classes
[ ] Singleton Class
[ ] final, finalize, finally
[ ] Object Class
[ ] Generics
[ ] Exception Handling
[ ] Collections Framework
[ ] Lambda Expression
[ ] Enums
[ ] Fast IO
[ ] File handling
- [ ] 17th Greedy Algorithms
[ ] 18th Stacks & Queues
- [ ] Introduction
- [ ] Interview problems
- [ ] Push efficient
- [ ] Pop efficient
- [ ] Queue using Stack and Vice versa
- [ ] Circular Queue
[ ] 19th Linked List
- [ ] Introduction
- [ ] Fast and slow pointer
- [ ] Cycle Detection
- [ ] Single and Doubly LinkedList
- [ ] Reversal of LinkedList
[ ] 20th, 21st, 22nd Dynamic Programming
- [ ] Introduction
- [ ] Recursion + Recursion DP + Iteration + Iteration Space Optimized
- [ ] Complexity Analysis
- [ ] 0/1 Knapsack
- [ ] Subset Questions
- [ ] Unbounded Knapsack
- [ ] Subsequence questions
- [ ] String DP
[ ] 23rd, 24th Trees
- [ ] Introduction
- [ ] Binary Trees
- [ ] Binary Search Trees
- [ ] DFS
- [ ] BFS
- [ ] AVL Trees
- [ ] Segment Tree
- [ ] Fenwick Tree / Binary Indexed Tree
- [ ] 25th Square Root Decomposition
[ ] 26th Heaps
- [ ] Introduction
- [ ] Theory
- [ ] Priority Queue
- [ ] Heapsort
- [ ] Two Heaps Method
- [ ] k way merge
- [ ] Top k elements
- [ ] Interval problems
[ ] 27th HashMap
- [ ] Introduction
- [ ] Theory how it works
- [ ] Comparisons of various forms
- [ ] Limitations and how to solve
- [ ] Map using LinkedList
- [ ] Map using Hash
- [ ] Count Sort
- [ ] Radix Sort
- [ ] Chaining
- [ ] Probing
- [ ] Huffman Encoder
- [ ] 28th Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
- [ ] 28th Tries
[ ] 29th, 30th Graphs
- [ ] Introduction
- [ ] BFS
- [ ] DFS
- [ ] Working with graph components
- [ ] Minimum Spanning Trees
- [ ] Kruskal Algorithm
- [ ] Prims Algorithm
- [ ] Dijkstra’s shortest path algorithm
- [ ] Topological Sort
- [ ] Bellman ford
- [ ] A* pathfinding Algorithm
- [ ] Advanced Concepts for CP Maths
- [ ] Bitwise + DP
- [ ] Extended Euclidean algorithm
- [ ] Modulo Multiplicative Inverse
- [ ] Linear Diophantine Equations
- [ ] Fermat’s Theorem
- [ ] Wilson's Theorem
- [ ] Lucas Theorem
- [ ] Chinese Remainder Theorem
Can u pls tell me how many days take to complete the total syllabus..
fire !!!!!!
It's an amazing course..!! ⚡♥
In geeksforgeeks the harder problems are very difficult to understand and Sure that this course will fill the gaps🙂
- [x] Complete Git & GitHub Course
- [x] Introduction to Programming
- [x] Types of languages
- [x] Memory management
- [x] Flow of the program
- [x] Flowcharts
- [x] Pseudocode
- [x] Introduction to Java
- [x] Introduction
- [x] How it works
- [x] Setup Installation
- [x] Input and Output in Java
- [x] Conditionals & Loops in Java
- [x] if else
- [x] loops
- [x] Switch statements
- [x] Data types
- [x] Coding best practices
- [x] Functions
- [x] Introduction
- [x] Scoping in Java
- [x] Shadowing
- [x] Variable Length Arguments
- [x] Overloading
- [x] Arrays
- [x] Introduction
- [x] Memory management
- [x] Input and Output
- [x] ArrayList Introduction
- [x] Sorting
- [x] Insertion Sort
- [x] Selection Sort
- [x] Bubble Sort
- [x] Cyclic Sort
- [x] (More ahead)
- [x] Searching
- [x] Linear Search
- [x] Binary Search
- [x] Modified Binary Search
- [x] 11th Binary Search on 2D Arrays
- [x] 11th Pattern questions
- [x] Strings
- [x] Introduction
- [x] How Strings work
- [x] Comparison of methods
- [x] Operations in Strings
- [x] StringBuilder in java
- [ ] 12th Recursion
- [x] Introduction
- [x] Why recursion?
- [x] Flow of recursive programs stacks
- [x] Tree building of function calls
- [x] Tail recursion
- [ ] 17th Sorting:
- [ ] Merge Sort
- [ ] Quick Sort
- [ ] Backtracking
- [ ] Sudoku Solver
- [ ] N Queens
- [ ] N Knights
- [ ] Maze problems
- [ ] Recursion String Problems
- [ ] Recursion Array Problems (RBS too)
- [ ] Recursion Pattern Problems
- [ ] Subset Questions
- [x] 16th Space and Time Complexity Analysis
- [x] Introduction
- [x] Comparisons of various cases
- [x] Solving Linear Recurrence Relations
- [x] Solving Divide and Conquer Recurrence Relations
- [x] Big O, Big Omega, Big Theta Notations
- [x] Little Notations
- [x] Get equation of any relation easily best and easiest approach
- [x] Complexity discussion of all the problems we do
- [x] Space Complexity
- [x] Memory Allocation of various languages
- [x] NP-Completeness Introduction
- [ ] 16th Maths for DSA
- [ ] Introduction
- [ ] Complete Bitwise Operators
- [ ] Prime numbers
- [ ] HCF / LCM
- [ ] Sieve of Eratosthenes
- [ ] Newton's Square Root Method
- [ ] Number Theory
- [ ] Euclidean algorithm
- [ ] Modulo Properties (of -ve also)
- [ ] 17th Object Oriented Programming
- [ ] Introduction
- [ ] Classes & its instances
- [ ] this keyword in Java
- [ ] Properties
- [ ] Inheritance
- [ ] Abstraction
- [ ] Polymorphism
- [ ] Encapsulation
- [ ] Overloading & Overriding
- [ ] Static & Non Static
- [ ] Access Control
- [ ] Interfaces
- [ ] Abstract Classes
- [ ] Singleton Class
- [ ] final, finalize, finally
- [ ] Object Class
- [ ] Generics
- [ ] Exception Handling
- [ ] Collections Framework
- [ ] Lambda Expression
- [ ] Enums
- [ ] Fast IO
- [ ] File handling
- [ ] 18th Greedy Algorithms
- [ ] 18th Stacks & Queues
- [ ] Introduction
- [ ] Interview problems
- [ ] Push efficient
- [ ] Pop efficient
- [ ] Queue using Stack and Vice versa
- [ ] Circular Queue
- [ ] 19th Linked List
- [ ] Introduction
- [ ] Fast and slow pointer
- [ ] Cycle Detection
- [ ] Single and Doubly LinkedList
- [ ] Reversal of LinkedList
- [ ] 20th, 21st, 22nd Dynamic Programming
- [ ] Introduction
- [ ] Recursion + Recursion DP + Iteration + Iteration Space Optimized
- [ ] Complexity Analysis
- [ ] 0/1 Knapsack
- [ ] Subset Questions
- [ ] Unbounded Knapsack
- [ ] Subsequence questions
- [ ] String DP
- [ ] 23rd Trees
- [ ] Introduction
- [ ] Binary Trees
- [ ] Binary Search Trees
- [ ] DFS
- [ ] BFS
- [ ] AVL Trees
- [ ] Segment Tree
- [ ] Fenwick Tree / Binary Indexed Tree
- [ ] 24th Square Root Decomposition
- [ ] 24th Heaps
- [ ] Introduction
- [ ] Theory
- [ ] Priority Queue
- [ ] Heapsort
- [ ] Two Heaps Method
- [ ] k way merge
- [ ] Top k elements
- [ ] Interval problems
- [ ] 25th HashMap
- [ ] Introduction
- [ ] Theory how it works
- [ ] Comparisons of various forms
- [ ] Limitations and how to solve
- [ ] Map using LinkedList
- [ ] Map using Hash
- [ ] Count Sort
- [ ] Radix Sort
- [ ] Chaining
- [ ] Probing
- [ ] Huffman Encoder
- [ ] 26th Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
- [ ] 26th Tries
- [ ] 27th, 28th Graphs
- [ ] Introduction
- [ ] BFS
- [ ] DFS
- [ ] Working with graph components
- [ ] Minimum Spanning Trees
- [ ] Kruskal Algorithm
- [ ] Prims Algorithm
- [ ] Dijkstra’s shortest path algorithm
- [ ] Topological Sort
- [ ] Bellman ford
- [ ] A* pathfinding Algorithm
Is space and time complexity video added on YouTube, because I'm not able to see it.
Is space and time complexity video added on YouTube, because I'm not able to see it.
No not uploaded yet
Not yet
Is space and time complexity video added on YouTube, because I'm not able to see it.
No not uploaded yet
Not yet but today it may according to the syllabus tracker
Is space and time complexity video added on YouTube, because I'm not able to see it.
Yes!
in syllabus it says maths for dsa is completed by 21 but it has not been uploaded on youtube yet??
in syllabus it says maths for dsa is completed by 21 but it has not been uploaded on youtube yet??
How to see the dates for the course? Also, Kunal sir has said it in Discord and telegram he was busy that is why there was a delay.
in syllabus it says maths for dsa is completed by 21 but it has not been uploaded on youtube yet??
How to see the dates for the course? Also, Kunal sir has said it in Discord and telegram he was busy that is why there was a delay.
Its recorded, not uploaded yet. Will be done soon.
Check https://github.com/kunal-kushwaha/DSA-Bootcamp-Java/blob/main/SYLLABUS.md for progress.