Algorithms
Complexity, sorting and searching, recursion, dynamic programming and graph algorithms.
0/129
- 1What is an algorithm?Junior
- 2What properties should an algorithm have?Junior
- 3What does "discreteness" of an algorithm mean?Junior
- 4What are the "input data" and "output data" of an algorithm?Junior
- 5What is an algorithm flowchart?Junior
- 6What are the main blocks used in flowcharts?Junior
- 7What is a linear structure of an algorithm?Junior
- 9What are nested conditions?Junior
- 10What is a pre-condition loop?Junior
- 11What is a post-condition loop?Junior
- 12What types of algorithms exist by structure?Junior
- 13What is a linear algorithm?Junior
- 14What is a branching algorithm?Junior
- 16What does time complexity mean?Junior
- 17What does space complexity mean?Junior
- 18Why is it important to estimate complexity?Junior
- 19What does asymptotic complexity mean?Junior
- 20What is Big O notation?Junior
- 21What does "worst case" mean (worst case)?Junior
- 22What is recursion?Junior
- 23What is the base case of recursion?Junior
- 24What is the recursive case?Junior
- 25Why is it important for any developer to know algorithm basics?Junior
- 1What does "algorithm complexity" mean?Junior
- 3What does an "order-of-growth estimate" mean?Junior
- 4Why are constants and lower-order terms often ignored?Junior
- 5What is a function's "growth rate"?Junior
- 6What does O(n) - linear complexity - mean?Junior
- 7What does O(n²) - quadratic complexity - mean?Junior
- 8What does "worst case" mean?Junior
- 9How is an algorithm's memory usage measured?Junior
- 10How does creating new arrays affect complexity?Junior
- 11What is the "call stack" in the context of memory?Junior
- 12How does recursion affect space complexity?Junior
- 13What does "recursion depth" mean?Junior
- 15What is the complexity of bubble sort?Junior
- 16What is the complexity of binary search?Junior
- 1What is sorting?Junior
- 2What is the complexity of the fastest sorting algorithm? Why can't it be made faster?Junior
- 3What is a "key" in sorting?Junior
- 4What are exchange sorts (exchange sorts)?Junior
- 5What is selection sort (selection sorts)?Junior
- 6What is insertion sort (insertion sorts)?Junior
- 7What is merge sort (Merge Sort)?Junior
- 8How does BubbleSort work?Junior
- 9How does quicksort (Hoare partition) work?Junior
- 1What is search used for?Junior
- 2What is linear search?Junior
- 3What is binary search?Junior
- 4What is the complexity of binary search?Junior
- 5Why is the algorithm called "binary"?Junior
- 6Why does binary search require a sorted array?Junior
- 7What does a binary search tree (BST) do?Junior
- 8What is exponential search (exponential search)?Junior
- 2What is the time complexity of index access?Junior
- 3What is the complexity of inserting an element into the middle of an array?Junior
- 4Why is appending to the end of an array more efficient?Junior
- 5What does "dynamic array" mean?Junior
- 6What is amortized complexity?Junior
- 7How to iterate over an array with a loop?Junior
- 8How to find the maximum element of an array?Junior
- 9How to reverse an array?Junior
- 10How to find an element in an array using linear search?Junior
- 12What is the "sliding window" technique?Junior
- 13How to count a string's length without built-in methods or properties (length)?Junior
- 14How to implement naive substring search?Junior
- 15What is a suffix array?Junior
- 1What does a tree consist of?Junior
- 2What is a node (node)?Junior
- 3What is the height of a tree?Junior
- 4What is a binary tree?Junior
- 5What are the main types of tree traversal?Junior
- 6What does postorder traversal (postfix tree traversal) do?Junior
- 7What does preorder traversal (prefix traversal) do?Junior
- 9What does level-order traversal (traversing a tree by levels) do?Junior
- 10What does the stack do during traversal without recursion?Junior
- 11What is Depth-first search (DFS)?Junior
- 12What is Breadth-First Search (BFS)?Junior
- 13How does the search algorithm work with a binary tree?Junior
- 14Why is tree balancing needed?Junior
- 1What does a graph consist of?Junior
- 2What is a weighted graph?Junior
- 3What is a directed graph?Junior
- 4How can a graph be stored in memory?Junior
- 6What does the BFS algorithm do on graphs (Breadth-First Search)?Junior
- 7What does the DFS algorithm do on graphs (Depth-First Search)?Junior
- 8What does the queue do in BFS on graphs?Junior
- 9What does the stack do in DFS on graphs?Junior
- 10What is topological sorting in graphs?Junior
- 11How does Dijkstra's algorithm work on graphs?Junior
- 12What does the Bellman-Ford algorithm do on graphs?Junior
- 13What does the Floyd-Warshall algorithm do on graphs?Junior
- 1What is a greedy algorithm?Junior
- 3What does a locally optimal choice mean in a greedy algorithm?Junior
- 4What does a globally optimal solution mean in a greedy algorithm?Junior
- 5What does 'greedy choice criterion' mean?Junior
- 6What is "optimal substructure" in a greedy algorithm?Junior
- 7When is a greedy algorithm inefficient?Junior
- 8What problems are classically solved with a greedy algorithm?Junior
- 9How is the classic coin change problem solved using a greedy algorithm?Junior
- 1What is dynamic programming (DP)?Junior
- 2What is the difference between DP and a greedy algorithm?Junior
- 4What does "overlapping subproblems" mean in dynamic programming?Junior
- 5What is "memoizing intermediate results" needed for?Junior
- 6What is tabulation in DP?Junior
- 7What does "state" mean in DP?Junior
- 8Why is it important to choose the state correctly in dynamic programming?Junior
- 9How is the classic "knapsack problem" solved in dynamic programming?Junior
- 1What are the main types of problems combinatorics solves?Junior
- 2What does an "arrangement" mean in combinatorics?Junior
- 4What is a combination in combinatorics?Junior
- 5How to calculate the number of permutations of n elements?Junior
- 6How to calculate the number of combinations of n choose k?Junior
- 7What is Pascal's triangle?Junior
- 8What does number theory study?Junior
- 9How to calculate the sum of divisors of a number?Junior