Zomato Interview Questions

You are given an array of integers. Determine if you can split the array into two non-empty subarrays such that the products of the numbers in each subarray are coprime (no common factors other than 1).

Calculate all possible subsequence sums from a given array of numbers. Return the bitwise OR of all those sums.

Imagine a long corridor with plants and seats. Find the number of ways to divide the corridor into sections, ensuring each section has exactly two plants.

Find the shortest cycle (path that starts and ends at the same node) in a given graph. Return the length of this shortest cycle.

You are given a list of shops, each having some items with associated prices. Maximize your total spending by strategically buying one item from each shop, considering a spending coefficient that increases with each purchase.

Imagine you only know the differences between adjacent numbers in a secret sequence. Given these differences and a range, count how many valid hidden sequences could exist within that range.

Find the smallest positive integer that is missing from a given array of integers. You need to do this in linear time and constant extra space.

You're given a list of worker costs and need to hire exactly K workers. Determine the minimum total cost to hire these workers by strategically selecting them from the cheapest available at either end of the list.

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

Determine if a word matches a given pattern, where a match means there's a one-to-one mapping between letters in the word and the pattern. You need to find all words from a list that match the provided pattern.

You're given an array where every number appears twice, except for two numbers that appear only once. Find those two unique numbers.

Find all unique triplets in an array that sum to zero. You'll need to consider the potential for duplicate numbers and avoid duplicate triplets in your solution.

Find the number of unique paths from the top-left to the bottom-right corner of a grid, but with obstacles blocking some paths. You need to navigate the grid avoiding the obstacles.

Find all unique combinations of numbers from a given array that sum up to a target value. Each number in the array can only be used once in each combination.

Determine if a given sequence of moves in a 2D plane causes the path to cross itself. The moves represent distances in the order north, west, south, and east.

Find two numbers in a sorted array that add up to a specific target value. Return the indices of these two numbers.

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

You are given an array where each element represents the maximum jump length from that position. Find the minimum number of jumps required to reach the last index.

Design and implement a Least Frequently Used (LFU) cache. The cache should efficiently store key-value pairs, evicting the least frequently used items when it reaches capacity.

You're given a sorted array where every element appears twice, except for one element that appears only once. Find and return this single, unique element.