{"id":19444745,"url":"https://github.com/ayeujjawalsingh/java-practice-codes-and-notes","last_synced_at":"2025-08-07T18:39:27.733Z","repository":{"id":152543018,"uuid":"462017509","full_name":"ayeujjawalsingh/Java-Practice-Codes-And-Notes","owner":"ayeujjawalsingh","description":"Java Notes \u0026 Codes for better understanding and it contains all the funtions with examples and also added Cheat Sheet for Revision... ","archived":false,"fork":false,"pushed_at":"2022-03-27T17:36:04.000Z","size":2177,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-07T22:42:59.679Z","etag":null,"topics":["ayeujjawal","ayeujjawalsingh","codechef","codeforces","gfg","hackerrank","java","java-codes","leetcode-java"],"latest_commit_sha":null,"homepage":"https://www.linkedin.com/in/ayeujjawalsingh/","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ayeujjawalsingh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-02-21T20:16:03.000Z","updated_at":"2025-01-06T06:03:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"c9af3165-0ef9-47dd-9a52-0b18570b52bd","html_url":"https://github.com/ayeujjawalsingh/Java-Practice-Codes-And-Notes","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayeujjawalsingh%2FJava-Practice-Codes-And-Notes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayeujjawalsingh%2FJava-Practice-Codes-And-Notes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayeujjawalsingh%2FJava-Practice-Codes-And-Notes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayeujjawalsingh%2FJava-Practice-Codes-And-Notes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ayeujjawalsingh","download_url":"https://codeload.github.com/ayeujjawalsingh/Java-Practice-Codes-And-Notes/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240629410,"owners_count":19831838,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["ayeujjawal","ayeujjawalsingh","codechef","codeforces","gfg","hackerrank","java","java-codes","leetcode-java"],"created_at":"2024-11-10T16:08:04.918Z","updated_at":"2025-02-25T08:23:01.857Z","avatar_url":"https://github.com/ayeujjawalsingh.png","language":"Java","readme":"# \u003cp align=\"center\"\u003e Complete Java + DSA Syllabus \u003c/p\u003e\n\n## Syallbus\n\n- ### Functions\n    - Scoping in Java\n    - Shadowing\n    - Variable Length Arguments\n    - Overloading\n- ### Arrays\n    - Memory management\n    - Input and Output\n    - ArrayList Introduction\n    - Searching\n        - Linear Search\n        - Binary Search\n        - Modified Binary Search\n        - Binary Search on 2D Arrays\n    - Sorting\n        - Insertion Sort\n        - Selection Sort\n        - Bubble Sort\n        - Cyclic Sort\n- ### Pattern questions(Self Practice)\n- ### Strings\n    - How Strings work\n    - Comparison of methods\n    - Operations in Strings\n    - StringBuilder in java\n- ### Maths for DSA\n    - Complete Bitwise Operators\n    - Range of numbers\n    - Prime numbers\n    - Sieve of Eratosthenes\n    - Newton's Square Root Method\n    - Factors\n    - Modulo properties\n    - Number Theory\n    - HCF / LCM\n    - Euclidean algorithm\n- ### Recursion\n    - Flow of recursive programs - stack\n    - Tree building of function calls\n    - Tail recursion\n    - Sorting\n        - Merge Sort\n        - Quick Sort\n    - Backtracking\n        - N-Queens\n        - N-Knights\n        - Sudoku Solver\n        - Maze problems\n    - Recursion String Problems\n    - Recursion Google, Amazon Questions\n    - Recursion Array Problems\n    - Recursion Pattern Problems\n    - Subset Questions\n- ### Space and Time Complexity Analysis\n    - Comparisons of various cases\n    - Solving Linear Recurrence Relations\n    - Solving Divide and Conquer Recurrence Relations\n    - Big-O, Big-Omega, Big-Theta Notations\n    - Little Notations\n    - Get equation of any relation easily - best and easiest approach\n    - Complexity discussion of all the problems we do\n    - Space Complexity\n    - NP-Completeness Introduction\n- ### Object Oriented Programming\n    - Classes \u0026 its instances\n    - this keyword in Java\n    - Properties\n        - Inheritance\n        - Abstraction\n        - Polymorphism\n        - Encapsulation\n    - Overloading \u0026 Overriding\n    - Static \u0026 Non-Static\n    - Packages\n    - Access Control\n    - Interfaces\n    - Abstract Classes\n    - Annotations\n    - Singleton Class\n    - final, finalize, finally\n    - Object Cloning\n    - Object Class\n    - Generics\n    - Exception Handling\n    - Collections Framework\n    - Vector Class\n    - Lambda Expression \n    - Enums\n- ### Linked List\n    - Singly + Doubly + Circular LinkedList\n    - Fast and slow pointer\n    - Cycle Detection\n    - Reversal of LinkedList\n    - Linked List + Recursion\n- ### Stacks \u0026 Queues\n    - Push efficient\n    - Pop efficient\n    - Circular Queue\n    - Queue using Stack and Vice versa\n    - Interview problems\n- ### Trees\n    - Binary Trees\n    - Binary Search Trees\n    - DFS\n    - BFS\n    - AVL Trees\n    - Segment Tree\n- ### Heaps\n    - Theory\n    - Priority Queue\n    - Heapsort\n    - Two Heaps Method\n    - k-way merge\n    - Top k elements\n    - Interval problems\n- ### HashMap\n    - Theory - how it works\n    - Comparisons of various forms\n    - Limitations and how to solve\n    - Map using LinkedList\n    - Map using Hash\n    - Count Sort\n    - Radix Sort\n    - Chaining\n    - Probing\n    - Huffman-Encoder\n- ### Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm\n- ### Graphs\n    - BFS\n    - DFS\n    - Working with graph components\n    - Minimum Spanning Trees\n    - Kruskal Algorithm\n    - Prims Algorithm\n    - Dijkstra’s shortest path algorithm\n    - Topological Sort\n    - Bellman ford\n    - A* pathfinding Algorithm\n- ### Dynamic Programming\n    - Recursion + Recursion DP + Iteration + Iteration Space Optimized\n    - Complexity Analysis\n    - 0/1 Knapsack\n    - Subset Questions\n    - Unbounded Knapsack\n    - Subsequence questions\n    - String DP\n- ### Greedy Algorithms\n- ### Tries\n\n## Advanced concepts apart from interviews \n- Fast IO\n- File handling\n- Bitwise + DP\n- Extended Euclidean algorithm\n- Modulo Multiplicative Inverse\n- Linear Diophantine Equations\n- Matrix Exponentiation\n- Mathematical Expectation\n- Catalan Numbers\n- Fermat’s Theorem\n- Wilson's Theorem\n- Euler's Theorem\n- Lucas Theorem\n- Chinese Remainder Theorem\n- Euler Totient\n- NP-Completeness\n- Multithreading\n- Fenwick Tree / Binary Indexed Tree\n- Square Root Decomposition\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayeujjawalsingh%2Fjava-practice-codes-and-notes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fayeujjawalsingh%2Fjava-practice-codes-and-notes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayeujjawalsingh%2Fjava-practice-codes-and-notes/lists"}