{"id":22083712,"url":"https://github.com/prasad89/neetcode-150-in-go","last_synced_at":"2025-03-23T21:26:31.083Z","repository":{"id":270433627,"uuid":"896375298","full_name":"prasad89/neetcode-150-in-go","owner":"prasad89","description":"Solutions to Neetcode 150 problems in Go, focused on mastering algorithms and data structures","archived":false,"fork":false,"pushed_at":"2025-01-10T03:01:57.000Z","size":26,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-29T04:45:45.585Z","etag":null,"topics":["golang","neetcode"],"latest_commit_sha":null,"homepage":"","language":"Go","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/prasad89.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-11-30T07:30:46.000Z","updated_at":"2025-01-14T06:35:47.000Z","dependencies_parsed_at":"2024-12-31T06:23:42.011Z","dependency_job_id":"53b80391-1d7e-432b-bc49-8dfa1429231f","html_url":"https://github.com/prasad89/neetcode-150-in-go","commit_stats":null,"previous_names":["prasad89/neetcode-150-in-go"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prasad89%2Fneetcode-150-in-go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prasad89%2Fneetcode-150-in-go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prasad89%2Fneetcode-150-in-go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prasad89%2Fneetcode-150-in-go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/prasad89","download_url":"https://codeload.github.com/prasad89/neetcode-150-in-go/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245170982,"owners_count":20572167,"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":["golang","neetcode"],"created_at":"2024-12-01T00:17:29.343Z","updated_at":"2025-03-23T21:26:31.056Z","avatar_url":"https://github.com/prasad89.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Neetcode 150 Solutions in GoLang\n\nThis repository contains my solutions to the **Neetcode 150** problems, implemented in **GoLang**. It serves as a structured approach to mastering data structures, algorithms, and problem-solving for technical interviews.\n\n## Getting Started\n\nEach topic will have its own folder, with GoLang files for individual problems. To run a solution:\n\n```bash\ngo run path/to/solution.go\n```\n\n## Topics Covered\n\n### Arrays \u0026 Hashing\n\n- [Contains Duplicate](./Arrays%20%26%20Hashing/containsDuplicate.go)\n- [Valid Anagram](./Arrays%20%26%20Hashing/validAnagram.go)\n- [Two Sum](./Arrays%20%26%20Hashing/twoSum.go)\n- [Group Anagrams](./Arrays%20%26%20Hashing/groupAnagrams.go)\n- [Top K Frequent Elements](./Arrays%20%26%20Hashing/topKFrequent.go)\n- [Encode and Decode Strings](./Arrays%20%26%20Hashing/encodingDecoding.go)\n- [Product of Array Except Self](./Arrays%20%26%20Hashing/productOfArrayExceptSelf.go)\n- [Valid Sudoku](./Arrays%20%26%20Hashing/validSudoku.go)\n- [Longest Consecutive Sequence](./Arrays%20%26%20Hashing/longestConsecutiveSequence.go)\n\n---\n\n### Two Pointers\n\n- [Valid Palindrome](./Two%20Pointers/validPalindrome.go)\n- [Two Sum II Input Array Is Sorted](./Two%20Pointers/twoSumII.go)\n- [3Sum](./Two%20Pointers/threeSum.go)\n- [Container With Most Water](./Two%20Pointers/containerWithMostWater.go)\n- [Trapping Rain Water](./Two%20Pointers/trappingRainWater.go)\n\n---\n\n### Linked List\n\n- [Reverse Linked List](./Linked%20List/reverseLinkedList.go)\n- [Merge Two Sorted Lists](./Linked%20List/mergeTwoSortedLists.go)\n- [Linked List Cycle](./Linked%20List/linkedListCycle.go)\n- [Reorder List](./Linked%20List/reorderList.go)\n- [Remove Nth Node From End of List](./Linked%20List/removeNthNodeFromEndOfList.go)\n- [Copy List With Random Pointer](./Linked%20List/copyListWithRandomPointer.go)\n- [Add Two Numbers](./Linked%20List/addTwoNumbers.go)\n- [Find The Duplicate Number](./Linked%20List/findTheDuplicateNumber.go)\n- [LRU Cache](./Linked%20List/lruCache.go)\n- [Merge K Sorted Lists](./Linked%20List/mergeKSortedLists.go)\n- [Reverse Nodes In K Group](./Linked%20List/reverseNodesInKGroups.go)\n\n---\n\n### Trees\n\n- [Invert Binary Tree](./Trees/invertBinaryTree.go)\n- [Maximum Depth of Binary Tree](./Trees/maximumDepthOfBinaryTree.go)\n- [Diameter of Binary Tree](./Trees/diameterOfBinaryTree.go)\n- [Balanced Binary Tree](./Trees/balancedBinaryTree.go)\n- [Same Tree](./Trees/sameTree.go)\n- [Subtree of Another Tree](./Trees/subtreeOfAnotherTree.go)\n- [Lowest Common Ancestor of a Binary Search Tree](./Trees/lowestCommonAncestorOfBinarySearchTree.go)\n- [Binary Tree Level Order Traversal](./Trees/binaryTreeLevelOrderTraversal.go)\n- [Binary Tree Right Side View](./Trees/binaryTreeRightSideView.go)\n- [Count Good Nodes in Binary Tree](./Trees/countGoodNodesInBinaryTree.go)\n- [Validate Binary Search Tree](./Trees/validBinarySearchTree.go)\n- [Kth Smallest Element in a BST](./Trees/kthSmallestIntegerInBST.go)\n- [Construct Binary Tree from Preorder and Inorder Traversal](./Trees/constructBinaryTreeFromPreorderAndInorderTraversal.go)\n- [Binary Tree Maximum Path Sum](./Trees/binaryTreeMaximumPathSum.go)\n- [Serialize and Deserialize Binary Tree](./Trees/serializeAndDeserializeBinaryTree.go)\n\n---\n\n### Greedy\n\n- [Maximum Subarray](./Greedy/maximumSubarray.go)\n- [Jump Game](./Greedy/jumpGame.go)\n- [Jump Game II](./Greedy/jumpGameII.go)\n- [Gas Station](./Greedy/gasStation.go)\n- [Hand of Straights](./Greedy/handOfStraights.go)\n- [Merge Triplets to Form Target Triplet](./Greedy/mergeTripletsToFormTargetTriplet.go)\n- [Partition Labels](./Greedy/partitionLabels.go)\n- [Valid Parenthesis String](./Greedy/validParenthesisString.go)\n\n---\n\n### Intervals\n\n- [Insert Interval](./Intervals/insertInterval.go)\n- [Merge Intervals](./Intervals/mergeIntervals.go)\n- [Non Overlapping Intervals](./Intervals/nonOverlappingIntervals.go)\n- [Meeting Rooms](./Intervals/meetingRooms.go)\n- [Meeting Rooms II](./Intervals/meetingRoomsII.go)\n- [Minimum Interval to Include Each Query](./Intervals/minimumIntervalToIncludeEachQuery.go)\n\n---\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprasad89%2Fneetcode-150-in-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fprasad89%2Fneetcode-150-in-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprasad89%2Fneetcode-150-in-go/lists"}