SDE - 1

You are given an array of 'N' elements. In this given array, each element appears an even number of times except one element which appears odd no. of times. Your task is to find the element which occurs an odd number of times.

For example :

Input array [5,5,6,4,6],If we look at the frequency of different elements in this array.We can see,4 appears an odd number of times, so our answer will be 4.

You are given an N-ary tree where every node has at most ‘N’ child nodes. You need to find the level order traversal of this tree

Note:

Note that the level order traversal must not contain any null values, simply return the tree in level order.

You are given three rods (numbered 1 to 3), and ‘N’ disks initially placed on the first rod, one on top of each other in increasing order of size ( the largest disk is at the bottom). You are supposed to move the ‘N’ disks to another rod(either rod 2 or rod 3) using the following rules and in less than 2 ^ (N) moves.

1. You can only move one disk in one move. 
2. You can not place a larger disk on top of a smaller disk.
3. You can only move the disk at the top of any rod.    

Note :

You may assume that initially, the size of the ‘i’th disk from the top of the stack is equal to ‘i’, i.e. the disk at the bottom has size ‘N’, the disk above that has size ‘N - 1’, and so on. The disk at the top has size 1.

Example :

There are 3 ants sitting at the three different corners of an equilateral triangle. Now each ant randomly picks a direction and starts moving along the edge of the triangle. What is the probability that none of the ants collide with each other?

Architecture of DBMS,What is Normalization, Lossy decomposition.Acid Properties,Find Nth highest salary of Employee.

Given a BST (Binary search tree) with N number of distinct nodes and two nodes ‘X’ and ‘Y’ (which are definitely present in the input BST). You need to find the value of the maximum node that lies in between the nodes ‘X’ and ‘Y’ (both inclusive) in the given BST.

A binary search tree (BST) is a binary tree data structure which has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.

Note:

1. All the elements of the Binary Search Tree are unique.

2. You can’t use the same node value/element of BST twice.

Where you will see yourself in 5 years, what you know about this company, why you want to Join. Strenth and Weakness.