Minimum coins to make a target amount — BlaBlaCar interview
Reported in BlaBlaCar European engineering loops. Dynamic programming optimization with unbounded choices.
Interview atlas
Explore 2,994 curated Q&As across 124 employers — filter by career stage, round, or company.
Reported in BlaBlaCar European engineering loops. Dynamic programming optimization with unbounded choices.
Reported in BlaBlaCar European engineering loops. Topological sort and directed cycle detection interview staple.
Reported in BlaBlaCar European engineering loops. Heap and selection strategy question with multiple valid approaches.
Reported in BlaBlaCar European engineering loops. Hash set based linear-time approach for sequence detection.
Reported in BlaBlaCar European engineering loops. Array prefix-suffix pattern often asked in coding rounds.
Reported in BlaBlaCar European engineering loops. Security and networking question covering encryption, certificates, and performance.
Reported in BlaBlaCar European engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in BlaBlaCar European engineering loops. HR negotiation question requiring research and flexible framing.
Reported in BlaBlaCar European engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in BlaBlaCar European engineering loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in BlaBlaCar European engineering loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in BlaBlaCar European engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in BlaBlaCar European engineering loops. Pointer manipulation staple for junior coding interviews.
Reported in BlaBlaCar European engineering loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in BlaBlaCar European engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.