Frontend Developer

You are given a linked list having ‘n’ nodes and an integer ‘k’.

You have to rotate the linked list to the right by ‘k’ positions .

Example :

Input: linked list = [1 2 3 4] , k = 2

Output: 3 4 1 2

Explanation:
We have to rotate the given linked list to the right 2 times. After rotating it to the right once it becomes 4->1->2->3. After rotating it to the right again, it becomes 3->4->1->2. 

You are given a string ‘STR’ containing space-separated words. A word is a sequence of non-space characters. Your task is to reverse the order of words in ‘STR’.

Note: Try to do it in-place without allocating extra space.

Example:

‘STR’ = “when in doubt use brute force”
The reverse order of words in ‘STR’ is: “force brute use doubt in when”.

Note:

1. ‘STR’ does not contain any leading or trailing spaces.
2. The words are always separated by a single whitespace character.

1) What is currying in Javascript?

2) Explain hoisting with a code snippet.

3) What does this return (typeof null) ?

4) What is callback hell?

Why should we hire you?

What keeps you motivated?