{"id":28717194,"url":"https://github.com/belanasaikiran/leetcode75","last_synced_at":"2025-08-31T13:34:30.160Z","repository":{"id":296453806,"uuid":"993445410","full_name":"belanasaikiran/LeetCode75","owner":"belanasaikiran","description":"My Implemenations for LeetCode 75","archived":false,"fork":false,"pushed_at":"2025-06-21T13:29:12.000Z","size":66,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-07-05T08:41:27.487Z","etag":null,"topics":["cplusplus","leetcode"],"latest_commit_sha":null,"homepage":"","language":"C++","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/belanasaikiran.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,"zenodo":null}},"created_at":"2025-05-30T20:00:49.000Z","updated_at":"2025-06-21T13:29:15.000Z","dependencies_parsed_at":"2025-05-31T05:54:39.755Z","dependency_job_id":"1c7a1b04-a5f7-4c61-ad93-ca7ad2f70aae","html_url":"https://github.com/belanasaikiran/LeetCode75","commit_stats":null,"previous_names":["belanasaikiran/leetcode75"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/belanasaikiran/LeetCode75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belanasaikiran%2FLeetCode75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belanasaikiran%2FLeetCode75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belanasaikiran%2FLeetCode75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belanasaikiran%2FLeetCode75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/belanasaikiran","download_url":"https://codeload.github.com/belanasaikiran/LeetCode75/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belanasaikiran%2FLeetCode75/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272988764,"owners_count":25026959,"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-08-31T02:00:09.071Z","response_time":79,"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":["cplusplus","leetcode"],"created_at":"2025-06-15T03:13:39.227Z","updated_at":"2025-08-31T13:34:30.154Z","avatar_url":"https://github.com/belanasaikiran.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode75 [🔗](https://leetcode.com/studyplan/leetcode-75/)\r\n\r\n### Arrays/Strings\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n| [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately) | Easy | [Solution](./StringsOrArrays/mergeStrings.cpp) | O(n) | O(1) |\r\n| [Greatest Common Divisor of Strings](https://leetcode.com/problems/merge-strings-alternately) | Easy | [Solution](./StringsOrArrays/GreatestCommonDivisorofStrings.cpp) | O(m+n+logmin(m,n)) | O(m + n) |\r\n| [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies) | Easy | [solution](./StringsOrArrays/KidsWiththeGreatestNumberofCandies.cpp) | O(n) |  O(1) |\r\n|[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | Easy | [Solution](./StringsOrArrays/CanPlaceFlowers.cpp) | O(n) | O(1) |\r\n| [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | Easy | [Solution](./StringsOrArrays/ReverseVowelsOfAString.cpp) | O(log n) | O(1) |\r\n| [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | Medium | [Solution](./StringsOrArrays/ReverseWordsInAString.cpp) | O(n) | O(n) |\r\n|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | Medium | [Solution](./StringsOrArrays/ProductOfArrayExceptSelf.cpp) | O(n) | O(1) |\r\n|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | Medium | [Solution](./StringsOrArrays/IncreasingTripletSubsequence.cpp) | O(n) | O(1) |\r\n|[String Compression](https://leetcode.com/problems/string-compression/) | Medium | [Solution](./StringsOrArrays//StringCompression.cpp) | O(n) | O(1) |\r\n\r\n### Two Pointers\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n| [Move Zeroes](https://leetcode.com/problems/move-zeroes) | Easy | [Solution](./TwoPointers/MoveZeroes.cpp) | O(n) | O(1) |\r\n| [Is Subsequence](https://leetcode.com/problems/is-subsequence) | Easy | [Solution](./TwoPointers/./IsSubsequence.cpp) | O(n) | O(1) |\r\n|[Container With Most Water](https://leetcode.com/problems/container-with-most-water)| Medium | [Solution](./TwoPointers/ContainerWithMostWater.cpp) | O(n) | O(1) |\r\n|[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs)| Medium | [Solution](./TwoPointers/MaxNumberOfKSumPairs.cpp) | O(n log n) and O(n) | O(1) |\r\n\r\n\r\n### Sliding Window\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)| Easy | [Solution](./SlidingWindow/MaximumAverageSubarrayI.cpp) | O(n) | O(1) |\r\n|[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/?envType=study-plan-v2\u0026envId=leetcode-75)| Medium | [Solution](./SlidingWindow/Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length.cpp) | O(n) | O(1) |\r\n|[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)| Medium | [Solution](./SlidingWindow/Max%20Consecutive%20Ones%20III.cpp) | O(n) | O(1) |\r\n|[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element)| Medium | [Solution](./SlidingWindow/Longest%20Subarray%20of%201s%20After%20Deleting%20One%20Element.cpp) | O(n) | O(1) |\r\n\r\n### Prefix Sum\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude)| Easy | [Solution](./PrefixSum/FindTheHighestAltitude.cpp) | O(n) | O(1) |\r\n|[Find the Pivot Index](https://leetcode.com/problems/find-pivot-index)| Easy | [Solution](./PrefixSum/FindPivotIndex.cpp) | O(n) | O(1) |\r\n\r\n### Hash Map  / Set\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays)| Easy | [Solution](./HashMapOrSet/FindTheDifferenceofTwoArrays.cpp) | O(n) | O(1) |\r\n|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences)| Easy | [Solution](./HashMapOrSet/UniqueNumberOfOccurrences.cpp) | O(n) | O(1) |\r\n|[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close)| Medium | [Solution](./HashMapOrSet/DetermineIfTwoStringsAreClose.cpp) | O(n) | O(1) |\r\n|[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs)| Medium | [Solution](./HashMapOrSet/EqualRowAndColumnPairs.cpp) | O(n) | O(1) |\r\n\r\n\r\n### Stacks\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string)| Medium | [Solution](./Stack/RemovingStarsFromAString.cpp) | O(n) | O(1) |\r\n|[Asteroid Collision](https://leetcode.com/problems/asteroid-collision)| Medium | [Solution](./Stack/AsteroidCollision.cpp) | O(n) | O(1) |\r\n|[Decode String](https://leetcode.com/problems/decode-string)| Medium | [Solution](./Stack/DecodeString.cpp) | O(n) | O(n) |\r\n\r\n\r\n### Queues\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity | Visit Again |\r\n| --------| :--------  |---------| :-------------: | :--------------: | :-----: |\r\n|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls)| Easy | [Solution](./Queues/number-of-recent-calls.cpp) | O(1) | O(1) |\r\n|[Dota 2 Senate ](https://leetcode.com/problems/dota2-senate)| Medium | [Solution](./Queues/dota2-senate.cpp) | O(n) | O(1) | Must Redo |\r\n\r\n\r\n\r\n### Linked Lists\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list)| Medium | [Solution](./LInkedList/delete-the-middle-node-of-a-linked-list.cpp) | O(log n) | O(1) |\r\n|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list)| Medium | [Solution](./LInkedList/delete-the-middle-node-of-a-linked-list.cpp) | O(log n) | O(1) |\r\n|[ Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)| Easy | [Solution](./LInkedList/reverse-linked-list.cpp) | O(n) | O(1) |\r\n|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list)| Medium | [Solution](./LInkedList/maximum-twin-sum-of-a-linked-list.cpp) | O(n) | O(1) |\r\n\r\n\r\n### Binary Tree (DFS)\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)| Easy | [Solution](./BinaryTrees/maximum-depth-of-binary-tree.cpp) | O(n) | O(1) |\r\n|[Leaf Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)| Easy | [Solution](./BinaryTrees/leaf-similar-trees.cpp) | O(n) | O(n) |\r\n|[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree)| Medium | [Solution](./BinaryTrees/count-good-nodes-in-binary-tree.cpp) | O(n) | O(1) |\r\n|[Path Sum III](https://leetcode.com/problems/path-sum-iii)| Medium | [Solution](./BinaryTrees/path-sum-iii.cpp) | O(n) | O(n) |\r\n|[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree)| Medium | [Solution](./BinaryTrees/longest-zigzag-path-in-a-binary-tree.cpp) | O(n) | O(n) |\r\n|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)| Medium | [Solution](./BinaryTrees/lowest-common-ancestor-of-a-binary-tree.cpp) | O(n) | O(n) |\r\n\r\n\r\n\r\n### Binary Tree (BFS)\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)| Medium | [Solution](./BinaryTrees/binary-tree-right-side-view.cpp) | O(n) | O(1) |\r\n|[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree)| Medium | [Solution](./BinaryTrees/maximum-level-sum-of-a-binary-tree.cpp) | O(n) | O(1) |\r\n\r\n\r\n### Binary Search Tree\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree)| Easy | [Solution](./BST/search-in-a-binary-search-tree.cpp) | O(n) | O(1) \r\n|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst)| Medium | [Solution](./BST/delete-node-in-a-bst.cpp) | O(n) | O(1) \r\n\r\n\r\n\r\n### Graphs - DFS\r\n\r\nI need to re-do this. Too confusing. Maybe redo and understand how to solve these\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms)| Medium | [Solution](./Graphs/keys-and-rooms.cpp) | O(n) | O(n) \r\n|[Number of Provinces](https://leetcode.com/problems/number-of-provinces)| Medium | [Solution](./Graphs/number-of-provinces.cpp) | O(n) | O(n) \r\n|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero)| Medium | [Solution](./Graphs/reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp) | O(n) | O(n) \r\n|[Evaluate Division](https://leetcode.com/problems/evaluate-division)| Medium | [Solution](./Graphs/evaluate-division.cpp) | O(n) | O(n) \r\n\r\n\r\n### Graphs - BFS\r\n\r\n| Problem | Difficulty |  | Time Complexity | Space Complexity |\r\n| --------| :--------  |---------| :-------------: | :--------------: |\r\n|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze)| Medium | [Solution](./Graphs/nearest-exit-from-entrance-in-maze.cpp) | O(m x n) | O(m x n) \r\n|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges)| Medium | [Solution](./Graphs/rotting-oranges.cpp) | O(m x n) | O(m x n) \r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbelanasaikiran%2Fleetcode75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbelanasaikiran%2Fleetcode75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbelanasaikiran%2Fleetcode75/lists"}