Flower Bouquets
Reported by candidates from Atlassian's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Atlassian's March 2024 OA included Flower Bouquets, a deceptively simple problem that trips up candidates who overthink it. You're given constraints on flower counts and need to determine if you can build valid bouquets. The trick isn't complex math or dynamic programming. It's recognizing the constraint pattern and implementing a clean greedy or direct validation check. StealthCoder sits in the background as your safety net if the logic breaks mid-interview.
Pattern and pitfall
Flower Bouquets typically asks: given flowers of different types and rules about how many of each type must appear in a bouquet, can you form a valid bouquet or a certain number of bouquets. The catch is that candidates often misread the constraint structure and write overcomplicated solutions. The pattern is usually greedy or direct validation: check if the flower counts satisfy the bouquet rules without simulation. If you're stuck on the OA itself, StealthCoder can parse the exact constraint from the screen and feed you the validation logic in real time, so you're not guessing under time pressure.
Memorize the pattern. If you can't, run StealthCoder. The proctor sees the IDE. They don't see what's behind it.
You can drill Flower Bouquets 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. Made by an engineer who treats the OA as theater. If yours is tonight, you don't have time to grind. You have time to hedge.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Atlassian's OA.
Atlassian reuses patterns across OAs. Made by an engineer who treats the OA as theater. If yours is tonight, you don't have time to grind. You have time to hedge. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Flower Bouquets FAQ
Is this a math problem or a simulation?+
Neither. It's a constraint satisfaction problem. You need to check if the flower counts meet the bouquet rules. The math is simple arithmetic. Most of the work is parsing what the rules actually mean, not computing anything complex.
Do I need dynamic programming?+
No. Candidates who reach for DP are overcomplicating. The problem is solvable with greedy logic or direct validation. If you're iterating over counts and checking conditions, you're on the right track.
What's the most common mistake?+
Misinterpreting the constraint. Candidates assume they need to simulate building multiple bouquets when the problem might just ask if one valid bouquet is possible. Read the exact output requirement twice before coding.
How do I solve this in 48 hours before the OA?+
You can't cram this meaningfully. Focus on understanding the problem statement word for word. Write out a few small examples by hand. Then code a simple check: iterate flower counts, apply the rule, return true or false.
Is this problem asked often at Atlassian?+
It appeared in March 2024. Atlassian favors practical, constraint-based problems over algorithm library questions. If you see similar "can you do X with Y constraints", the solution is rarely fancy.