SDE - Intern

You are given an array Arr consisting of n integers, you need to find all the distinct triplets present in the array which adds up to zero.

An array is said to have a triplet {arr[i], arr[j], arr[k]} with 0 sum if there exists three indices i, j and k such that i!=j, j!=k and i!=k and arr[i] + arr[j] + arr[k] = 0.

Note :

1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then (2, -3, 1), (-3, 2, 1) etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".

Given an array 'arr' of size 'n'.

Return an array with all the elements placed in reverse order.

Note:

You don’t need to print anything. Just implement the given function.

Example:

Input: n = 6, arr = [5, 7, 8, 1, 6, 3]

Output: [3, 6, 1, 8, 7, 5]

Explanation: After reversing the array, it looks like this [3, 6, 1, 8, 7, 5].

Python-based MCQs: Basic level
General Aptitude: Age-based and Speed-based questions

Given an integer array Arr of size N and an integer target, your task is to find the indices of two elements of the array such that their sum is equal to target. Return <-1,-1> if no such pair exists.

Note:

If more than one such pair of indices exist, return the lexicographically smallest pair
You may not use the same element twice.

Explain dynamic memory allocation in Python.

Explain hooks, what custom components are, and explain the virtual DOM.

They picked questions from my resume, such as what is Kafka and why I used Node.js in a particular project. Every question was based on my resume.