Bentley Systems coding interview
questions, leaked.
2 problems reported across recent Bentley Systems interviews. Top patterns: hash table, string, greedy. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Bentley Systems has a small but dense assessment. Two problems, one easy and one medium, but they hit six different patterns across hash tables, strings, greedy logic, counting, arrays, and dynamic programming. You're not looking at breadth here. You're looking at depth. Each problem is built to expose gaps in pattern recognition and implementation speed. If you've practiced these topics separately, you'll be fine. If you haven't, StealthCoder gives you the real-time safety net when the live OA starts. You don't have time to be slow on this one.
Top problems at Bentley Systems
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Largest Palindromic Number | MEDIUM | 100.0 | 36% | Hash Table · String · Greedy |
| 02 | Best Time to Buy and Sell Stock | EASY | 100.0 | 55% | Array · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Bentley Systems OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- hash table1 · 50%
- string1 · 50%
- greedy1 · 50%
- counting1 · 50%
- array1 · 50%
- dynamic programming1 · 50%
The medium problem, Largest Palindromic Number, packs hash tables, string manipulation, greedy selection, and counting into one. It's the kind of problem that looks simple until you realize you need to track character frequencies, reason about palindrome structure, and pick the right greedy strategy all at once. The easy problem, Best Time to Buy and Sell Stock, is a classic DP warm-up but still trips candidates who haven't internalized the state-transition logic. Together, these two suggest Bentley values tight, multi-concept problem solving over raw volume. Drill the hash-table and string topics first because Largest Palindromic Number is the harder ask. Get comfortable building frequency maps and reasoning about greedy choices within constraints. If you hit a wall during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds.
Companies with similar patterns
If you prepped for Bentley Systems, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Bentley Systems.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Bentley Systems interview FAQ
What should I study first for the Bentley OA?+
Hash tables and strings. Largest Palindromic Number, the medium problem, depends on frequency counting and string reconstruction under greedy constraints. Master those two patterns and you've covered the harder problem. Best Time to Buy and Sell Stock is DP on arrays, which is lower friction once you see the state transitions.
Is one easy and one medium problem enough to prepare for?+
Depends on your current level. With only two problems, each one is heavier. Largest Palindromic Number mixes four topics, so it's a good stress test. Solve it cold, then trace through the greedy logic. One medium and one easy with this distribution is tight, so expect no room for sloppy execution on the live OA.
How should I approach Largest Palindromic Number?+
Build a frequency map first. Then reason about how to place characters greedily to form the largest palindrome. The hard part is deciding which characters go in the center and which get paired. Work through examples with odd and even character counts before you code.
Do I need to know advanced DP for Best Time to Buy and Sell Stock?+
No. It's a single-pass DP problem. Track the minimum price seen so far and the maximum profit at each step. If you understand the state definition (best profit given a price on day i), you'll nail it. Spend 10 minutes on this one, then move to the harder problem.
What if I blank on one of these during the assessment?+
That's where preparation and a safety net matter. If you've drilled hash tables and greedy logic, you won't blank. If you do, StealthCoder is invisible during screen share and solves the problem in real time, so you stay on track and finish strong.