Just finished Intuit SWE OA, hurry up and write this to share while the memory is still fresh. To be honest, I searched for relevant posts on various platforms for a long time before doing it, and the scattered information was incomplete when put together, so I wanted to sort out my complete experience, hoping to help students who are preparing later.
My overall feeling is: Intuit's OA is not the type where you can pass the Hard questions, but it is definitely not something you can pass by just writing. What it tests is not whether you can solve problems, but whether the code you write is stable and engineering enough. After I finished it, I felt okay, but looking back, there were a few borderline cases that I didn't expect at the time - this is what I want to remind everyone in particular.
Overall process overview
Intuit's recent (2025 Q4 ~ 2026 Q1) New Grad / SWE 1 recruitment process is basically as follows:
- Online application → Resume screening
- OA (2-3 questions): The platform is HackerRank or Glider, and some positions are on the Uptime Crew recruitment platform.
- Recruiter Phone Screen: 30 minutes, behavioral questions + AI usage topics
- Technical Phone Screen/VO: Depending on the position, 1 to 2 rounds of technical interviews
- Offer/Rejection
Some positions (delivered through Uptime Crew) need to complete Uptime's internal 90-minute coding challenge first, and then be handed over to Intuit for interviews.
Intuit SWE 26 OA latest test questions sharing
The following are high-frequency questions actually encountered by candidates (organized by Programhelp)
Server failure count
You have N Servers, whose IDs are S1, s2, ..., sn. The system processes a series of log entries, each in the format:
,inStatusCan only be"success"Or"error".
You need to record the number of consecutive errors for each server. The rules are as follows:
- If a server records 3 consecutive
"error"Log, it will be deemed faulty and replaced (the replaced server will still use the same ID). - When a server is replaced, its number of consecutive errors is reset to 0.
- One piece
"success"The log will also reset the number of consecutive errors for this server to 0.
Your task is: after processing all log entries, count the total number of server replacements that have occurred.
Example:
Enter:N=2, log = ["s1 error", "s1 error", "s2 error", "s1 error", "s1 error", "s2 success"]
Output:1
Problem-solving ideas:
Use a hash table to record the number of consecutive "errors" for each server. When "success" is encountered, the server count is cleared; when "error" is encountered, the count is incremented by one. If it reaches 3 times, the number of replacements is +1 and the count is cleared. All logs are continued to be processed, and the total number of replacements is finally returned.
String minimum length
Given a string consisting only of characters 'A' And 'B' A string consisting of Seq.
You can do the following repeatedly:
- Delete any occurrence of substring
"AB"Or"BB". - After deletion, the remaining parts of the string are automatically spliced together.
Your task is to find the minimum possible length of the string after performing any number of effective deletions.
Note: Substring refers to a continuous sequence of characters.
Example:
Enter:Seq = "BABBA"
Output:1
Problem-solving ideas:
The deletable "AB" or "BB" is equivalent to: every time you encounter a B, as long as there are characters on the left, you can form a deletable pair with it and eliminate it together. Use stack simulation: when A is read, it is pushed onto the stack; when B is read, if the stack is not empty, pop the stack (delete a pair), otherwise push it onto the stack. The final stack length is the minimum remaining length.
Pair Swapping
There are several weights placed on each of the two trays of the balance. You need to decide whether the scale can be balanced by exchanging one weight on each of the two pallets.
Given two integer arrays, representing the weight of the weights on the two pallets respectively. Please write a program to determine whether there is such a pair of weights, and the balance will be balanced after exchange.
Input format:
- First line: an integer
M, represents the number of weights on the first pallet. - Second line:
MA space-separated integer representing the weight of the weight on the first pallet. - Line 3: an integer
N, represents the number of weights on the second pallet. - The fourth line:
NA space-separated integer representing the weight of the weight on the second pallet.
Output:
If such a pair of weights exists, return True; Otherwise return False.
Problem-solving ideas:
The judgment logic is simplified through mathematical derivation. First, calculate the total weight of the two pallet weights, which are recorded as sum1 and sum2 respectively. Assume that the weights of the two exchanged weights are a (from the first pallet) and b (from the second pallet). The condition for balance after exchange is sum1 – a + b = sum2 – b + a. After sorting, we can get sum1 – sum2 = 2 (a – b). This means that the total weight difference of the two pallets must be an even number, otherwise false will be returned directly. If the total weight difference is an even number, calculate the target difference diff=(sum1-sum2)/2, and then traverse each weight a of the first pallet to determine whether there is b=a-diff and b is in the second pallet. If it exists, it will return true. If it is not found at the end of the traversal, it will return false. This avoids violent double loops and improves efficiency.
Oldest and Youngest
You are evacuating hostages from a burning building and can only take two people at a time. You decide to take away the oldest and youngest hostages first.
Write a function that finds the oldest and youngest hostages from an array of integers representing their ages.
Input format:
- First line: an integer
N, represents the number of hostages. - Second line:
NA space-separated integer representing the age of each hostage.
Output format:
Output the age of the oldest hostage and the age of the youngest hostage (in the order required by the question).
Problem-solving ideas:
Directly traverse the array to obtain the extreme value. First, determine whether the hostage age array is empty. If it is not empty, initialize the youngest age to the first element of the array and the oldest age to the first element of the array. Then traverse the entire age array starting from the second element. Each age traversed is compared with the current youngest age. If it is smaller, the youngest value is updated; compared with the current oldest age, if it is larger, the oldest value is updated. Two extreme values can be found at the same time in one traversal, with the lowest time complexity. After the traversal is completed, the oldest and youngest ages can be directly output.
Don’t let the OA you get from sea investment become your final destination.
Headcount is now shrinking every day. Every OA you get may be your only and last chance to go ashore this year. Don't use this precious opportunity to test your luck and so-called question sense.
Leave professional matters to top experts. If you are currently holding an OA link in your hand that you have been reluctant to click on, or you are unable to sleep at night because of the upcoming VO, contact us immediately ProgramHelp . Use the most stable, ruthless and accurate method to firmly grasp the offer that should be yours!
