CodeSignal Technical Assessment Algorithm Design 2

Question 1

Which algorithmic technique solves the 0/1 Knapsack problem optimally?

Accepted Answer

Dynamic programming

Answer

Greedy algorithm

Answer

Divide and conquer

Answer

Backtracking only

Question 2

What is the worst-case time complexity of quicksort?

Accepted Answer

O(n²)

Answer

O(n log n)

Answer

O(n)

Answer

O(log n)

Question 3

In Dijkstra's algorithm, which data structure gives the best practical performance?

Accepted Answer

Min-heap (priority queue)

Answer

Stack

Answer

Unsorted array

Answer

Max-heap

Question 4

Which sorting algorithm is stable and has O(n log n) worst-case time?

Accepted Answer

Merge sort

Answer

Quicksort

Answer

Heapsort

Answer

Shell sort

Question 5

What does memoization primarily optimize?

Accepted Answer

Repeated computation of identical subproblems

Answer

Space usage by compressing arrays

Answer

Cache eviction policies

Answer

Sorting order of recursive calls

Question 6

Which problem can be solved with the sliding window technique?

Accepted Answer

Maximum sum subarray of size k

Answer

Finding the shortest path in a graph

Answer

Detecting cycles in a linked list

Answer

Checking balanced parentheses

Question 7

What is the purpose of a sentinel value in algorithm design?

Accepted Answer

To simplify boundary checks by providing a dummy boundary element

Answer

To mark the end of recursion depth

Answer

To store intermediate DP results

Answer

To balance a binary search tree