SDE - 1

Write a query that prints a list of employee names (i.e.: the name attribute) for employees in Employee having a salary greater than $2000 per month who have been employees for less than 6 months. Sort your result by ascending employee_id.
 

Given a Problem Statement and a Code we need to find the bug in the code and correct the given code.

You have been given a Binary Tree of distinct integers and two integers “target” and ‘K’. You are supposed to return the list of values of all the nodes which are situated at ‘K’ distance from the target node.

Distance between two nodes ‘u’ and ‘v’ is defined as the number of edges in the shortest path from ‘u’ to ‘v’.

Note :

You may assume that the given target node definitely exists in the given binary tree.

For example :

For the given binary tree

Nodes in the above binary tree that has K = 2 distance from the target node are highlighted in yellow colour.

You are given an array consisting of 0s and 1s. You need to find the length of the largest subarray with an equal number of 0s and 1s.

For example:

If the given array is: [0, 0, 1, 0, 1] The largest subarray would be: [0, 1, 0, 1] (last 4 elements) having length 4.

What is TLB? Why is it used? What are huge pages and their advantages? Which is accessed first TLB or cache? Can we access TLB and cache in parallel?

How are system calls made at assembly level? How are IO operations like cout translated at low level?

Discussion about how the file system is stored on disk and how ls works.

Distinguish between RISC and CISC architectures.

What is the difference between hard work and smart work? 

How do you feel about working weekends and night shifts?

Why should we hire you?

Where do you see yourself in  3 years?