In modern C++, given a 2D matrix of ‘float’s, write a C++ function to transpose it. This tests basic matrix manipulation plus“modern C++”API design: choosing an appropriate container (e.g., std::vector<std::vector<float>> or a flat vector with row/col indexing), handling non-square matrices, and deciding whether to return a new transposed matrix or transpose in-place (only possible for…

Modify your implementation to support different types of restrictions.Possible restrictions are: This is about extensible design: model restrictions as composable policies (not a single enum), support multiple restrictions per tag, and define evaluation order (e.g., log then block or block then log). Interviewers look for clean abstractions, easy future extension (new restriction types), and clear…

Problem Description — Load Balancer Implement a prototype round-robin load balancing algorithm for n servers, numbered from 1 to n, handling m incoming requests. Each request i: Server Assignment Rules Output Requirement For each request, return: Function Description Complete the function: Parameters Returns Example Request Processing Order (by arrival time) Request Index Arrival Burst Completion…

This is a classic array problem that frequently appears in interviews, with tricky edge cases caused by negative numbers. The key challenge lies in handling sign changes that can flip maximum and minimum products. Interviewers use this question to evaluate a candidate’s reasoning process, adaptability, and ability to explain dynamic decision-making clearly during live interviews….

Question 1: String Replace Without Using Built-in Functions Question 2: LinkedIn Connection Distance These questions reflect LinkedIn’s focus on fundamental implementation skills and graph-based reasoning. The string replacement problem tests low-level string traversal and edge-case handling without relying on built-in helpers. The connection distance problem maps directly to shortest path search in an unweighted graph….

This problem tests a candidate’s ability to map phone keypad digits to letters and efficiently match words against a given dictionary. The key is avoiding brute-force generation and instead using reverse mapping or preprocessing strategies. Interviewers focus heavily on reasoning clarity, optimization choices, and time complexity discussion. In live interviews, explaining the approach clearly is…

I successfully received an offer from Nvidia (US), and I’d like to share my complete interview experience here. Hopefully, this can serve as a reference for those who are preparing for interviews at Nvidia or similar companies. The first round was a phone interview with the hiring manager. This round mainly focused on my background…

This problem asks you to design a simplified package manager similar to Homebrew or APT. At its core, it tests your ability to:

Build a 3×3 grid of light cells (omitting the center cell),where you can click on the cells to activate them (turn green). When all the cells have been activated,they will be deactivated one-by-one in the reverse order they were activated,with a 300ms interval in between. A practical UI problem involving event ordering, async timing, and…

Problem Description (Original) 1. Problem You are given a simple web page layout with a navigation menu: The page initially loads only the basic structure. 2. Solution / Requirement Implement lazy loading, where content is loaded only when needed, instead of loading everything at page initialization. You are also required to add content dynamically to…

Problem Description You are given a sorted list of distinct integers ranging from 0 to 99. For example: Your task is to produce a string that describes the numbers missing from the list. In this example, the missing numbers are: Examples This problem asks you to scan a sorted list of integers and generate a…

Problem Description There are a total of numCourses courses you have to take, labeled from 0 to numCourses – 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. For example, the pair [0, 1] indicates that to…

From a Data Structure Question to“Are You a Fit for Infrastructure Work” The interviewer was an engineer working on Kafka / streaming infrastructure, and the style was very clear from the beginning:they were not rushing you to write code, and they were not looking for a“perfect solution in the first minute.”Instead, the interview kept moving…

You must design a BusTracker that knows the ordered list of stations and where each bus currently is. nearestBusToStation returns the minimum number of forward stops from a given station until you meet any bus (or -1 if all buses are behind it). getBusLocation is just a lookup from bus id to its station. A…

You have a multi-level linked list where each node has next and optional down pointers. The goal is to“flatten”it into a single-level list by splicing every down chain between the parent node and the parent’s original next, preserving relative order within each chain. Recursion or an explicit stack both work: when you see a down,…

This is the same wildcard-binary problem in a shorter form: given a binary string containing ?, generate all possible binary strings by replacing each ? with 0 or 1. The examples show how a single ? doubles the outputs, and multiple wildcards lead to 2^k combinations where k is the number of ? characters. Bloomberg…

You are asked to implement a function that recursively walks through a directory and all its subdirectories, finds every .csv file, reads each line, extracts the second column, and sums all integer values found there. Files with other extensions should be ignored. The second column is guaranteed to contain integers. The final result is the…

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: