31 problems · 6 Easy, 18 Medium, 7 Hard · Ranked #63 of 458
Difficulty breakdown
6 Easy
19% · avg 23%
18 Medium
58% · avg 59%
7 Hard
23% · avg 18%
Top topics
array
71%
string
25.8%
hash-table
22.6%
binary-search
19.4%2.2x
rolling-hash
12.9%34.5x
string-matching
12.9%14.8x
Interview profile
Based on 31 reported problems, Autodesk interviews are slightly harder than average - 23% Hard vs 18% across all companies. The majority (58%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Autodesk puts unusual emphasis on rolling-hash (12.9% of problems, 34.5x the industry average), hash-function (12.9% of problems, 22.2x the industry average), string-matching (12.9% of problems, 14.8x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (71%), string (25.8%), hash-table (22.6%), binary-search (19.4%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 31 problems
Problem
Difficulty
Frequency
Topics
Number of Subarrays That Match a Pattern I
You are given a 0-indexed integer array nums of size n, and a 0-indexed integer array pattern of size m consisting of integers -1, 0, and 1.
You are given a 0-indexed string s typed by a user. Changing a key is defined as using a key different from the last used key. For example, s = "ab" has a chang...
You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum...
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If...
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order...
A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.
You are given a 0-indexed string s typed by a user. Changing a key is defined as using a key different from the last used key. For example, s = "ab" has a chang...
You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum...
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If...
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order...
A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.
MediumLikely
stringbacktracking
How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Autodesk interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Preparing for your Autodesk coding interview
Autodesk interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Autodesk interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
What coding problems does Autodesk ask in interviews?add
Autodesk has been reported to ask 31 distinct coding problems. The most common topics are array, string, hash-table. 6 are Easy difficulty, 18 are Medium, and 7 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Autodesk coding interviews?add
Based on 31 reported problems, Autodesk interviews are slightly harder than average - 23% Hard vs 18% across all companies. 58% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Autodesk coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Autodesk coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.