Como se preparar para entrevistas na NVIDIA

+10

Design a Job Scheduler

Design a distributed job scheduler that can handle high-throughput job processing (10,000+ jobs per second), support both scheduled (cron-based) and ad-hoc job execution, include retry mechanisms for failed jobs, and maintain execution history for up to one year.

+3

Design a Ticket Booking System

Design a ticket booking system like Ticketmaster that handles high-traffic events, supports both seated and general admission tickets, and manages scenarios like flash sales with limited inventory and concurrent users.

+2

Leetcode 981. Time Based Key-Value Store

Design a time-based key-value store that records multiple values per key with timestamps and returns the value whose timestamp is the largest <= the queried timestamp. With timestamps per key strictly increasing and up to 2e5 operations, the typical solution uses per-key ordered timestamp/value lists and binary search to find the floor timestamp efficiently.

+1

Design LeetCode

Design an online coding judge system for programming competitions where users can submit solutions, view real-time leaderboards, and participate in timed contests with automatic code evaluation.

Design a Restaurant Booking Service

Design a restaurant booking system that allows users to search for restaurants by name, cuisine, or location (defaulting to 30 miles radius), and make, edit, or cancel individual or group reservations.

Explain how you managed a project with strict deadlines

Tell me about a conflict you had to resolve among teams and one that you had with your manager.

Leetcode 71. Simplify Path

Given an absolute Unix-style path, produce its canonical simplified form by collapsing multiple slashes and resolving "." (current dir) and ".." (parent dir) references. This is typically done by processing path segments (e.g., with a stack) to ensure a single leading slash, no trailing slash except for root, and no '.'/'..' tokens.

Leetcode 1723. Find Minimum Time to Finish All Jobs

Partition the given job times into k worker workloads so that the maximum sum assigned to any worker is as small as possible — a balanced k-way partitioning problem. With n ≤ 12 this is typically solved by exhaustive search/bitmask DP with strong pruning or by binary-searching the answer and checking feasibility via DFS.

Design Paste Bin with Monitoring

Design a paste bin service similar to Pastebin that allows users to create, share, and access text snippets with optional expiration dates and monitoring capabilities. The system should handle 4 writes per second, support unlimited content size, and include monitoring features to track usage and performance.

Leetcode 3067. Count Pairs of Connectable Servers in a Weighted Tree Network

For each node c in a weighted tree, count unordered pairs of distinct servers (a,b) (neither equal to c) such that the distances from c to a and to b are each divisible by signalSpeed and the paths from c to a and b go into different incident branches (edge-disjoint). The core task is, for every node, to compute distance residues (mod signalSpeed) of nodes in each neighboring subtree and sum cross-subtree products of nodes with residue 0 to get the pair counts.

Leetcode 1679. Max Number of K-Sum Pairs

Given an array and integer k, maximize the number of disjoint pairs whose elements sum to k — a frequency/ complement-matching problem (can be solved with hashing or two-pointer after sorting) for n up to 1e5.