Asana Coding Interview Questions
26 Asana coding interview problems with full optimal solutions — 15 easy, 10 medium, 1 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Asana interviewer values, and a FAQ section.
Showing 8 problems of 26
- #4easysometimes asked
4. Remove Duplicates from Sorted Array
Remove duplicates from a sorted array in-place and return the new length. Asana likes this to check whether you handle the two-pointer pattern cleanly — a precursor to their dedup steps in activity-feed merge logic.
- #5easysometimes asked
5. Remove Element
Remove all instances of a value from an array in-place. Asana asks this to test whether you understand the two-pointer write/read separation that scales to their bulk-task-mutation pipelines.
- #6easysometimes asked
6. Search Insert Position
Given a sorted array and a target, return the index where target is or would be inserted. Asana asks this to confirm you can write a bug-free binary search — a building block for task-priority ordering in their backend.
- #7easyrarely asked
7. Plus One
Given a number represented as a digit array, return the array plus one. Asana uses this to gauge whether you handle carry propagation cleanly — the same pattern that shows up in their counter-aggregation services.
- #10easysometimes asked
10. Same Tree
Given two binary trees, determine if they are structurally identical. Asana asks this to test recursive base cases on trees — a foundation for their structural-diff logic in project templates.
- #11easysometimes asked
11. Symmetric Tree
Determine if a binary tree is a mirror of itself. Asana asks this to test whether you can pair two pointers across a tree — the same pattern used in their snapshot-diff symmetry checks.
- #13easysometimes asked
13. Balanced Binary Tree
Determine if a binary tree is height-balanced. Asana asks this to test whether you spot the O(n) early-exit pattern — they care because the same trick speeds up their dependency-imbalance detector.
- #14easysometimes asked
14. Minimum Depth of Binary Tree
Find the minimum depth of a binary tree — the shortest path from root to a leaf. Asana asks this because it's the classic 'recursive trap' where reusing the max-depth template silently breaks.