Available question text
It was leetcode standard cherry picking problem variant
Related questions
Continue with questions that share topics or the same question type.
- Solve this impossible leetcode hard problem that involves figuring out an alogrithms that can crack any RSA encryption in O(1) time.
All jokes aside, it was a question about topological sorting. You have to find manager and employees given a list of their names and ids and print them out in a pyramid sideway pyramid.
Coding
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
- Alien Dictionary (hard problem from leetcode)
Coding
- C++ leetcode hard questions was asked.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Uber
It was leetcode standard cherry picking problem variant
Reported Sep 2025 · 1 source report
Software Developer
Source snapshot: Nov 12, 2026
View source