golang

type BinaryMatrix interface {
	Get(row int, col int) int
	Dimensions() []int
}

type Cache struct {
	// contains filtered or unexported fields
}

type Cacheable interface {
	Load(keys ...int) (int, bool)
	Save(val int, keys ...int)
}

type CustomStack struct {
	// contains filtered or unexported fields
}

type DoubleListNode struct {
	Val  int
	Next *DoubleListNode
	Prev *DoubleListNode
}

type FindElements struct {
	// contains filtered or unexported fields
}

type FirstUnique struct {
	// contains filtered or unexported fields
}

type FoodItem struct {
	// contains filtered or unexported fields
}

type FoodItemsPQ struct {
	// contains filtered or unexported fields
}

type FoodRatings struct {
	// contains filtered or unexported fields
}

type IntHeap []int

type IntSlice []int

type KthLargest struct {
	// contains filtered or unexported fields
}

type ListNode struct {
	Val  int
	Next *ListNode
}

type Logger struct {
	// contains filtered or unexported fields
}

type MRUQueue struct {
	// contains filtered or unexported fields
}

type MovingAverage struct {
	// contains filtered or unexported fields
}

type MyCalendar struct {
	// contains filtered or unexported fields
}

type MyCircularDeque struct {
	// contains filtered or unexported fields
}

type MyCircularQueue struct {
	// contains filtered or unexported fields
}

type MyHashMap struct {
	// contains filtered or unexported fields
}

type MyHashSet struct {
	// contains filtered or unexported fields
}

type MyQueue struct {
	// contains filtered or unexported fields
}

type Node struct {
	Val      int
	Children []*Node
}

type NumArray struct {
	// contains filtered or unexported fields
}

type NumberContainers struct {
	// contains filtered or unexported fields
}

type PairNode [2]int

type ParkingSystem struct {
	// contains filtered or unexported fields
}

type ProductOfNumbers struct {
	// contains filtered or unexported fields
}

type Queue[T Queueable] interface {
	Enqueue(val T)
	Dequeue() (T, bool)
	Peek() (T, bool)
	Size() int
	IsEmpty() bool
}

type Queueable interface {
	~int | ~*TreeNode | PairNode | ~[]int
}

type RandomizedSet struct {
	// contains filtered or unexported fields
}

type SeatManager struct {
	// contains filtered or unexported fields
}

type Set[T comparable] interface {
	Add(val T)
	Del(val T)
	Size() int
	Populate(vals ...T)
	Contains(val T) bool
	Values() []T
}

type Slice []int

type Stack[T Stackable] interface {
	Push(val T)
	Pop() (T, bool)
	Peek() (T, bool)
	Size() int
	IsEmpty() bool
}

type Stackable interface {
	~int | ~rune | ~string | ~*TreeNode | ~*ListNode
}

type SticksPQ []int

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

type TwoSum struct {
	// contains filtered or unexported fields
}

type ValidWordAbbr struct {
	// contains filtered or unexported fields
}