# Reverse Words - Amazon Top Interview Questions

### Problem Statement :

```Given a string s of words delimited by spaces, reverse the order of words.

Constraints

n ≤ 100,000 where n is the length of s

Example 1

Input
sentence = "hello there my friend"

Output
"friend my there hello"```

### Solution :

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

string solve(string sentence) {
int N = sentence.size();
for (int i = 0, j = 0; i < N;) {
while (i < N && isspace(sentence[i])) i++;
if (i >= N) break;
for (j = i; j < N && !isspace(sentence[j]); j++)
;
reverse(sentence.begin() + i, sentence.begin() + j);
i = j;
}
reverse(sentence.begin(), sentence.end());
return sentence;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public String solve(String s) {
String temp = "";
String res = "";

for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if ((int) c == 32) {
res = " " + temp + res;
temp = "";
} else {
temp = temp + c;
}
}
res = temp + res;
return res;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, sentence):
s = sentence.split(" ")
s = s[::-1]
return " ".join(s)```
```

## 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