PolicyBazaar Full Stack Developer Interview Questions and Answers

Amazon pay customer service cnt number

Customer care number..

Q1. Calling" Amazon 091-53-56-47-89- Customer Care number to receive email from trustpilot about your reviews, inspection, tips about businesses and product, ...Calling" Amazon 09153.564.789 .Customer Care num...read more
Add your answer
Q2. Amazon pay customer care number
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

11:05am – 12:05pm (IST). What are classes in javascript? how do you integrate js in html.

Q1. 
Longest Substring Without Repeating Characters Problem Statement
Given a string S of length L, determine the length of the longest substring that contains no repeating characters.
Example:
Input:
"abac...read more
Add your answer
Q2. 
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...read more
Add your answer
Q3. 
Number of Islands Problem Statement
Given a non-empty grid of 0s and 1s, determine the number of distinct islands. An island is a collection of '1's (land) connected horizontally, vertically, or diagonall...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

12:30pm – 1:30pm (IST). SQL questions What are Aggregate and Scalar functions? What is a Stored Procedure?

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Add your answer
Q2. 
Container with Most Water Problem Statement
Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequence represents the height of a lin...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

5pm – 6pm (IST)

Q1. What is ambitionbox
Add your answer
Q2. How many questions are there in that
Add your answer

Q1. Same as above questions
Add your answer
Q2. Same as above questions second one
Add your answer

BFS Implementation of a jug question.

Q1. Few hashmap questions
Add your answer
Q2. Object Oriented Programming questions
Add your answer

Q1. Maximum Sum Subarray
Add your answer
Q2. Insert node in binary search tree
Ans. 
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
• Start at the root node and compare the value of the node to be inserted with the current node.

• If the value is less than the current node, move to the left child node. If it is greater, move to the right child node.

• Repeat this process until reaching a leaf node, then insert ...read more
Answered by AI
Add your answer

DSA Problem statement of Trie

Q1. About yourself hobbies
Add your answer