Types & classes — github.com/careercup/CtCI-6th-Edition-Go

CodeHub MCPcopy Create free account

hub / github.com/careercup/CtCI-6th-Edition-Go / types & classes

Types & classes19 in github.com/careercup/CtCI-6th-Edition-Go

⨍ Functions 122◇ Types & classes 19

↓ 2 callersTypeAliasintSlice

src/chapter3/stack_test.go:9

StructDoublyLinkedList

src/chapter2/linked_list.go:3

src/chapter3/problem2.go:7

Pet queue type, using PetInfo instead of int. Would be much easier if Go had generics.

src/chapter3/problem6.go:11

src/chapter3/problem6.go:24

StructPetShelter

Simple approach using two queues: one for dogs, one for cats. To find the oldest, we just check the oldest from each queue.

src/chapter3/problem6.go:77

TypeAliasPetType

src/chapter3/problem6.go:17

src/chapter3/queue.go:14

StructQueueUsingStacks

src/chapter3/problem4.go:7

InterfaceQueueable

src/chapter3/queue.go:7

StructSetOfStacks

Approaching this problem with the "stacks don't have to be at capacity" idea. This means that when we popAt, the target stack becomes the next stack t

src/chapter3/problem3.go:11

StructSliceMultiStack

Only including fixed stack size solution. Book states variable solution is too complex for an interview.

src/chapter3/problem1.go:10

StructSortStack

Sort stack based on using two stacks, where one is always in order and the other is used for temp storage during sorting.

src/chapter3/problem5.go:9

src/chapter3/stack.go:14

InterfaceStackable

src/chapter3/stack.go:7

src/chapter2/linked_list.go:9

StructpetQueueNode

src/chapter3/problem6.go:28

StructqueueNode

src/chapter3/queue.go:18

StructstackNode

src/chapter3/stack.go:18