Guess Number Higher or Lower II, is a LeetCode problem from dynamic-programming subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Guess Number Higher or Lower II at LeetCode


For each guess:

  1. Get the worse case of every choice to guarantee the result

  2. Get the least cost among the guaranteed results

Time Complexity: O(nlogn), Space Complexity: O(n^2)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu