Algoritma dan Struktur Data JavaScript

• Penjelasan tentang algoritma dan struktur data yang dikenal luas, mencakup contoh berbasis JavaScript serta video YouTube terkait [terjemahan bahasa Korea]

→ B : 63 untuk pemula

→ A : 69 untuk tingkat mahir

Struktur data

B: linked list, doubly linked list, queue, stack, hash table, heap, priority queue

A: trie, tree, binary search tree, AVL tree, red-black tree, segment tree, Fenwick tree, graph, disjoint set, Bloom filter

Algoritma

• Math

→ B : faktorial, bilangan Fibonacci, uji bilangan prima, algoritma Euclidean, KPK, sieve of Eratosthenes, cara memeriksa pangkat dua, segitiga Pascal

→ A : partisi bilangan bulat positif, algoritma π Liu Hui - mencari aproksimasi π berdasarkan N-gon

• Sets

→ B : Cartesian product, Fisher–Yates shuffle

→ A : power set, permutasi, kombinasi, longest common subsequence, longest increasing subsequence, Shortest Common Supersequence (SCS), masalah knapsack

• Strings

→ B : jarak Hamming - jumlah posisi dengan simbol yang berbeda

→ A : edit distance, algoritma Knuth-Morris-Pratt, algoritma Z, algoritma Rabin-Karp, longest common substring, regular expression matching

• Searches

→ B : pencarian linear, jump search, binary search, interpolation search

• Sorting

→ B : bubble sort, selection sort, insertion sort, heap sort, merge sort, quick sort, Shell sort, counting sort, radix sort

• Trees

→ B : depth-first search (DFS), breadth-first search (BFS)

• Graphs

→ B : depth-first search (DFS), breadth-first search (BFS), algoritma Kruskal

→ A : algoritma Dijkstra, algoritma Bellman-Ford, algoritma Floyd-Warshall, deteksi siklus, algoritma Prim, topological sort, articulation point, bridge, lintasan Euler dan sirkuit Euler, lintasan Hamilton, strongly connected component, masalah travelling salesman

• Uncategorized

→ B : Menara Hanoi, rotasi matriks persegi, jump game, contoh algoritma greedy, unique paths, masalah trapping rain water

→ A : masalah N-Queens, Knight's Tour

Algoritma berdasarkan paradigma

• brute force

• algoritma greedy

• divide and conquer

• dynamic programming

• backtracking