# Hash Tables: Ice Cream Parlor

### Problem Statement :

```Each time Sunny and Johnny take a trip to the Ice Cream Parlor, they pool their money to buy ice cream. On any given day, the parlor offers a line of flavors. Each flavor has a cost associated with it.

Given the value of money and the cost  of each flavor for  trips to the Ice Cream Parlor, help Sunny and Johnny choose two distinct flavors such that they spend their entire pool of money during each visit. ID numbers are the 1- based index number associated with a cost. For each trip to the parlor, print the ID numbers for the two types of ice cream that Sunny and Johnny purchase as two space-separated integers on a new line. You must print the smaller ID first and the larger ID second.

Note:

Two ice creams having unique IDs  and  may have the same cost (i.e. cost[ i ] = cost[ j ]  ).
There will always be a unique solution.
Function Description

Complete the function whatFlavors in the editor below. It must determine the two flavors they will purchase and print them as two space-separated integers on a line.

whatFlavors has the following parameter(s):

cost: an array of integers representing price for a flavor
money: an integer representing the amount of money they have to spend
Input Format

The first line contains an integer, t , the number of trips to the ice cream parlor.

Each of the next t sets of 3 lines is as follows:

The first line contains money.
The second line contains an integer, n, the size of the array cost.
The third line contains n space-separated integers denoting the cost[ i ].

Output Format

Print two space-separated integers denoting the respective indices for the two distinct flavors they choose to purchase in ascending order. Recall that each ice cream flavor has a unique ID number in the inclusive range from 1 to cost.

Sample Input

2
4
5
1 4 5 3 2
4
4
2 2 4 3
Sample Output

1 4
1 2```

### Solution :

```                            ```Solution in C :

In  C :

#include <stdio.h>

int main(int argc, const char * argv[]) {

int t;
//printf("Enter number of trips to the ice cream parlor:\n");
scanf("%d", &t);
for (int trip = 0; trip < t; trip++) {
int m;
//printf("Enter amount of dollars:\n");
scanf("%d", &m);
int n;
//printf("Enter number of flavors:\n");
scanf("%d", &n);
int cost[n];
for (int id = 0; id < n; id++) {
//printf("Enter the cost of flavor %d", id);
scanf("%d", &cost[id]);
}
int total = 0;
for (int cost1 = 0; cost1 < n; cost1++) {
for (int cost2 = cost1 + 1; cost2 < n; cost2++) {
total = cost[cost1] + cost[cost2];
if (total == m && cost1 < cost2) {
printf("%d %d\n", cost1 + 1, cost2 + 1);
break;
}
}
if (total == m) {
break;
}
}

}

}```
```

```                        ```Solution in C++ :

In   C++ :

#include <bits/stdc++.h>
using namespace std;

class IceCream {

public:
int flavor;
int index;

IceCream(int flavor, int index) {
this->flavor = flavor;
this->index = index;

}

};

int binarySearch(int first, int last, vector<IceCream> arr, int search) {

int n = last;
int mid = (first+last)/2;
while(first <= last){
if(arr[mid].flavor==search)
return arr[mid].index;

else{
if(arr[mid].flavor>search)
last = mid-1;
else
first = mid+1;
}
mid = (first+last)/2;
}
return -1;
}

bool compare(IceCream i1, IceCream i2)
{
return (i1.flavor < i2.flavor);
}

int main() {
int t;
int n, m;
cin >> t;
for(int test = 0; test < t; test++) {
cin >> m >> n;
vector<IceCream> arr;
arr.reserve(n);

for (int i = 0; i < n; i++) {
int cost;
cin >> cost;
arr.push_back(IceCream(cost, i + 1));
}

sort(arr.begin(), arr.end(), compare);
/*for (int i = 0; i < n; i++) {
cout<<arr[i].flavor<<"\t";
}*/
int firstIndex = 100000, secondIndex = 100000;
for(int i = 0; i < n - 1 ; i++) {
int search = m - arr[i].flavor;
//cout<<search<<endl;
if(search >= arr[i].flavor) {
int index = binarySearch( i + 1, n - 1, arr, search);
if( index != -1 ) {
cout << min(arr[i].index, index) << " " << max(arr[i].index, index) << endl;
break;

}
}
}

}

}```
```

```                        ```Solution in Java :

In  Java :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {

int t;
int n, m;

Scanner in = new Scanner(System.in);
t = in.nextInt();
HashMap<Integer, Integer> h = new HashMap<>();
for(int test = 0; test < t; test++) {

m = in.nextInt();
n = in.nextInt();

int first=-99999999;
int last=-99999999;

for (int i = 0; i < n; i++)
{
int r=in.nextInt();

if(h.containsKey(m-r))

{
//   System.out.println("contains key "+r);
first= Math.min(h.get(m-r),i+1);
last = Math.max(h.get(m-r),i+1);

}
else{
if(m-r>=0)
h.put(r,i+1);
}

}
h.clear();
System.out.println(first+" "+last);

}

}

}```
```

```                        ```Solution in Python :

In  Python3   :

def flavors(m,a):
prices = {}
for idx, p in enumerate(a):
if m-p in prices:
return prices[m-p], idx
prices[p] = idx
return None

t = int(input().strip())
for a0 in range(t):
m = int(input().strip())
n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
f1, f2 = flavors(m,a)
print(f1+1, f2+1)```
```

## Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

## Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t

## Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

## Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

## Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

## Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function