{"id":20196237,"url":"https://github.com/shaikrasheed99/data-structures-and-algorithms","last_synced_at":"2026-02-23T15:01:41.681Z","repository":{"id":58586151,"uuid":"532599737","full_name":"shaikrasheed99/data-structures-and-algorithms","owner":"shaikrasheed99","description":"Practice problems of DSA from LeetCode and GeeksForGeeks platforms. ","archived":false,"fork":false,"pushed_at":"2022-11-06T07:56:47.000Z","size":86,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-04T09:36:07.140Z","etag":null,"topics":["arrays","bit-manipulation","dsa","dsa-algorithm","dsa-learning-series","dsa-practice","geeksforgeeks","java","leetcode","leetcode-java","leetcode-practice","leetcode-questions","leetcode-solutions","math","number-theory","patterns","strings","trees"],"latest_commit_sha":null,"homepage":"","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/shaikrasheed99.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}},"created_at":"2022-09-04T16:49:14.000Z","updated_at":"2024-07-05T17:29:58.000Z","dependencies_parsed_at":"2023-01-21T23:15:38.140Z","dependency_job_id":null,"html_url":"https://github.com/shaikrasheed99/data-structures-and-algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/shaikrasheed99/data-structures-and-algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shaikrasheed99%2Fdata-structures-and-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shaikrasheed99%2Fdata-structures-and-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shaikrasheed99%2Fdata-structures-and-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shaikrasheed99%2Fdata-structures-and-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shaikrasheed99","download_url":"https://codeload.github.com/shaikrasheed99/data-structures-and-algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shaikrasheed99%2Fdata-structures-and-algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29746499,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-23T07:44:07.782Z","status":"ssl_error","status_checked_at":"2026-02-23T07:44:07.432Z","response_time":90,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["arrays","bit-manipulation","dsa","dsa-algorithm","dsa-learning-series","dsa-practice","geeksforgeeks","java","leetcode","leetcode-java","leetcode-practice","leetcode-questions","leetcode-solutions","math","number-theory","patterns","strings","trees"],"created_at":"2024-11-14T04:22:40.970Z","updated_at":"2026-02-23T15:01:41.659Z","avatar_url":"https://github.com/shaikrasheed99.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Problems in Java \n\n## Arrays:\n* Easy:\n  * [1](https://leetcode.com/problems/two-sum/). Two Sum - [code](src/arrays/easy/TwoSum.java)\n  * [1672](https://leetcode.com/problems/richest-customer-wealth/). Richest Customer Wealth - [code](src/arrays/easy/MatrixTraversal.java)\n  * [1337](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/). The K Weakest Rows in a Matrix - [code](src/arrays/easy/KWeakestRows.java)\n  * [496](https://leetcode.com/problems/next-greater-element-i/). Next Greater Element I - [code](src/arrays/easy/NextGreaterElementOne.java)\n  * [1475](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/). Final Prices With a Special Discount in a Shop - [code](src/arrays/easy/NextSmallerElement.java)\n  * [1979](https://leetcode.com/problems/find-greatest-common-divisor-of-array/). Find Greatest Common Divisor of Array - [code](src/arrays/easy/GCDInArray.java)\n  * [485](https://leetcode.com/problems/max-consecutive-ones/). Max Consecutive Ones - [code](src/arrays/easy/MaxConsecutiveOnes.java)\n  * [905](https://leetcode.com/problems/sort-array-by-parity/). Sort Array By Parity - [code](src/arrays/easy/SortArrayByParity.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/segregate-0s-and-1s5106/1). Segregate 0s and 1s - [code](src/arrays/easy/Segregate0sAnd1s.java)\n* Medium:\n  * [54](https://leetcode.com/problems/spiral-matrix/). Spiral Matrix I - [code](src/arrays/medium/SpiralMatrixOne.java)\n  * [59](https://leetcode.com/problems/spiral-matrix-ii/). Spiral Matrix II - [code](src/arrays/medium/SpiralMatrixTwo.java)\n  * [2326](https://leetcode.com/problems/spiral-matrix-iv/). Spiral Matrix IV - [code](src/arrays/medium/SpiralMatrixFour.java)\n  * [1996](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/). The Number of Weak Characters in Game - [code](src/arrays/medium/NumberOfWeakCharacters.java)\n  * [503](https://leetcode.com/problems/next-greater-element-ii/). Next Greater Element II - [code](src/arrays/medium/NextGreaterElementCircular.java)\n  * [75](https://leetcode.com/problems/sort-colors/). Sort Colors - [code](src/arrays/medium/Sort0s1s2s.java)\n* Hard:\n  * [41](https://leetcode.com/problems/first-missing-positive/). First Missing Positive - [code](src/arrays/hard/FirstMissingPositive.java)\n\n## Math:\n* Easy: \n  * [412](https://leetcode.com/problems/fizz-buzz/). Fizz Buzz - [code](src/math/easy/FizzBuzz.java)\n  * [9](https://leetcode.com/problems/palindrome-number/). Palindrome Number - [code](src/math/easy/PalindromeCheck.java)\n  * [1281](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/). Subtract the Product and Sum of Digits of an Integer - [code](src/math/easy/SubtractProductAndSum.java)\n  * [1290](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/). Convert Binary Number in a Linked List to Integer - [code](src/math/easy/BinaryLinkedListToDecimal.java)\n  * [231](https://leetcode.com/problems/power-of-two/). Power of Two - [code](src/math/easy/PowerOfTwo.java)\n  * [1175](https://leetcode.com/problems/prime-arrangements/). Prime Arrangements - [code](src/math/easy/PrimeArrangements.java)\n  * [258](https://leetcode.com/problems/add-digits/). Add Digits - [code](src/math/easy/AddDigits.java)\n  * [202](https://leetcode.com/problems/happy-number/). Happy Number - [code](src/math/easy/HappyNumber.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/lcm-and-gcd4516/1). LCM and GCD - [code](src/math/easy/GCDAndLCM.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/armstrong-numbers2727/1). Armstrong Number - [code](src/math/easy/ArmstrongNumberCheck.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/count-digits5716/1). Count digits - [code](src/math/easy/CountDigitsGFG.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/decimal-to-binary-1587115620/1). Decimal to Binary - [code](src/math/easy/DecimalToBinary.java) \n  * [Gfg](https://practice.geeksforgeeks.org/problems/binary-number-to-decimal-number3525/1). Binary to Decimal - [code](src/math/easy/BinaryToDecimal.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/sum-of-all-divisors-from-1-to-n4738/1). Sum of all divisors from 1 to n - [code](src/math/easy/SumOfAllDivisors.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/sieve-of-eratosthenes5242/1). Sieve of Eratosthenes - [code](src/math/easy/SieveOfEratosthenes.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/prime-factors5052/1). Prime Factors - [code](src/math/easy/PrimeFactors.java)\n* Medium:\n  * [7](https://leetcode.com/problems/reverse-integer/). Reverse Integer - [code](src/math/medium/ReverseInteger.java)\n  * [1390](https://leetcode.com/problems/four-divisors/). Four Divisors - [code](src/math/medium/FourDivisors.java)\n  * [204](https://leetcode.com/problems/count-primes/). Count Primes - [code](src/math/medium/CountPrimes.java)\n\n## Bit Manipulation:\n* Easy:\n  * [191](https://leetcode.com/problems/number-of-1-bits/). Number of 1 Bits - [code](src/bit_manipulation/easy/NumberOfOnes.java)\n  * [476](https://leetcode.com/problems/number-complement/). Number Complement - [code](src/bit_manipulation/easy/NumberCompliment.java)\n  * [190](https://leetcode.com/problems/reverse-bits/). Reverse Bits - [code](src/bit_manipulation/easy/ReverseBits.java)\n  * [136](https://leetcode.com/problems/single-number/). Single Number I - [code](src/bit_manipulation/easy/SingleNumber.java)\n  * [2220](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/). Minimum Bit Flips to Convert Number - [code](src/bit_manipulation/easy/MinimumBitFlipsToConvertNumber.java)\n  * [338](https://leetcode.com/problems/counting-bits/). Counting Bits - [code](src/bit_manipulation/easy/CountingBits.java)\n  * [137](https://leetcode.com/problems/single-number-ii/). Single Number II - [code](src/bit_manipulation/easy/OneSingleNumberInGroupOfThreeNumbers.java)\n  * [260](https://leetcode.com/problems/single-number-iii/). Single Number III - [code](src/bit_manipulation/easy/TwoSingleNumbers.java)\n  * [405](https://leetcode.com/problems/convert-a-number-to-hexadecimal/). Convert a Number to Hexadecimal - [code](src/bit_manipulation/easy/ConvertANumberToHexadecimal.java)\n  * [268](https://leetcode.com/problems/missing-number/). Missing Number - [code](src/bit_manipulation/easy/MissingNumber.java)\n  * [67](https://leetcode.com/problems/add-binary/). Add Binary - [code](src/bit_manipulation/easy/AddBinary.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/check-whether-k-th-bit-is-set-or-not-1587115620/1). Check whether K-th bit is set or not - [code](src/bit_manipulation/easy/CheckKthBitIsSet.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/odd-or-even3618/1). Odd or Even - [code](src/bit_manipulation/easy/OddOrEven.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1). Set kth bit - [code](src/bit_manipulation/easy/SetKthBit.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/set-the-rightmost-unset-bit4436/1). Set the rightmost unset bit - [code](src/bit_manipulation/easy/SetRightMostUnsetBit.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/find-position-of-set-bit3706/1). Find position of set bit - [code](src/bit_manipulation/easy/PositionOfSetBit.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/copy-set-bits-in-range0623/1). Copy Set Bits in Range - [code](src/bit_manipulation/easy/CopySetBitsInRange.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/find-xor-of-numbers-from-l-to-r/1). Find XOR of numbers from L to R - [code](src/bit_manipulation/easy/FindXORInRange.java)\n* Medium:\n  * [371](https://leetcode.com/problems/sum-of-two-integers/). Sum of Two Integers - [code](src/bit_manipulation/medium/SumOfTwoIntegers.java)\n  * [201](https://leetcode.com/problems/bitwise-and-of-numbers-range/). Bitwise AND of Numbers Range - [code](src/bit_manipulation/medium/BitwiseAndOfNumbersRange.java)\n  * [1680](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/). Concatenation of Consecutive Binary Numbers - [code](src/bit_manipulation/medium/ConcatenationOfConsecutiveBinaryNumbers.java)\n  * [78](https://leetcode.com/problems/subsets/). Subsets - [code](src/bit_manipulation/medium/Subsets.java)\n  * [50](https://leetcode.com/problems/powx-n/). Pow(x, n) - [code](src/bit_manipulation/medium/PowerOfXAndN.java)\n  * [29](https://leetcode.com/problems/divide-two-integers/). Divide Two Integers - [code](src/bit_manipulation/medium/DivideTwoIntegers.java)\n  * [Gfg](https://practice.geeksforgeeks.org/problems/count-total-set-bits-1587115620/1). Count total set bits - [code](src/bit_manipulation/medium/CountTotalSetBits.java)\n\n## Strings:\n* Easy:\n  * [557](https://leetcode.com/problems/reverse-words-in-a-string-iii/). Reverse Words in a String III - [code](src/strings/easy/ReverseWordsInString.java)\n\n## Trees:\n* Easy:\n  * [94](https://leetcode.com/problems/binary-tree-inorder-traversal/). Binary Tree Inorder Traversal - [code](src/trees/easy/InorderTraversal.java)\n  * [144](https://leetcode.com/problems/binary-tree-preorder-traversal/). Binary Tree Preorder Traversal - [code](src/trees/easy/PreorderTraversal.java)\n\n## Pattens:  \n* [codes](src/patterns)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshaikrasheed99%2Fdata-structures-and-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshaikrasheed99%2Fdata-structures-and-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshaikrasheed99%2Fdata-structures-and-algorithms/lists"}