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…