Open In App

Snowflake USA Interview Experience for Internship 2021

Improve
Improve
Like Article
Like
Save
Share
Report

I am from Birla Institute of Technology, Mesra, Ranchi. I have interviewed for internship 2021 snowflake USA . 

Round 1:

Coding questions: There are 2 questions. Platform – Hackerrank 

  1. Given a 2D boolean array where true represents water and false represents land, generate a grid with the highest possible peak. 

    Rules are: 

    • The height of any water cell is 0.
    • The height of any land cell cannot differ for more than one from any of the neighboring (sharing one edge) cells.

    Example:

    Input:
    [[T, F, T],
    [F, F, F],
    [F, F, F]]
    One possible grid is
    [[0, 0, 0],
    [1, 0, 1],
    [2, 1, 2]]
    And grid
    [[0, 2, 0],
    [0, 0, 0],
    [0, 0, 0]]
    Output:  
    [[0, 1, 0],
    [1, 2, 1],
    [2, 3, 2]]

    Where the highest peak is 3.    Hint – Use BSF 

  2. Compare strings stored in two Linked Lists. Return true if the strings stored in both the lists are similar.

    List 1: "He" -> " llo" -> "wor" -> "ld"
    List 2: "H" --> "e" --> "ll" --> "owo" --> "r" --> "ld"

    Both the lists store “helloworld”.

Round 2:

  1. Basic DBMS, OOPS, OS questions 

  2. Divide the array into two parts, such that the difference between the sums of these two parts is minimized and the numbers of elements in these two parts differ by at most 1.

    Constraints:

    Number of TestCases: 50

    Size of array: 1 <= n <= 200. Hint – use dp 

  3. Given an array of integers A and an integer K, find a subsequence of length K that maximize the sum, which must be even. Return the sum, or -1 if no even sum can be made.

    Examples:

    A = [4,2,6,7,8], K = 3, the algorithm should return 18 as 4 + 6 + 8 = 18
    A = [5, 5, 2, 4, 3], K = 3, the algorithm should return 14 as 5 + 5 + 4 = 14


Last Updated : 17 Nov, 2020
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads