Autodesk Interview Questions — 31 DSA Problems

31 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Autodesk LeetCode questions for software engineering interviews.

• Number of Subarrays That Match a Pattern I (MEDIUM) — Array, Rolling Hash, String Matching, Hash Function
• Number of Changing Keys (EASY) — String
• Distribute Elements Into Two Arrays I (EASY) — Array, Simulation
• Distribute Elements Into Two Arrays II (HARD) — Array, Binary Indexed Tree, Segment Tree, Simulation
• Number of Subarrays That Match a Pattern II (HARD) — Array, Rolling Hash, String Matching, Hash Function
• Count Prefix and Suffix Pairs II (HARD) — Array, String, Trie, Rolling Hash, String Matching, Hash Function
• Count Prefix and Suffix Pairs I (EASY) — Array, String, Trie, Rolling Hash, String Matching, Hash Function
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Valid Parentheses (EASY) — String, Stack
• Combination Sum (MEDIUM) — Array, Backtracking
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Longest Increasing Subsequence (MEDIUM) — Array, Binary Search, Dynamic Programming
• Linked List Cycle (EASY) — Hash Table, Linked List, Two Pointers
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Elimination Game (MEDIUM) — Math, Recursion
• Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix
• Valid Sudoku (MEDIUM) — Array, Hash Table, Matrix
• Minimum Size Subarray Sum (MEDIUM) — Array, Binary Search, Sliding Window, Prefix Sum
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Majority Element (EASY) — Array, Hash Table, Divide and Conquer, Sorting, Counting
• Restore IP Addresses (MEDIUM) — String, Backtracking
• Block Placement Queries (HARD) — Array, Binary Search, Binary Indexed Tree, Segment Tree
• Product of Array Except Self (MEDIUM) — Array, Prefix Sum
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List