Recent Intuit OA has begun to be issued one after another. This set of question types is actually very stable. Whether it is an AI post or an SDE post, the overall structure has almost remained the same: three questions: Code + SQL + Bash. If you have played similar combinations before, this set is basically a type that can be passed by "familiarity with the question types + stable performance".
This article is based on the real experience of doing the questions and gives you a summary of the interview experience that is closer to actual combat.
Intuit OA Basics
- Platform: Generally HackerRank/CodeSignal
- Time: 70～90 minutes
- Number of questions: 3
- Question type distribution:
- 1 Coding
- 1 SQL
- 1 Bash / Shell
Intuit OA real question sharing
Topic 1: Student Arrangement
Question description:
A number needs to be assigned to the element in the array that represents the classmate. An arrangement is considered "good" if the absolute difference between any two adjacent student numbers does not exceed 1.
The input array contains 0 Marked missing elements, the task is to statistically replace these with arbitrary integers 0, to form the total number of ways to form a "good array". Since the result can be very large, return the value modulo 109+7.
Constraints:
- Array length 1≤n≤1500
- Non-zero elements in the array 0≤arr[i]≤109
- There is at least one non-zero element in the array
Problem-solving ideas
The non-zero numbers in the array are fixed anchor points. The original array is divided into independent intervals with fixed values at both ends and all 0s in the middle. The filling plans of each interval do not interfere with each other. The total number of plans is the product (modulo) of the number of all interval plans. When solving a single interval, the starting point value, end point value and interval length are known, which is equivalent to starting from the starting point, each step can only be ±1 / unchanged, and the number of paths to the end point; the total displacement is fixed, directly calculated using the multi-set combination number formula, enumerating the + 1, -1, unchanged number of operations, substituting the number of + 1, -1, unchanged operations into the combination formula to quickly solve, without the need for violent enumeration, the time complexity is reduced from exponential to linear, and perfectly adapts to the upper limit of the array length.
Topic 2: SQL: Stock Market Software Capitalization Report
Question description:
As part of stock market software development, write a SQL query that returns a list of total capitalization amounts for all companies in each stock sector.
Result requirements:
- Result column:
Sector(stock sector),Total_capitalization(corresponding to the total capitalization amount of the sector) Total_capitalizationFormat: Keep two decimal places and use suffixes respectively.B(billions) andM(millions) identification unit- The result needs to be pressed
SectorSort in ascending order
Things to note:
- Company capitalization data may be incomplete and missing sector or capitalization information will appear as
N/a - Includes only companies with both stock sector and capitalization information
Table structure:
Table name:Companies
Sheet
| List | Type | Constraint | Describe |
|---|---|---|---|
| Name | VARCHAR(255) | PRIMARY KEY | Company Name |
Problem-solving ideas
Process the dirty data first and filter out the sector/capitalization value asN/aInvalid data; then standardize the capitalized value of the string with units: extract the numeric part,BCorresponds to multiplying by 10⁹,MCorrespondingly, multiply by 10⁶ and uniformly convert it into a pure numerical value; sum up according to sector grouping to obtain the total capitalization value; finally reverse format the result and convert the total value into a value with two decimal places.B/MThe strings of units are finally sorted and output in ascending order of sections. The entire data processing logic is closed loop and there is no redundant calculation.
Topic 3: Bash: Pattern Matching
Question description:
Given an array of strings, count the number of strings containing at least one uppercase letter and output the result to standard output (STDOUT).
Example:
Input array:["FirstWord", "Word2", "thirdword"]
Output:2(because "FirstWord" And "Word2" Contains uppercase letters)
Sample input:
Plaintext
Abc
bcd
f
def
cDe
Sample output:
Plaintext
3
Explain:"Abc","Efg","cDe" These 3 strings contain uppercase letters.
Problem-solving ideas
Traverse all input strings through regular expressions[A-Z] Accurately matches uppercase letters without complex judgment; every time a string containing uppercase letters is matched, the counter increments by 1, and the counter result is directly output after the traversal is completed; regular matching is highly efficient, the code is concise, and it is suitable for any input scale, which is the optimal solution.
Want to get high scores stably and pass OA quickly?
Our team has rich practical experience in Intuit OA and can help you accurately sort out the question types and provide targeted guidance to ensure that the three questions of Code, SQL, and Bash are completed efficiently.
OA ghostwriting/assistance: Remote safe operation to ensure 100% pass of test cases, no fee will be charged if test cases fail.
Real-time thinking assistance: Avoid getting stuck on Bash syntax or SQL boundaries and help you perform stably.
Full service: From OA to follow-up interviews, seniors provide one-on-one support to help you avoid detours.
We have helped many students successfully pass Intuit and similar OA, and get subsequent interview opportunities. If necessary, you are welcome to contact ProgramHelp directly, and we will provide the most suitable assistance plan after assessing your specific situation. Prepare early and get the offer early! Opportunities wait for no one at Intuit OA. Persistence in performance is victory. Come on!
