SDE - Intern

Alex has bought a new machine that does photocopies of photos in batches of minimum size ‘K’. Alex has ‘N’ photos, whose resolution is given in an integer array ‘photos’. The machine has some downsides as well. The error in photocopying a batch is the absolute difference between the highest resolution photo and the lowest resolution photo in the batch.

Now Alex will divide the photos into some groups of size at least ‘K’ and feed it to the machine. The maximum error is the maximum of the errors from each batch. He wants to minimize the maximum error. Can you help him divide the photos into batches efficiently and tell him the minimum maximum error he can achieve?

Example: Let the resolutions be [1, 5, 2] and K = 2. So there is only one way of dividing the array, which is a single group of all three elements. The error is therefore 5 - 1 = 4.

You have been given an array/list “BOOKINGS” of booking details of ‘N’ flights from 1 to ‘N’. Each booking detail contains three positive integers [first, last, seats] which represent a booking for flights “first” through “last” (inclusive) with “seats” seats reserved for each flight in the range.

Now, you are supposed to return an array/list “ANSWER” of length ‘N’, where answer[i] represents the total number of seats reserved for ith flight.

You're given an alphabetical string ‘S’.

Determine whether it is palindrome or not. A palindrome is a string that is equal to itself upon reversing it.

For example:

‘S’ = racecar
The reverse of ‘S’ is: racecar
Since ‘S’ is equal to its reverse. So ‘S’ is a palindrome.
Hence output will be 1.

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.

What is Join?
What are the differences between the Primary key and the Unique Key?
Given a record of students with Roll Numbers, names, and marks. What will be your Primary key?
How would you club records from two different tables?

How many types of Operating system are there?
What is virtual Memory?
What is Paging?
What is Fragmentation?
Types of Fragmentation?

Ninja works in a travel agency. During summers, he got a total of ‘X’ clients for a trip to a nearby waterpark. Ninja has a total of ‘N’ taxis where each taxi takes different routes to reach the destination.

Ninja has an array ‘taxiTravelTime’ representing how long it takes for each taxi (at that index of the array) to make a trip. Ninja wants to know the minimum time required to make ‘X’ trips.

Ninja wants to schedule a certain number of trips with a collection of several taxis.

You have to return the minimum time required to make ‘X’ trips.

Note :

Assume that taxis can run simultaneously and there is no waiting period between trips. There may be multiple taxis with the same time cost.

Example:

If ‘X=3’, ‘N=2’ and ‘taxiTravelTime=[1,2]’, 
Then the answer is 2. This is because the first taxi (index 0, cost 1) can make two trips costing 2 minutes, and the second taxi can make a single trip costing 2 minutes simultaneously.