亚麻 SDE2 OA

Code Question 1

At Amazon, a user owns a unique tool called the "Parentheses Perfection Kit." This kit contains different types of parentheses, each with a specific efficiency rating. The goal is to create a balanced sequence of parentheses by adding zero or more parentheses from the kit to maximize the sequence's total EfficiencyScore. The EfficiencyScore of a sequence is the sum of the efficiency ratings of the parentheses used from the kit.
A sequence is considered balanced if it has an equal number of opening '(' and closing ')' parentheses, with each opening parentheses properly matched with a closing one in the correct order (i.e., circular balance). For instance, sequences like ((),(), and (((())) are balanced, while sequences like ), ((), and (())( are not.
You are given an initial parentheses sequence represented by the string ss, along with a Parentheses Perfection Kit containing different types of parentheses in the form of the string kitParentheses and their respective efficiency ratings in the efficiencyRatings array (both of size m). The EfficiencyScore of the original string ss is initially 0. You can use any number of unused parentheses from the kit to create the final sequence, as long as the final sequence remains balanced.
The task is to determine the maximum possible EfficiencyScore that can be achieved for the resulting balanced sequence.
Note: It is guaranteed that the sequence can be made balanced by adding zero or more parentheses from the kit.Example

s="(("s=&quo

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

changing their order.
Language Java 8
& Autocomplete Ready

• import java. 10.*:
  14
  15
  16
  class Result (
  17
  18

Hint: It can be proved that (a + b) % c = ((a % c) + (b % c)) % c where a, b,
and c are integers and % represents the modulo operation.
Function Description
Complete the function getMinErrors in the editor below.
19
20

• Complete the 'getMinErrors' function below.
• The function is expected to return an
  21
  getMinErrors has the following parameter(s):
  string errorString: a string of characters 'O', '1', and 'T' int x: the number of errors generated for every occurrence of
  subsequence 01
  int y: Ithe number of errors generated for every occurrence of
  subsequence 10
  INTEGER.
• The function accepts Following parameters:
• 1, STRING errorString

• INTEGER *
• INTEGER Y

Returns
int: the minimum number of errors possible, modulo 10^9+7


Constraints
• 1 ≤ len(errorString) ≤ 10^5
• 0 ≤ x, y ≤ 10^5
• s consists only of characters 'O', 'T, and '!'

第二题 amazon-get-min-errors

第一题 amazon-maximize-parentheses-efficiency-score