Types of Algorithms

Question 1

Brute Force

Answer 1

straightforward approach to solve problem by trying all possible solutions

Question 2

Greedy

Answer 2

make the locally optimal choice at each stage with the hope that these local solutions will lead to a global optimum

Question 3

Dynamic Programming

Answer 3

divide the problem into smaller subproblems and storing the solutions to subproblems to avoid redundant calculations

Question 4

Divide & Conquer

Answer 4

divide the problem into smaller subproblems, solve them independently and then combine the results to solve overall problem

Question 5

Backtracking

Answer 5

Systematically explore all possible solutions by trying and rejecting possibilities based on constraints

Question 6

A _____ approach to finding the smallest coin combination to make a certain amount of money involves picking the largest coins first

Answer 6

Greedy Algorithm

Question 7

Merge Sort divides an array into two halves, sorts each half, and then merges them back together. This is an example of:

Answer 7

Divide and Conquer Algorithms

Question 8

_______ stores the solutions to overlapping subproblems so that you do not solve the same problem multiple times. It’s used for optimization problems.

Answer 8

Dynamic Programming