i
Gap
Filter interviews by
I applied via Approached by Company
I realized my passion for coding during my Chemical Engineering studies and pursued it further through self-learning and projects.
Discovered passion for coding during Chemical Engineering studies
Pursued coding through self-learning and projects
Believe software engineering offers more opportunities for growth and impact
While planning a project, I had to adjust the timeline due to unexpected delays in the delivery of hardware components.
Planned a project with a specific timeline
Ordered necessary hardware components
Delivery of hardware components was delayed
Adjusted the timeline to accommodate the delay
Ensured that the project was completed successfully despite the delay
During a team project, I adjusted my communication style to better collaborate with a team member.
I noticed that my team member preferred more frequent check-ins and updates than I was used to.
I adapted by scheduling regular meetings and sending progress updates more frequently.
This helped us work more effectively together and complete the project on time.
As a project lead, I had to coordinate with the development, testing, and design teams to ensure timely delivery of a product.
Coordinated with development team to ensure timely completion of coding tasks
Worked with testing team to ensure proper testing and bug fixing
Collaborated with design team to ensure product met client's expectations
I led a team to develop a new feature for our company's flagship product.
Identified the need for the feature through customer feedback
Convinced the team and management to prioritize the feature
Coordinated with designers, developers, and testers to deliver the feature on time
Received positive feedback from customers and increased revenue for the company
I initiated a project to automate the testing process for our team.
Identified the need for automation to save time and improve accuracy
Researched and evaluated different testing tools
Presented the proposal to the team and got their buy-in
Implemented the automation process and trained the team on its usage
Worked as part of a team in developing a mobile application.
Collaborated with team members to define project requirements
Assigned tasks and tracked progress using project management tools
Conducted code reviews and provided feedback to team members
Resolved conflicts and ensured timely delivery of project milestones
Prepared a speech for a group of high school students on the importance of computer science.
Researched the audience to understand their interests and level of knowledge
Created an engaging presentation with relatable examples
Practiced the speech multiple times to ensure smooth delivery
Encouraged questions and feedback from the audience
Provided additional resources for those interested in pursuing computer science
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
Use dynamic programming to keep track of maximum stolen money at each house.
Consider two cases: either rob the current house and skip the next, or skip the current house.
Handle circular arrangement by considering the first and last houses separately.
Example: For arr[] = {2, 3, 2}, the output is 3. Rob...
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .
You are provided with two linked lists, L1
and L2
, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
Traverse both linked lists simultaneously to find common elements
Create a new linked list to store the intersecting elements
Ensure the final linked list is sorted in ascending order
Handle cases where there are no common elements between the lists
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
Find the Kth largest element in a given list of numbers.
Sort the array in descending order.
Return the Kth element from the sorted array.
Handle multiple test cases efficiently.
Round duration - 50 Minutes
Round difficulty - Easy
This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
Use a combination of HashMap and ArrayList to achieve constant time operations.
For insert operation, add the element to the ArrayList and store its index in the HashMap.
For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accesse
Round duration - 45 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
Design a Railway Reservation System
Create a database to store train schedules, seat availability, and passenger information
Implement a user interface for users to search for trains, book tickets, and view their reservations
Include features like seat selection, payment processing, and ticket confirmation
Handle scenarios like waitlisting, cancellations, and refunds
Ensure data security and privacy of passenger information
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
Java code is compiled into bytecode, which can run on any platform with a JVM.
JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.
The JVM ...
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.
I appeared for an interview before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...
Find the minimum cost to buy a specific weight of oranges using given cost list.
Iterate through the cost list and find the minimum cost to achieve the desired weight
Keep track of the minimum cost while considering available packet weights
Return -1 if it is not possible to buy exactly W kg of oranges
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result if true.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
Burn both wires at the same time, one wire will burn faster than the other.
Measure the time it takes for the faster burning wire to completely burn.
Calculate the specific amount of time by using the ratio of the lengths of the two wires.
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
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.
Factors affecting pricing of products on e-retail website
Cost of production
Competitor pricing
Demand and supply
Target audience
Marketing and advertising costs
Vertical scrolling is the best option for e-retail websites.
Vertical scrolling is more intuitive and easier to use for most users.
Horizontal scrolling can be confusing and frustrating for users.
Each product on a different page can lead to slower load times and more clicks for users.
Infinite scrolling can be a good option for some e-retail websites.
Consider the type of products being sold and the user experience when de
My happiest moment was when I got accepted into my dream university.
Received the acceptance letter in the mail
Celebrated with family and friends
Felt a sense of accomplishment and excitement for the future
I completed internships at two different companies, one focused on web development and the other on software testing.
Interned at XYZ Company as a web developer, worked on front-end development using React and back-end development using Node.js
Interned at ABC Company as a software tester, tested various software applications and reported bugs to the development team
My strengths include problem-solving, adaptability, and teamwork. My weaknesses include public speaking and time management.
Strengths: Problem-solving - I enjoy finding solutions to complex problems. Adaptability - I am able to quickly adjust to new situations. Teamwork - I work well in a team environment and value collaboration.
Weaknesses: Public speaking - I get nervous when speaking in front of large groups. Time ma...
I enjoy playing sports, reading books, and volunteering in my community.
Playing basketball and soccer with friends
Reading books on technology and self-improvement
Volunteering at local food banks and animal shelters
I believe gaining practical experience is more valuable than pursuing further education at this point in my career.
I have gained valuable experience through internships and projects
I am constantly learning and improving my skills through online courses and workshops
I may consider pursuing further education in the future if it aligns with my career goals
I appeared for an interview before Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were of easy to medium level I would say with some lenghty implementations .
Given an array 'ARR'
consisting of N
integers, along with two integers, 'SUM'
and 'MAXVAL'
, you need to determine the minimum number of integers to be added to t...
Determine the minimum number of integers to be added to an array to make its sum equal to a given value.
Iterate through the array and calculate the current sum.
Determine the difference between the target sum and the current sum.
Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.
Given an array of integers NUMS
consisting of N
integers and an integer K
, determine the maximum sum of an increasing subsequence with exactly K
elements.
Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.
Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.
For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.
Update the dynamic programming table with the maximum sum found...
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.
You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.
A Complete Binary Tree is defined as a binary tree where ever...
Check if a binary tree is a Complete Binary Tree or not based on given criteria.
Traverse the binary tree level by level and check if all levels are completely filled except the last one.
Ensure all nodes at the last level are positioned at the leftmost side.
Use level order traversal to check for completeness of the binary tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.
Given an array arr
of N
non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
The first line of inp...
Check if an array of integers consists of consecutive numbers.
Iterate through the array and check if the absolute difference between consecutive elements is 1.
Sort the array and check if the elements are consecutive.
Use a set to store the elements and check if the size of the set is equal to the length of the array.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
Divide the range of numbers (1-100) among the threads to avoid duplication.
Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.
Consider using a shared data structure like a queue to coordinate the threads.
Implement a mechanism to signal the threads when to start and stop printing.
Views in a database management system provide data security, simplify complex queries, and improve performance.
Enhanced security by restricting access to certain columns or rows
Simplify complex queries by pre-defining joins and filters
Reduce redundancy by storing commonly used queries as views
Improve performance by storing pre-processed data in views
Allow for data abstraction, making it easier to work with complex data
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
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.
I applied via LinkedIn and was interviewed in Dec 2020. There were 4 interview rounds.
An E-Commerce system can be designed by identifying user requirements, selecting appropriate technologies, and implementing secure payment and shipping methods.
Identify user requirements and create user stories
Select appropriate technologies for front-end, back-end, and database
Implement secure payment and shipping methods
Design a user-friendly interface with easy navigation
Ensure scalability and performance of the sys...
based on 1 interview
Interview experience
based on 14 reviews
Rating in categories
Software Engineer
153
salaries
| ₹9 L/yr - ₹16.2 L/yr |
Senior Software Engineer
123
salaries
| ₹12 L/yr - ₹30 L/yr |
Staff Software Engineer
62
salaries
| ₹21.3 L/yr - ₹44.5 L/yr |
Senior System Analyst
41
salaries
| ₹12.8 L/yr - ₹21.1 L/yr |
Senior Manager
35
salaries
| ₹30 L/yr - ₹61.8 L/yr |
Reliance Retail
Walmart
Landmark Group
Lowe's