SDE - 1

Given a binary tree. Print the Top View of Binary Tree. Print the nodes from left to right order.

Example:

Input:

Output: 2 35 2 10 2

You are given two strings ‘S1’ and ‘S2’. Your task is to find the smallest substring of ‘S1’ which contains all the characters of ‘S2’. The characters of ‘S2’ need not be present in the same order in S1. That is, we need a substring that contains all characters of ‘S2’ irrespective of the order.

A substring is a contiguous sequence of characters within a string.

Example

Let ‘S1’ be “ABBCD” and ‘S2’ be “ABC”, so the smallest substring of ‘S1’ which contains all the characters of S1 is “ABBA”.

Basics of DBMS and Difference b/w RDMS and NoSQL.

questions on Synchronization, Semaphore, Thread, Difference b/w Thread, and Process.

There are 5 Read and 3 Write operations performed parallelly. Write a mechanism to run them.

You have been given a Binary Tree of integers. You are supposed to return the reverse of the level order traversal.

For example:

For the given binary tree

The reverse level order traversal will be {7,6,5,4,3,2,1}.

What happens when you type the URL in your browser?

Layers in the OSI Model and the task of each layer.

Difference b/w TCP Vs UDP

What happens when you try to reach any server (explained using the Netflix example)

Framing, Flow Control, ARQ Techniques

Some basic questions from Operating System.

Introduce yourself.
Family background.
Why MakeMyTrip?