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 for Freshers
13 Interview questions
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.
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...
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...
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.
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...
Caching is the process of storing frequently accessed data in a temporary storage to improve performance.
Caching reduces the need to fetch data from the original source, improving response time.
It helps in reducing network traffic and server load.
Caching can be done at various levels like browser caching, CDN caching, and server-side caching.
Examples of caching include browser caching of website assets, CDN cachin...
Designing an e-commerce web app involves user interface, product management, payment processing, and scalability considerations.
User Interface: Create a responsive design for easy navigation and product discovery.
Product Management: Implement a database to manage product listings, including categories, descriptions, and images.
User Authentication: Allow users to create accounts, log in, and manage their profiles.
S...
A load balancer distributes network traffic across multiple servers to ensure reliability and optimize resource use.
Improves application availability by distributing requests to multiple servers.
Can be hardware-based (like F5) or software-based (like Nginx).
Helps in scaling applications by adding more servers as demand increases.
Supports various algorithms like Round Robin, Least Connections, and IP Hash.
Example: ...
Implement 2 stacks in an array
Divide the array into two halves
Use top1 and top2 to keep track of top elements of stacks
Push and pop elements from respective halves
Check for overflow and underflow conditions
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a hash table to store key-value pairs
Use a doubly linked list to keep track of the order of items
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the back of the list
Lookup and insertion should be O(1) time complexity
Carwale Interview Experiences for Freshers
9 interviews found
Anonymous
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
I appeared for an interview in Mar 2023.
(1 Question)
- Q1. Normal profile discussion
SQL-medium-joins
Python-medium-dictionaries
Selected
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Questions from trees and linkedin
(2 Questions)
- Q1. Question on dsa and on oops
- Q2. Reverse linked list with multiple approach
- Ans.
Reverse a linked list using multiple approaches.
Iterative approach: Use three pointers to reverse the links between nodes.
Recursive approach: Recursively reverse the rest of the list and adjust the links.
Stack approach: Push all the nodes onto a stack and then pop them to create the reversed list.
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Sep 2021. There were 3 interview rounds.
Do DSA easy-medium questions from leetcode
Most of the questions were array based
(2 Questions)
- Q1. Brief summary of project, technology used, challenges faced, how did u overcome that challanges
- Ans. I explained my project and problem faced, then interviewed asked how did u overcome this problem
- Q2. Leetcode medium difficulty level dsa questions
- Ans. 3 questions related to array and 1 was related to tree
(3 Questions)
- Q1. This was system design interview, they asked me how would u design e-commerce web app
- Ans.
Designing an e-commerce web app involves user interface, product management, payment processing, and scalability considerations.
User Interface: Create a responsive design for easy navigation and product discovery.
Product Management: Implement a database to manage product listings, including categories, descriptions, and images.
User Authentication: Allow users to create accounts, log in, and manage their profiles.
Shoppi...
- Q2. Then he asked me what is load balancer
- Ans.
A load balancer distributes network traffic across multiple servers to ensure reliability and optimize resource use.
Improves application availability by distributing requests to multiple servers.
Can be hardware-based (like F5) or software-based (like Nginx).
Helps in scaling applications by adding more servers as demand increases.
Supports various algorithms like Round Robin, Least Connections, and IP Hash.
Example: A web...
- Q3. What is caching and why do we need to do caching
- Ans.
Caching is the process of storing frequently accessed data in a temporary storage to improve performance.
Caching reduces the need to fetch data from the original source, improving response time.
It helps in reducing network traffic and server load.
Caching can be done at various levels like browser caching, CDN caching, and server-side caching.
Examples of caching include browser caching of website assets, CDN caching of ...
Interview Preparation Tips
- DSA
- C++
Be confident during interview while answering
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in May 2021. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. In first round exam was on hackerrank and in second round there was DSA coding question, 3 round system design
Interview Preparation Tips
Interview Questionnaire
2 Questions
- Q1. Implement LRU Cache
- Ans.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a hash table to store key-value pairs
Use a doubly linked list to keep track of the order of items
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the back of the list
Lookup and insertion should be O(1) time complexity
- Q2. Implement 2 stacks in an array
- Ans.
Implement 2 stacks in an array
Divide the array into two halves
Use top1 and top2 to keep track of top elements of stacks
Push and pop elements from respective halves
Check for overflow and underflow conditions
Skills evaluated in this interview
Nilima More
Interview Questionnaire
7 Questions
- Q1. Self introduction
- Q2. Java basics
- Q3. DBMS basics
- Q4. Sorting
- Q5. Ball puzzles
- Q6. Color puzzles
- Q7. Chess puzzles
Interview Preparation Tips
Experience: Aptitude test is simple as much it based on basic programs,technical terms.make sure that you attempt all sections.
Tips: 1.Revised all basic programs like sorting,stack,linked list.
2.Attempt every question.
Total Questions: 2 hr
Round: Technical Interview
Experience: Its awesome experience when you know all the questions already.actually it was my 10 company..n 5 th technical interview.
Tips: I would want you to be confident as they look for your confidence.
Round: Puzzle Interview
Tips: Dont quit here..this is the elimination round.atleast answer 2 puzzles out off 4.
General Tips: Concentrate on basic concepts Of java,dbms,dsa.
be coconfident.
Skills: Communication skill
College Name: TERNA ENGINEERING COLLEGE
Sachin
Interview Questionnaire
2 Questions
- Q1. Programming based question on datastructure and logical
- Q2. Questions related intrest and company
Interview Preparation Tips
Experience: it was good experience while giving answer , because i knew the most of answer and answered confidently...
Tips: makes the basic concept clear and be confident on what u say....
Round: HR Interview
Experience: answered confidently .... she offered me the job....
Tips: its all about your confidence and communication skills....
Skills: web technology, java
College Name: TERNA ENGINEERING COLLEGE
SDE (Software Development Engineer) Interview Questions & Answers
Shubham Jain
posted on 14 Oct 2015
Interview Preparation Tips
Experience: Online coding session :
Q1). Check for balanced parenthesis in an expression.
Q2). Count all possible paths from top left to bottom right of a M x N matrix.
(From each cell you can move only to right or down).
Q3) Count number of pairs with given sum in an array.
Q4). Print (N-K) values corresponding to min of each K-sized chunk in a given array of size N.
Tips: Lead in this round can benefit you in next rounds, so give your best shot.
Duration: 120 minutes minutes
Total Questions: 4
Round: Technical Interview
Experience: This was about a 30 min session.
He asked me very easy concept based questions.
Q1). Explain your project briefly.
Q2). Explain multiple inheritance
Q3). Why JAVA doesn’t support multiple inheritance.
Q4). Convert a hexadecimal to binary number and vice versa.
Q5). What are balanced BSTs?
Q6). Explain all possible rotations possible in a balanced BST.
Q7). Write INSERT function for a balanced BST.
Tips: Correct explaination matters,time doesn't.Take your time.
Round: Technical Interview
Experience: This was Technical + HR round :
Q1). Detailed discussion on my intern project.
Asked the shortcomings of the project and approaches to resolve them.
Q2). Discussion on minor project (Threaded download accelerator)
Asked about what all different approaches I could have followed in the project and why didn’t I chose them.
Q3). Favorite subject – I replied OS.
Asked few basic questions-
What are threads? How are they different from process? Explain with example.
I don’t remember the other os questions he asked about.
Q4). Implement Twitter.
It wasn’t easy to make him understand the approach. He was kind of satisfied with my approach at the end.
Q5). Discussion on other projects.
.
HR questions followed.
Tips: Be yourself.Don't pretend.
All the best :)
Skill Tips: Have conceptual knowledge of subjects, don't just mug up things.
Interviewers are smart enough to make it out anyway.
Skills: Logical Thinking, Operating System Basics, Algorithm, Database Management, Data Structures, C++, C
College Name: NIT Bhopal
Motivation: Flat hierarchy.
No cabin culture.
Working at startup is always better because you get to learn a lot of things.
Decent salary.
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
8 Questions
- Q1. Implement queue with the help of two stacks
- Ans.
Queue can be implemented using two stacks by maintaining the order of elements in the stacks.
Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the ...
- Q2. Iven a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number
- Ans.
Retrieve the 2nd highest and nth highest marks from a student table using SQL queries.
Use the DISTINCT keyword to avoid duplicate marks.
For the 2nd highest marks: SELECT DISTINCT Marks FROM student ORDER BY Marks DESC LIMIT 1 OFFSET 1;
For nth highest marks: SELECT DISTINCT Marks FROM student ORDER BY Marks DESC LIMIT 1 OFFSET n-1; (replace n with the desired number)
Example for 2nd highest: If Marks are 90, 85, 90, 80, ...
- Q3. What is left join. Give example. And Full outer join?
- Ans.
Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.
Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...
- Q4. What is magic functions and autoloading in PHP?
- Ans.
Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.
Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle ...
- Q5. Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6, 7, 20, 80, 100} ar3[] = {3, 4, 15, 20, 30, 70, 80, 120} Ou...
- Ans.
Given three sorted arrays, find common elements.
Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array
- Q6. A puzzle. You will be given with a 3 Litre container & a 7 Litre Container. Measure exactly 5 Litres of water
- Q7. Asked about one of my projects I mentioned in my resume?
- Q8. Find if a number is a power of 2 or not?
- Ans.
Check if a number is a power of 2 or not.
A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
Interview Preparation Tips
College Name: na
Motivation: Overall it was a very good experience. They test you from every aspect. In the End I would like to say that Practo is one of the best companies to work for.
Skills evaluated in this interview
Carwale Interview FAQs
Some of the top questions asked at the Carwale interview for freshers -
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
- Software Engineer Interview Questions
- Business Analyst Interview Questions
- Sales Executive Interview Questions
- Senior Engineer Interview Questions
- Java Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 3 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Carwale Reviews and Ratings
based on 169 reviews
Rating in categories
4-6 Yrs
₹ 3-7.3 LPA
2-5 Yrs
₹ 3.4-7.2 LPA
3-6 Yrs
₹ 2.1-39 LPA
|
Accounts Manager
138
salaries
|  ₹3 L/yr - ₹5.8 L/yr |
|
Key Account Manager
97
salaries
| ₹3 L/yr - ₹9.1 L/yr |
|
Regional Manager
35
salaries
| ₹4 L/yr - ₹10.2 L/yr |
|
Product Manager
27
salaries
| ₹12 L/yr - ₹31 L/yr |
|
Software Development Engineer 1
22
salaries
| ₹6.5 L/yr - ₹14.9 L/yr |
MagicBricks
Netmeds.com
Practo
Tracxn
- Home >
- Interviews >
- Carwale Interview Questions >
- Carwale Interview Questions for Fresher
