Question 1

Number of Subarrays That Match a Pattern I — Autodesk Interview Question

Accepted Answer

"Number of Subarrays That Match a Pattern I" is a medium difficulty problem asked at Autodesk interviews. It covers the following topics: Array, Rolling Hash, String Matching, Hash Function. You can practice it on LeetCode: https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-i

Question 2

Number of Changing Keys — Autodesk Interview Question

Accepted Answer

"Number of Changing Keys" is a easy difficulty problem asked at Autodesk interviews. It covers the following topics: String. You can practice it on LeetCode: https://leetcode.com/problems/number-of-changing-keys

Question 3

Distribute Elements Into Two Arrays I — Autodesk Interview Question

Accepted Answer

"Distribute Elements Into Two Arrays I" is a easy difficulty problem asked at Autodesk interviews. It covers the following topics: Array, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/distribute-elements-into-two-arrays-i

Question 4

Distribute Elements Into Two Arrays II — Autodesk Interview Question

Accepted Answer

"Distribute Elements Into Two Arrays II" is a hard difficulty problem asked at Autodesk interviews. It covers the following topics: Array, Binary Indexed Tree, Segment Tree, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/distribute-elements-into-two-arrays-ii

Question 5

Number of Subarrays That Match a Pattern II — Autodesk Interview Question

Accepted Answer

"Number of Subarrays That Match a Pattern II" is a hard difficulty problem asked at Autodesk interviews. It covers the following topics: Array, Rolling Hash, String Matching, Hash Function. You can practice it on LeetCode: https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-ii

Question 6

Count Prefix and Suffix Pairs II — Autodesk Interview Question

Accepted Answer

"Count Prefix and Suffix Pairs II" is a hard difficulty problem asked at Autodesk interviews. It covers the following topics: Array, String, Trie, Rolling Hash, String Matching, Hash Function. You can practice it on LeetCode: https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii

#	Question Title	Difficulty	Frequency	Topics
1	Number of Subarrays That Match a Pattern I	MEDIUM	100.0	ArrayRolling HashString Matching+1
2	Number of Changing Keys	EASY	97.9	String
3	Distribute Elements Into Two Arrays I	EASY	95.5	ArraySimulation
4	Distribute Elements Into Two Arrays II	HARD	95.5	ArrayBinary Indexed TreeSegment Tree+1
5	Number of Subarrays That Match a Pattern II	HARD	95.5	ArrayRolling HashString Matching+1
6	Count Prefix and Suffix Pairs II	HARD	95.5	ArrayStringTrie+3
7	Count Prefix and Suffix Pairs I	EASY	95.5	ArrayStringTrie+3
8	Group Anagrams	MEDIUM	73.1	ArrayHash TableString+1
9	Sliding Window Maximum	HARD	73.1	ArrayQueueSliding Window+2
10	Search in Rotated Sorted Array	MEDIUM	66.1	ArrayBinary Search

Explore 450+ Companies

Companies

Autodesk

Want to see more?

Autodesk Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Autodesk

Want to see more?

Autodesk Interview Questions

Ai Assistant Kas