Array Interview Questions
1610 real interview questions test Array. Practice any of them in the code editor and get AI feedback on your solution.
- Junior21% (345)
- Mid/Senior53% (861)
- Staff25% (404)
Companies that ask Array the most
Questionspage 16 of 17
- Maximum Energy Boost From Two Drinks1 companyMid/Senior
- Count Almost Equal Pairs I1 companyMid/Senior
- Minimum Amount of Damage Dealt to Bob1 companyStaff
- K-th Nearest Obstacle Queries1 companyMid/Senior
- Maximum XOR Score Subarray Queries1 companyStaff
- Maximum Number of Moves to Kill All Pawns1 companyStaff
- Find Indices of Stable Mountains1 companyJunior
- Find the Maximum Sequence Value of Array1 companyStaff
- Minimum Number of Valid Strings to Form Target I1 companyMid/Senior
- Sorted GCD Pair Queries1 companyStaff
- Find Maximum Removals From Source String1 companyMid/Senior
- Check if DFS Strings Are Palindromes1 companyStaff
- Maximum Points Tourist Can Earn1 companyMid/Senior
- Find the Maximum Factor Score of Array1 companyMid/Senior
- Adjacent Increasing Subarrays Detection II1 companyMid/Senior
- Sum of Good Subsequences1 companyStaff
- Minimize the Maximum Adjacent Element Difference1 companyStaff
- Shift Distance Between Two Strings1 companyMid/Senior
- Minimum Positive Sum Subarray1 companyJunior
- Minimum Time to Break Locks I1 companyMid/Senior
- Count Paths With the Given XOR Value1 companyMid/Senior
- Minimum Operations to Make Columns Strictly Increasing1 companyJunior
- Maximum Subarray With Equal Products1 companyJunior
- Sum of Variable Length Subarrays1 companyJunior
- Frequencies of Shortest Supersequences1 companyStaff
- Assign Elements to Groups with Constraints1 companyMid/Senior
- Eat Pizzas!1 companyMid/Senior
- Transform Array by Parity1 companyJunior
- Choose K Elements With Maximum Sum1 companyMid/Senior
- Longest Special Path II1 companyStaff
- Zero Array Transformation IV1 companyMid/Senior
- Properties Graph1 companyMid/Senior
- Number of Unique XOR Triplets I1 companyMid/Senior
- Number of Unique XOR Triplets II1 companyMid/Senior
- Shortest Path in a Weighted Tree1 companyStaff
- Calculate Score After Performing Instructions1 companyMid/Senior
- Make Array Non-decreasing1 companyMid/Senior
- Find X Value of Array I1 companyMid/Senior
- Find X Value of Array II1 companyStaff
- Find the Most Common Response1 companyMid/Senior
- Count Cells in Overlapping Horizontal and Vertical Substrings1 companyMid/Senior
- Path Existence Queries in a Graph I1 companyMid/Senior
- Concatenated Divisibility1 companyStaff
- Path Existence Queries in a Graph II1 companyStaff
- Fill a Special Grid1 companyMid/Senior
- Merge Operations for Minimum Travel Time1 companyStaff
- Smallest Index With Digit Sum Equal to Index1 companyJunior
- Minimum Swaps to Sort by Digit Sum1 companyMid/Senior
- Partition Array into Two Equal Product Subsets1 companyMid/Senior
- Minimum Moves to Clean the Classroom1 companyMid/Senior
- Maximize Count of Distinct Primes After Split1 companyStaff
- Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values1 companyMid/Senior
- Maximize Subarray GCD Score1 companyStaff
- Maximum Good Subtree Score1 companyStaff
- Maximum Product of First and Last Elements of a Subsequence1 companyMid/Senior
- Find Weighted Median Node in Tree1 companyStaff
- Count Prime-Gap Balanced Subarrays1 companyMid/Senior
- Longest Common Prefix Between Adjacent Strings After Removals1 companyMid/Senior
- Partition Array to Minimize XOR1 companyMid/Senior
- Minimum Stability Factor of Array1 companyStaff
- Partition Array for Maximum XOR and AND1 companyStaff
- Maximum Balanced Shipments1 companyMid/Senior
- Minimum Time to Activate String1 companyMid/Senior
- Maximum K to Sort a Permutation1 companyMid/Senior
- Partition Array Into K-Distinct Groups1 companyMid/Senior
- Find The Least Frequent Digit1 companyJunior
- Generate Schedule1 companyMid/Senior
- Subsequence Sum After Capping Elements1 companyMid/Senior
- Number of Stable Subsequences1 companyStaff
- Split and Merge Array Transformation1 companyMid/Senior
- Maximize Alternating Sum Using Swaps1 companyStaff
- Compute Decimal Representation1 companyJunior
- Split Array With Minimum Difference1 companyMid/Senior
- Minimum Moves to Equal Array Elements III1 companyJunior
- Longest Non-Decreasing Subarray After Replacing at Most One Element1 companyMid/Senior
- Minimum Operations to Make Binary Palindrome1 companyMid/Senior
- Maximize Points After Choosing K Tasks1 companyMid/Senior
- Maximum Subgraph Score in a Tree1 companyStaff
- Minimum Moves to Balance Circular Array1 companyMid/Senior
- Minimum Number of Operations to Have Distinct Elements1 companyMid/Senior
- Maximum Sum of Three Numbers Divisible by Three1 companyMid/Senior
- Maximum Score After Binary Swaps1 companyMid/Senior
- Minimum Swaps to Avoid Forbidden Values1 companyStaff
- Total Sum of Interaction Cost in Tree Groups1 companyStaff
- Minimum Subarray Length With Distinct Sum At Least K1 companyMid/Senior
- Count Routes to Climb a Rectangular Grid1 companyStaff
- Word Squares II1 companyMid/Senior
- Count Caesar Cipher Pairs1 companyMid/Senior
- Maximum Bitwise AND After Increment Operations1 companyStaff
- Minimum Prefix Removal to Make Array Strictly Increasing1 companyMid/Senior
- Rotate Non Negative Elements1 companyMid/Senior
- Minimum K to Reduce Array Within Limit1 companyMid/Senior
- Final Element After Subarray Deletions1 companyMid/Senior
- Toggle Light Bulbs1 companyJunior
- Smallest Pair With Different Frequencies1 companyJunior
- Minimum Bitwise OR From Grid1 companyMid/Senior
- Sum of GCD of Formed Pairs1 companyMid/Senior
- Longest Arithmetic Sequence After Changing At Most One Element1 companyMid/Senior
- Construct Uniform Parity Array II1 companyMid/Senior
- Minimum Absolute Difference Between Two Values1 companyJunior