Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/theodesp/go-leetcode
Solutions and implementations of Leetcode problems in Go.
https://github.com/theodesp/go-leetcode
go leetcode
Last synced: about 1 month ago
JSON representation
Solutions and implementations of Leetcode problems in Go.
- Host: GitHub
- URL: https://github.com/theodesp/go-leetcode
- Owner: theodesp
- License: mit
- Created: 2019-02-04T21:33:33.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2019-10-23T20:36:15.000Z (about 5 years ago)
- Last Synced: 2023-03-02T11:06:12.330Z (over 1 year ago)
- Topics: go, leetcode
- Language: Go
- Size: 132 KB
- Stars: 5
- Watchers: 0
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
[](https://golangci.com/r/github.com/theodesp/go-leetcode)
go-leetcode
---
Solutions and implementations of Leetcode problems in Go.
May the code be with you.
## Challenges completed
- [x] **Tries**: [Link](https://leetcode.com/explore/learn/card/trie/150/introduction-to-trie/)
- [x] : Trie Representation
- [x] : Trie Operations
- [x] : Map Sum
- [x] : ReplaceWords
- [x] : AddSearch
- [x] : FindMaximumXOR
- [x] : WordSearch
- [x] **Binary Search**: [Link](https://leetcode.com/explore/learn/card/binary-search/138/background/)
- [x] : Binary Search
- [x] : Sqrt
- [x] : SearchRotated
- [x] : FindPeakElement
- [x] : FindMinInRotatedArray
- [x] : SearchRange
- [x] : Find K Closest Elements
- [x] : Pow
- [x] : IsPerfectSquare
- [x] : NextGreatestLetter
- [x] : FindMin
- [x] : ArrayIntersection
- [x] : ArrayIntersection2
- [x] : TwoSum
- [x] : FindDuplicateNumber
- [x] : FindMedianSortedArrays
- [x] : Find K-th Smallest Pair Distance
- [x] : Split Array Largest Sum
- [x] : Find Peak Element 2d
- [] **List**:
- [x] : Reverse a Linked List
- [x] : Find Middle Element
- [x] : Remove Duplicates from Unsorted/Sorted List
- [x] : Linked List Implementation
- [x] : Double Linked List Implementation
- [] **Array**:
- [x] : Find common elements in K sorted arrays
- [x] : Pascals Triangle
- [x] : Array permutations
- [x] : Find kth largest/smallest element in unsorted list
- [x] : K-th Element of Two Sorted Arrays
- [x] **Stack**:
- [x] : Implement Stack using Queue
- [x] : Sort Stack using temp stack
- [x] **Queue**:
- [x] : Implement Queue using Stack
- [x] **Heap**:
- [x] : Implement a MinHeap
- [x] **Searching**:
- [x] : Rabin-Karp Searching
- [x] **Graph**:
- [x] : Implement an UndirectedGraph
- [x] : Implement an DirectedGraph
- [x] : BFS
- [x] : DFS
- [x] : Topological sort
- [x] **Cache**:
- [x] : Implement LFU Cache using Double List
- [x] : Implement LRU Cache using Double List
- [] **Tree**:
- [x] : Reverse a Binary Tree
- [x] : Preorder Traversal
- [x] : Inorder Traversal
- [x] : Postorder Traversal
- [x] : Levelorder Traversal
- [x] : Binary Search Tree Delete
- [x] : Binary Search Tree Search
- [x] : Binary Search Tree Lowest Common Ancestor
- [x] : Binary Search Tree Print nodes K distance from root
- [x] : Binary Search Tree Subtree of Another Tree
- [x] : Binary Search Tree Trees are mirror
- [x] **Hash Table**:
- [x] : Hash table Implementation
- [x] **Sorting**:
- [x] : Counting Sort
- [x] : Radix Sort
- [x] : Merge Sort
- [x] **Dynamic Programming**:
- [x] : Fibonacci Dynamic
- [x] : Knapsack
- [] **Uncategorized**:
- [x] : Add two numbers
- [x] : Length Of Longest Substring
- [x] : Defanging an IP Address
- [x] : First Unique Character in a String
- [x] : Longest prefix which is also suffix
- [x] : Best time to buy and sell stock - With explanation
- [x] : Add binary - With explanation
- [x] : Two Sum - With explanation
- [x] : Valid Palindrome
- [x] : Subarray Sum Equals K
- [x] : Check string chars can be rearranged to form palindrome
## LICENCE
Copyright © 2019 Theo Despoudis MIT license