Backend Developer

Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may have to assume that ‘ARR1’ has a size equal to ‘M’ + ‘N’ such that ‘ARR1’ has enough space to add all the elements of ‘ARR2’ in ‘ARR1’.

For example:

‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’. 
‘ARR1’ = [3 4 6 9 10]

You are given an input string 'S'. Your task is to find and return all possible permutations of the input string.

Note:

1. The input string may contain the same characters, so there will also be the same permutations.

2. The order of permutation does not matter.

Define Javascript. (Learn)

What is closure? (Learn)

What is scopes in JS? (Learn)

Give an example of Event loop? (Learn)

What are modules in node.js? (Learn)

You are given an integer ‘N’. Your task is to find all palindromic numbers from 1 to ‘N’.

Palindromic integers are those integers that read the same backward or forwards.

Note:

Order of numbers should be in the non-decreasing matter.

For example:

You are given ‘N’ as 12, so the output should be [1, 2, 3, 4, 5, 6, 7, 8, 9, 11], as all single-digit numbers are palindromic, and 11 is also a palindromic number.