FlexportLeetCode Questions
VerifiedCompany-wise coding interview questions asked by Flexport, ranked by real frequency across 30-day, 3-month, and 6-month recency windows.
# | Problem | Difficulty | Frequency↓ | Acceptance | |
|---|---|---|---|---|---|
| #394 | Decode String3 sources | Medium | 100% | 62.9% | |
| #133 | Clone Graph3 sources | Medium | 100% | 65.7% | |
| #981 | Time Based Key-Value Store3 sources | Medium | 100% | 50.0% | |
| #729 | My Calendar I3 sources | Medium | 75% | 58.3% | |
| #17 | Medium | 75% | 66.4% | ||
| #300 | Longest Increasing Subsequence3 sources | Medium | 63% | 59.7% | |
| #713 | Subarray Product Less Than K3 sources | Medium | 63% | 54.7% | |
| #948 | Bag of Tokens3 sources | Medium | 63% | 59.7% | |
| #468 | Validate IP Address3 sources | Medium | 63% | 28.4% | |
| #299 | Bulls and Cows3 sources | Medium | 63% | 52.7% |
Flexport Technical Interview Overview & Company-Wise Questions
Software engineering and technical interviews at Flexport emphasize real-world problem solving, algorithmic efficiency, and scalable data structure design. The curated dataset above contains 10 verified LeetCode problems, categorized by frequency and filtered across recent interview seasons.
Frequently Asked Questions
What are the top LeetCode questions for Flexport?
Leading questions include Decode String, Clone Graph, Time Based Key-Value Store. Reviewing questions with higher recency (within the last 30 to 90 days) yields the highest return on preparation time.
Where can I practice company-wise LeetCode questions for Flexport?
You can practice all 10 Flexport LeetCode questions right here on LeetMap Pro. Filter by 30-day, 3-month, and 6-month recency, track your progress with local checkpoints, and practice curated SQL problems completely free.
How should I prepare for Flexport coding rounds?
Begin by reviewing Medium-difficulty problems (10 tracked), which constitute the majority of technical rounds. Complement coding practice with foundational DSA patterns like Sliding Window, Two Pointers, and Graph Traversal.