Tip 1 : 1 Programming Language Tip 2 : Practice Data Structures with atleast 300 ques. Tip 3 : CS Fundamental
Application process
Where: Campus
Eligibility: No backlogs
Resume tip
Tip 1 : 1 Pager Tip 2 : Add top 3 projects in Resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date16 Sep 2020
Problems2
Subtree of Another Tree
Given two binary trees T and S, check whether tree S has exactly the same structure and node values with a subtree of T, i.e., check if tree S is a subtree of the tree T.
You are given a binary search tree and an integer ‘S’. Your task is to find all the pairs of nodes in the BST which sum to the value ‘S’. If no such pair exists, then print -1 - 1.