SDE - Intern

A Bitonic Sequence is a sequence of numbers that is first strictly increasing and then strictly decreasing.

A strictly ascending order sequence is also considered bitonic, with the decreasing part as empty, and same for a strictly descending order sequence.

For example, the sequences [1, 3, 5, 3, 2], [1, 2, 3, 4] are bitonic, whereas the sequences [5, 4, 1, 4, 5] and [1, 2, 2, 3] are not.

You are given an array 'arr' consisting of 'n' positive integers.

Find the length of the longest bitonic subsequence of 'arr'.

Example :

Input: 'arr' = [1, 2, 1, 2, 1]

Output: 3

Explanation: The longest bitonic subsequence for this array will be [1, 2, 1]. Please note that [1, 2, 2, 1] is not a valid bitonic subsequence, because the consecutive 2's are neither strictly increasing, nor strictly decreasing.

You are given an array 'ARR' consisting of 'N' integers and a non-negative integer 'K'. Consider an operation on the array as replacing every element 'ELE' of the array with 'MX - ELE', where 'MX' is the maximum element of the array. You need to return the updated array, given that this operation is performed on the array exactly 'K' number of times.

Note:

1. The array follows 0-based indexing.
2. Note that after each operation, the next operation will be performed on the updated array i.e the array obtained after the last operation.

int a = 1;
switch(a)
{
case 1: print “5”;
case 2: print “6”;
case 3: print “7”;
}
What is the output of the above code?

What is a pointer? What is an array? Give real world applications of Linked Lists.

Difference between array and linked list.

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 :-

Is stack a LIFO or FIFO data structure. Briefly explain its working/ implementation as well.

8801 = 5
5261 = 1
9632 = 2
6381 = 3
6321 = ?

He asked me about how I had implemented the Machine Learning algorithm in my Face Recognition project.

You have been given a Binary Tree of 'N'

nodes, where the nodes have integer values.

Your task is to return the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree.

For example :

For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].
The Preorder traversal will be [1, 3, 5, 2, 4, 7, 6].
The Postorder traversal will be [5, 2, 3, 7, 6, 4, 1].

He asked how I had implemented my Whatsapp Clone project and how I had implemented file sharing over the server real time messaging notifications sending. Then he used it to test my Computer Networks knowledge as well. He asked me about various protocols working underneath and the difference between HTTPS protocol and UDP protocol, UDP vs TCP

How was your day so far? How did you like interacting with senior employees of the company?
Would describe yourself as a team player? How would you handle the situation if one of your team mates is not working up to the mark?
She had a discussion with me about technologies that I have worked on and then we had a little chat about the technologies used in the backed of wells fargo and how would I adapt to learning new technologies that are required to work on company products