JobsJob TrackerJob alerts

JungleWorks · 3 questions

All 3Coding 3
  • Implement Merge Sort algorithmCoding
  • House Robber II approach and recursionCoding
  • Closest Dessert CostCoding
← JungleWorks questions
  1. Interview questions
  2. JungleWorks
  3. Closest Dessert Cost
Coding

Closest Dessert Cost

Filed under JungleWorks

The question

Solve a backtracking problem based on finding the closest dessert cost given base costs, topping costs, and a target.

No write-up yet. Related questions below have one.

Related JungleWorks questions

  • House Robber II approach and recursion
← House Robber II approach and recursion

Collected from public candidate posts and coding forums. Updated Nov 2026.