{"id":19642116,"url":"https://github.com/developer-ronnie/complete-leetcode-solutions","last_synced_at":"2026-02-13T00:06:52.719Z","repository":{"id":249417520,"uuid":"831459905","full_name":"Developer-RONNIE/complete-leetcode-solutions","owner":"Developer-RONNIE","description":"Master DSA! Practice with LeetCode to solidify your understanding and refine your coding skills for real-world interview challenges.","archived":false,"fork":false,"pushed_at":"2024-07-27T14:20:25.000Z","size":461,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-26T23:16:47.745Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"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/Developer-RONNIE.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":"2024-07-20T16:01:34.000Z","updated_at":"2024-07-27T14:20:28.000Z","dependencies_parsed_at":"2024-11-11T14:11:38.452Z","dependency_job_id":"a6ff6367-b5c6-436d-a4d4-69f3a82b55ad","html_url":"https://github.com/Developer-RONNIE/complete-leetcode-solutions","commit_stats":null,"previous_names":["developer-ronnie/complete-leetcode-solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Developer-RONNIE/complete-leetcode-solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Developer-RONNIE%2Fcomplete-leetcode-solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Developer-RONNIE%2Fcomplete-leetcode-solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Developer-RONNIE%2Fcomplete-leetcode-solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Developer-RONNIE%2Fcomplete-leetcode-solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Developer-RONNIE","download_url":"https://codeload.github.com/Developer-RONNIE/complete-leetcode-solutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Developer-RONNIE%2Fcomplete-leetcode-solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274128645,"owners_count":25227066,"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","status":"online","status_checked_at":"2025-09-08T02:00:09.813Z","response_time":121,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2024-11-11T14:11:35.908Z","updated_at":"2026-02-13T00:06:52.713Z","avatar_url":"https://github.com/Developer-RONNIE.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e\n    Welcome to Structured Leetcode Solutions | Java ☕\n\u003c/h1\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003ca name=\"logo\"\u003e\n    \u003cimg src=\"https://github.com/Developer-RONNIE/complete-leetcode-solutions/blob/main/assets/Leetcode%20Banner%20.png\" alt=\"Complete DSA Preparation\" width=\"750\"\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\n\u003ch4 align=\"center\"\u003eMake sure to :star: my DSA repo so you can keep up to date on any daily progress!\u003c/h4\u003e\n\n\u003cp align=\"center\"\u003e\n   \u003ca href=\"https://github.com/Developer-RONNIE/DSA-Bootcamp-Java\" alt=\"Github\" title=\"github\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/DSA--Guide--Java-blue?style=for-the-badge\u0026logo=github\u0026logoColor=white\" align=\"center\" alt=\"Github\"/\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\n  \n\n\u003cp align=\"center\"\u003e\n    Welcome to the Complete DSA Preparation Course - Java! This repository is your comprehensive guide to mastering Data Structures and Algorithms (DSA) using Java. Whether you're a beginner or looking to sharpen your skills, this course covers all the essential topics needed to excel in coding interviews and software development.\n\u003c/p\u003e\n\n\n\u003ch2 align=\"center\"\u003e\n    Table Content\n\u003c/h2\u003e\n\n\u003e \"For coding interview preparation, LeetCode \u0026 GeeksforGeeks is one of the best online resource providing a rich library of more than 500+ real coding interview questions for you \"\n\n:green_square:\n:orange_square:\n:red_square:\n\n### Mathematics\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n|1|Absolute value||[Theory](https://www.geeksforgeeks.org/program-to-find-absolute-value-of-a-given-number/)||:green_square: Easy| abs() |\n|2| Celsius To Fahrenheit ||[Theory](https://www.geeksforgeeks.org/program-celsius-fahrenheit-conversion/)||:green_square: Easy| Math |\n|3| Roots of Quadratic equation||[Theory](https://www.geeksforgeeks.org/program-to-find-the-roots-of-quadratic-equation/)||:green_square: Easy| Math |\n|4| [Factorial Of Number](https://practice.geeksforgeeks.org/problems/factorial5739/1)||||:green_square: Easy| Math |\n|5| [Count digits in a factorial ](https://practice.geeksforgeeks.org/problems/count-digits-in-a-factorial3957/1)||||:green_square: Easy| Factorial, Math |\n|6| [Series GP](https://practice.geeksforgeeks.org/problems/series-gp4646/1)||||:green_square: Easy| Basic Math |\n|7| [Prime Number](https://practice.geeksforgeeks.org/problems/prime-number2314/1)||||:green_square: Easy| Basic Math |\n|8| Exactly 3 Divisors ||[Theory](https://www.geeksforgeeks.org/numbers-exactly-3-divisors/)||:green_square: Easy| Basic Math |\n|9| Addition Under Modulo||[Theory](https://www.geeksforgeeks.org/sum-of-two-numbers-modulo-m/)||:green_square: Easy| Modulo |\n|10| Multiplication Under Modulo||[Theory](https://www.geeksforgeeks.org/multiply-large-integers-under-large-modulo/)||:green_square: Easy| Modulo |\n|11| [Modular Multiplicative Inverse](https://practice.geeksforgeeks.org/problems/modular-multiplicative-inverse-1587115620/1)||||:green_square: Easy| Modulo |\n|12| [Trailing zeroes in factorial](https://practice.geeksforgeeks.org/problems/trailing-zeroes-in-factorial5134/1)||||:orange_square: Medium| Logic |\n|13| [Prime Factors ](https://practice.geeksforgeeks.org/problems/prime-factors5052/1)||||:orange_square: Medium| Prime |\n\n### Bits Manipulation\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n|1| [Find first set bit](https://practice.geeksforgeeks.org/problems/find-first-set-bit-1587115620/1)| | | |:green_square: Easy| Bits, Modulo |\n|2| [Rightmost different bit ](https://practice.geeksforgeeks.org/problems/rightmost-different-bit-1587115621/1)| | | |:green_square: Easy| XOR, Modulo |\n|3| [Check whether K-th bit is set or not ](https://practice.geeksforgeeks.org/problems/check-whether-k-th-bit-is-set-or-not-1587115620/1)| | | |:green_square: Easy| XOR, Modulo |\n|4| [Count total set bits ](https://practice.geeksforgeeks.org/problems/count-total-set-bits-1587115620/1)| | | |:orange_square: Medium| RIght shift |\n|5| [Bit Difference ](https://practice.geeksforgeeks.org/problems/bit-difference-1587115620/1)| | | |:green_square: Easy| Bits |\n|6| [Number is sparse or not  ](https://practice.geeksforgeeks.org/problems/number-is-sparse-or-not-1587115620/1)| | | |:green_square: Easy| Bits |\n|7| [Longest Consecutive 1's  ](https://practice.geeksforgeeks.org/problems/longest-consecutive-1s-1587115620/1)| | | |:green_square: Easy| Bits |\n|8| [ Gray Code    ](https://practice.geeksforgeeks.org/problems/gray-code4907/1)| | | |:green_square: Easy| Xor, Right Shift |\n|9| [Gray to Binary equivalent   ](https://practice.geeksforgeeks.org/problems/gray-to-binary-equivalent-1587115620/1)| | | |:green_square: Easy| Xor, Right Shift |\n|10| [Power of 2](https://practice.geeksforgeeks.org/problems/power-of-2-1587115620/1)| | | |:green_square: Easy| AND |\n|11| [Swap all odd and even bits](https://practice.geeksforgeeks.org/problems/swap-all-odd-and-even-bits-1587115621/1)| | | |:green_square: Easy| OR |\n|12| [Maximum AND Value ](https://practice.geeksforgeeks.org/problems/maximum-and-value-1587115620/1)| | | |:orange_square: Medium| AND |\n\n### Recursion\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n|1| [Print 1 to n without using loops](https://practice.geeksforgeeks.org/problems/print-1-to-n-without-using-loops3621/1)| | | |:green_square: Easy| Recursion|\n|2| [Sum Of Digits ](https://practice.geeksforgeeks.org/problems/sum-of-digits1742/1)| | | |:green_square: Easy|Recursion|\n|3| [Count Total Digits in a Number  ](https://practice.geeksforgeeks.org/problems/count-total-digits-in-a-number/1)| | | |:green_square: Easy|Recursion|\n|4| [Digital Root  ](https://practice.geeksforgeeks.org/problems/digital-root/1/)| | | |:orange_square: Medium|Recursion|\n|5| [Fibonacci Using Recursion](https://practice.geeksforgeeks.org/problems/fibonacci-using-recursion/1/)| | | |:green_square: Easy|Recursion|\n|6| [Tower Of Hanoi](https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1)| | | |:orange_square: Medium|Recursion|\n|7| [Josephus problem](https://practice.geeksforgeeks.org/problems/josephus-problem/1)| | | |:orange_square: Medium|Recursion|\n\n### Arrays\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Searching\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Sorting\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Matrix\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n|1|[What is Multidimensional Arrays c++](https://www.geeksforgeeks.org/multidimensional-arrays-c-cpp/)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/multi%20dimension%20array.pdf)|[Video](https://youtu.be/TfE2c7SXaUo)|:green_square: Easy| Matrix, Array |\n|2|[Sum of upper and lower triangles ](https://practice.geeksforgeeks.org/problems/sum-of-upper-and-lower-triangles-1587115621/1)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Sum%20of%20upper%20and%20lower%20triangles.pdf)|[Solution](https://youtu.be/YuqtMC6Nvg8)|:green_square: Easy| Matrix, Array|\n|3|[Transpose of Matrix ](https://practice.geeksforgeeks.org/problems/transpose-of-matrix-1587115621/1)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Transpose%20of%20Matrix.pdf)|[Solution](https://youtu.be/n3-XWx-Inns)|:green_square: Easy| Matrix, Array|\n|4|[Rotate by 90 degree ](https://practice.geeksforgeeks.org/problems/rotate-by-90-degree-1587115621/1)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Rotate%20by%2090%20degree.pdf)|[Solution](https://youtu.be/yIUryrv2I7I)|:green_square: Easy| Matrix, Array|\n|5|[Multiply the matrices  ](https://practice.geeksforgeeks.org/problems/multiply-the-matrices-1587115620/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Multiply%20two%20matrices.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Multiply%20two%20matrices.pdf)|[Solution](https://youtu.be/DvG9SF2VXL4)|:green_square: Easy| Matrix, Array|\n|6|[ Spirally traversing a matrix  ](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Spirally%20traversing%20a%20matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Spirally%20traversing%20a%20matrix%20.pdf)|[Solution](https://youtu.be/4mSTiSBk_iY)|:orange_square: Medium| Matrix, Array|\n|7|[ Interchanging the rows of a Matrix   ](https://practice.geeksforgeeks.org/problems/reversing-the-rows-of-a-matrix-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Interchanging%20the%20rows%20of%20a%20Matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Interchanging%20The%20Rows%20of%20a%20Matrix.pdf)|[Solution](https://youtu.be/72UDspLEZAg)|:green_square: Easy| Matrix, Array|\n|8|[ Matrix Interchange ](https://practice.geeksforgeeks.org/problems/matrix-interchange/1)||| Practice |:green_square: Easy| Matrix, Array|\n|9|[ Search in a row-column sorted Matrix   ](https://practice.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Search%20in%20a%20row-column%20sorted%20Matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Search%20in%20a%20row-column%20sorted%20Matrix.pdf)|[Solution](https://youtu.be/Gy0WeuIuTg4)|:orange_square: Medium| Matrix, Array|\n|10|[ Boolean Matrix   ](https://practice.geeksforgeeks.org/problems/boolean-matrix-problem-1587115620/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Boolean%20Matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Boolean%20Matrix.pdf)|[Solution](https://youtu.be/TBTNZXzwpP8)|:orange_square: Medium| Matrix, Array|\n\n\n\n\n### Hashing\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### String\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Linked List\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Stack\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Queue\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Tree\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Binary Search Tree\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Heap\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Graph\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Greedy\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Backtracking\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Dynamic Programming\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n### Trie\n|  #  |      Title     |   Code   |    Resource   |  Video  | Difficulty  |                  \n|-----|----------------|----------|---------------|---------|-------------|\n\n\n---\n\n\n\u003ch2 align=\"center\"\u003e\n    Connect With Me \n\u003c/h2\u003e\n\nLet me know your views on the repository or any changes or improvements at \n[LinkedIn](https://www.linkedin.com/in/alapan-banerjee/), [Telegram](https://telegram.me/DeveloperRONNIE)\n\n\u003cp align = \"center\"\u003e\n    \u003ca href=\"https://telegram.me/DeveloperRONNIE\" target=\"_blank\"\u003e\u003cimg src=\"https://github.com/Developer-RONNIE/complete-leetcode-solutions/blob/main/assets/telegram.png\" alt=\"telegram\" width=\"60\"/\u003e\u003c/a\u003e\n    \u003ca href=\"https://x.com/ronnie002_\" target=\"_blank\"\u003e\u003cimg src=\"https://github.com/Developer-RONNIE/complete-leetcode-solutions/blob/main/assets/twitter-x-logo.png\" alt=\"X\" width=\"60\"/\u003e\u003c/a\u003e\n    \u003ca href=\"https://www.linkedin.com/in/alapan-banerjee/\" target=\"_blank\"\u003e\u003cimg src=\"https://github.com/Developer-RONNIE/complete-leetcode-solutions/blob/main/assets/linkedin.png\" alt=\"Linkedin\" width=\"60\"/\u003e\u003c/a\u003e\n\u003c/p\u003e\n\n\n\n\n\n\n\n***Do star ⭐, fork and share the repo to show your support, it would help others too!***   \n\n\n\n\n\n\n\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdeveloper-ronnie%2Fcomplete-leetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdeveloper-ronnie%2Fcomplete-leetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdeveloper-ronnie%2Fcomplete-leetcode-solutions/lists"}