AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Carvana Interview Questions and Answers
Carvana Interview Experiences
3 interviews found
Anonymous
I applied via Approached by Company and was interviewed before Sep 2023. There were 3 interview rounds.
(2 Questions)
- Q1. Basic get to know you questions
- Q2. Your experience with the coding languages they had listened on the job description
Got sent a case study where I had to perform different python packages to suggest data driven decisions that the company could use to have better performance on a new product.
(2 Questions)
- Q1. Expand on projects that I had at previous job
- Ans.
Implemented a new CRM system to streamline customer interactions and improve data analysis.
Led cross-functional team to gather requirements and design system
Managed implementation process and trained staff on new system
Analyzed data to identify trends and improve customer experience
- Q2. Gave a statistical question that was more of a brain teaser than anything
Interview Preparation Tips
Business Analyst Interview Questions asked at other Companies
I applied via LinkedIn and was interviewed in Nov 2023. There were 3 interview rounds.
(1 Question)
- Q1. Past experience and challenges
Car services automation
Metrics
Past experience
Interview Preparation Tips
Selected
I applied via Indeed and was interviewed before Mar 2023. There was 1 interview round.
(1 Question)
- Q1. What shift would you prefer?
Inventory Specialist Interview Questions asked at other Companies
Interview questions from similar companies
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
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.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Times Internet
Shreyas Ashok Keote
posted on 6 Dec 2015
Interview Questionnaire
18 Questions
- Q1. Introduce yourself.
- Q2. Being from a non-CS background (Civil Engineering branch), he asked me which coding language i am best at
- Q3. Find the second largest prime number from a given array of positive integers. Also return it's index in most optimal way
- Ans.
Find the second largest prime number and its index from an array of positive integers.
Iterate through the array and check if each number is prime
Store the largest and second largest prime numbers found so far
Also store their indices
Return the second largest prime number and its index
- Q4. Given an array of positive and negative integers, find the first missing positive number in the most optimal way
- Ans.
Find the first missing positive number in an array of positive and negative integers.
Sort the array in ascending order
Iterate through the sorted array and find the first positive number that is missing
If no positive number is missing, return the next positive number after the largest positive number in the array
- Q5. Which data structure would i use to program a jigsaw puzzle program and what methods would i use to solve the puzzle
- Ans.
The data structure to program a jigsaw puzzle program would be a graph.
Use a graph data structure to represent the puzzle pieces and their connections.
Each puzzle piece can be represented as a node in the graph.
Edges between nodes represent the connections between puzzle pieces.
To solve the puzzle, use graph traversal algorithms like depth-first search or breadth-first search.
Apply puzzle-solving strategies like findin
- Q6. Questions based on my resume
- Q7. What do i know about Times Internet and the work that happens in TIL
- Ans.
Times Internet Limited (TIL) is a digital products company that operates various online platforms and services.
TIL is a subsidiary of Bennett Coleman & Co. Ltd (BCCL), which is India's largest media conglomerate.
TIL operates popular websites and apps like Times of India, Economic Times, Gaana, MX Player, and Cricbuzz.
TIL focuses on digital content, e-commerce, and technology solutions.
TIL has a diverse portfolio of...
- Q8. Why was i opting for a job as software developer though i was from Civil Engineering background
- Ans.
I transitioned to software development due to my passion for coding and problem-solving.
I discovered my interest in coding during my civil engineering studies
I took online courses and attended coding bootcamps to learn software development skills
I completed projects and internships in software development to gain practical experience
I enjoy the creativity and problem-solving aspects of software development
- Q9. Asked me questions based on my CV
- Q10. If a person travels from point A to point B at 20 km/h and returns at 30 km/h, calculate the average speed without using pen and paper.
- Ans.
The average speed can be calculated by taking the harmonic mean of the two speeds.
To calculate the harmonic mean, divide the sum of the speeds by the reciprocal of the sum of their reciprocals.
In this case, the harmonic mean can be calculated as 2/(1/20 + 1/30) = 24 km/h.
- Q11. Asked the above question with different speeds to travelling
- Q12. Given 8 balls of the same properties and one of these balls is defective and is heavier than the others. Calculate the minimum no. of steps to find the defective ball
- Ans.
The minimum number of steps to find the defective ball is 2.
Divide the 8 balls into 3 groups of 3, 3, and 2 balls.
Compare the weights of the two groups of 3 balls.
If one group is heavier, divide it into 2 balls and compare their weights.
If the two balls have different weights, the heavier ball is the defective one.
If the two balls have the same weight, the remaining ball in the first group of 3 is the defective one.
- Q13. Asked the above question, but this time we don't know whether the defective ball is heavier or lighter than the others
- Q14. 20 red balls and 16 blue balls are present in a bag. 2 balls are removed, if they are of the same color, then they are replaced by a red ball. If they are of different color, then they are replaced with a...
- Q15. What is polymorphism with examples
- Ans.
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism is achieved through method overriding and method overloading.
Method overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass.
Method overloading allows multiple methods with the same name but different parameters ...
- Q16. What is operator overloading?. Give an example
- Ans.
Operator overloading is the ability to redefine operators for custom classes.
Allows operators to be used with custom classes
Example: '+' operator can be used to concatenate strings
Can improve readability and simplify code
- Q17. Differentiate between method overloading and method overriding
- Ans.
Method overloading is having multiple methods with the same name but different parameters. Method overriding is having a method in a subclass with the same name, return type, and parameters as a method in its superclass.
Method overloading is achieved within the same class.
Method overriding occurs in a subclass that inherits from a superclass.
Method overloading is determined at compile-time based on the number, type, an...
- Q18. Do you have any question for us?
Interview Preparation Tips
Experience: The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.
Tips: 1. Practice questions on Geekquiz.
2. Practice coding problems. There are various websites like HackerRank, HackerEarth etc. which have a lot of coding problems.
Duration: 90 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.
Round: Puzzle Interview
Experience: The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.
Round: HR Interview
Experience: This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.
General Tips: Be confident, think loudly, never panic and have a smile to your face always. You have already prepared hard for the recruitment process, it is just the confidence that matters. Don't lose hope, there are many opportunities for you.
Skills: Confidence, Communication, Puzzle Solving Capability, Algorithms And Data Structures, Basic C/C++
College Name: IIT Varanasi
Motivation: TIL has a wide range of products and the compensation is good
Funny Moments: The HR interview was more of a friendly talk and i shared my hobbies which led to a longer discussion.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.
- Q1.
Largest Prime Factor Problem Statement
You are given a positive integer
n. Your task is to identify the largest prime factor of this given positive integer.If there is no prime factor for a given intege...
- Ans.
Identify the largest prime factor of a given positive integer.
Iterate from 2 to sqrt(n) to find prime factors
Check if each factor is prime and update largest prime factor
If no prime factor found, output -1
- Q2.
First Missing Positive Problem Statement
You are provided with an integer array
ARRof length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T... - Ans.
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited using index as a reference.
After marking, iterate again to find the first unmarked index which represents the missing positive integer.
Handle edge cases like duplicates and negative numbers appropriately.
Example: For input [3, 4, -1, 1], the output should be 2.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.
- Q1.
Binary Array Sorting Problem Statement
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
Input:
The fir...
- Ans.
Yes, the binary array can be sorted in linear time and constant space using a single traversal.
Use two pointers approach to swap 0s to the left and 1s to the right.
Maintain two pointers, one for 0s and one for 1s, and iterate through the array once.
Example: Input array [1, 0, 1, 0, 1] will be sorted to [0, 0, 1, 1, 1] in a single traversal.
- Q2. What is polymorphism in object-oriented programming?
- Ans.
Polymorphism in OOP allows objects of different classes to be treated as objects of a common superclass.
Polymorphism allows for flexibility and reusability in code.
It enables a single interface to be used for different data types.
Examples include method overriding and method overloading.
- Q3. What is operator overloading?
- Ans.
Operator overloading is the ability to redefine the behavior of operators for user-defined data types.
Allows operators to be used with custom data types
Can define custom behavior for operators like +, -, *, etc.
Helps make code more readable and intuitive
Example: Overloading the + operator for a custom Vector class to add two vectors
- Q4. What is the difference between method overloading and method overriding?
- Ans.
Method overloading is having multiple methods in the same class with the same name but different parameters. Method overriding is having a method in a subclass with the same name and parameters as a method in its superclass.
Method overloading involves multiple methods with the same name but different parameters.
Method overriding involves a subclass redefining a method from its superclass with the same name and paramete...
Round duration - 45 minutes
Round difficulty - Easy
The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.
Round duration - 30 minutes
Round difficulty - Easy
This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.
Interview Preparation Tips
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.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(5 Questions)
Round duration - 60 minutes
Round difficulty - Easy
I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.
- Q1. Can you introduce yourself?
- Q2. What is a Binary Search Tree (BST)?
- Ans.
A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.
BST allows for efficient search...
- Q3.
Binary Search Tree Insertion
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...
- Ans.
Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.
Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.
Insert the new node as a leaf node in the appropriate position to maintain the BST properties.
Ensure that the resulting tree is a valid binary search tree by follow...
- Q4.
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
- Ans.
Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.
Traverse the BST to find the node to be deleted.
Handle different cases like node with no children, one child, or two children.
Update the pointers of the parent node and child nodes accordingly.
Perform inorder traversal after deletion to get the modified BST.
- Q5.
Clone Linked List with Random Pointer Problem Statement
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
- Ans.
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.
Iterate through the original linked list to create the cloned nodes and update the hashmap.
Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.
Time comple...
Interview Preparation Tips
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 : Must verify your CV from your seniors/batchmates.
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
Tips: Prepare for CAT. Be Fast. Develop a decent proficiency in English.
Round: Interview
Experience: There could be Multiple rounds. You will be grilled thoroughly on your CV. Logical Puzzle Solving skills will be put to test. Your common sense about the internet will also provide a boost.
Tips: Do not prepare. Be yourself. CV should not be exaggerated. Prepare a CV customized for the company.
General Tips: Be Yourself and Win it!
College Name: IIT KHARAGPUR
Motivation: Best in business.
Interview Preparation Tips
Tips: Prepare well.
Round: Interview
Tips: The Basics should be good.
Round: Interview
Experience: The Advanced level.
General Tips: Just be yourself. Maintain a good CGPA. Focus as much as you can on internships. They Matter a big deal.
Skills: Adobe Photoshop, Quantitative Ability, Logical Reasoning, Data Interpretation
College Name: IIT KHARAGPUR
Motivation: One of the best companies to work for. Great growth.
Anuj Gupta
Interview Questionnaire
6 Questions
- Q1. Given a Linked list , print yes if it is palindrome else print no
- Q2. Print the level order traversal of the binary tree in the spiral form
- Ans.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
- Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
- Ans.
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
- Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
- Ans.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
- Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
- Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
- Ans.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
Interview Preparation Tips
Duration: 90 minutes
Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL
Skills evaluated in this interview
Carvana Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
Carvana Interview Process
based on 2 interviews
Interview experience
Interview Questions from Similar Companies
Amazon
Flipkart
BigBasket
JustDial
- Home >
- Interviews >
- Carvana Interview Questions
