Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/TheAlgorithms/TypeScript
/ types & classes
Types & classes
56 in github.com/TheAlgorithms/TypeScript
⨍
Functions
286
◇
Types & classes
56
Class
data_structures/tries/tries.ts:4
Class
data_structures/tries/tries.ts:19
Class
data_structures/heap/heap.ts:12
Class
data_structures/heap/heap.ts:138
Class
data_structures/heap/heap.ts:144
Class
data_structures/heap/heap.ts:150
Class
data_structures/stack/stack.ts:7
Class
data_structures/stack/linked_list_stack.ts:9
Class
data_structures/queue/array_queue.ts:8
Class
data_structures/queue/stack_queue.ts:13
Class
data_structures/queue/circular_queue.ts:10
Class
data_structures/queue/linked_queue.ts:14
Class
data_structures/map/hash_map.ts:16
Class
data_structures/map/hash_map.ts:231
Class
data_structures/list/doubly_linked_list.ts:15
Class
data_structures/list/doubly_linked_list.ts:290
Class
data_structures/list/singly_linked_list.ts:10
Class
data_structures/list/singly_linked_list.ts:28
Class
data_structures/set/map_set.ts:11
Class
data_structures/set/hash_map_set.ts:11
Class
data_structures/disjoint_set/disjoint_set.ts:17
Class
data_structures/tree/binary_search_tree.ts:6
Class
data_structures/tree/binary_search_tree.ts:29
Class
graph/kruskal.ts:39
Class
graph/prim.ts:63
Class
ArrayQueue
data_structures/queue/array_queue.ts:8
Class
BinarySearchTree
data_structures/tree/binary_search_tree.ts:29
Enum
Calendar
maths/zellers_congruence.ts:None
Class
CircularQueue
data_structures/queue/circular_queue.ts:10
Interface
CoinChange
dynamic_programming/coin_change.ts:1
Class
DisjointSet
data_structures/disjoint_set/disjoint_set.ts:17
Class
DoublyLinkedList
data_structures/list/doubly_linked_list.ts:15
Class
DoublyLinkedListNode
* Represents a node in a doubly linked list. * * @template T The type of the value stored in the node. * @property value The value stored in the no
data_structures/list/doubly_linked_list.ts:290
Class
Edge
graph/kruskal.ts:39
Class
Edge
graph/prim.ts:63
Class
HashMap
data_structures/map/hash_map.ts:16
Class
HashMapSet
data_structures/set/hash_map_set.ts:11
Interface
LinkedList
data_structures/list/linked_list.ts:4
Class
LinkedListStack
data_structures/stack/linked_list_stack.ts:9
Class
LinkedQueue
data_structures/queue/linked_queue.ts:14
Class
ListNode
* Represents a node in a linked list. * * @template T The type of the data stored in the node. * @property data The data stored in the node. * @pr
data_structures/list/singly_linked_list.ts:10
Interface
Map
data_structures/map/map.ts:6
Class
MapEntry
data_structures/map/hash_map.ts:231
Class
MaxHeap
data_structures/heap/heap.ts:144
Class
MinHeap
data_structures/heap/heap.ts:138
Class
PriorityQueue
data_structures/heap/heap.ts:150
Interface
Queue
data_structures/queue/queue.ts:1
Interface
Set
data_structures/set/set.ts:4
Class
SinglyLinkedList
data_structures/list/singly_linked_list.ts:28
Class
Stack
data_structures/stack/stack.ts:7
Class
StackQueue
data_structures/queue/stack_queue.ts:13
Interface
TestCase
maths/test/prime_factorization.test.ts:3
Interface
TestCase
dynamic_programming/test/coin_change.test.ts:3
Class
TreeNode
* Represents a node of a binary search tree. * * @template T The type of the value stored in the node.
data_structures/tree/binary_search_tree.ts:6
Class
Trie
data_structures/tries/tries.ts:19
Class
TrieNode
* Represents a node in a Trie data structure.
data_structures/tries/tries.ts:4