Latest Questions | Page 10

1. Question 1

You've just started as a trainer in Thoughtworks University, and you want to make a good first impression. You start investigating how to make it easier to organise the coding sessions. It turns out that trainers are spending a lot of their time finding out the average confidence of the participants.

The coding sessions are organised based on how confident the participants are with programming. This is a self-score rating on a scale of 0 to 9. To save having to count how many participants there are, the trainers always prepend this number to the list of participant confidence ratings.

You also find that coding sessions are done in pairs. When there are an odd number of participants, the overall confidence can be determined using the following flow chart: Show More

The Amazon warehouse receives a multitude of packages every day, each assigned a unique identifier from 1 to n. The warehouse manager must sort the packages, not by their identifiers, but rather through a specific process defined by a permutation sorterOrder that ensures optimal processing.

Initially, the number of sorted packages, sortedCount, is zero. In each operation, the manager sifts thro ugh the packages from left to right. If the current package's identifier aligns with the next one to be sorted (i.e., sorterOrder[i] = sortedCount + 1), the manager sorts it and increments sortedCount by one. If the current package is not next in the sorting sequence, the manager overlooks it.

Determine the number of operations required by the manager to sort all the packages. One operation indicates a complete check from the first package to the last.

Note: A permutation is a sequence consisting of integers from 1 to n, of length n, containing each integer exactly once. For example, [1, 3, 2] is a permutation, while [1, 2, 1] is not.

Example 1:
n = 5
sorterOrder = [5, 3, 4, 1, 2]

Initially sortedCount = 0. In the first operation, the manager does the following: Show More

2. Code Question 2

In Amazon's vast inventory system, there's a need to ensure the efficient organization of product codes, represented by the sequence productSeq.

The product codes are categorized using characters 'a' through 'g'. For better management, a substring of product codes is considered valid if the count of each character within the substring does not exceed the number of distinct characters present.

Your task is to determine the number of valid substrings in productSeq that meet this criteria.

A string a is considered a substring of b if a can be obtained from b by removing several (possibly zero) characters from the beginning or the end of the string.

Example:
productSeq = "abaa" Show More

The data engineers at Amazon are working on partitioning their server chains. There is a linear chain of n servers numbered from 1 to n, where the cost parameter associated with the ith server is represented by the array cost[i]. These servers need to be partitioned into exactly k different server chains. The cost of partitioning a server chain servers[i : j] is defined as cost[i] + cost[j]. The t otal cost is the sum of the partitioning cost of each server chain.

Given n servers, an array cost, and an integer k, find the minimum and maximum possible total cost of the operations and return them in the form of an array of size 2: [minimum cost, maximum cost].

Note: Partitioning of an array means splitting the array sequentially into two or more parts where each element belongs to exactly one partition. For an array [1, 2, 3, 4, 5], a valid partition would be [[1], [2, 3], [4, 5]], while [[1, 2], [2, 3], [4, 5]] and [[1, 3], [2, 4, 5]] would be considered invalid partitions.

Example:
Given cost = [1, 2, 3, 2, 5] and k = 3. Show More

1. Simple Text Queries

In this challenge, you will be given an array of sentences and an array of queries. Determine which
sentences contain all of the words of a query. If no sentence contains all of the words, the answer to
that query is [-1].

Example:
sentences = ['bob and alice like to text each other', 'bob does not like to ski but does not like to fall',
'Alice likes to ski']
que ries = ['bob alice', 'alice', 'like', 'non occurrence']

The results of the queries are:

0. sentences[0] -> [0]
1. sentences[0] -> [0]
2. sentences[0], sentences[1], sentences[1] -> [0, 1, 1]
3. none match -> [-1]

Return a 2-dimensional integer array: [[0], [0], [0, 1, 1], [-1]].

Note: The word "like" in queries[2] does not match "likes" in sentences[2]. The word "alice" does not match
"alice" in sentence[2]. Matches must be exact.

After each query has been processed, add an array of indices of the matching sentences to the answer. Show More

Solution

In a lively car showroom, an array of cars awaits, each with its distinctive features. Picture yourself mixing and matching these cars in unique
combinations to create dream blends which have an F-score equal to the XOR value of the combination.

Your mission: To compute the blend score, which is the XOR of the F-score values for all these dreamy combinations.

Now, it's time to r eveal the grand total!

Input Format:

- The first line of input consists of the integer N, representing the number of cars in the showroom.
- The second line consists of N integers, representing the features of the car.

Output Format:
Print the sum of F-scores obtained.

Constraints:
1 <= N <= 10^4
0 <= Fi <= 10^4

Sample Testcase 0:
Testcase Input: Show More

Solution

Rahul has an integer array called 'arr' of length N containing unique values. He wants to create a balanced tree where each parent node has
smaller valued nodes on its left and larger valued nodes on its right. This balanced tree should ensure that the depth of the two subtrees for every
node doesn't differ by more than one.

Your task is to assist him in creating this type of tree .

The output contains N lines denoting the pre-order traversal of nodes. If the left child of the node contains a non-null value, then print the value;
otherwise, print a dot (.). A similar process for the right child also. Each right child value is separated from the node by a ">" sign, and each left
child by a left arrow sign.

Input Format:

- First line contains an integer N representing the size of the array arr.
- The second line contains N unique space-separated integers representing the elements of the array arr.

Output Format:

The output contains N lines denoting the pre-order traversal of nodes. If the left child of the node contains a non-null value, then print the value;
otherwise, print a dot (.). A similar process for the right child also. Each right child value is separated from the node by a "-" sign, and each left child
by a left arrow sign.

Constraints:
1 <= N <= 10^5
1 <= arr[i] <= 10^19 Show More

Problem Statement

You have a budget of x coins each day to buy beer, and your goal is to buy as many bottles of beer as possible before the price of beer in all shops exceeds your daily budget.
There are N shops, and each shop sells one bottle of beer per day. The price of beer in each shop increases by 1 coin per day after each purchase.
You can visit multiple shops in a single day, but you can buy only one bottle per shop per day.

Your task is to determine the total number of beer bottles you can buy before the prices at all shops exceed your daily budget.

Input Format

The first line contains two space-separated integers N, X. The number of shops and everyday budget.
The second line contains N space-separated integers, representing the cost of one bottle in each shop.

Output Format
Print one integer representing the total number of beer bottles you can buy before prices exceed your daily budget. Show More

A substring is a group of contiguous characters in a string. For instance, all substrings of abc are [a, b, c, ab, bc, abc].

Given a binary representation of a number, determine the total number of substrings present that match the following conditions:

1. The 0s and 1s are grouped consecutively (e.g., 01, 10, 0011, 1100, 000111, etc.).
2. The number of 0s in the substring is equal to the n umber of 1s in the substring.

Example:
s = 001101

The 4 substrings matching the two conditions include [0011, 01, 10, 01]. Note that 01 appears twice, from indices 1-2 and 4-5. There are other substrings, e.g., 001 and 011 that match the first condition but not the second.

Function Description:
Complete the function `counting` in the editor below.

counting has the following parameter(s):
string s: a string representation of a binary integer Show More

How to Attempt?
Chocolate Arrangement
Alex loves chocolate a lot. His brother Sam gifts him 2^N boxes of chocolate. These boxes are arranged in 2 rows denoted by 2 arrays A and B both of size N. Each box of chocolate contains some number of chocolates which is represented by A[i] and B[i] (for 1 <= i <= N).
Alex wants the boxes of chocolate in those 2 rows to be arranged in such a way that the boxes containing an equal number of chocolates are placed at the same index i.e. if A[x] and B[y] are equal, then x should be equal to y. You have to help Alex arrange the rows of boxes such that the maximum number of pairs of equal boxes can be placed at the same index, in the manner that Alex wants.
Return the maximum number of pairs of boxes that can be successfully arranged in the manner specified above.
Note: You can rearrange the row only by cyclically shifting the row to the left or to the right. A single cyclic shift to the left is an operation that sets A[0] = A[1], A[1] = A[2], ..., A[N-1] = A[0] simultaneously, and a single Show More