SDE - 1

Given an array arr of size N containing positive and negative integers. Arrange the array alternatively such that every non-negative integer is followed by a negative integer and vice-versa.

Note:

The number of positive integers and negative integers may not be equal. In such cases, add the extra integers at the end.

For Example:

For array {4, -9, -2, 6, -8}, the output will be {-9, 4, -2, 6, -8}

For array {1, 2, 3, -5}, the output will be {-5, 1, 2, 3}   

Given two binary trees T and S, check whether tree S has exactly the same structure and node values with a subtree of T, i.e., check if tree S is a subtree of the tree T.

A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T. The subtree corresponding to the root node is the entire tree; the subtree corresponding to any other node is called a proper subtree.

You have been given an array/list 'ARR' consisting of 'N' integers. Your task is to find the majority element in the array. If there is no majority element present, print -1.

Note:

A majority element is an element that occurs more than floor('N' / 2) times in the array.

Integer p,q,r

Set p=2, q=5, r=9 If((q+9)<p || (q&p)<p)        r=(p&p)+q Else        p=r+p End if r=q+p Print p+q+r

Which data structures finds its use in recursion?

Which of the following highly uses the concept of an array?

A) Binary Search tree
B) Caching
C) Spatial locality
D) Scheduling of Processes

#include   int main()  {    

 int arr[5]={10,20,30,40,50};    

 printf("%d", arr[5]);       

 return 0;  }

Rent a Ride” As a customer to Rent a Ride you book a cab. We charge you as per the distance covered. We charge 8rs/km. The moment you click the button to RIDE, we search for the nearby drivers who will accept your ride. Suppose there are 15 drivers near your location, then we send the request to the first driver who is closest to you, then the second, and so on. There are a few conditions though, based on which we can not send the request to the nearby driver.

Condition 1: If the driver rating is lower than 4. (out of 5)

Condition 2: If you selected a specific car, and that car driver is not the closest one.


In case there is no driver present as per your request for the car, we will ask you to select some other car. A table was given having drivers, cars model, their ratings, and distance from the customer, and using this data we have to provide the most appropriate car to the customer, with the calculated fare. I was able to solve the problem in the given time, interviewers kept on asking questions about my code, and I answered every question. This round lasted 2 hours.

What are OOPs concept and explain its 4 pillar.

Does java supports multiple inheritance.