I just got the OA for this position and they said there are 3 questions. Are the questions hard? What can I expect for them?
Hello! I’ve heard Snowflake’s OA is quite challenging. Here are a few examples of questions they’ve asked:
- Given a vector of integers (with possible repetitions) and integer k, get the number of distinct pairs that satisfy a, b in the vector and a+k = b
- {n, m, totalNum} totalNum is the number of ascending orders in array if you start with the first value in an array until the largest value. n is the size of the array and m is the upper bound of the array (1 \leq x leq m). How many arrays would satisfy these conditions?
- Question similar to this one: Given an n x n square matrix, find sum of all sub-squares of size k x k - GeeksforGeeks
1 Like