Airtasker LeetCode Interview Questions
Practice 40 real coding problems frequently asked in Airtasker technical interviews. Master these questions to ace your next Airtasker software engineering interview.
Top Topics at Airtasker
Ace your Airtasker interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Airtasker Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Subsets 100% | MediumM | Solve→ |
Maximum Depth of Binary Tree 94% | EasyE | Solve→ |
Split Array Largest Sum 88% | HardH | Solve→ |
Gas Station 86% | MediumM | Solve→ |
Invalid Transactions 84% | MediumM | Solve→ |
Group Anagrams 83% | MediumM | Solve→ |
Coin Change II 80% | MediumM | Solve→ |
Rank Teams by Votes 79% | MediumM | Solve→ |
Find the Index of the First Occurrence in a String 78% | EasyE | Solve→ |
Maximum Subarray 76% | MediumM | Solve→ |
Product of Array Except Self 74% | MediumM | Solve→ |
String Compression 74% | MediumM | Solve→ |
Clone Graph 70% | MediumM | Solve→ |
Check Completeness of a Binary Tree 67% | MediumM | Solve→ |
Rotting Oranges 63% | MediumM | Solve→ |
Reverse Words in a String 60% | MediumM | Solve→ |
Permutation in String 59% | MediumM | Solve→ |
Ransom Note 58% | EasyE | Solve→ |
Word Ladder II 56% | HardH | Solve→ |
Spiral Matrix 55% | MediumM | Solve→ |
Plus One 55% | EasyE | Solve→ |
Two Best Non-Overlapping Events 50% | MediumM | Solve→ |
Missing Ranges 46% | EasyE | Solve→ |
Course Schedule 42% | MediumM | Solve→ |
Add Two Numbers 41% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Tree Maximum Path Sum 40% | HardH | Solve→ |
Single Number 39% | EasyE | Solve→ |
Find the Celebrity 38% | MediumM | Solve→ |
Check If N and Its Double Exist 37% | EasyE | Solve→ |
Binary Tree Vertical Order Traversal 36% | MediumM | Solve→ |
Kth Smallest Element in a BST 35% | MediumM | Solve→ |
Reorganize String 32% | MediumM | Solve→ |
Flood Fill 32% | EasyE | Solve→ |
Valid Anagram 31% | EasyE | Solve→ |
Binary Tree Right Side View 30% | MediumM | Solve→ |
Sqrt(x) 27% | EasyE | Solve→ |
Logger Rate Limiter 27% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 24% | MediumM | Solve→ |
LRU Cache 23% | MediumM | Solve→ |
Shortest Word Distance II 21% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Airtasker ask in interviews?
Airtasker commonly asks 40 coding problems in technical interviews, including Subsets, Maximum Depth of Binary Tree, Split Array Largest Sum. The difficulty breakdown is 11 Easy, 26 Medium, and 3 Hard problems.
How should I prepare for a Airtasker coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Airtasker interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Airtasker coding interviews?
Based on our data, Airtasker interviews include 11 Easy (28%), 26 Medium (65%), and 3 Hard (8%) problems.
Ready to ace your Airtasker interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required