Segment Interview Questions

Note: ensure you read the disclaimer on the previous page reading the accuracy and sourcing of these problems.

Course Prerequisites

Here's a classic challenge that comes up in real life interviews surprisingly often. Interviewers like it as a way to assess your ability to find the right data structure for a non obvious and non trivial use case. The prompt is as follows: you're a university student currently trying to plan th...

Difficulty: 8/10

Two Sum

This is a classic and very common interview problem. Given an array of integers, return the indices of the two numbers in it that add up to a specific "goal" number. Suppose we had an array 1, 3, 6, 7, 9 , and let's say our "goal" number was 10 . Our numbers to sum to it could be 3 and 7 , an...

Difficulty: 4/10

Power of Three

Given an integer num , write a method to determine if it is a power of 3. The method will be called as follows: js console.log powerOfThree 9 true console.log powerOfThree 7 false Constraints The given would be a non zero positive integer in the ran...

Difficulty: 3/10

Longest Substring With No Duplicate Characters

Given a string of characters, can you find the longest substring of the string that has no repeating characters? An example is shown below: js lengthOfLongestSubstring "abracadabar" 4 because it is 'brac' Constraints Length of the string 100000 The string ...

Difficulty: 5/10

Union of Linked Lists

Now that we've implemented a Linked List challenges implement a linked list , let's start operating on it! Assume you have a Linked List implementation with this definition: js class LinkedList constructor this.head null this.tail null prepend newVal const ...

Difficulty: 4/10

Longest Increasing Subsequence

The Longest Increasing Subsequence LIS is a subsequence within an array of numbers with an increasing order. The numbers within the subsequence have to be unique and in an ascending manner. It's important to note that the items of the sequence do not have to be in consecutive locations within the...

Difficulty: 8/10

Longest Palindromic Substring

We're given a string that's a mixture of several alphabetical characters. js const str "algototheehtotdaily" Could you write a method to find the longest substring that is considered a palindrome? In the above example, it would be "totheehtot" . Where there are multiple longest ...

Difficulty: 7/10

Contiguous Subarray Sum

Given an array of numbers, return true if there is a subarray that sums up to a certain number n . A subarray is a contiguous subset of the array. For example the subarray of 1,2,3,4,5 is 1,2,3 or 3,4,5 or 2,3,4 etc. js const arr 1, 2, 3 , sum 5 subarraySum arr, sum...

Difficulty: 4/10

Two Stack Queue

Building a Queue with Two Stacks: A Challenge in Engineering Elegance The Objective: Queue with Stacks In this challenge, your task is to implement a queue using two stacks. While many programming languages offer queues through arrays or lists, we're restricting our approach to only utilize ...

Difficulty: 6/10

What Is A Segment Tree?

Welcome to the realm of Segment Trees! If you've meandered through the pathways of data structures, you've likely bumped into various trees. But today, we're introducing a special kind of tree that's less talked about yet incredibly powerful: the **Segment Tree**. What Exactly is a Segment Tre...

Difficulty: 5/10

Lesson 1: Introduction to Advanced Data Structures

Welcome to the Introduction to Advanced Data Structures lesson! In this lesson, we will explore various advanced data structures that are used to organize and manipulate data efficiently. These data structures are designed to solve complex problems and optimize performance. Some of the advanced d...

Difficulty: 5/10

OS Main and Virtual Memory Management

This lesson is about the memory management functions of an OS, with a focus on the following key points: 1. Memory management issues that may arise in a computer system. 2. Techniques used by the operating system to solve memory management issues and manage them. Computer systems are expected...

Difficulty: 5/10

Interview Reports

Segment Interview Questions | Glassdoor...

Segment interview details: 99 interview questions and 89 interview reviews posted anonymously by Segment interview candidates.

People at Segment Say

This information was sourced from reviews originally posted on Glassdoor.

Very open higher management. Well thought out product and customer first approach to everything that is done. Free food, bicycle credit, health allowance can keep going

Segment shows a very strong drive to ensure the happiness of those of us who work here. Even though not everything succeeds or hits the mark, it's been obvious that the satisfaction of those here is still a priority for the company, even as we grow.

Interesting challenges and a strong group of engineers. You can have a lot of ownership over problems if you are inclined to. The company is doing well and growing quickly, so it is not a bad place to be at all. The company still has a long and rough road ahead of itself to grow in to the business it wants to be. So far it is handling it pretty well.

Segment is truly an amazing place to work, and I don't say that lightly. There are tons of opportunities to learn, grow, and work on high impact projects. Work life balance is excellent, and working remotely is easy to do if that's what you like.