Concurrency control, Matrix paths and Coin weighing puzzle
Filed under Oracle
The question
Discussed concurrency measures when reading/writing records concurrently, finding the number of ways to reach the bottom-right corner of a matrix moving only right or down using dynamic programming, and identifying a heavy bag of coins among 10 bags using a weighing machine only once.
No write-up yet. Related questions below have one.
Related Oracle questions
Collected from public candidate posts and coding forums. Updated Nov 2026.