Five Leetcode questions: Round-1: 1. Find the depth of a binary tree. 2. Implement a stack with push, pop, top and getMin() functions in constant time. 3. Check if two strings are anagrams or not. Very optimal solutions required instead of brute-force. Round-2: 1. Partition Lables 2. Maximum value between two nodes in a binary search tree.
I was asked one question about my resume, even though the interviewer told me we were going to 'review' it together.
Behavioral question was strange: If the world was going to end tomorrow and you only had a day to build a computer that would save the world, which two people would you choose and why?
Return if 2 elements in an array sum up to a given number.
Find distance between two nodes in a binary search tree.
In the 20 minute debugging test I just had to find logical errors in sections of code they gave
1) Data warehousing basics 2) Python coding - intermediate level 3) 2 SQL questions - group by, RANK() types 4) Resume drill down 5) Tell me about a time you helped a teammate? 6) Hardest data pipeline you have worked on? 7) Difference between STAR, SNOWFLAKE and GALAXY schema 8) SCD and types 9) A recent ETL process you have worked on and challenges you faced in it
Cloning a binary tree with a random pointer. Distribution of coins - Leetcode Max sum of coins without exempting side by side coins.
Construct a LRU cache class with get and put methods.
First round - code debugging, 2 coding problems, reasoning questions.
Viewing 1611 - 1620 interview questions