Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. Didi

Didi LeetCode Interview Questions

Practice 23 real coding problems frequently asked in Didi technical interviews. Master these questions to ace your next Didi software engineering interview.

2 Easy
18 Medium
3 Hard

Top Topics at Didi

ArraySortingDynamic ProgrammingGreedyMatrix

Ace your Didi interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Didi Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Toeplitz Matrix
100%
EasyE
100%
ArrayMatrix
Solve→
Maximum Profit in Job Scheduling
91%
HardH
91%
ArrayBinary Search+2
Solve→
Moving Average from Data Stream
87%
EasyE
87%
ArrayDesign+2
Solve→
Zero Array Transformation III
78%
MediumM
78%
ArrayGreedy+3
Solve→
Binary Tree Vertical Order Traversal
78%
MediumM
78%
Hash TableTree+4
Solve→
K Closest Points to Origin
77%
MediumM
77%
ArrayMath+5
Solve→
Reverse Integer
76%
MediumM
76%
Math
Solve→
Largest Rectangle in Histogram
75%
HardH
75%
ArrayStack+1
Solve→
Design Tic-Tac-Toe
70%
MediumM
70%
ArrayHash Table+3
Solve→
Longest Arithmetic Subsequence of Given Difference
66%
MediumM
66%
ArrayHash Table+1
Solve→
Best Time to Buy and Sell Stock II
64%
MediumM
64%
ArrayDynamic Programming+1
Solve→
Diagonal Traverse
56%
MediumM
56%
ArrayMatrix+1
Solve→
Integer to English Words
54%
HardH
54%
MathString+1
Solve→
Minimum Remove to Make Valid Parentheses
53%
MediumM
53%
StringStack
Solve→
Lowest Common Ancestor of a Binary Tree
52%
MediumM
52%
TreeDepth-First Search+1
Solve→
Maximum Number of Events That Can Be Attended
45%
MediumM
45%
ArrayGreedy+2
Solve→
Two City Scheduling
43%
MediumM
43%
ArrayGreedy+1
Solve→
Shortest Path in Binary Matrix
43%
MediumM
43%
ArrayBreadth-First Search+1
Solve→
Coin Change
40%
MediumM
40%
ArrayDynamic Programming+1
Solve→
Jump Game
36%
MediumM
36%
ArrayDynamic Programming+1
Solve→
Largest Number
31%
MediumM
31%
ArrayString+2
Solve→
Palindromic Substrings
23%
MediumM
23%
Two PointersString+1
Solve→
Nested List Weight Sum
21%
MediumM
21%
Depth-First SearchBreadth-First Search
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

Ampere Computing
23 problems
AT&T
23 problems
Byjus
23 problems
Cerebras Systems
23 problems
Chainalysis
23 problems
Chegg
23 problems

Frequently Asked Questions

What LeetCode problems does Didi ask in interviews?

Didi commonly asks 23 coding problems in technical interviews, including Toeplitz Matrix, Maximum Profit in Job Scheduling, Moving Average from Data Stream. The difficulty breakdown is 2 Easy, 18 Medium, and 3 Hard problems.

How should I prepare for a Didi coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Didi interviews typically emphasize Array and Sorting. Practice explaining your thought process while coding.

What is the difficulty level of Didi coding interviews?

Based on our data, Didi interviews include 2 Easy (9%), 18 Medium (78%), and 3 Hard (13%) problems.

Ready to ace your Didi interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.