Filter interviews by
Be the first one to contribute and help others!
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 9 Dec 2024
The Two Sum problem involves finding two numbers in an array that add up to a given target value.
Iterate through the array and store the difference between the target and current element in a hashmap
Check if the current element exists in the hashmap, if yes return the indices
Time complexity can be reduced to O(n) using a hashmap
Reverse a singly linked list and return the reversed list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the list.
Update the head of the list to be the last node after reversing.
Find the longest palindromic substring in a given string.
Iterate through each character in the string and expand around it to find palindromes
Use dynamic programming to optimize the solution
Consider both odd and even length palindromes
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
Duration-60min, topics covered- financial literacy, logical thinking, reasoning and General awareness
EBIT is earnings before interest and taxes, while EBITDA is earnings before interest, taxes, depreciation, and amortization.
EBIT excludes depreciation and amortization expenses, while EBITDA includes them.
EBITDA provides a clearer picture of a company's operating performance by removing the impact of non-operating expenses.
EBIT is commonly used to analyze profitability, while EBITDA is often used to assess a company's ...
A 10% decrease in depreciation would result in higher net income and retained earnings on the financial statements.
Net income would increase as depreciation expense is lower, leading to higher profits.
Retained earnings would also increase as net income contributes to this account.
The company's assets would appear higher on the balance sheet due to lower accumulated depreciation.
Investors may view the company more favor...
I applied via Campus Placement and was interviewed in Oct 2022. There were 2 interview rounds.
Company asked to choose three subjects from total six and set a 10 MCQ questions for each of the subject and 10 questions for aptitude.
Natural Language Processing
Developing chatbots using NLP techniques
Sentiment analysis of customer reviews
Text classification for news articles
Named entity recognition for medical records
I applied via Campus Placement and was interviewed in May 2024. There was 1 interview round.
I was interviewed in Nov 2022.
Strong appitude knowledge is required.
SQL statements are used to interact with databases by performing operations like querying, updating, and deleting data.
SQL statements are made up of keywords like SELECT, INSERT, UPDATE, DELETE, etc.
They are structured in a specific order, with clauses like WHERE, ORDER BY, GROUP BY, etc.
Tables are referenced using their names, and conditions are specified to filter data.
Joins can be used to combine data from multiple
I applied via Job Portal and was interviewed in Jan 2023. There were 3 interview rounds.
I applied via Company Website and was interviewed in Feb 2022. There were 2 interview rounds.
posted on 15 Mar 2022
I applied via Company Website and was interviewed in Feb 2022. There were 2 interview rounds.
I am open to discussing salary based on the responsibilities and opportunities offered by the position.
I am flexible and open to negotiation.
I am more interested in the overall package and growth opportunities than just the salary.
I would like to be compensated fairly based on my skills, experience, and the market value for the position.
I am confident that we can come to a mutually beneficial agreement.
My family background is diverse and has influenced my values and work ethic.
My parents come from different cultural backgrounds, which has exposed me to different perspectives and traditions.
My father is an engineer and my mother is a teacher, which has instilled in me a passion for both problem-solving and education.
I have a sibling who is also in the software development field, which has provided me with a supportive...
I have a strong technical background and a passion for software development.
I have a deep understanding of programming languages and frameworks.
I have experience in developing and delivering high-quality software solutions.
I am a quick learner and adapt easily to new technologies and methodologies.
I am a team player and can effectively collaborate with cross-functional teams.
I have excellent problem-solving and analyti...
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
Strengths: problem-solving, attention to detail, teamwork
Weaknesses: time management, public speaking
I am a software developer with experience in developing web applications using various programming languages and frameworks.
Proficient in Java, Python, and JavaScript
Experience with front-end development using HTML, CSS, and React
Familiar with Agile development methodologies
Strong problem-solving and analytical skills
Worked on a team to develop a customer relationship management system for a large e-commerce company
Executive Accountant
6
salaries
| ₹0 L/yr - ₹0 L/yr |
CAD Engg
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Civil Site Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Site Supervisor
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Cadd Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Primus Global Technologies
GAMMON INDIA
Educomp Solutions
Magneti Marelli Motherson Auto System