Filter interviews by
I appeared for an interview in Jun 2021.
Top trending discussions
I applied via Naukri.com and was interviewed in Oct 2019. There were 3 interview rounds.
A program to convert numbers into their English word representation, handling numbers from 1 to infinity.
Use a recursive function to break down numbers into manageable parts.
Handle special cases for numbers like 11-19 (e.g., eleven, twelve).
Use arrays or dictionaries to map numbers to words for efficiency.
Example: 1543 is broken down into 1000 + 500 + 40 + 3, resulting in 'one thousand five hundred forty three'.
posted on 27 Oct 2021
I appeared for an interview 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...
Find all root-to-leaf paths in a binary tree that sum to a given number K.
Use Depth-First Search (DFS) to traverse the tree.
Keep track of the current path and its sum as you traverse.
When a leaf node is reached, check if the sum equals K.
If it does, store the path as a valid result.
Example: For tree [5, 6, 4] and K=15, path [5, 6, 4] is valid.
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.
Reasoning and logic base qus
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Simple SQL questions
I appeared for an interview before May 2024, where I was asked the following questions.
I am a detail-oriented Business Analyst with a strong background in data analysis and project management, passionate about driving business success.
Over 5 years of experience in business analysis across various industries, including finance and healthcare.
Skilled in gathering and documenting requirements through stakeholder interviews and workshops.
Proficient in data visualization tools like Tableau and Power BI to pre...
As a Business Analyst, I prioritize stakeholder communication and data analysis to drive project success.
Engage stakeholders through regular meetings to gather requirements.
Utilize data visualization tools to present findings effectively.
Conduct SWOT analysis to identify project strengths and weaknesses.
Example: Collaborated with marketing to analyze customer feedback, leading to a 20% increase in satisfaction.
Indexing in MySQL is a technique to improve the performance of database queries by creating a data structure that allows for faster data retrieval.
Indexes are created on one or more columns of a table.
They help in speeding up the search, sorting, and joining of data.
Indexes can be created using different algorithms like B-tree, hash, or bitmap.
Using indexes appropriately can significantly enhance query performance.
Exam...
Object-oriented programming concepts in PHP
Encapsulation: bundling data and methods together in a class
Inheritance: creating new classes based on existing ones
Polymorphism: using a single interface to represent different types
Abstraction: hiding unnecessary details and exposing only essential features
Class: blueprint for creating objects
Object: instance of a class
Method: function defined inside a class
Property: variabl...
I applied via Naukri.com and was interviewed before Jun 2022. There were 3 interview rounds.
They gave me case study in interview based on that I had provide the solution.
based on 5 reviews
Rating in categories
Senior Software Engineer
403
salaries
| ₹17.2 L/yr - ₹31 L/yr |
Software Engineer2
199
salaries
| ₹10.2 L/yr - ₹18 L/yr |
Senior Developer
176
salaries
| ₹13 L/yr - ₹22 L/yr |
Software Engineer
168
salaries
| ₹7.7 L/yr - ₹13.9 L/yr |
Lead Software Engineer
156
salaries
| ₹24.9 L/yr - ₹40.1 L/yr |
R.R. Donnelley
Smollan Group
ChannelPlay
Affinity Express