# Beer Bottles - Microsoft Top Interview Questions

### Problem Statement :

```You are given an integer n representing n full beer bottles.

Given that you can exchange 3 empty beer bottles for 1 full beer bottle, return the number of beer bottles you can drink.

Constraints

0 ≤ n < 2 ** 31

Example 1

Input

n = 9

Output

13

Explanation

In first round, we drink 9 beer bottles.

We can exchange the 9 empty ones for 3 beer bottles.

We can exchange the 3 empty ones for 1 beer bottle.```

### Solution :

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

int solve(int n) {
return !!n * (n + n / 2 - 1 + (n & 1));
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int solve(int n) {
int exchange = 0;
int initial = n;
while (n > 2) {
exchange += n / 3;
n = (n % 3 + n / 3);
}
return (initial + exchange);
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, full):
empty = 0
drunken = 0

while full:
drunken += full
empty += full
full = empty // 3
empty %= 3

return drunken```
```

## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

## Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink