第 3 / 5 页
非代码面试题
显示 20 / 100 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
791Color Ledger Hat Deduction 6A public ledger says the room contains hats with totals 'red': 3, 'blue': 3, 'green': 1 . One player sees visible hats ['blue', 'red', 'blue'] on the other unrevealed players and has already heard earlier exact declarations ['red', 'green', 'red']. What is that player's own hat color?脑筋急转弯简单brainteaser未尝试免费792Color Ledger Hat Deduction 7A public ledger says the room contains hats with totals 'red': 2, 'blue': 2, 'green': 3 . One player sees visible hats ['green', 'blue', 'green'] on the other unrevealed players and has already heard earlier exact declarations ['red', 'blue', 'green']. What is that player's own hat color?脑筋急转弯中等数值题未尝试免费793Color Ledger Hat Deduction 8A public ledger says the room contains hats with totals 'red': 1, 'blue': 4, 'green': 2 . One player sees visible hats ['blue', 'blue', 'green'] on the other unrevealed players and has already heard earlier exact declarations ['blue', 'red', 'green']. What is that player's own hat color?脑筋急转弯中等brainteaser未尝试面试订阅794Color Ledger Hat Deduction 9A public ledger says the room contains hats with totals 'red': 3, 'blue': 1, 'green': 2 . One player sees visible hats ['red', 'green', 'red'] on the other unrevealed players and has already heard earlier exact declarations ['blue', 'green']. What is that player's own hat color?脑筋急转弯困难brainteaser未尝试面试订阅795Color Ledger Hat Deduction 10A public ledger says the room contains hats with totals 'red': 2, 'blue': 3, 'green': 2 . One player sees visible hats ['blue', 'green', 'blue'] on the other unrevealed players and has already heard earlier exact declarations ['red', 'red', 'green']. What is that player's own hat color?脑筋急转弯困难brainteaser未尝试面试订阅796Mixed Audit Hat Deduction 5A public ledger says the room contains hats with totals 'red': 2, 'blue': 2, 'green': 1, 'yellow': 1 . The current player can see still-unrevealed hats ['blue', 'yellow']. Earlier in the round, audited declarations were: Player 1 guessed blue and was marked wrong; Player 2 guessed blue and was marked wrong; Player 3 guessed red and was marked correct. What is the current player's own hat color?脑筋急转弯简单brainteaser未尝试免费797Mixed Audit Hat Deduction 6A public ledger says the room contains hats with totals 'red': 2, 'blue': 2, 'green': 1, 'yellow': 1 . The current player can see still-unrevealed hats ['blue', 'yellow']. Earlier in the round, audited declarations were: Player 1 guessed green and was marked wrong; Player 2 guessed green and was marked wrong; Player 3 guessed red and was marked correct. What is the current player's own hat color?脑筋急转弯中等数值题未尝试免费798Mixed Audit Hat Deduction 7A public ledger says the room contains hats with totals 'red': 2, 'blue': 2, 'green': 1, 'yellow': 1 . The current player can see still-unrevealed hats ['blue', 'yellow']. Earlier in the round, audited declarations were: Player 1 guessed red and was marked correct; Player 2 guessed red and was marked wrong; Player 3 guessed red and was marked wrong. What is the current player's own hat color?脑筋急转弯简单brainteaser未尝试免费799Mixed Audit Hat Deduction 8A public ledger says the room contains hats with totals 'red': 2, 'blue': 2, 'green': 1, 'yellow': 1 . The current player can see still-unrevealed hats ['blue', 'red']. Earlier in the round, audited declarations were: Player 1 guessed yellow and was marked wrong; Player 2 guessed red and was marked correct; Player 3 guessed yellow and was marked wrong. What is the current player's own hat color?脑筋急转弯中等数值题未尝试免费800Mixed Audit Hat Deduction 9A public ledger says the room contains hats with totals 'red': 2, 'blue': 2, 'green': 1, 'yellow': 1 . The current player can see still-unrevealed hats ['blue', 'red']. Earlier in the round, audited declarations were: Player 1 guessed green and was marked wrong; Player 2 guessed green and was marked wrong; Player 3 guessed blue and was marked correct. What is the current player's own hat color?脑筋急转弯困难brainteaser未尝试面试订阅801Binary Query Budget for Composite State 1A hidden system state is determined by a venue among 7 choices, a regime among 4 choices, and a throttle flag among 2 choices. Each yes/no query can return one bit. What is the minimum number of yes/no queries needed to guarantee identifying the full hidden state?脑筋急转弯简单brainteaser未尝试免费806Ternary Diagnostic Rounds 1A health check returns one of three colors each round: green, amber, or red. If there are 28 possible hidden states to distinguish, what is the minimum number of rounds needed to identify the state with certainty?脑筋急转弯中等brainteaser未尝试免费811Mixed-Outcome Signature Slack 1A diagnostic protocol has answer slots with outcome counts [2, 2, 3]. If it must encode exactly 11 hidden states, how many answer signatures remain unused under a perfect injective assignment?脑筋急转弯简单brainteaser未尝试免费815Mixed-Outcome Signature Slack 5A diagnostic protocol has answer slots with outcome counts [2, 2, 2, 3]. If it must encode exactly 19 hidden states, how many answer signatures remain unused under a perfect injective assignment?脑筋急转弯简单brainteaser未尝试免费816Modulo Checksum Recovery 1A packet contains integer fields modulo 7. The published checksum says the total field sum is congruent to 4 mod 7. You observe all but one field, whose visible values are [3, 5, 6, 1]. What is the missing field value modulo 7?脑筋急转弯中等brainteaser未尝试免费818Modulo Checksum Recovery 3A packet contains integer fields modulo 11. The published checksum says the total field sum is congruent to 4 mod 11. You observe all but one field, whose visible values are [8, 6, 1, 3, 5]. What is the missing field value modulo 11?脑筋急转弯中等brainteaser未尝试免费821Signature Feasibility Check 1A protocol has answer slots with outcome counts [2, 2, 2]. Can it encode 9 hidden states injectively?脑筋急转弯简单brainteaser未尝试免费823Signature Feasibility Check 3A protocol has answer slots with outcome counts [3, 3]. Can it encode 8 hidden states injectively?脑筋急转弯中等brainteaser未尝试免费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未尝试免费