{"id":23343916,"url":"https://github.com/sorcererchiragsingh/java-dsa","last_synced_at":"2025-04-07T16:24:28.956Z","repository":{"id":235868526,"uuid":"791305513","full_name":"SorcererChiragsingh/Java-DSA","owner":"SorcererChiragsingh","description":"Uploading My Leetcode Answer's Over Here ","archived":false,"fork":false,"pushed_at":"2025-01-31T13:59:25.000Z","size":128,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-13T18:46:14.251Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SorcererChiragsingh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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-04-24T13:30:32.000Z","updated_at":"2025-01-31T13:59:28.000Z","dependencies_parsed_at":"2024-04-24T19:42:15.155Z","dependency_job_id":"20ff7235-7e1e-415a-bd9b-9ffc011aba37","html_url":"https://github.com/SorcererChiragsingh/Java-DSA","commit_stats":null,"previous_names":["sorcererchiragsingh/java-dsa"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SorcererChiragsingh%2FJava-DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SorcererChiragsingh%2FJava-DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SorcererChiragsingh%2FJava-DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SorcererChiragsingh%2FJava-DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SorcererChiragsingh","download_url":"https://codeload.github.com/SorcererChiragsingh/Java-DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247685981,"owners_count":20979159,"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":[],"created_at":"2024-12-21T06:17:15.090Z","updated_at":"2025-04-07T16:24:28.937Z","avatar_url":"https://github.com/SorcererChiragsingh.png","language":"Java","readme":"\u003ch1\u003eDSA Solution's in Java\u003c/h1\u003e\u003cbr\u003e\n\u003cb\u003eSolving DSA Question's From Leet code\u003c/b\u003e\u003cbr\u003e\n\u003ca href=\"https://leetcode.com/chiragsingh8926/\" target=\"_blank\"\u003eLeetCode\u003c/a\u003e\n\u003cbr\u003e\n\n\n\u003ch2\u003eVisualize Data structures \u003c/h2\u003e\n\u003cbr\u003e\nFrom these sites:- \u003cbr\u003e\n1. Pathfinding Visualizer. \n\u003ca href=\"https://clementmihailescu.github.io/Pathfinding-Visualizer/\" target=\"_blank\"\u003ePathfinding Visualizer\u003c/a\u003e\n\u003cbr\u003e\n2. VisuAlgo.\n\u003ca href=\"https://visualgo.net/en\" target=\"_blank\"\u003eVisuAlgo\u003c/a\u003e\n\u003cbr\u003e\n3. Algorithm Visualizer.\n\u003ca href=\"https://algorithm-visualizer.org\" target=\"_blank\"\u003eAlgorithm Visualizer\u003c/a\u003e\n\u003cbr\u003e\n\n\n\u003ch3\u003e Excel Sheet's Which I am Currently Following👨‍💻\u003c/h3\u003e\n\u003cbr\u003e\n1. My Solution Tracker Excel Sheet.\n\u003ca href=\"https://1drv.ms/x/c/de8097aded520007/EaOnCB2KFtZGpkVNzFcTopYBaoTnJ-ii0uqmQIA6_IZlqw?e=fxceMr\" target=\"_blank\"\u003eLink For My Excel Sheet\u003c/a\u003e\n\u003cbr\u003e\n2. Top Leetcode questions of All Time - Most Important.\n\u003ca href=\"https://1drv.ms/x/c/de8097aded520007/EXY4Y8rPIX5PmPHRQumjPFkBHjxpSXnars9w5qvy0yJRaA?e=MMe7eG\" target=\"_blank\"\u003eLink For Top Leetcode questions of All Time Excel Sheet\u003c/a\u003e\n\u003cbr\u003e\n3. Love Babbar Final 450 DSA Question.\n\u003ca href=\"https://1drv.ms/x/c/de8097aded520007/EZOqeQ3M7D1OiYMiFReB2_wBSCmVq5-Dj9arWZaxsteqMA?e=b1xLHW\" target=\"_blank\"\u003eLink For Love Babbar Final 450 DSA Question's Excel Sheet\u003c/a\u003e\n\u003cbr\u003e\n4. Blind 75 \"EXCEL SHEET\"\n\u003ca href=\"https://1drv.ms/x/c/de8097aded520007/EfJxknhhap5CtE5tH5RI4dgBLlGFZdvqrXLbtqtyxT4izg?e=9UMoyJ\" target=\"_blank\"\u003eLink For Blind 75 Excel Sheet\u003c/a\u003e\n\u003cbr\u003e\n5. Apna College DSA \"Excel Sheet\".\n\u003ca href=\"https://1drv.ms/x/c/de8097aded520007/EcdS75K0ba9CrgAAvoBaiywB6iNEcTR4aGXXsd-y1uwEZA?e=q0UiOs\" target=\"_blank\"\u003eLink For Apna College DSA Excel Sheet\u003c/a\u003e\n\u003cbr\u003e\n\n\n\u003ch4\u003eComplete DSA Roadmap🔥\u003c/h4\u003e\n\u003cul\u003e\n  \u003cli\u003eBasic Data Structures\n    \u003cul\u003e\n      \u003cli\u003eArrays\u003c/li\u003e\n      \u003cli\u003eStrings\u003c/li\u003e\n      \u003cli\u003eLinked Lists\u003c/li\u003e\n      \u003cli\u003eStacks\u003c/li\u003e\n      \u003cli\u003eQueues\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eAdvanced Data Structures\n    \u003cul\u003e\n      \u003cli\u003eTrees\n        \u003cul\u003e\n          \u003cli\u003eBinary Trees\u003c/li\u003e\n          \u003cli\u003eBinary Search Trees\u003c/li\u003e\n          \u003cli\u003eAVL Trees\u003c/li\u003e\n          \u003cli\u003eB-Trees\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003eGraphs\n        \u003cul\u003e\n          \u003cli\u003eGraph Representation\n            \u003cul\u003e\n              \u003cli\u003eAdjacency Matrix\u003c/li\u003e\n              \u003cli\u003eAdjacency List\u003c/li\u003e\n            \u003c/ul\u003e\n          \u003c/li\u003e\n          \u003cli\u003eDepth-First Search\u003c/li\u003e\n          \u003cli\u003eBreadth-First Search\u003c/li\u003e\n          \u003cli\u003eShortest Path Algorithms\n            \u003cul\u003e\n              \u003cli\u003eDijkstra's Algorithm\u003c/li\u003e\n              \u003cli\u003eBellman-Ford Algorithm\u003c/li\u003e\n            \u003c/ul\u003e\n          \u003c/li\u003e\n          \u003cli\u003eMinimum Spanning Tree\n            \u003cul\u003e\n              \u003cli\u003ePrim's Algorithm\u003c/li\u003e\n              \u003cli\u003eKruskal's Algorithm\u003c/li\u003e\n            \u003c/ul\u003e\n          \u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003eHeaps\n        \u003cul\u003e\n          \u003cli\u003eMin Heap\u003c/li\u003e\n          \u003cli\u003eMax Heap\u003c/li\u003e\n          \u003cli\u003eHeap Sort\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003eHash Tables\u003c/li\u003e\n      \u003cli\u003eDisjoint Set Union\u003c/li\u003e\n      \u003cli\u003eTrie\u003c/li\u003e\n      \u003cli\u003eSegment Tree\u003c/li\u003e\n      \u003cli\u003eFenwick Tree\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eAlgorithmic Paradigms\n    \u003cul\u003e\n      \u003cli\u003eBrute Force\u003c/li\u003e\n      \u003cli\u003eDivide and Conquer\u003c/li\u003e\n      \u003cli\u003eGreedy Algorithms\u003c/li\u003e\n      \u003cli\u003eDynamic Programming\u003c/li\u003e\n      \u003cli\u003eBacktracking\u003c/li\u003e\n      \u003cli\u003eSliding Window Technique\u003c/li\u003e\n      \u003cli\u003eTwo Pointer Technique\u003c/li\u003e\n      \u003cli\u003eDivide and Conquer Optimization\n        \u003cul\u003e\n          \u003cli\u003eMerge Sort Tree\u003c/li\u003e\n          \u003cli\u003ePersistent Segment Tree\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eSearching Algorithms\n    \u003cul\u003e\n      \u003cli\u003eLinear Search\u003c/li\u003e\n      \u003cli\u003eBinary Search\u003c/li\u003e\n      \u003cli\u003eDepth-First Search\u003c/li\u003e\n      \u003cli\u003eBreadth-First Search\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eSorting Algorithms\n    \u003cul\u003e\n      \u003cli\u003eBubble Sort\u003c/li\u003e\n      \u003cli\u003eSelection Sort\u003c/li\u003e\n      \u003cli\u003eInsertion Sort\u003c/li\u003e\n      \u003cli\u003eMerge Sort\u003c/li\u003e\n      \u003cli\u003eQuick Sort\u003c/li\u003e\n      \u003cli\u003eHeap Sort\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eGraph Algorithms\n    \u003cul\u003e\n      \u003cli\u003eDepth-First Search\u003c/li\u003e\n      \u003cli\u003eBreadth-First Search\u003c/li\u003e\n      \u003cli\u003eTopological Sort\u003c/li\u003e\n      \u003cli\u003eStrongly Connected Components\u003c/li\u003e\n      \u003cli\u003eArticulation Points and Bridges\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eDynamic Programming\n    \u003cul\u003e\n      \u003cli\u003eIntroduction to DP\u003c/li\u003e\n      \u003cli\u003eFibonacci Series using DP\u003c/li\u003e\n      \u003cli\u003eLongest Common Subsequence\u003c/li\u003e\n      \u003cli\u003eLongest Increasing Subsequence\u003c/li\u003e\n      \u003cli\u003eKnapsack Problem\u003c/li\u003e\n      \u003cli\u003eMatrix Chain Multiplication\u003c/li\u003e\n      \u003cli\u003eDynamic Programming on Trees\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eMathematical and Bit Manipulation Algorithms\n    \u003cul\u003e\n      \u003cli\u003ePrime Numbers and Sieve of Eratosthenes\u003c/li\u003e\n      \u003cli\u003eGreatest Common Divisor\u003c/li\u003e\n      \u003cli\u003eLeast Common Multiple\u003c/li\u003e\n      \u003cli\u003eModular Arithmetic\u003c/li\u003e\n      \u003cli\u003eBit Manipulation Tricks\u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n  \u003cli\u003eAdvanced Topics\n    \u003cul\u003e\n      \u003cli\u003eTrie based Algorithms\n        \u003cul\u003e\n          \u003cli\u003eAuto completion\u003c/li\u003e\n          \u003cli\u003eSpell Checker\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003eSuffix Trees and Arrays\u003c/li\u003e\n      \u003cli\u003eComputational Geometry\u003c/li\u003e\n      \u003cli\u003eNumber Theory\n        \u003cul\u003e\n          \u003cli\u003eEuler's Totient Function\u003c/li\u003e\n          \u003cli\u003eMobius Function\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003eString Algorithms\n        \u003cul\u003e\n          \u003cli\u003eKMP Algorithm\u003c/li\u003e\n          \u003cli\u003eRabin-Karp Algorithm\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n\u003c/ul\u003e\n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsorcererchiragsingh%2Fjava-dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsorcererchiragsingh%2Fjava-dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsorcererchiragsingh%2Fjava-dsa/lists"}