Problem database last updated: June 20, 2025
10 problems · 0 Easy, 10 Medium, 0 Hard · Ranked #147 of 458
0 Easy
0% · avg 23%
10 Medium
100% · avg 59%
0 Hard
0% · avg 18%
Based on 10 reported problems, Flexport interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (100%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Flexport puts unusual emphasis on binary-search (40% of problems, 4.5x the industry average), sliding-window (20% of problems, 4.3x the industry average), design (20% of problems, 3.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (50%), string (40%), hash-table (40%), binary-search (40%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Decode String Given an encoded string, return its decoded string. | Medium | Very Likely | stringstackrecursion | Solve |
Clone Graph Given a reference of a node in a connected undirected graph. | Medium | Very Likely | hash-tabledepth-first-searchbreadth-first-search | Solve |
Time Based Key-Value Store Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain... | Medium | Very Likely | hash-tablestringbinary-search | Solve |
My Calendar I You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking. | Medium | Very Likely | arraybinary-searchdesign | Solve |
Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. | Medium | Very Likely | hash-tablestringbacktracking | Solve |
Bag of Tokens You start with an initial power of power, an initial score of 0, and a bag of tokens given as an integer array tokens, where each tokens[i] denotes the value of... | Medium | Likely | arraytwo-pointersgreedy | Solve |
Validate IP Address Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type. | Medium | Likely | string | Solve |
Subarray Product Less Than K Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly le... | Medium | Likely | arraybinary-searchsliding-window | Solve |
Longest Increasing Subsequence Given an integer array nums, return the length of the longest strictly increasing subsequence. | Medium | Likely | arraybinary-searchdynamic-programming | Solve |
Count Zero Request Servers You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server... | Medium | Likely | arrayhash-tablesliding-window | Solve |
Decode String
SolveGiven an encoded string, return its decoded string.
Clone Graph
SolveGiven a reference of a node in a connected undirected graph.
Time Based Key-Value Store
SolveDesign a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain...
My Calendar I
SolveYou are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking.
Letter Combinations of a Phone Number
SolveGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
Bag of Tokens
SolveYou start with an initial power of power, an initial score of 0, and a bag of tokens given as an integer array tokens, where each tokens[i] denotes the value of...
Validate IP Address
SolveGiven a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.
Subarray Product Less Than K
SolveGiven an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly le...
Longest Increasing Subsequence
SolveGiven an integer array nums, return the length of the longest strictly increasing subsequence.
Count Zero Request Servers
SolveYou are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Flexport interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Flexport interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Flexport interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Flexport has been reported to ask 10 distinct coding problems. The most common topics are array, string, hash-table. 0 are Easy difficulty, 10 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 10 reported problems, Flexport interviews are easier than average - only 0% Hard compared to 18% across all companies. 100% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Flexport coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Flexport interview with AIarrow_forward
