You must implement the feedback mechanism of the Wordle game:Given a target 5-letter word and a user guess, return a 5-character feedback string where: A correct solution must also properly handle duplicate letters (e.g.,“staff”,“fluff”).

This problem asks you to segment a concatenated string into valid dictionary words. It is a classic word-break problem: greedily picking the longest prefix in the dictionary also works for this particular example, but in general you use dynamic programming or backtracking to find a valid segmentation. Bloomberg Interview Question: Count Ships in a Rectangular…

This problem asks you to design a command-line tool that, given a directory of Shakespeare text files and a target word, scans every file and reports:

This question asks you to merge overlapping and adjacent calendar intervals to produce a“busy view.”The key is to sort all intervals by start time and then sweep through them, merging when the next event starts before (or exactly at) the current merged interval’s end. Bloomberg Interview Question: Identify the First Process That Crashed You are…

This problem asks you to recursively or iteratively expand all ? positions in a binary string, producing every valid 0/1 combination. Each wildcard branches into two possibilities. A depth-first search (DFS) is the most natural solution. Bloomberg Interview Question: Maximum Travel Distance on a Circular Moon Route This is a circular route fuel-management problem. You…

This Bloomberg question asks you to design a deque-like data structure that supports inserting and removing from both ends, plus querying its size, all in constant time. The natural approach is to use a doubly linked list (or dynamic circular array) and maintain head, tail, and size fields so each operation touches only a few…

This Google interview problem simplifies a computer vision task: given a frame represented as an m×n matrix of 0s and 1s, where a spine tag corresponds to a square submatrix of 1s, determine how to detect that square quickly and efficiently. The challenge typically lies in finding the top-left coordinate and size of the square…

This Google interview problem describes an evacuation scenario: multiple flights leave the island tomorrow, and every islander has their own arrival time at the airport. Assuming planes fill up in departure-time order and seats are taken by whoever arrives earlier, you must compute the latest time you personally can arrive at the airport and still…

This Google problem asks you to determine whether a“needle”appears in a“haystack,”but with a twist: non-standard characters such as é, ë, æ, or å must be converted according to a given transliteration map before matching. The map can map one character to multiple English characters (e.g., “æ” → “ae”), so matching is not just one-to-one replacement…

“””Implement a restaurant waitlist data structure. It should support the following features: A party of customers can join the waitlist.A previously joined party can leave the waitlist at any time.The restaurant can ask the data structure for the first party that fits a given table size (a table size is given as an argument).“”” This…