Search Questions

Latest Questions | Page 6

#1

There are N trolleys used to transport products and each trolley is given a unique ID from 0 to N-1. A trolley operates for a certain time period and is able to carry products. For each trolley, the automated system stores three parameters i.e., the start and end time of operation (both inclusive) and units of products carried. A trolley can be operated within a specified period. No two trolleys c

Asked in: FLIPKART


Buyer: 0
Code Size: 20
#2

Given three points a(x1, y1), b(x2, y2), and c(x3, y3), determine if they form a non-degenerate triangle. Then, check if two points, p(xp, yp) and q(xq, yq), are inside or on the triangle.

Return the corresponding scenario number:
0. The lines do not form a valid non-degenerate triangle.
1. Point p is inside the triangle, but point q is not.
2. Point q is inside the triangle, but point

Asked in: MEESHO


Buyer: 0
Code Size: 36
#3

Vowel SubString

Given a string composed of lowercase letters within the ASCII range 'a'-'z', determine the number of substrings that consist solely of vowels, where each vowel appears at least once. The vowels are ['a', 'e', 'i', 'o', 'u']. A substring is defined as a contiguous sequence of characters within the string.
Example
s = 'aeioaexaaeuiou'

There is a substring to the left that is

Asked in: MEESHO


Buyer: 0
Code Size: 39
#4

Coding Wars
There are 'N' coders standing in a line, where i denotes the ith position of a coder with a rating of Ri. All ratings are distinct.
You have to form a team of 3 from amongst them with the condition:
Any three coders with positions (i, j, k) and ratings ("Ri< Rj< Rk" or "Ri > Rj > Rk") and(1 <= i < j < k <= N)
You have to find out how many such teams exist (1 coder can be part of m

Asked in: AMAZON MICROSOFT


Buyer: 1
Code Size: 54
#5

String Encoding
Encode a given string by collapsing consecutive instances of a single character into two pieces of information: the number of instances and the character. Note that even single characters should be run-length encoded. If the string is empty, return an empty string. Your implementation should work on all alphanumeric characters.
Function Description
Complete the function collapse

Asked in: AMAZON MICROSOFT


Buyer: 0
Code Size: 40
#6

Break a Palindrome
A palindrome reads the same forwards and backwards, like "mom". Modify a palindrome by changing exactly one character to another character within the ASCII range [a-z].
The goal is to ensure the new string fulfills the following criteria:
1.It is not a palindrome.
2.It is alphabetically lower than the original palindrome.
3.It is the smallest possible string alphabetically

Asked in: AMAZON MICROSOFT


Buyer: 0
Code Size: 47
#7

Vaccination Drive
In order to curb the spread of the novel COVID-19 virus, the citizens of Hackerland need to be vaccinated on priority. There are center_nodes vaccination centers in Hackerland, where each center has a status denoted by status[i]:
โ€ข Centers with a shortage of vaccines have status 1.
โ€ข Those with sufficient vaccines have status 2.
โ€ข Those with a surplus have status 3.

Vac

Asked in: AMAZON MICROSOFT JUSPAY


Buyer: 0
Code Size: 78
#8

Optimal Points Selection

Given a set of n distinct points on the x-axis, choose k of them such that the minimum distance between any two chosen points is as large as possible. Find this maximum possible minimum distance.
Example
Consider n = 5, k = 3, and x = [1, 4, 2, 9, 8].
In the optimal solution, one of the possible selections of points is [1, 4, 8]. Here,
The distance between 1 and 4 =

Asked in: AMAZON MICROSOFT


Buyer: 0
Code Size: 56
#9

Optimal Points Selection

Given a set of n distinct points on the x-axis, choose k of them such that the minimum distance between any two chosen points is as large as possible. Find this maximum possible minimum distance.
Example
Consider n = 5, k = 3, and x = [1, 4, 2, 9, 8].
In the optimal solution, one of the possible selections of points is [1, 4, 8]. Here,
The distance between 1 and 4 =

Asked in: AMAZON MICROSOFT


Buyer: 0
Code Size: 56
#10

Drone Delivery Optimization โ€“ Amazon's Challenge

In Amazon's vast distribution network, drones are essential for delivering packages. These drones have varying capacities, ranging from 1 to 10โน. Each j-th drone has a carrying capacity of j.
Problem Statement
Amazon needs to dispatch n packages, where the weight of the i-th package is given by the array pack[i].During peak delivery times, only

Asked in: AMAZON


Buyer: 1
Code Size: 77