Can't disclose but 2 LC medium problems.
Engineer Ii Interview Questions
9,767 engineer ii interview questions shared by candidates
Basic DS questions: LRU cache, trees, count the islands.
1.SQL: **d_customers** +-------------+-----------------------+---------------------+ | customer_id | membership_start_date | membership_end_date | +-------------+-----------------------+---------------------+ | 114 | 2015-01-01 | 2015-02-15 | | 116 | 2015-02-01 | 2015-03-15 | | 120 | 2015-02-15 | 2015-04-01 | | 221 | 2015-03-15 | 2015-10-01 | | 120 | 2015-05-15 | 2015-07-01 | +-------------+-----------------------+---------------------+ **d_shipments** +-------------+------------+-----------------------+----------+ | shipment_id | ship_date | receiving_customer_id | quantity | +-------------+------------+-----------------------+----------+ | 1 | 2015-02-13 | 114 | 2 | | 2 | 2015-03-01 | 116 | 4 | | 2 | 2015-03-01 | 116 | 1 | | 3 | 2015-06-01 | 116 | 1 | | 4 | 2015-03-01 | 120 | 6 | | 5 | 2015-10-01 | 120 | 3 | | 6 | 2015-03-01 | 321 | 10 | +-------------+------------+-----------------------+----------+ Populate **a_shipments** +-----------+-----------+----------+----------+----------+ | ship_date | customer_id | is_member | quantity | +-----------+-----------+----------+----------+----------+ the column [is_member]: if [ship_date] is between [membership_start_date] and [membership_end_date] then 'y', else 'N' sample of otput: 2015-03-01 | 116 | Y | 5 | 2015-06-01 | 116 | N | 1 | 2. Coding task. Check whether a string is palindrome. I have been asked to code a solution by iterative and recursive approach. 3. Big Data questions: 3.1. What format of files in Hadoop do I know? What is a difference between Avro and Parquet format? 3.2. How compression is used in Avro and Parquet formats? 3.3. Most difficult big data performance challenges you have faced and resolved? 3.4. Spark optimization. Spark cost based optimizer
Design Questions and Leadership principles
Write a function to find number that occur odd times in input array
K most frequent integers from array of integers.
1. Design an ordering system.
The most difficult question was to find the maximum contiguous subsequence in a bar chart. I was able to find a solution in O(N^3) which is basically the brute force method The idea is that given a bar chart with peaks and valley's, you should find the subsequence X which gives you the maximum area underneath the chart. For the life of me I couldn't think of the answer at the time, , I had a hard time visualizing it, however it's a classical computer science problem called "the maximum sum contiguous subsequence problem."
There is no unexcepted question
The best way to prepare is to go to topcoder and practice a bunch of the questions there. They asked a question about infrastructure. They had me describe my companies infrastructure, and then grilled me on how to adapt it to AWS. Make sure you have at least some knowledge of all of AWS's systems.
Viewing 9241 - 9250 interview questions