第 1 / 2 页
非代码面试题
显示 20 / 25 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
826Two-Stage Pipeline Completion 17 identical jobs each require 3 minutes on Stage 1 and then 5 minutes on Stage 2. Each stage handles at most one job at a time, and a job can enter Stage 2 immediately after Stage 1 if Stage 2 is free. What is the earliest completion time of all jobs?脑筋急转弯简单brainteaser未尝试免费831Escort Cart Trip Count 12 staff members and 2 trained couriers start on one side of a corridor. A cart carries at most two people, and only couriers can drive it. Assuming at least two couriers are available, what is the minimum number of one-way cart trips needed to move everyone across if staff must always ride with a courier?脑筋急转弯中等brainteaser未尝试免费836Minimum Room Count 1Meetings occupy half-open time intervals [(9, 12), (10, 13), (11, 15), (14, 16)]. What is the minimum number of rooms needed so that all meetings can be scheduled without overlap?脑筋急转弯简单brainteaser未尝试免费837Minimum Room Count 2Meetings occupy half-open time intervals [(8, 10), (9, 11), (10, 12), (10, 13), (13, 15)]. What is the minimum number of rooms needed so that all meetings can be scheduled without overlap?脑筋急转弯简单brainteaser未尝试免费841Batch Shuttle Time 1A shuttle holds 5 people and takes 7 minutes for a one-way crossing. It must return after every outbound trip except the last. How many minutes are needed to move 23 people across?脑筋急转弯简单数值题未尝试免费846Periodic Window Alignment 1One maintenance window opens every 18 minutes and another opens every 24 minutes, both starting now. After how many minutes will they next open simultaneously?脑筋急转弯简单数值题未尝试免费5715Bridge and Torch CrossingFour people must cross a rickety bridge at night. They have one torch, and the bridge holds at most two people at a time. Anyone on the bridge must carry the torch, so the torch must be walked back for the next group. The four people walk at different speeds, needing 1, 2, 5, and 10 minutes respectively to cross; when two cross together they move at the slower person's pace. What is the minimum total time for all four to get across?脑筋急转弯中等brainteaser未尝试免费5716Measuring Four Units with a 3-Jug and a 5-JugYou have an unlimited water supply, a 3-unit jug, and a 5-unit jug, both unmarked. The only operations allowed are: fill a jug completely from the supply, empty a jug onto the ground, or pour from one jug into the other until the source is empty or the destination is full. What is the minimum number of such operations needed to end with exactly 4 units of water in a jug?脑筋急转弯简单brainteaser未尝试免费5717Ferrying Guards and PrisonersThree guards and three prisoners must cross a river using a single boat that holds at most two people and cannot cross empty (someone must row it). At no time and on neither bank may prisoners outnumber the guards present there (if guards are present); if no guard is on a bank, any number of prisoners there is fine. Everyone can row. What is the minimum number of one-way boat trips needed to move all six across safely?脑筋急转弯困难brainteaser未尝试面试订阅5718The Carry-One Ferry with Incompatible CargoA trader must ferry three items — a fox, a goose, and a sack of beans — across a river in a small boat that can carry the trader plus at most one item per trip. If left together unattended, the fox eats the goose, and the goose eats the beans (the fox ignores the beans). The trader rows every trip. What is the minimum number of one-way crossings needed to get all three items safely to the far bank?脑筋急转弯简单brainteaser未尝试免费5719Two Eggs, One Hundred FloorsThere is a 100-floor building and two identical eggs. An egg breaks if dropped from floor h or above for some unknown threshold h (and survives any drop below h); a survived egg can be reused, a broken one cannot. You want to determine h with certainty. Drops are made one at a time and you choose each next floor adaptively. What is the minimum number of drops that guarantees you can identify h in the worst case?脑筋急转弯困难brainteaser未尝试面试订阅5720Sorting Pancakes by Spatula FlipsA stack of four pancakes has diameters, from top to bottom, 3,1,4,2 (all distinct). The only allowed move is to insert a spatula under any pancake and flip the entire block above it, reversing the order of that top prefix. You want the pancakes sorted with the largest on the bottom and the smallest on top (i.e. top-to-bottom 1,2,3,4). What is the minimum number of flips required?脑筋急转弯中等brainteaser未尝试免费5721Shortest Possible Project Completion TimeA project has six tasks with durations (in hours): A=3, B=2, C=4, D=1, E=5, F=2. The precedence constraints are: A must finish before C and D start; B must finish before D starts; C and D must both finish before E starts; D must finish before F starts. Any number of tasks may run in parallel as long as all their prerequisites are complete. Starting at time 0, what is the earliest time at which all six tasks are finished?脑筋急转弯中等brainteaser未尝试免费5722Timing Fifteen Minutes with Two HourglassesYou have a 7-minute hourglass and an 11-minute hourglass, and you must time a process that takes exactly 15 minutes. You may start the process only at the moment you begin timing, and you may flip either hourglass whenever it runs out (or at any time). Using only these two hourglasses, what is the least total elapsed time in which you can mark off exactly a 15-minute interval starting from time zero?脑筋急转弯困难brainteaser未尝试面试订阅5723Sequencing Jobs Through Two MachinesThree jobs must each be processed first on Machine 1 and then on Machine 2, in that order. Each machine handles one job at a time, jobs cannot be preempted, and all jobs are available at time 0. Processing times (Machine 1, Machine 2) in minutes are: Job X = (3, 2), Job Y = (2, 4), Job Z = (4, 3). You may choose the order in which jobs enter the system (the same order is used on both machines). What is the minimum possible time at which all three jobs are completely finished?脑筋急转弯中等brainteaser未尝试面试订阅5724Ordering Jobs to Minimize Total WaitingA single server must process four jobs, one at a time with no idle gaps, all available now. Their processing times are 8, 2, 5, and 3 minutes. Each job's completion time is the moment it finishes, and you want to minimize the sum of all four completion times (equivalently, the average time a job spends in the system). In what order should the jobs be run, and what is the resulting minimum sum of completion times?脑筋急转弯中等brainteaser未尝试免费5725Frying Three Steaks on a Two-Slot GriddleA griddle can hold at most two steaks at once. Each steak must be cooked on both sides, and each side takes exactly 1 minute. You can take a steak off and put it back later, and swap steaks freely between minutes, but a side can only cook while the steak is on the griddle. You have three steaks to cook, each needing both sides done. What is the minimum total time to finish all three?脑筋急转弯简单brainteaser未尝试免费5726Measuring 45 Minutes with Two RopesYou have two ropes. Each rope takes exactly 60 minutes to burn from one end to the other, but neither burns at a uniform rate (a half-burned rope is not necessarily half-consumed in time). You may light either end of either rope at any moment. Using only these ropes and a way to light them, how do you measure exactly 45 minutes, and what is the shortest real time in which you can finish measuring it?脑筋急转弯简单brainteaser未尝试免费5727The Circular Gas Station TourFive gas stations are arranged in a circle, numbered 1 through 5 in clockwise order. Driving clockwise from station i to the next station costs a fixed amount of fuel. At station i you may pick up gas[i] units, and the drive from station i to the next one consumes cost[i] units. The amounts are gas = [1, 2, 3, 4, 5] and cost = [3, 4, 5, 1, 2]. Your tank starts empty and has unlimited capacity. From which single station can you start, pick up its gas, and drive all the way around the circle returning to the start without the tank ever going negative?脑筋急转弯中等brainteaser未尝试免费5728Tower of Hanoi with Five DisksFive disks of distinct sizes are stacked on the first of three pegs, largest at the bottom and smallest on top. You move disks one at a time from the top of any peg to the top of another peg, and a disk may never be placed on top of a smaller disk. What is the minimum number of single-disk moves needed to transfer the entire stack to the third peg?脑筋急转弯中等brainteaser未尝试免费