React developer

Which of the following is NOT a valid way to declare a variable in JavaScript?
A) let
B) var
C) const
D) set

What is the time complexity of searching for an element in a balanced binary search tree (BST)?
A) O(1)
B) O(n)
C) O(log n)
D) O(n^2)

Which of the following HTTP methods is used to update an existing resource?
A) GET
B) POST
C) PUT
D) DELETE

In CSS, which of the following is the correct way to apply styles to elements with the class btn-primary?
A) btn-primary { color: red; }
B) #btn-primary { color: red; }
C) .btn-primary { color: red; }
D) $btn-primary { color: red; }

Which data structure is used in the implementation of recursion?
A) Queue
B) Stack
C) Tree
D) Graph

You are given an integer array 'arr' of size 'N' and an integer 'K'.

Your task is to find the total number of subarrays of the given array whose sum of elements is equal to k.

A subarray is defined as a contiguous block of elements in the array.

Example:

Input: ‘N’ = 4, ‘arr’ = [3, 1, 2, 4], 'K' = 6

Output: 2

Explanation: The subarrays that sum up to '6' are: [3, 1, 2], and [2, 4].

You have been given an integer array/list (ARR) of size N. You have to return an array/list PRODUCT such that PRODUCT[i] is equal to the product of all the elements of ARR except ARR[i]

 Note :

Each product can cross the integer limits, so we should take modulo of the operation. 

Take MOD = 10^9 + 7 to always stay in the limits.

Follow up :

Can you try solving the problem in O(1) space?

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity. 

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

Bubble Sort implementation for the given array:  {6,2,8,4,10} is shown below :-

What is Normalization? Explain different types of normalization. (Learn)

What is a Process and a Thread? (Learn)