SDE - 1

Design Bowling alley game.

The system will keep track of players' scores throughout the game and display them, and a winner will be announced at the conclusion.
The same is true for playing different games simultaneously on different free lanes.
Observe these guidelines:

There are ten sets in a game.

The player has two chances to knock down ten pins in each set.

The entire number of pins knocked down, plus any additional points earned for strikes and spares, make up a set's score.

When a player knocks down all ten pins in two attempts, they have a spare.

The player receives 5 extra points if there are any spares.

A strike occurs when a player successfully knocks all 10 pins down on the first try.

Upon a strike, the player receives 10 bonus points

A player who rolls a spare or a strike in the last set may roll the additional balls to finish the set. In the last set, however, only a maximum of three balls may be rolled.

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

For example:

For the given binary tree

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

Given a sorted array of keys of BST and an array of frequency counts of each key in the same order as in the given inorder traversal. The frequency of an element is the number of searches made to that element. Construct a binary search tree from the given keys such that the total cost of all the searches is minimum.

Cost of searching a key is its frequency multiplied by its level number in the BST.

A binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

For example:

Input keys = [ 1, 3, 5 ] 
Frequency = [ 3, 10, 7 ] 

All the unique BST possible from the given keys are: 

Among all these possible BST, the minimum cost is obtained from the below BST: 

Cost = 1 * (freq of 3) + 2 * (freq of 1) + 2 * (freq of 5) = 30 
where 1 is the level of node 3, 2 is the level of the node 1 and node 5. 

Discussion about current projects.

What is my expectations from the company?