We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Ice Cream Parlor
  5. Discussions

Ice Cream Parlor

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/WvLuA-LCsb0

    vector<int> icecreamParlor(int m, vector<int> arr) {
    map<int, int> mp;
    for (int i = 0; i < arr.size(); i++) {
        int complement = m - arr[i];
        if (mp.count(complement)) {
            return {mp[complement] + 1, i + 1};
        }
        mp[arr[i]] = i;
    }
    return {};
}