Problem database last updated: June 20, 2025

AAutodesk logo

Autodesk Coding Interview Questions

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

Number of Subarrays That Match a Pattern I

Solve

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.

MediumVery Likely
arrayrolling-hashstring-matching

Number of Changing Keys

Solve

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...

EasyVery Likely
string

Distribute Elements Into Two Arrays II

Solve

You are given a 1-indexed array of integers nums of length n.

HardVery Likely
arraybinary-indexed-treesegment-tree

Distribute Elements Into Two Arrays I

Solve

You are given a 1-indexed array of distinct integers nums of length n.

EasyVery Likely
arraysimulation

Count Prefix and Suffix Pairs II

Solve

You are given a 0-indexed string array words.

HardVery Likely
arraystringtrie

Count Prefix and Suffix Pairs I

Solve

You are given a 0-indexed string array words.

EasyVery Likely
arraystringtrie

Number of Subarrays That Match a Pattern II

Solve

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.

HardVery Likely
arrayrolling-hashstring-matching

Group Anagrams

Solve

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

MediumLikely
arrayhash-tablestring

Sliding Window Maximum

Solve

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...

HardLikely
arrayqueuesliding-window

Combination Sum

Solve

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...

MediumLikely
arraybacktracking

Search in Rotated Sorted Array

Solve

There is an integer array nums sorted in ascending order (with distinct values).

MediumLikely
arraybinary-search

Maximum Subarray

Solve

Given an integer array nums, find the subarray with the largest sum, and return its sum.

MediumLikely
arraydivide-and-conquerdynamic-programming

Valid Parentheses

Solve

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

EasyLikely
stringstack

LRU Cache

Solve

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

MediumLikely
hash-tablelinked-listdesign

Linked List Cycle

Solve

Given head, the head of a linked list, determine if the linked list has a cycle in it.

EasyLikely
hash-tablelinked-listtwo-pointers

Elimination Game

Solve

You have a list arr of all integers in the range [1, n] sorted in a strictly increasing order. Apply the following algorithm on arr:

MediumLikely
mathrecursion

Minimum Size Subarray Sum

Solve

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...

MediumLikely
arraybinary-searchsliding-window

3Sum

Solve

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.

MediumLikely
arraytwo-pointerssorting

Block Placement Queries

Solve

There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis.

HardLikely
arraybinary-searchbinary-indexed-tree

Longest Palindromic Substring

Solve

Given a string s, return the longest palindromic substring in s.

MediumLikely
two-pointersstringdynamic-programming

Majority Element

Solve

Given an array nums of size n, return the majority element.

EasyLikely
arrayhash-tabledivide-and-conquer

Product of Array Except Self

Solve

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

MediumLikely
arrayprefix-sum

Longest Increasing Subsequence

Solve

Given an integer array nums, return the length of the longest strictly increasing subsequence.

MediumLikely
arraybinary-searchdynamic-programming

Koko Eating Bananas

Solve

Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.

MediumLikely
arraybinary-search

Median of Two Sorted Arrays

Solve

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

HardLikely
arraybinary-searchdivide-and-conquer

Set Matrix Zeroes

Solve

Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's.

MediumLikely
arrayhash-tablematrix

Letter Combinations of a Phone Number

Solve

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.

MediumLikely
hash-tablestringbacktracking

Sort Colors

Solve

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...

MediumLikely
arraytwo-pointerssorting

Valid Sudoku

Solve

Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

MediumLikely
arrayhash-tablematrix

Reverse Nodes in k-Group

Solve

Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.

HardLikely
linked-listrecursion

Restore IP Addresses

Solve

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.

Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.

Frequently Asked Questions

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.

Other companies to explore

Ready to ace your Autodesk interview?

Simulate a real Autodesk coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Autodesk interview with AIarrow_forward