{"id":21590529,"url":"https://github.com/anishlearnstocode/leetcode-arrays-101","last_synced_at":"2025-07-13T03:34:53.012Z","repository":{"id":98362962,"uuid":"381467825","full_name":"anishLearnsToCode/leetcode-arrays-101","owner":"anishLearnsToCode","description":"Solved Questions from LeetCode Learn Section Arrays 101.","archived":false,"fork":false,"pushed_at":"2021-11-21T21:22:02.000Z","size":61,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-06-09T12:48:50.804Z","etag":null,"topics":["array","arrays","intro-to-programming","leetcode","leetcode-solutions","programming","solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.com/explore/learn/card/fun-with-arrays/","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/anishLearnsToCode.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,"zenodo":null}},"created_at":"2021-06-29T18:55:31.000Z","updated_at":"2024-04-05T05:10:34.000Z","dependencies_parsed_at":"2023-04-06T08:03:59.831Z","dependency_job_id":null,"html_url":"https://github.com/anishLearnsToCode/leetcode-arrays-101","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anishLearnsToCode/leetcode-arrays-101","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fleetcode-arrays-101","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fleetcode-arrays-101/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fleetcode-arrays-101/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fleetcode-arrays-101/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anishLearnsToCode","download_url":"https://codeload.github.com/anishLearnsToCode/leetcode-arrays-101/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fleetcode-arrays-101/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265084096,"owners_count":23708860,"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":["array","arrays","intro-to-programming","leetcode","leetcode-solutions","programming","solutions"],"created_at":"2024-11-24T16:18:48.373Z","updated_at":"2025-07-13T03:34:52.985Z","avatar_url":"https://github.com/anishLearnsToCode.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Learn - Arrays 101\n\n![problems-solved](https://img.shields.io/badge/Problems%20Solved-18/18-1f425f.svg)\n![problems-solved-java](https://img.shields.io/badge/Java-18/18-1abc9c.svg)\n![problems-solved-python](https://img.shields.io/badge/Python-18/18-1abc9c.svg)\n[![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)\n\n🔒 = Subscription Content\n\n## Introduction\n| Question | Solution | Youtube |\n|------|:--------:|:----------------------:|\n| [Max Consecutive Ones](https://leetcode.com/explore/learn/card/fun-with-arrays/521/introduction/3238/) | [![Java](assets/java.png)](java/src/MaxConsecutiveOnes.java) [![Python](assets/python.png)](python/max_consecutive_ones.py) | \n| [Find Numbers with Even Number of Digits](https://leetcode.com/explore/learn/card/fun-with-arrays/521/introduction/3237/) | [![Java](assets/java.png)](java/src/FindNumbersWithEvenNumberOfDigits.java) [![Python](assets/python.png)](python/find_number_with_even_number_of_digits.py) | \n| [Squares of a Sorted Array](https://leetcode.com/explore/learn/card/fun-with-arrays/521/introduction/3240/) | [![Java](assets/java.png)](java/src/SquaresOfSortedArray.java) [![Python](assets/python.png)](python/squares_of_a_sorted_array.py) | \n\n\n## Inserting Items Into An Array\n| Question | Solution | Youtube |\n|------|:--------:|:-------:|\n| [Duplicate Zeros](https://leetcode.com/explore/learn/card/fun-with-arrays/525/inserting-items-into-an-array/3245/) | [![Java](assets/java.png)](java/src/DuplicateZeros.java) [![Python](assets/python.png)](python/duplicate_zeros.py) | \n| [Merge Sorted Array](https://leetcode.com/explore/learn/card/fun-with-arrays/525/inserting-items-into-an-array/3253/) | [![Java](assets/java.png)](java/src/MergeSortedArray.java) [![Python](assets/python.png)](python/merge_sorted_array.py) | \n\n\n## Deleting Items From An Array\n| Question | Solution | Youtube |\n|------|:--------:|:----------------------:|\n| [Remove Element](https://leetcode.com/explore/learn/card/fun-with-arrays/526/deleting-items-from-an-array/3247/) | [![Java](assets/java.png)](java/src/RemoveElement.java) [![Python](assets/python.png)](python/remove_element.py) | \n| [Remove Duplicates from Sorted Array](https://leetcode.com/explore/learn/card/fun-with-arrays/526/deleting-items-from-an-array/3248/) | [![Java](assets/java.png)](java/src/RemoveDuplicatesFromSortedArray.java) [![Python](assets/python.png)](python/remove_duplicate_elements_from_sorted_array.py) | \n\n\n## Searching For Items In An Array\n| Question | Solution | Youtube |\n|------|:--------:|:----------------------:|\n| [Check if N And It's Double Exists](https://leetcode.com/explore/learn/card/fun-with-arrays/527/searching-for-items-in-an-array/3250/) | [![Java](assets/java.png)](java/src/CheckIfNAndItsDoubleExist.java) [![Python](assets/python.png)](python/check_if_n_and_its_double_exists.py) | \n| [Valid Mountain Array](https://leetcode.com/explore/learn/card/fun-with-arrays/527/searching-for-items-in-an-array/3251/) | [![Java](assets/java.png)](java/src/ValidMountainArray.java) [![Python](assets/python.png)](python/valid_mountain_array.py) | \n\n\n## In-Place Operations\n| Question | Solution | Youtube |\n|------|:--------:|:----------------------:|\n| [Replace Elements with Greatest Element on Right Side](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/3259/) | [![Java](assets/java.png)](java/src/ReplaceElementsWithGreatestOnTheRightSide.java) [![Python](assets/python.png)](python/replace_elements_with_greatest_on_right.py) | \n| [Remove Duplicates from Sorted Array](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/3258/) | [![Java](assets/java.png)](java/src/RemoveDuplicatesFromSortedArray.java) [![Python](assets/python.png)](python/remove_duplicate_elements_from_sorted_array.py) | \n| [Move Zeros](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/3157/) | [![Java](assets/java.png)](java/src/MoveZeros.java) [![Python](assets/python.png)](python/move_zeros.py) | \n| [Sort Array By Parity](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/3260/) | [![Java](assets/java.png)](java/src/SortArrayByParity.java) [![Python](assets/python.png)](python/sort_array_by_parity.py) | \n| [Remove Element](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/3575/) | [![Java](assets/java.png)](java/src/RemoveElement.java) [![Python](assets/python.png)](python/remove_element.py) | \n\n\n## Conclusion\n Name | Solution | Youtube |\n|------|:--------:|:----------------------:|\n| [Height Checker](https://leetcode.com/explore/learn/card/fun-with-arrays/523/conclusion/3228/) | [![Java](assets/java.png)](java/src/HeightChecker.java) [![Python](assets/python.png)](python/) | \n| [Third Maximum Number](https://leetcode.com/explore/learn/card/fun-with-arrays/523/conclusion/3231/) | [![Java](assets/java.png)](java/src/ThirdMaximumNumber.java) [![Python](assets/python.png)](python/third_maximum_number.py) | \n| [Find All Numbers Disappeared in an Array](https://leetcode.com/explore/learn/card/fun-with-arrays/523/conclusion/3270/) | [![Java](assets/java.png)](java/src/FindAllNumbersDisappearedInAnArray.java) [![Python](assets/python.png)](python/find_all_numbers_that_dissapeared.py) | \n| [Squares of a Sorted Array](https://leetcode.com/explore/learn/card/fun-with-arrays/523/conclusion/3574/) | [![Java](assets/java.png)](java/src/SquaresOfSortedArray.java) [![Python](assets/python.png)](python/squares_of_a_sorted_array.py) | \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishlearnstocode%2Fleetcode-arrays-101","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanishlearnstocode%2Fleetcode-arrays-101","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishlearnstocode%2Fleetcode-arrays-101/lists"}