Priority Customers (Easy)
**This is the easy version of the problem. Here, you only need to compute the number of valid subsets. The constraints are the same as the hard version.** $N$ people stand in line to enter your store. Some of them are priority customers, though you don't know which ones yet. Their initial order is $[1, 2, 3, \ldots, N]$. You can change the order of people by doing the following: Call a singl
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start