#Algoritma

24 pitakon

• Apa yaiku algoritma?Algorithms#algorithmsJunior›
• Piye cara binary search gumana lan apa sing dibutuhake?Algorithms#searchingJunior›
• Apa iku recursion?Algorithms#algorithmsJunior›
• Iterasi vs rekursi — apa kae trade-off-ne?Algorithms#algorithmsJunior›
• Apa iku teknik rong-pointer?Algorithms#algorithmsJunior›
• Apa iku teknik sliding-window?Algorithms#algorithmsJunior›
• Apa iku brute force, lan kapan iku bisa ditampa?Algorithms#algorithmsJunior›
• Carane merge sort bisa berfungsi?Algorithms#sortingMiddle›
• Piye cara quicksort nglaras lan apa iku kasuwan paling parah?Algorithms#sortingMiddle›
• Piye cara heap sort makarya?Algorithms#sortingMiddle›
• Piye cara hash map ngoptimalake algoritma?Algorithms#algorithmsMiddle›
• Apa iku paradigma divide-and-conquer?Algorithms#algorithmsMiddle›
• Apa iku algoritma greedy lan kapan bisa gumana?Algorithms#algorithmsMiddle›
• Apa iku backtracking?Algorithms#algorithmsMiddle›
• Apa iku prefix sum, lan kepriye cara nyepat range queries?Algorithms#algorithmsMiddle›
• Paano ngayon nggunakan Floyd tortoise lan hare kanggo ndeteksi cycle?Algorithms#algorithmsMiddle›
• Apa iku dynamic programming (memoization vs tabulation)?Algorithms#dynamic-programmingSenior›
• Kapan dynamic programming diterapake versus greedy?Algorithms#dynamic-programmingSenior›
• Papahe Dijkstra lan Bellman-Ford golek dalan paling cepet?Algorithms#graphsSenior›
• Apa iku topological sorting?Algorithms#graphsSenior›
• Kepiye cara Kruskal lan Prim ngbangun minimal spanning tree?Algorithms#graphsSenior›
• Apa iku union-find lan ing endi digunakake?Algorithms#graphsSenior›
• Apa trik-trik manipulasi bit yang umum?Algorithms#algorithmsSenior›
• Apa strategi sing apik kanggo ngatasi masalah coding-interview?Algorithms#algorithmsSenior›