Data Engineer Interview Questions

Nitish C. - "All purpose cluster remains up and running for longer duration irrespective of the job hence preferred for notebooks, adhoc work whereas job cluster spins up as per the submitted job and shuts down post the completion hence preferred for production scheduled workloads as it also offers compute isolation"See full answer

Chen J. - "Leetcode 347: Heap + Hashtable Follow up question: create heap with the length of K instead of N (more time complexity but less space )"See full answer

Ritika Y. - "with my worked experienced"See full answer

Erjan G. - "i did not know ,but the answer is parquet is column-oriented, avro is row-oriented"See full answer

Relynn may silver B. - "import java.util.Arrays; import java.util.stream.Collectors; class Main { // Recursive function to print all combinations of numbers from \i\ to \n\ // having sum \n. The index\ denotes the next free slot in the output array \out\ public static void printCombinations(int i, int n, int[] out, int index) { // if the sum becomes n, print the combination if (n == 0) { System.out.println(Arrays.stream(out).limit(index) .boxed().collect(Collectors.toList())); } // start from the previous e"See full answer

Erjan G. - "i failed to answer, did not know"See full answer

Aneesh D. - "I have worked with tools such as Hadoop, Oracle, DBeaver, and Databricks. I have used these tools at work when dealing with large datasets, data cleaning, data security, and creating models"See full answer

Prashant Y. - "The height of a binary tree is the maximum number of edges from the root node to any leaf node. To calculate the height of a binary tree, we can use a recursive approach. The basic idea is to compare the heights of the left and right subtrees of the root node, and return the maximum of them plus one."See full answer

Payal B. - "My brute force approach was to read them. Give a id to each paragraph and for each token count the number of time it has appeared. If any two rows look same , it is duplicated. Further , interviewer guided me that he will do it with hashing."See full answer