Facebook | Phone | Construct smallest number from given digits
Anonymous User
3000
MetaPhone ScreeningInterview

Totally stumpted by this question:
Given array of digits (0-9, no negatives) and another number, a lower bound, construct next largest number. e.g.

  1. digits: [8,5,2], lowerBound 100: number "258"
  2. digits: [8,5,2], lowerBound 260: number "285"
  3. digits: [8,5,2], lowerBound 500: number "528"
  4. digits: [8,5,2], lowerBound 528: number "582"
  5. digits: [8,5,2], lowerBound 585: number "825"
  6. digits: [9,0,0], lowerBound 0: number "9"
  7. digits: [9,0,0], lowerBound 10: number "90"

Could it be sloved in O(n)?

Comments (10)