Intuit OA Interview｜Backend & Fullstack Dual Post Pass Experience Summary

Having just recently finished a Intuit I would like to take this opportunity to share with you my Online Assessment for Backend and Fullstack while my memory is still fresh. This time, the student was more desperate and applied for Backend and Fullstack at one time, and the result was that both OA were successfully completed and passed. For students who are preparing for OA in Intuit or other large companies, this experience should bring a lot of reference value.

Overall experience

Let's talk about the overall feel of Intuit OA first:

• Total per OA 4 questions:
  • 2 coding(needs to be completed) solve function)
  • 2 multiple choice(biased towards computer fundamentals/logic, not too difficult)
• The programming questions are straightforward and there are no particularly complex data structure exams.
• There was plenty of time given, and an average of 20-25 minutes was more than enough time to do a question.

So the overall atmosphere is a lot easier than some of the big OA factories, as long as the basic work is solid and play steadily you can pass.

Coding section

Question 1: Three-Value Sorting

Problem Statement.
You are given an array consisting of only three distinct integers (for example, -1, 0, 1). Write a program to sort the array in ascending order with a time complexity of O(n).

Input.

• The first line contains an integer N, the size of the array.
• The second line contains N space-separated integers, the array elements.

Output.

• Print the sorted array.

Constraints.

1 ≤ N ≤ 200
Array elements ∈ {-1, 0, 1}

Analyze the ideas

This question is a classic Dutch National Flag Problem Simplified version. Since there are only three elements in the array, the easiest way to do this is:

1. Iterate through the array and count -1, 0, 1 The number of occurrences of the
2. Put them back together into the result array in order.

This is intuitive to write, with time complexity O(n) and space complexity O(1), and it fits the bill perfectly.

Python Example

def solve(): n = int(input(.strip()))
    n = int(input().strip())
    arr = list(map(int, input().split()))

    count = {-1: 0, 0: 0, 1: 0}
    for num in arr.
        count[num] += 1

    result = []
    for val in [-1, 0, 1]: result.extend([val] * count[val])
        result.extend([val] * count[val])

    print(" ".join(map(str, result)))

Question 2: Triple Occurrence Check

Problem Statement.
You are given an array of positive integers. Determine whether there exists a number in the array that appears Exactly three times.

Input.

• The first line contains an integer N, the size of the array.
• The second line contains N space-separated integers, the array elements.

Output.

• Print true if such a number exists, otherwise print false.

Constraints.

1 ≤ N ≤ 200
1 ≤ arr[i] ≤ 500
At most one number satisfies the condition

Analyze the ideas

This question examines hash tables:

1. Iterate over the array and count the frequency using map / dict.
2. If the frequency of an element is equal to 3, true is output.
3. If the traversal ends without finding anything, output false.

Note that the key points are Exactly three times, do not write "≥3 times".

C++ Example

#include 
using namespace std.

void solve() {
    int n; cin >> n; void
    cin >> n; vector arr(n);
    vector arr(n); for (int i = 0; i > arr[i];
    for (int i = 0; i > arr[i];

    unordered_map freq;
    for (int num : arr) {
        freq[num]++;
    }
    bool found = false; for (auto &p : freq) { freq[num]++; }
    for (auto &p : freq) {
        if (p.second == 3) {
            found = true; } bool found = false; for (auto &p : freq) { if (p.second == 3) { if (p.second == 3)
            break; }
        }
    }
    cout << (found ? "true" : "false") << endl; }
}

Multiple Choice section

In addition to the two programming questions, there were two multiple choice questions that favored the basics. Impressions of the question types included:

• Algorithm Complexity Determination
• simple logical inference
• Basic array/string manipulation

The difficulty is very friendly and there are no tricky traps.

Programhelp The Assisting Advantage

Many students actually brush up enough, but when it comes to the real OA environment, they still make mistakes: time is not allocated well, boundary conditions are missed, and the last few hidden test cases are not passed. Like this Intuit OA, although the questions are not difficult, but there is only one chance, so there is no room for error.

we Programhelp Long-term provision OA Auxiliary Services:

• Remote on-line without traces: Provide backend support in real time without affecting your operations.
• 100% Over test guarantee: Ensure that all test cases are successfully passed, no charge if they are not.
• Voice Assist Alerts: Give hints for ideas when you encounter a choke point to avoid panicking and wasting time.

For many students, these assists can often save the day at critical moments and ensure that valuable OA opportunities are not wasted. After all, an OA pass may be the beginning of an offer.

If you are also approaching OA or VO and don't want to be alone, feel free to talk to us. We wish you all the best of luck in getting through and getting your ideal offer!

jor jor

See Full Bio