Part 5: Common Coding Interview Problems

In a _____ problem, you usually print numbers in a range, but for certain multiples you print special words instead.

FizzBuzz

To _____ a string means to return the characters in the opposite order.

reverse

A(n) _____ check is used to see whether a word or phrase reads the same forward and backward.

palindrome

To _____ vowels in a string means to find how many letters are vowels.

count

To _____ characters in a string means to find how many total letters, symbols, or spaces it contains.

count

To _____ words in a string means to find how many separate words appear in the text.

count

To find the _____ in a(n) _____ means to return the largest value it contains.

max, array

To find the _____ in a(n) _____ means to return the smallest value it contains.

min, array

To _____ duplicates from a list means to return only the unique values.

remove

A(n) _____ count problem keeps track of how many times each character or value appears.

frequency

In the _____ _____ problem, you try to find two numbers that add up to a target value.

Two Sum

A(n) _____ parentheses problem checks whether opening and closing brackets are matched in the correct order.

valid

To _____ two sorted arrays means to combine them into one correctly sorted array.

merge

A(n) _____ search is used to quickly find a value in a sorted array by repeatedly cutting the search space in half.

binary

The first non

repeating _____ in a string is the first one that appears only once.

A(n) _____ check is used to see whether two words or strings contain the same letters in a different order.

anagram

To _____ a(n) _____ means to split it into smaller groups of a chosen size.

chunk, array

To _____ a nested array means to turn it into a single

level array.

To _____ duplicates means to find which values appear more than once.

find

To group array items by a(n) _____ means to organize them based on a shared field, key, or attribute.

property

To _____ a linked list means to change the direction of its nodes so the last node becomes the first.

reverse

A(n) _____ traversal means visiting all the nodes in a tree in a specific order.

tree

_____ stands for Breadth

First Search, which visits graph nodes level by level.

_____ stands for Depth

First Search, which explores one path as far as possible before backing up.

A(n) _____ recursion problem is a basic problem where a function solves a smaller version of itself until it reaches a stopping point.

simple

A(n) _____ _____ problem uses a moving range of values to solve array or string problems more efficiently.

sliding window

A(n) _____ map problem usually uses key

value pairs to store and look up data quickly.

A(n) _____ problem often involves Last In, First Out behavior, where the most recent item added is the first removed.

stack

A(n) _____ problem often involves First In, First Out behavior, where the first item added is the first removed.

queue

A(n) _____ dynamic programming problem like climbing stairs is solved by reusing answers from smaller subproblems instead of solving them again and again.

simple