How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Uber.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Uber during technical interviews.

Solve Prime Jumps and Pipeline Scaling | Uber Interview Question

Quick Overview

This question evaluates algorithmic problem-solving skills in constrained path optimization and resource-allocation throughput maximization, including concepts such as graph modelling with prime-step constraints, dynamic programming, number-theoretic reasoning, and combinatorial optimization.

An online assessment contains two independent coding problems. Solve both.

Problem 1: Prime-Constrained Score Jump

You are given an integer array score of length n and an integer k. You start at index 0, and your initial total is score[0]. On each move, you may jump from index i to index j only if:

j > i ,
j - i <= k , and
j - i is a prime number.

When you land on an index, you add score[j] to your total. Return the maximum total score you can obtain when reaching index n - 1. If index n - 1 cannot be reached, return null.

Assume score may contain negative values.

Problem 2: Maximize Pipeline Throughput

You are given a serial processing pipeline with n services. Service i has:

base throughput t[i] , and
expansion cost cost[i] .

The pipeline throughput is the minimum throughput among all services.

You may expand any service any nonnegative integer number of times. If service i is expanded x times, then:

its throughput becomes t[i] * (1 + x) , and
the total money spent on that service is x * cost[i] .

Given a total budget budget, return the maximum possible overall pipeline throughput.

Quick Overview

An online assessment contains two independent coding problems. Solve both.

Problem 1: Prime-Constrained Score Jump

You are given an integer array score of length n and an integer k. You start at index 0, and your initial total is score[0]. On each move, you may jump from index i to index j only if:

j > i ,
j - i <= k , and
j - i is a prime number.

When you land on an index, you add score[j] to your total. Return the maximum total score you can obtain when reaching index n - 1. If index n - 1 cannot be reached, return null.

Assume score may contain negative values.

Problem 2: Maximize Pipeline Throughput

You are given a serial processing pipeline with n services. Service i has:

base throughput t[i] , and
expansion cost cost[i] .

The pipeline throughput is the minimum throughput among all services.

You may expand any service any nonnegative integer number of times. If service i is expanded x times, then:

its throughput becomes t[i] * (1 + x) , and
the total money spent on that service is x * cost[i] .

Given a total budget budget, return the maximum possible overall pipeline throughput.

Solve Prime Jumps and Pipeline Scaling

Quick Overview

Problem 1: Prime-Constrained Score Jump

Problem 2: Maximize Pipeline Throughput

Comments (0)

Solve Prime Jumps and Pipeline Scaling

Quick Overview

Problem 1: Prime-Constrained Score Jump

Problem 2: Maximize Pipeline Throughput

Comments (0)