Each person wants to eat one cake. People tend to get the cake that is the closest to him/her.However, if he/she finds that this cake already belongs to someone else, the person will give up that cake and look for the next closest cake. The number of cakes is never smaller than the number of…

Given a 1-d space, represented as an int array.Each element in this array can have one of the three values {0, 1, 2} with meanings: The distance between a cake and a person is defined as the number of spaces between them. Please write a method to get the minimum distance between any person and…

Given an m × n array of characters, and a list of strings.Return the subset of the strings that are found in the array. You are given a character grid and a list of candidate words.Your task is to return all words that can be formed by tracing adjacent cells in the grid (typically up,…

Problem statement:Given an array of strings (terms) and a target string, find the number of occurrences of each term in the target. You only need to implement the Count method. Parameters / Requirements: Without regex, implement multi-pattern counting. Options: naive sliding checks with indexing by first letter/length, or Aho–Corasick for optimal performance. Count overlapping matches…

Given two integers, numerator and denominator, return the decimal representation of the fraction numerator/denominator as a string. Examples Simulate long division. Track each remainder’s first index in the fractional string via a hash map. When a remainder repeats, insert parentheses around the substring from its first occurrence to the end. Handle sign, zero integer part,…

Given an array of words and an array of sentences, calculate how many distinct sentences can be created by replacing any word with one of its anagrams. Note:• Two words are said to be anagrams of each other if one can be created by rearranging the letters of the other word, using all the original…

Background Congratulations! Your next best-selling novel is finally finished. You cut/paste text fragments from your various notes to build the final manuscript. But you are a terrible typist! Often you press the “paste” key multiple times by mistake. You’d better fix those errors before sending it off to the publisher. Fortunately, you can code better…

Two Sigma Question 1 — Merge Sensor Data The Merger class has two public methods: acceptBatches(batches: List<List<…>>) :Pass N batches of delta-encoded elements where the ith batch corresponds to data from the ith sensor.Data within a batch is sorted by timestamp and delta-encoded.Do not rely on references to the batches after acceptBatches returns. getNextElement() →…

An application running on Linux used to process 1000 requests/second. Now it only processes ~2 requests/second.How would you troubleshoot this issue? A. Frame the problem (1–2 min) B. Quick triage (5 min, command set) C. Locate the bottleneck D. Common instant fixes E. Verify & prevent (close loop) Answer pattern (talk track): start with measurement…

Given an array of integers nums and an integer target, return an array of arrays containing all unique triplets that add up to target. Each returned triplet must be in ascending order, and the final result must not contain duplicate triplets. You may assume nums has at least 3 elements. Example: This is a generalized…