Filter interviews by
posted on 13 Sep 2015
I am a highly motivated and experienced professional with a strong background in project management and team leadership.
Experienced project manager
Skilled in team leadership
Motivated and dedicated
Strong organizational and communication skills
No, I don't mind being posted out of Bombay.
I am open to being posted in different locations.
I believe in embracing new opportunities and experiences.
I have a flexible mindset and can adapt to different environments.
I am willing to explore new cities and cultures.
I understand that professional growth often requires relocation.
In 10 years, I see myself as a successful entrepreneur, running my own business and making a positive impact in the industry.
Running my own successful business
Making a positive impact in the industry
Continuously learning and growing professionally
Building a strong network of industry professionals
Taking on leadership roles and mentoring others
I applied via Company Website and was interviewed in Jun 2022. There were 2 interview rounds.
Thomas Edison is credited with inventing the bulb.
Thomas Edison is widely recognized as the inventor of the bulb.
He developed the first practical incandescent light bulb in 1879.
Edison's bulb used a carbon filament and was able to last for longer periods of time.
His invention revolutionized the way we illuminate our surroundings.
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedI applied via Naukri.com
I am a highly motivated and organized individual with a passion for leadership and team building.
I have several years of experience in management roles, including overseeing teams of up to 20 employees.
I am skilled in project management, budgeting, and strategic planning.
I have a proven track record of improving team performance and achieving business goals.
I am a strong communicator and enjoy collaborating with others...
As a member of FSAE club, I designed and built a formula-style race car for competition.
Designed and fabricated various components of the car, including the chassis, suspension, and steering system
Collaborated with team members to optimize the car's performance and ensure compliance with competition rules
Participated in testing and tuning sessions to improve the car's speed and handling
Managed the team's budget and res...
Stress strain curve for ductile material
Ductile materials can undergo large plastic deformations before failure
Stress strain curve shows the relationship between stress and strain during deformation
The curve has three regions: elastic, plastic, and necking
Elastic region: linear relationship between stress and strain
Plastic region: non-linear relationship between stress and strain
Necking region: localized reduction in c...
Piston rings are essential components in an engine that prevent oil from entering the combustion chamber and help maintain compression.
Piston rings create a seal between the piston and cylinder wall
They prevent oil from entering the combustion chamber
They help maintain compression by preventing gases from escaping
Piston rings also help dissipate heat from the piston
Without piston rings, the engine would lose power and
I chose to gain practical experience and develop my skills in the industry.
I wanted to gain practical experience in the industry
I believed that hands-on experience would be more valuable than a Masters degree
I wanted to develop my skills in a real-world setting
I felt that pursuing a Masters degree at this time would not align with my career goals
I have taken courses and attended workshops to continue my education and s
I have strong leadership, communication, and problem-solving skills that can benefit the company.
Leadership skills to motivate and guide team members towards achieving goals
Effective communication skills to ensure clear understanding and collaboration among team members and with customers
Strong problem-solving skills to identify and resolve issues efficiently and effectively
Experience in managing budgets, schedules, an...
The spring stiffness depends on various factors.
The material of the spring
The thickness of the wire used in the spring
The number of coils in the spring
The diameter of the spring
The length of the spring
The type of loading on the spring
The temperature of the spring
The presence of any pre-stress in the spring
I was involved in various non-technical works in FSAE club.
Organizing and managing team meetings
Coordinating with sponsors and arranging sponsorships
Planning and executing fundraising events
Recruiting new members and conducting interviews
Managing team budget and expenses
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
Software Engineer
6
salaries
| ₹15 L/yr - ₹94 L/yr |
Software Developer
4
salaries
| ₹8.6 L/yr - ₹26.6 L/yr |
Accountant
4
salaries
| ₹1 L/yr - ₹4.6 L/yr |
Director
4
salaries
| ₹46 L/yr - ₹200 L/yr |
Manager
3
salaries
| ₹13.7 L/yr - ₹35.7 L/yr |
Amazon
Larsen & Toubro Limited
Mahindra & Mahindra
Delhivery