CodeSignal Technical Assessment Algorithm Design 1

Question 1

What is the two-pointer technique?

Accepted Answer

Using two pointers moving toward each other or in the same direction to solve array problems efficiently

Answer

Using two programming languages

Answer

Having two monitors

Answer

Running two programs simultaneously

Question 2

What is the sliding window technique?

Accepted Answer

Maintaining a window of elements that slides through an array to solve subarray/substring problems

Answer

A GUI element

Answer

A file management system

Answer

A database query

Question 3

What is memoization?

Accepted Answer

Caching results of expensive function calls to avoid recomputation

Answer

A memory management technique

Answer

Writing notes while coding

Answer

A debugging method

Question 4

What is the greedy algorithm approach?

Accepted Answer

Making the locally optimal choice at each step hoping to find the global optimum

Answer

Always choosing the worst option

Answer

Random selection at each step

Answer

Exhaustive search of all possibilities

Question 5

What is Big O notation?

Accepted Answer

A mathematical notation describing the upper bound of an algorithms time or space complexity

Answer

A grading system

Answer

A file format

Answer

A programming language feature

Question 6

What is the difference between BFS and DFS?

Accepted Answer

BFS explores level by level using a queue; DFS explores as deep as possible using a stack

Answer

They produce identical results

Answer

BFS is always faster

Answer

DFS uses more memory