Documentation
¶
Index ¶
- func DailyTemperature(temps []int) []int
- func FindDuplicate(files []File) [][]File
- func FindDuplicateMain(paths []string) [][]string
- func FindFrequentTreeSum(root *TreeNode) []int
- func FindKFrequent(elements []int, size int) []int
- func FindSmallestCommon(matrix [][]int) int
- func FlipColumsEqualRows(matrix [][]int) int
- func ReplaceWords(dict []string, sentence string) string
- func SortCharByFreq(str string) string
- func TableOrdersMain(orders []Orders) [][]string
- type BinaryTreeNode
- type File
- type FindElements
- type LeaderBoard
- type Orders
- type Player
- type TinyURL
- type TreeNode
- type TwoSum
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func DailyTemperature ¶
use an array of temperatures for lookup go reverse and save the latest index in lookup with the current temp search for min index for all temps > current from lookup
func FindDuplicate ¶
func FindDuplicateMain ¶
func FindFrequentTreeSum ¶
func FindKFrequent ¶
func FindSmallestCommon ¶
Note nested maps are requited for duplicates map[value]m ap[rownum]bool
func FlipColumsEqualRows ¶
func ReplaceWords ¶
func SortCharByFreq ¶
func TableOrdersMain ¶
Types ¶
type BinaryTreeNode ¶
type BinaryTreeNode struct {
Value int
Left *BinaryTreeNode
Right *BinaryTreeNode
}
type FindElements ¶
type FindElements struct {
Root *BinaryTreeNode
}
func Constructor ¶
func Constructor(root *BinaryTreeNode) FindElements
func (*FindElements) Find ¶
func (f *FindElements) Find(target int) bool
func (*FindElements) Print ¶
func (f *FindElements) Print()
type LeaderBoard ¶
type TinyURL ¶
type TinyURL struct {
// contains filtered or unexported fields
}
func NewTinyURL ¶
func NewTinyURL() TinyURL
Source Files
¶
- daily-temperatures.go
- design-a-leaderboard.go
- display-table-of-food-orders-in-a-restaurant.go
- encode-and-decode-tinyurl.go
- find-duplicate-file-in-system.go
- find-elements-in-a-contaminated-binary-tree.go
- find-smallest-common-element-in-all-rows.go
- flip-columns-for-maximum-number-of-equal-rows.go
- group-shifted-strings.go
- implement-magic-dictionary.go
- insert-delete-getrandom-o1.go
- minimum-area-rectangle.go
- most-frequent-subtree-sum.go
- replace-words.go
- sort-characters-by-frequency.go
- sparse-matrix-multiplication.go
- time-based-key-value-store.go
- todo.go
- top-k-frequent-elements.go
- two-sum-iii-data-structure-design.go
- vertical-order-traversal-of-a-binary-tree].go
Click to show internal directories.
Click to hide internal directories.