Customer Experience

You have been given a Binary Search Tree (BST) of integer values and 2 integers 'LOW' and 'HIGH' denoting range ['LOW', 'HIGH'].

Your task is to return the count of nodes where all the nodes under that node (or subtree rooted with that node) lie in the given range.

A binary search tree (BST) is a binary tree data structure with 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:

Consider the following binary search tree. Suppose the given range is [ 15, 32 ] so we return ‘2’ as an answer as there are two nodes whose subtree is in the given range, the nodes are 20 and 30.

You should have knowledge related to switching ,routing , IP ,mac , osi layer

First problem was related to data sciences more related to security part face recognition.

Second problem is related to coal mining traffic and iot.

You are given an array consisting of 'N' integers. You have to find the fourth largest element present in the array.

If there is no such number present in the array, then print the minimum value of an integer which is -2147483648.

Follow Up:

Try solving this problem in O(N) time complexity.

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.

Example:-

The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

Discussion about Project.

Previous internship experiences.

Why should we hire you?

Why do you want to join us?