[BUGFIX] [Hacker Rank] Interview Preparation Kit: Hash Tables: Ice Cream Parlor. Initial solution optimized to avoid "Set". Timeout fixed.

Author: Gonzalo Diaz

docs/hackerrank/interview_preparation_kit/search/ctci-ice-cream-parlor-solution-notes.md

@@ -26,9 +26,14 @@ The preliminary guess is that the "edges" may be poorly thought out,
 and it may also not properly account for cases where there may be
 "repeated" values in the search.
 
-## Working solution
+## Editorial-based solution
 
-This solution has a complexity of O(N).
+Using editorial C++ based solution, I can notice about that solution in O(n) space,
+realy do 3 times (3*O(n)) pass over data list.
+
+## Final working solution
+
+This solution has a complexity of O(N) in just one iteration.
 It is based on a very simple idea.
 
 A dictionary (key-value object) is created.

src/hackerrank/interview_preparation_kit/search/ctci_ice_cream_parlor.ts

@@ -11,9 +11,8 @@ export function whatFlavorsCompute(
   for (const [key, price] of Object.entries(cost)) {
     const i = parseInt(key);
     const diff = money - price;
-    const cacheKeys = new Set(Object.keys(cache));
 
-    if (cacheKeys.has(diff.toString())) {
+    if (Number.isInteger(cache?.[diff])) {
       return [i + 1, cache[diff] + 1].sort((a, b) => a - b);
     }