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 Bytedance.

What role is this question designed for?

This question is commonly asked for Machine Learning Engineer candidates at Bytedance during technical interviews.

Find Highest Product Segment

Last updated: Apr 6, 2026

Quick Overview

This question evaluates algorithmic problem-solving with arrays and numerical edge cases, including reasoning about products across contiguous segments and sign/zero handling.

Bytedance

Jan 7, 2026, 12:00 AM

Machine Learning Engineer

Technical Screen

Coding & Algorithms

Given an integer array nums, find the maximum product obtainable from any non-empty contiguous segment.

A contiguous segment must contain adjacent elements from the array. The array may contain positive numbers, negative numbers, and zeros.

Return the largest possible product.

Example 1:

Input: [2, 3, -2, 4]
Output: 6
Explanation: The segment [2, 3] has product 6 .

Example 2:

Input: [-2, 0, -1]
Output: 0
Explanation: The best segment is [0] .

Aim for linear time complexity.

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More Bytedance•More Machine Learning Engineer•Bytedance Machine Learning Engineer•Bytedance Coding & Algorithms•Machine Learning Engineer Coding & Algorithms