I recently had chance to sit for the intuit OA, it was pretty great experience, there were four questions,
first question was a variant of merge sort, i dont remember much but it was something like this:
you are given two array of same length
you have to get maximum sum
such that you can switch between the arrays only if at index i the value of arr1[i]==arr2[i]

e.g.
arr1: 1, 2, 4, 7, 9,12, 3,6
arr2: 1, 5, 7, 8, 9, 3, 5, 7,

1+ 5+ 7+8+ 12 + 3+ 6 is the answer;
how? since we start from any of these two arrays, both the arrays at index 4, the value at arr1[i]== arr2[i], so we can change the array if we want

second question was priority queue based,i dont remember,
third question was rotten oranges from leetcode,
fourth was dp based, i dont remember this too, but it was one-d dp.
i got shortlisted,

Second round, interview 1:
i was asked kth largest term in tree, and

q2: you are given an array
e.g. 1, 5, 2, 4, 7, 3,5
and you have to return a vector where arr[i]= product of all number except for the arr[i]

i said we can use a prod of int type and store the product of all numbers and divide the arr[i] with the number.
but the problem will be if it has a zero, so we can also add condition to this.

so he said you have very poor compiler, you can not divide, so after taking two minutes i came up with another solution and he was happy about it.

then alot of discussion about my projects, it was great.

i got shortlisted.

Round 3 interview 2
i was asked a variant of merge sort which was pretty easy, i answered correctly. they asked what would you like in core. I said, DBMS and OOPS. i was prepared with none. questions were relatively easy but my concepts were messed up.
in oops they asked
what is polymorphism,
compile time,
how it is different from runtime,
difference between error and exception,
cases where function overloading will happen,
virtual keyword and a example of same.
inheritance,
what is abstraction
difference between inheritance and abstraction,
a couple more

in dbms :
dcl
dql
dml
exmaple of these
is alter in dml or dcl?
what is indexing,.

since, my concept were so messed up i didnt get selected in final round,. but it was fun experience, pretty easy overall.
dont worry you will make it.