AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Carwale Interview Questions and Answers
66 Interview questions
To find the right view of a binary tree, we need to traverse the tree and keep track of the rightmost node at each level.
Traverse the tree using level order traversal
At each level, keep track of the rightmost node
Add the rightmost node to the result array
Return the result array
Find two missing numbers from an unsorted array in O(n) time complexity.
Calculate the sum of all numbers from 1 to n using the formula n*(n+1)/2
Calculate the sum of all numbers in the given array
Subtract the sum of array from the sum of all numbers to get the sum of missing numbers
Use the sum of missing numbers and the sum of squares of all numbers from 1 to n to calculate the missing numbers using simultaneous eq...
Implement max() function to find the maximum element in a stack with optimized time and space complexity.
Use an additional stack to keep track of the maximum element at each step.
When pushing an element onto the stack, compare it with the top element of the maximum stack and push the larger one.
When popping an element from the stack, also pop the top element from the maximum stack if they are equal.
The top element...
Stacks are a data structure that follows the Last-In-First-Out (LIFO) principle.
Stacks have two main operations: push (adds an element to the top) and pop (removes the top element).
Stacks can be implemented using arrays or linked lists.
Common applications of stacks include function call stack, undo/redo operations, and expression evaluation.
Example: A stack of books, where the last book placed is the first one to ...
The sum of even numbers in the Fibonacci series is calculated.
Generate the Fibonacci series up to a given limit
Iterate through the series and check if each number is even
If the number is even, add it to the sum
Return the sum of the even numbers
Print Fibonacci series less than or equal to 1000.
Start with two variables, a and b, initialized to 0 and 1 respectively.
Print a and update a to the value of b, and b to the sum of the previous a and b.
Repeat until a exceeds 1000.
An abstract class is a class that cannot be instantiated and is meant to be subclassed.
An abstract class can have both abstract and non-abstract methods.
It can provide a common interface for its subclasses.
Subclasses of an abstract class must implement all the abstract methods.
Abstract classes can have constructors.
An abstract class cannot be instantiated directly, but its subclasses can be.
Check if given tree is BST or not
A binary tree is a BST if the value of each node is greater than all the values in its left subtree and less than all the values in its right subtree
Perform an in-order traversal of the tree and check if the values are in ascending order
Alternatively, for each node, check if its value is within the range defined by its left and right subtrees
Delete nodes in linkedlist with greater value on right side
Traverse the linked list from right to left
Compare each node with the maximum value seen so far
If the current node has a greater value, delete it
Update the maximum value seen so far
Runtime polymorphism is when the method to be executed is determined at runtime, while compile-time polymorphism is determined at compile-time.
Runtime polymorphism is achieved through method overriding.
Compile-time polymorphism is achieved through method overloading.
Runtime polymorphism is also known as dynamic polymorphism.
Compile-time polymorphism is also known as static polymorphism.
Runtime polymorphism is asso...
Carwale Interview Experiences
43 interviews found
Anonymous
Selected
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
Array , String, stack , queue - Basic Easy to medium level
(2 Questions)
- Q1. What happen when we visit Url
- Ans.
When we visit a URL, the browser sends a request to the server hosting the website, which then responds with the requested web page.
Browser sends a request to the server hosting the website
Server processes the request and responds with the requested web page
Web page is displayed in the browser for the user to interact with
- Q2. Difference B/w Http and https
- Ans.
HTTP is a protocol used for transferring data over the internet, while HTTPS is a secure version of HTTP that encrypts data.
HTTP stands for Hypertext Transfer Protocol, used for transmitting data over the internet.
HTTPS stands for Hypertext Transfer Protocol Secure, which adds a layer of security by encrypting data.
HTTP operates on port 80, while HTTPS operates on port 443.
HTTPS uses SSL/TLS certificates to establish a...
(2 Questions)
- Q1. Journey through school life till now
- Ans.
I have always been a dedicated student, excelling in academics and extracurricular activities.
Consistently achieved top grades in all subjects
Participated in various school competitions and won awards
Served as a class representative and organized events
Took part in sports teams and cultural activities
- Q2. Tell everything and also mention achievement you received
Interview Preparation Tips
Skills evaluated in this interview
Selected
I applied via Campus Placement and was interviewed in Jul 2024. There were 4 interview rounds.
4 questions on codebyte platform
1 easy combination sum
2. medium spiral traversal
3. medium question based on backtracking
4. medium to hard question based on anagrams
(1 Question)
- Q1. Find element in rotated sorted array
- Ans.
Use binary search to find the target element in a rotated sorted array.
Perform binary search to find the pivot element where the array is rotated.
Based on the pivot element, determine which half of the array to search for the target element.
Continue binary search in the appropriate half of the array to find the target element.
(1 Question)
- Q1. In depth questions on core concepts, system design questions, resume deep dive
(1 Question)
- Q1. Tech+HR questions
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement
90 mins, easy, Data structures and algorithm basics
(1 Question)
- Q1. Given an array, remove all duplicates in place
- Ans.
Remove duplicates from array of strings in place
Use a HashSet to keep track of unique elements
Iterate through the array and remove duplicates by checking if element is already in the HashSet
Update the array in place by shifting elements to fill in the removed duplicates
(1 Question)
- Q1. Caching and its uses
- Ans.
Caching is the process of storing data in a temporary location to reduce access time and improve performance.
Caching helps reduce the load on servers by serving frequently accessed data quickly
It can improve performance by reducing the time needed to retrieve data from the original source
Examples include browser caching, CDN caching, and database caching
(1 Question)
- Q1. Personality grading
Skills evaluated in this interview
I appeared for an interview in Dec 2024, where I was asked the following questions.
- Q1. Regarding the API structure and difference between post and put? ?client id secret key working for authentication.
- Q2. Difference between streams and for loop, Java coding optimization
- Ans.
Streams provide a functional approach to processing collections, while for loops offer imperative control over iteration.
Streams support functional programming, allowing operations like map, filter, and reduce.
For loops provide more control over iteration, including index manipulation.
Example of stream: List<String> names = Arrays.asList('Alice', 'Bob'); names.stream().filter(n -> n.startsWith('A')).forEach(Sy...
2 hours coding round, only 1 person out of 90 cleared
(1 Question)
- Q1. Asked loads of dsa, super technical questions
Selected
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
(2 Questions)
- Q1. Experience and field Knowledge
- Q2. Roles and responsibilities
Interview Preparation Tips
4 dsa questions were asked in online coding round.
DSA question asked in the coding test.
I appeared for an interview in Nov 2024, where I was asked the following questions.
- Q1. 1 Cultural fit round.
- Q2. System Design Quesitons.
Selected
I applied via Campus Placement and was interviewed in Jul 2023. There were 4 interview rounds.
There were 4 questions, CoderByte was the platform used.
1st: Hard: Array: Search GFG for "Maximum size rectangle binary sub-array with all 1s"
2nd: Medium: Search: Longest Palindrome Substring
3rd: Easy: String: Search LEET for "Largest Substring between two equal characters." There was one more condition - the substring should have unique characters.
4th: Easy: String: Given a string, of characters, If "M" is encountered, remove "M" and duplicate the last small case letter. If "N" is encountered, remove "N" and discard the next character.
(3 Questions)
- Q1. This round was supposed to be based on DSA. What is Time Complexity? Give examples.
- Ans.
Time complexity measures the amount of time an algorithm takes to complete as a function of the input size.
Time complexity is expressed using Big O notation (e.g., O(n), O(log n)).
O(1) - Constant time: Example - Accessing an element in an array by index.
O(n) - Linear time: Example - Finding an element in an unsorted array.
O(n^2) - Quadratic time: Example - Bubble sort algorithm.
O(log n) - Logarithmic time: Example - Bi...
- Q2. What will be the time complexity to add an element to the Singly Linked List? Note* there are 2 types to add an element: 1st: to add at the end using Tail pointer so O(1) 2nd: to add anywhere in the middle...
- Ans.
Time complexity to add an element to a Singly Linked List is O(1) if added at the end using Tail pointer, and O(n) if added anywhere in the middle.
Adding an element at the end of a Singly Linked List using the Tail pointer is a constant time operation, hence O(1).
Adding an element anywhere in the middle of a Singly Linked List requires traversing the list to find the insertion point, resulting in a time complexity of O...
- Q3. Given an array of numbers, find the smallest Prime Number. I had to write down the whole code.
- Ans.
Find the smallest prime number in a given array of numbers.
A prime number is greater than 1 and has no divisors other than 1 and itself.
Example: In the array [4, 6, 8, 3, 5], the smallest prime is 3.
To find the smallest prime, iterate through the array and check each number for primality.
Use a helper function to determine if a number is prime.
(4 Questions)
- Q1. This round was supposed to be System Designs. Asked me about my Web Projects. I Implemented roles. So, how did manage my DB side? How did I give access to certain roles? How to optimize my DB? If I were ...
- Q2. Database Designs. They asked me to draw some schema from my project, related to the above questions. Optimize it. They asked me what are Indexes. Query to be returned in O(n). So how will you do this?
- Q3. React What's the difference between using NextJs and ReactJs? Routing in NextJs. VDOM? Event Listeners. Some Hooks in NextJs.
- Ans.
NextJs is a framework built on top of ReactJs, providing server-side rendering and other features for easier development.
NextJs is a framework built on top of ReactJs, providing server-side rendering, routing, and other features for easier development.
ReactJs is a JavaScript library for building user interfaces, while NextJs is a framework that adds functionality like server-side rendering and routing to React applicat...
- Q4. JSON How to optimize JSON? Wrote a Py code to convert optimized JSON into normal JSON. An alternative method of storing JSON data in another DS
- Ans.
Optimizing JSON involves minimizing redundant data, using efficient data structures, and compressing data when necessary.
Minimize redundant data by using references or IDs instead of repeating the same information multiple times.
Use efficient data structures like arrays or dictionaries to store JSON data in a more organized and accessible way.
Compress JSON data using techniques like gzip or deflate to reduce file size ...
(7 Questions)
- Q1. Tell me about yourself.
- Q2. Technical Qualities. Professional Qualities.
- Q3. Some negative points about it
- Ans.
Full Stack Web Development has its challenges, including complexity, skill breadth, and project management issues.
Complexity: Managing both front-end and back-end can be overwhelming, leading to potential burnout.
Skill Breadth: Requires knowledge of multiple technologies (e.g., React, Node.js), making it hard to master any single one.
Project Management: Balancing tasks across the stack can lead to miscommunication and ...
- Q4. Personal and Family Background.
- Q5. Academic history. Achievements and Lows during Primary and Secondary school.
- Q6. Plan for Higher studies. I said Yes. It is generally said to tell NO even if you have plans. But considering my prior responses they selected me.
- Q7. Commuting to work by train?
- Ans.
Yes, I prefer commuting to work by train for its reliability and eco-friendliness.
I find commuting by train to be more reliable than other modes of transportation, as it is not affected by traffic congestion.
Taking the train is also more eco-friendly compared to driving a car, as it reduces carbon emissions.
Commuting by train allows me to relax, read, or work during the journey, making it a productive use of time.
Interview Preparation Tips
For Technical 1, DSA is a must, know your basics. While optimizing a particular problem, try to use Hashmap.
For Technical 2, Know your project very well, If you have not contributed to your project, and if you are not eager to learn about it, then you are doomed for rejection. So learn about it.
And you always know that there is a certain part of the project which you could have designed well, So study about it, because they will ask you to optimize it.
For HR, be true and honest about yourself.
Skills evaluated in this interview
Top trending discussions
Carwale Interview FAQs
Some of the top questions asked at the Carwale interview -
The duration of Carwale interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Carwale Interviews By Designations
- Carwale Accounts Manager Interview Questions
- Carwale Software Developer Interview Questions
- Carwale SDE (Software Development Engineer) Interview Questions
- Carwale Software Engineer Interview Questions
- Carwale Full Stack Developer Interview Questions
- Carwale Front end Developer Interview Questions
- Carwale Associate Engineer Interview Questions
- Carwale Operations Executive Interview Questions
- Show more
Interview Questions for Popular Designations
- Accounts Manager Interview Questions
- Software Developer Interview Questions
- SDE (Software Development Engineer) Interview Questions
- Associate Interview Questions
- Executive Interview Questions
- Sales Executive Interview Questions
- Graduate Engineer Trainee (Get) Interview Questions
- Associate Software Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 29 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Carwale Reviews and Ratings
based on 170 reviews
Rating in categories
2-5 Yrs
₹ 3.4-7.2 LPA
4-6 Yrs
₹ 3-7.3 LPA
3-6 Yrs
₹ 2.1-39 LPA
|
Accounts Manager
141
salaries
|  ₹3 L/yr - ₹5.2 L/yr |
|
Key Account Manager
97
salaries
| ₹3.3 L/yr - ₹7.3 L/yr |
|
Regional Manager
35
salaries
| ₹4.7 L/yr - ₹10.2 L/yr |
|
Product Manager
30
salaries
| ₹16 L/yr - ₹25 L/yr |
|
Software Development Engineer
23
salaries
| ₹6.7 L/yr - ₹13.8 L/yr |
MagicBricks
Netmeds.com
Practo
Tracxn
- Home >
- Interviews >
- Carwale Interview Questions
