Filter interviews by
Clear (1)
I was interviewed in Dec 2024.
Asked questions from mern stack, sql database, gcp cloud
Python programming round
Use list comprehension to add corresponding elements of two arrays.
Use list comprehension to iterate over both arrays simultaneously and add corresponding elements.
Ensure both arrays are of the same length.
Example: result = [str(int(x) + int(y)) for x, y in zip(array1, array2)]
Horizontal scaling involves adding more machines to distribute load, while vertical scaling involves increasing resources on a single machine.
Horizontal scaling is more cost-effective as it allows for adding cheaper machines as needed.
Vertical scaling is limited by the capacity of a single machine and can be more expensive.
Examples of horizontal scaling include adding more servers to a web application cluster.
Examples ...
Left join includes all records from the left table and matching records from the right table, while inner join only includes matching records from both tables.
Left join returns all records from the left table and the matched records from the right table.
Inner join returns only the matched records from both tables.
Use left join when you want to include all records from the left table, regardless of whether there is a ma...
Scaling application involves optimizing performance, increasing capacity, and ensuring reliability.
Implementing load balancing to distribute traffic evenly across servers
Using caching mechanisms to reduce database load
Horizontal scaling by adding more servers to handle increased traffic
Vertical scaling by upgrading server hardware for improved performance
Top trending discussions
Api related questions
I applied via Naukri.com and was interviewed in Oct 2019. There were 3 interview rounds.
posted on 10 Mar 2024
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
posted on 20 May 2024
I applied via Campus Placement and was interviewed in Nov 2023. There were 2 interview rounds.
It consited of apti as well as coding questions
posted on 28 Aug 2023
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Held on interview bit. 3 ques were asked. Questions were from range query and DP.
posted on 16 Sep 2021
I was interviewed in Dec 2020.
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
Understand the problem statement and expected output
Review the code for syntax errors, logical errors, and potential bugs
Use debugging tools like breakpoints, print statements, and IDE debuggers
Test the code with different inputs and edge cases to identify the bug
Make necessary corrections and re
Given a Binary Tree of distinct integers and two integers, target
and K
, return a list of values of all nodes located at a distance K
from the target no...
Find nodes at distance K from target node in a Binary Tree.
Use BFS to traverse the tree and keep track of the distance of each node from the target node.
Maintain a set to keep track of visited nodes to avoid revisiting them.
Return the values of nodes at distance K from the target node.
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input beg...
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Return the length of the longest subarray found.
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
posted on 27 Oct 2021
I was interviewed in Feb 2021.
Round duration - 90 Minutes
Round difficulty - Hard
The test was at 6 pm with cam on and in fullscreen mode.
You are given three strings 'A', 'B', and 'C'. Determine if 'C' is formed by interleaving 'A' and 'B'.
String 'C' is an interleaving of 'A' and 'B' if the lengt...
The problem involves determining if a string 'C' is formed by interleaving two given strings 'A' and 'B'.
Check if the length of 'C' is equal to the sum of the lengths of 'A' and 'B'.
Verify if all characters of 'A' and 'B' exist in 'C' while maintaining their order.
Return 'True' if 'C' is an interleaving of 'A' and 'B', otherwise return 'False'.
Given two lists representing the inorder and postorder traversal of a binary tree of integer type with 'N' nodes, construct the binary tree and r...
Construct a binary tree from inorder and postorder traversal lists and return its root.
Create a map to store the indices of elements in the inorder traversal list for quick access during tree construction.
Use the postorder list to determine the root of the tree and recursively build left and right subtrees.
Construct the tree by recursively dividing the inorder list based on the root index in postorder list.
Return the r...
Round duration - 45 Minutes
Round difficulty - Easy
At 10:00 AM. Interviewer was very friendly and young but his cam was off.
Kevin has sketched a series of integers, forming a diagram that represents a binary tree. Challenged by a friend, Kevin needs to find all paths from the root to the leaf where th...
Round duration - 45 Minutes
Round difficulty - Easy
It was held at 4 p.m. The interviewer was senior compared to the one in the previous round. Also, his cam was also on, but he wasn't speaking much and neither giving any expressions.
Given a set of boxes represented by an array gainPower
, where each box has a certain power value, along with an initial power value 'power', your task is to maximize the t...
Maximize total score by selecting boxes optimally based on power values and operations.
Iterate through the boxes and perform operations based on power values and current score
Keep track of power, score, and selected boxes to maximize total score
Example: For input [3, 50, [20, 30, 40]], select boxes with power 20 and 30 to get a score of 2
Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.
Tip 1 : Keep it crisp and to the point. Make bullet points.
Tip 2 : Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3 : Only put the things you are confident about.
Tip 4 : Don't put things irrelevant to the job, it only dilutes the main content.
posted on 2 Oct 2022
I was interviewed in Sep 2022.
A weather app that provides accurate and up-to-date weather information.
Include real-time weather updates
Provide hourly and daily forecasts
Include radar and satellite maps
Allow users to set location and receive alerts for severe weather
Include a widget for quick access to weather information
based on 1 interview
Interview experience
Senior Business Analyst
217
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
128
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Strategy Manager
91
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Media Associate
32
salaries
| ₹0 L/yr - ₹0 L/yr |
Adglobal360
Interactive Avenues
WATConsult
Resultrix