Mining Question (Algo)
Grad Interview Questions
8,344 grad interview questions shared by candidates
Given incomplete logs from a race, find the order of the winners
Medium LeetCode question on LinkedList
add_route ( start, dest ) question print_all_destinations ( start, dest )
Design an Underground System with checkin, checkout and average times
First Phone interview: A scheduling problem looks like the regular on leetcode. Second Phone interview: A matrix problem
Describe the project I found challenging from my resume
Tell me about a technical project you worked on
Q: Leetcode rotate a matrix
You are given a database that describes N six-sided boxes, where one side of each box is open (no flaps). Each box has a unique integer ID and is defined by three dimensions: width, height, and length. Your task is to determine which boxes, if any, can fit inside other boxes, in order to consolidate space. A box A can fit inside box B if its base (length × width) can be completely placed within B’s base, in any rotational order. That means both dimensions of A’s base must be strictly smaller than the corresponding dimensions of B’s base, even after considering rotation (i.e., min(LA, WA) < min(LB, WB) and max(LA, WA) < max(LB, WB)). Additionally, box B’s height must be greater than or equal to box A’s height. You are expected to output valid box containment chains, where each box fits inside the next. An example of such an output chain might look like: A → C → Q → B or M → D → Z or R → O → E → Y, and so on. The idea is to show the maximum possible nesting or consolidation paths, based on the given dimension rules.
Viewing 7671 - 7680 interview questions