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…

Problem:Given an integer n, you may perform only the following operations: Your goal is to compute the smallest number of operations required to reduce n to 1. Example: This is a classic greedy + bit-manipulation problem.Two operations are allowed: The key insight comes from binary representation: This produces an O(log n) time greedy solution. This…

Part A — Leaves are the only“alive”nodes You are given a binary tree whose nodes have integer values.Define an alive node as a leaf node.Find the maximum path sum between any two alive nodes in the tree.A path is a sequence of connected nodes; its sum is the sum of node values along the path….

You are given n cities on a Cartesian plane.For each city i, you know: For every queried city q, return the name of the nearest city that shares either the same x or the same y coordinate with q. If no other city shares the same x or the same y with q, return “NONE”….

Many companies provide their employees time-limited DoorDash credits as perks.Each credit: A customer placing one order can combine multiple credits, as long as their time windows overlap with the order time. You are given a list of credits, each represented as: Your task is to determine the maximum credit amount the customer can use at…

DoorDash uses machine learning to recommend users items that are similar to ones they have ordered before. Each item is assigned an integer score, and the similarity between two items is defined by how close their scores are. Given: Return the mostSimilarItems items that are closest in score to the target score. The smaller the…