Cerebry Interview Questions and Answers

Coding teat about to integrate some third party api

Q1. Management related questions
Add your answer

Generic leetcode easy question

Generic leetcode easy/medium question

Q1. Leetcode medium/hard question
Add your answer

Q1. Check if a pair exists with given sum in given array.
Ans. 
Check if a pair exists with given sum in given array.
• Iterate through the array and for each element, check if the difference between the given sum and the current element exists in the array.

• Use a hash table to store the elements of the array and their indices for faster lookup.

• If the sum is even, check for pairs of equal values that add up to half the sum.

• If the array is sorted, use two pointers to traverse the array
Answered by AI
Add your answer
Q2. Binary tree maximum path sum.
Ans. 
Find the maximum sum of a path in a binary tree.
• Traverse the tree recursively and calculate the maximum sum of left and right subtrees.

• Update the maximum sum if the current node value + left subtree sum + right subtree sum is greater.

• Return the maximum sum found.

• Consider negative values in the tree as well.
Answered by AI
Add your answer