You’re given a log stream of a chat application.Every log entry has the following fields:- timestamp: long – the number of seconds that have elapsed since 1970-01-01.- sender: string – username of the sender- receiver: string – username of the receiver- message_text: string – the message payloadWe want to implement a log stream processor which…

Design File Storage SystemDesign the file storage system with: This is a scoped storage-system design: define core entities (Company/User/File/Category), permissions at company scope, and APIs for upload/update/download/search. Interviewers expect discussion on metadata indexing for search, storage layout (object store), versioning for updates, and access checks on every operation. Optional: audit logs, quotas, and multi-tenant isolation.

Valid Parentheses CheckerGiven a string s containing only ‘(‘ , ‘)’ , ‘{‘ , ‘}’ , ‘[‘ , ‘]’, return True if valid: opens must be closed by same type and in correct order. Test Cases Classic stack validation: push opening brackets, on closing bracket check top matches type, otherwise invalid; finally stack must be…

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…