Yelp Interview Questions

You are given a list of paths, where each path connects two cities. Find the destination city, which is the city that has a path coming in but no path going out.

You're given a list of restaurants with their vegan-friendly status, price, and distance. Select the restaurants that match specified vegan, price, and distance criteria and return their IDs in sorted order.

Determine if it is possible to finish all courses given prerequisite relationships between them. Essentially, detect if a cycle exists in the course dependencies.

Find all the shortest transformation sequences from a start word to an end word, using a dictionary of valid words. You can only change one letter at a time.

You're given two lists of strings representing favorite restaurants. Find the common strings with the minimum index sum across both lists.

Determine if two strings are anagrams of each other, meaning they contain the same characters in a different order. You need to check if one string can be rearranged to form the other.

Reverse the order of words in a given string. The input string may contain leading or trailing spaces, which should be removed in the output.

Find the k most frequently occurring words in a given list of words. Return the top k words sorted by frequency, and then alphabetically for words with the same frequency.

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

You are given the head of a singly linked list. Reverse the list and return the new head.

Transform one word into another, one letter at a time, using only words from a given dictionary. Find the shortest sequence of words to reach the target.

Design a data structure that supports insertion, deletion, and random element retrieval, all in constant time on average. You'll need to handle edge cases carefully to achieve O(1) complexity.

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

Compress a given string by replacing consecutive repeating characters with the character followed by the count of repetitions. If the compressed string isn't shorter, return the original.

Given a string, generate all possible strings by changing each letter to lowercase or uppercase. Return a list of all these possible strings.

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

Imagine you are looking at a city skyline. Given the locations and heights of buildings, find the outline of the skyline formed by these buildings when viewed from a distance.

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

Determine if any word in a given sentence starts with a specified search word. Return true if the search word is a prefix of at least one word in the sentence, and false otherwise.