```
This data structure consist of Contact data, previous pointer and next pointer.
```
```
DLL Node Insertion
```
```
DLL Node Deletion
```
```
Binary Search Technique to search a contact based on the initials entered by user.
```
```
Search for the Name and replace Name, WorkContact and MobileNumber with the new data.
```
```
Use Hashset to check for duplicates
```
```
Merge Sort - If auxilary memory is available
Randomised Quicksort - Fastest execution on machine
Heapsort - If there are memory constraints
```
```
Create a Deque and a HashSet. Set some capacity of the Cache Memory. Check in hashset for node. Then push into the list and hashset.
```
```
For bill splitting.
To minimize the cost required to deliver maximum amount of flow possible in the network
```