Build Monuments
Reported by candidates from Unknown Company's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
You've got a problem called Build Monuments coming at you in the Unknown Company OA this March, and the lack of hints means it's probably testing your ability to read between the lines. These problems usually hide a math or greedy pattern in what sounds like a straightforward simulation. You'll need to figure out the constraint that makes the problem snap into focus. StealthCoder will be your safety net if you blank on the insight during the live assessment.
Pattern and pitfall
Without the full problem text, the title suggests you're either optimizing monument placement on a grid, maximizing some property of a monument configuration, or deciding the order to build them under resource constraints. Monument problems typically lean on greedy reasoning (build tallest first, or closest first) or math (calculate total cost or height with a formula). The trick is usually that a naive simulation times out, so you need to spot the pattern that lets you skip the iteration. If it's placement-based, think about geometry or sorting. If it's sequencing, greedy often works. StealthCoder will parse the exact constraint and offer the pattern in real time.
If this hits your live OA and you blank, StealthCoder solves it in seconds, invisible to the proctor.
You can drill Build Monuments cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. Built by an Amazon engineer who would have shipped this the night before his JPMorgan OA if he'd had it.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Unknown Company's OA.
Unknown Company reuses patterns across OAs. Built by an Amazon engineer who would have shipped this the night before his JPMorgan OA if he'd had it. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Build Monuments FAQ
Is this a sorting or greedy problem?+
Monument problems often are. If you're building them in some order (by height, cost, or position), sort first and iterate once. If you're placing them on a grid, think about whether a greedy choice at each step is optimal. Test it with a small example.
What if it's asking for the total cost or sum?+
Check for a formula. Monument totals often collapse to a closed-form equation (like n times (n+1) divided by 2, or similar). If you can derive it, you're done in O(1). That's the win.
How hard is this really for an OA?+
Medium, probably. It's not a classic LeetCode problem, so the insight is the bottleneck, not the code. Once you name the pattern, it's straightforward to implement in 15 minutes.
Can I brute force this?+
Depends on constraints you'll see in the OA. If n is under 1000, a nested loop might pass. If n is larger, you need the smart approach. Read the problem carefully for the hard limit.
What should I do if I blank on the pattern?+
Write a brute force solution first to get partial credit. Then use StealthCoder to see the optimized pattern in real time. That's exactly what it's built for.