1. How do you handle angry customers?
2. Pair with Given Sum in a Balanced BST Problem Statement You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target’. Your task is to determine if there exists any pair of nodes such that the sum of their values equals the target. Specifically, check if any two distinct nodes have a sum equal to ‘target’. Example: Input: ROOT = 5 2 6 -1 -1 -1 -1, target = 8 Output: true Explanation: Here, the nodes with values 2 and 6 sum to 8. Constraints: 1 <= T <= 10 1 <= N <= 1000 0 <= data <= 10^3 0 <= target <= 10^3 Time Limit: 1 sec Input: The first line of input contains a single integer ‘T’, representing the number of test cases. Each test case includes: 1. the elements in level order, with `-1` indicating a null node,2. a line with a single integer ‘target’ denoting the target sum. Output: Output a single line per test case, indicating 'true' or 'false' if a pair exists. Note: Implement the function without handling input/output—they are managed for you.
3. How do you find the median using a min-heap data structure in a stream of numbers?
4. Largest BST Subtree Problem Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree). Input: The first line contains an integer 'T', representing the number of test cases.For each test case, the first line contains space-separated integers representing the tree's level order traversal. Use '-1' to represent a null node.Example input for a tree: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Output: For each test case, output a single integer: the size of the largest BST subtree within the binary tree. Example: Input: 11 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Output: 3 Constraints: 1 ≤ T ≤ 100 1 ≤ N ≤ 5000 1 ≤ data ≤ 105 and data ≠ -1 Time Limit: 1 second Note: The level order traversal format for input assumes '-1' is used for missing children in the binary tree representation.
5. What is the best authorization type to select when integrating Salesforce with Postman?
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.
Instantly access job listings, apply easily, and track applications.
