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 15 problems of 26
- #22easyfoundational
22. Climbing Stairs
Count the distinct ways to reach the top of an n-step staircase using 1 or 2 steps at a time — Asana uses this Fibonacci-DP warmup to assess how cleanly you reduce a novel problem to overlapping subproblems before coding.
- #1easyfrequently asked
1. Two Sum
Given an array of integers and a target, return the indices of two numbers that add up to the target. Asana opens with this to confirm you reach for hash maps reflexively before quadratic loops — a baseline signal before they pivot to graph problems.
- #2easyfrequently asked
2. Valid Parentheses
Determine if a string of brackets is balanced and properly nested. Asana asks this to test whether you reach for a stack reflexively — the same data structure underpins their task-dependency cycle checks.
- #3easyfrequently asked
3. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list by splicing nodes together. Asana asks this to confirm you can handle pointer manipulation cleanly — a building block for their dependency-resolution merge step.
- #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.
- #8easyfrequently asked
8. Merge Sorted Array
Merge two sorted arrays in-place, where the first has extra trailing slots. Asana asks this to test whether you spot the back-to-front trick — they care because the same insight powers their activity-feed merge logic.
- #9easyfrequently asked
9. Binary Tree Inorder Traversal
Return the inorder traversal of a binary tree. Asana asks this to confirm you can implement both recursive and iterative tree walks — they care because the iterative pattern is what powers their cycle-free dependency walker.
- #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.
- #12easyfrequently asked
12. Maximum Depth of Binary Tree
Find the maximum depth of a binary tree. Asana asks this to confirm you can write the simplest tree recursion cleanly — a baseline before they ask about deep project-hierarchy traversals.
- #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.