SDE - Intern

Ninja has been given two baskets of apples containing ‘A’ and ‘B’ apples each. Also, he has been given extra ‘C’ apples separately.

This apple will be gifted to the Ninja’s best buddies; Ninja wants to do some partiality so that the number of apples in the first basket is strictly greater than the number of apples in the second basket.

The ninja can do it using extra ‘C’ apples, he must have to use all the extra apples and transfer them in both the first and second basket.

Your task is to help Ninja by calculating a number of possible arrangements of apples so that the resultant configuration is feasible for Ninja to do the partiality.

EXAMPLE:

Input: 'A' = 5, 'B' = 3, 'C' = 4

Output: 3

Here only three possible combinations are:

(7, 5) Transfer 2 apples to the first basket and 2 apples to the second basket.
(9, 3) Transfer 4 apples to the first basket and 0 apples to the second basket.
(8, 4) Transfer 3 apples to the first basket and 1 apple to the second basket.

Only above combinations for (A, B) satisfies the condition that all 'C'  apples are used and ('A' > 'B')

You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that node from the linked list.

A singly linked list is a linear data structure in which we can traverse only in one direction i.e. from Head to Tail. It consists of several nodes where each node contains some data and a reference to the next node.

Note:

• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.

A sample Linked List-

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.

A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).

A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.

You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.

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.

Example :

Answer :

Level 1: 

All the nodes in the left subtree of 4 (2, 1, 3) are smaller 
than 4, all the nodes in the right subtree of the 4 (5) are 
larger than 4.

Level 2 :

For node 2:
All the nodes in the left subtree of 2 (1) are smaller than 
2, all the nodes in the right subtree of the 2 (3) are larger than 2.
For node 5:
The left and right subtrees for node 5 are empty.

Level 3:

For node 1:
The left and right subtrees for node 1 are empty.
For node 3:
The left and right subtrees for node 3 are empty.

Because all the nodes follow the property of a binary search tree, the above tree is a binary search tree.

They ask me to implement interface abstraction and a number of object oriented concepts including inheritance etc .static functions and all.

Some general talks asking about my interest and what are my goals .