SDE - 1

You are given an array ‘arr’ that contains an equal number of positive and negative elements. Rearrange the given array such that positive and negative numbers are arranged alternatively. Also, the respective relative order of positive and negative should be maintained.

For example:

For the given arr[ ] = { -1, 3, 5, 0, -2, -5 } 
arr[ ] = {3, -1, 5, -2, 0, -5 } is valid rearrangement.
arr[ ] = {3, -1, 0, -2, 5, -5 } is invalid rearrangement; order of 0 and 5 is changed. 
arr[ ] = {3, -1, 5, 0, -2, -5 } is invalid rearrangement; positive and negative elements are not alternative.

Note:

Make changes in the same array and no returning or printing is needed.
Consider zero(0) as a positive element for this question.
It is guaranteed that an answer always exists.

You are given an arbitrary array ‘arr’ consisting of N non-negative integers, where every element appears thrice except one. You need to find the element that appears only once.

After the coding question, he asked me about some javascript concepts like hoisting, event loop, callback hell, and tricky output question related to promises. I explained each of them in detail.

After a quick introduction, he asked me these questions.
1. Write a script in the Chrome DevTools to open the very first site after a keyword search.
2. Questions about my most recent projects. About tech stack, problems faced and how I solved them.
3. Javascript output questions.

Some behavioural questions and job-specific questions. Some of them are. 

1. Why do you want to join TestBook 

2. How do you find this role a perfect fit for you. 

3. About relocation.