Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Syllabus Progress Tracker #3

Open
thatbeautifuldream opened this issue Sep 7, 2021 · 0 comments
Open

Syllabus Progress Tracker #3

thatbeautifuldream opened this issue Sep 7, 2021 · 0 comments
Assignees
Labels
documentation Improvements or additions to documentation

Comments

@thatbeautifuldream
Copy link
Owner

thatbeautifuldream commented Sep 7, 2021

  • Complete Git & GitHub Course
  • Introduction to Programming
  • Flow of the program
  • Introduction to Java
  • Functions
  • Arrays
  • Pattern questions
  • Strings
    • Introduction
    • How Strings work
    • Comparison of methods
    • Operations in Strings
    • StringBuilder in java
  • Maths for DSA
    • Introduction
    • Complete Bitwise Operators
    • Prime numbers
    • HCF / LCM
    • Sieve of Eratosthenes
    • Newton's Square Root Method
    • Number Theory
    • Euclidean algorithm
    • Advanced Concepts for CP (later in the course)
      • Bitwise + DP
      • Extended Euclidean algorithm
      • Modulo Properties
      • Modulo Multiplicative Inverse
      • Linear Diophantine Equations
      • Fermat’s Theorem
      • Wilson's Theorem
      • Lucas Theorem
      • Chinese Remainder Theorem
  • Recursion
    • Introduction
    • Why recursion?
    • Flow of recursive programs - stacks
    • Convert recursion to iteration
    • Tree building of function calls
    • 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
  • 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
  • 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
  • Greedy Algorithms
  • Stacks & Queues
    • Introduction
    • Interview problems
    • Push efficient
    • Pop efficient
    • Queue using Stack and Vice versa
    • Circular Queue
  • Linked List
    • Introduction
    • Fast and slow pointer
    • Cycle Detection
    • Single and Doubly LinkedList
    • Reversal of LinkedList
  • Dynamic Programming
    • Introduction
    • Recursion + Recursion DP + Iteration + Iteration Space Optimized
    • Complexity Analysis
    • 0/1 Knapsack
    • Subset Questions
    • Unbounded Knapsack
    • Subsequence questions
    • String DP
  • Trees
    • Introduction
    • Binary Trees
    • Binary Search Trees
    • DFS
    • BFS
    • AVL Trees
    • Segment Tree
    • Fenwick Tree / Binary Indexed Tree
  • Square Root Decomposition
  • Heaps
    • Introduction
    • Theory
    • Priority Queue
    • Heapsort
    • Two Heaps Method
    • k-way merge
    • Top k elements
    • Interval problems
  • HashMap
    • Introduction
    • Theory - how it works
    • Comparisons of various forms
    • Limitations and how to solve
    • Map using LinkedList
    • Map using Hash
    • Chaining
    • Probing
    • Huffman-Encoder
  • Tries
  • 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
Repository owner deleted a comment from github-actions bot Sep 8, 2021
@thatbeautifuldream thatbeautifuldream self-assigned this Oct 14, 2021
@thatbeautifuldream thatbeautifuldream added the documentation Improvements or additions to documentation label Oct 14, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
documentation Improvements or additions to documentation
Projects
None yet
Development

No branches or pull requests

1 participant