AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Carwale Full Stack Web Developer Interview Questions and Answers for Freshers
7 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...
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...
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.
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 ...
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 app...
Carwale Full Stack Web Developer Interview Experiences for Freshers
1 interview 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
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
Agam Mahajan
Interview Preparation Tips
Experience: There was Pool Campus Placement of 4 Colleges together(NIT Jalandhar,NIT Hamirpur ,Candigarh University and CGC Landran ) at Chandigarh University.Written test was taken on Hacker Rank. There were 5 Coding Questions of Linklist , Dynamic Programming,Priority Queues etc .
You didn't have to do All the questions (3 can get you to the next round).
One thing that need to be beware of is that on Hacker Rank Your Draft is Saved every second(or so). So don't copy from the internet and just paste there(they will get to know).
Tips: Make sure you practice lot of Algorithms.
Duration: 120 minutes
Total Questions: 5
Round: Problem Statement
Experience: Only 8 Students were selected for this round
20 mins were given for it
and afterwards each student had personal discussion(10 mins) with them to explain their schema .
3-4 Questions were also asked related to your schema and how to perform a particular query
Tips: You should Be Through with DBMS
Make sure there is no redundant table and Primary keys are marked
Round: Technical Interview
Experience: 2 were selected for the Interview
Firstly they make you very Comfortable and ask how were the previous Rounds.
Then they asked about the two questions of First Round and my approach
Then couple of questions on The design that was made Earlier.
Then there were questions on How Internet Works ,gcc,Linux,git,sql.
Then the Interviewer asked if I have any question
I asked about (as the work on doctor's app) how they know the credibility of a doctor which is enlisted in their app.
Interviewer was really Impressed by the question and told me all about it with all details.
Both were selected
Tips: Be cool in the Interview
Think Loudly and Interact with them well.
If they want you to ask any question ,it should not be related to technical stuff ,it should be related to the company
College Name: NIT JALANDHAR
I applied via Referral
Interview Questionnaire
5 Questions
- Q1. I was asked to optimize the last program mentioned above
- Q2. I was asked in detail about my internship experience and projects
- Q3. I was asked why I did not contribute to any open source projects
- Ans.
I haven't contributed to open source due to time constraints and focusing on personal projects and learning new technologies.
Time Constraints: Balancing work, personal projects, and learning new technologies has limited my availability.
Focus on Personal Projects: I've been dedicated to developing my own applications, such as a task management tool.
Learning New Technologies: I prioritized mastering frameworks like React...
- Q4. I was asked to explain the code of my android app from my dropbox account
- Q5. The usual HR questions followed after that
Interview Preparation Tips
College Name: NA
I appeared for an interview before Feb 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
- Q1.
N Queens Problem
Given an integer
N, find all possible placements ofNqueens on anN x Nchessboard such that no two queens threaten each other.Explanation:
A queen can attack another queen if they ar...
- Ans.
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
- Q2.
Sort 0 1 2 Problem Statement
Given an integer array
arrof size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.Input:
The first line contains an integer 'T' representing the n... - Ans.
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
- Q1.
Ninja and Substrings Problem Statement
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
- Ans.
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
- Q2.
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's
nextpoints back to a previous node in the ... - Ans.
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
- Q1.
Balanced Parentheses Combinations
Given an integer
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- Ans.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
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
Interview Questionnaire
9 Questions
- Q1. What is event bubbling?
- Ans.
Event bubbling is the propagation of an event from the innermost child element to the outermost parent element.
Events triggered on a child element will also trigger on its parent elements
The event travels up the DOM tree until it reaches the document object
Can be stopped using event.stopPropagation()
Can be useful for event delegation
- Q2. Difference between .on(‘click’,function() and .click(function())
- Ans.
The .on('click',function() is a more flexible method than .click(function())
The .on() method can handle multiple events and selectors
The .click() method can only handle one event and one selector
The .on() method can also handle dynamically added elements
The .click() method cannot handle dynamically added elements
- Q3. Write a function to check if two strings are anagram or not
- Ans.
Function to check if two strings are anagram or not
Create two character arrays from the strings
Sort the arrays
Compare the sorted arrays
- Q4. Given an array of integers which can be in one of four order – i.Increasing 2.Decreasing 3.decreasing then increasing 4.increasing then decreasing .Write a function to find the type of array
- Ans.
Function to determine the order of integers in an array.
Check first and last element to determine if increasing or decreasing
Check for inflection point to determine if order changes
Return order type as string
- Q5. How can you improve the performance of a site.(Only frontend)
- Ans.
Optimize images, minify code, reduce HTTP requests, use caching, and lazy loading.
Optimize images using compression and appropriate file formats
Minify code to reduce file size and improve load times
Reduce HTTP requests by combining files and using sprites
Use caching to store frequently accessed data locally
Implement lazy loading to defer loading of non-critical resources
- Q6. Design database schema for a movie site.Where user can watch the movie,genre of movie,give ratings and recommended movies to user.Also Write an algorithm to show recommended movies to user
- Ans.
Design a database schema for a movie site with user ratings and recommendations.
Create tables for movies, users, ratings, and recommendations
Use foreign keys to link tables
Include columns for movie genre and user watch history
Algorithm for recommendations can use user watch history and ratings to suggest similar movies
- Q7. By tossing a coin we can get either head or tail, i have a function toss() which return head or tail with equal probability
- Ans.
Using a coin toss function, we can generate random binary outcomes for various applications in programming.
The toss() function simulates a fair coin toss, returning 'head' or 'tail'.
It can be used in games to make random decisions, like choosing a player to start.
In algorithms, it can help in randomized algorithms, such as quicksort.
Example: If toss() returns 'head', you might proceed with one branch of logic; if 'tail...
- Q8. You have to write a function for dice which will return number from 1-6 with equal probability. constraints : you can not use random function, you can use only toss function
- Ans.
Function to simulate dice roll with equal probability without using random function
Use a toss function that returns either 0 or 1 with equal probability
Call the toss function 3 times and convert the result to a binary number
If the binary number is greater than 0 and less than or equal to 6, return it
If the binary number is greater than 6, repeat the process
- Q9. Write a query to fetch duplicate email from table?
- Ans.
Query to fetch duplicate email from table
Use GROUP BY and HAVING clause to filter out duplicates
SELECT email, COUNT(*) FROM table_name GROUP BY email HAVING COUNT(*) > 1;
This will return all the duplicate emails in the table
Interview Preparation Tips
College Name: na
Motivation: Practo is the market leader in digital healthcare management with millions of consumers using our products to find doctors, book appointments and manage their healthcare efficiently. Practo Ray is the platform of choice for the vast majority of doctors and clinics deploying cloud based clinic management solution.I recently got an offer from Practo, here is my interview experience:
Skills evaluated in this interview
I applied via Campus Placement
Interview Questionnaire
4 Questions
- Q1. General questions. Where are you from, tell about yourself etc..,
- Q2. Asked me about the projects which i have mentioned in my resume
- Q3. Some algorithmic questions including data structures. Time complexity, space complexity etc.,
- Q4. How would you design a snake game present in basic nokia mobiles. Just the data structure part and some functions which are used as the game goes on
Interview Preparation Tips
Experience: A bit difficult but sensible way to get started with the selection procedure. Questions purely attack the algorithmic and stastitic aspects.
Tips: Get yourself ready with conceptual clartity regarding algorithms and stastics . Don't be ambitious to attempt all the questions, completely solving one problem would be more than enough for getting through this level.
Duration: 120 minutes
Total Questions: 3
Round: Technical Interview
Experience: Believe me. You never feel inferior, it's really interactive and very friendly. Interviewer gave me a few chances and hints whenever i've gone wrong. Overall interview experience was awesome.
Tips: If you're up to this round, they believe you have the potential. So don't panic if you are unable to answer their questions. Just tell them which aspects which you are comfortable with and they will proceed correspondingly, Just be honest whatsoever.
Skill Tips: Prefer having some revision about the above skills before undergoing the selection process.
Skills: Math Puzzles, Algorithmic Approach To Problem Solving, Data Structures
Duration: 2months
College Name: IIT Madras
Funny Moments: Receiving the offer letter from HR official who visited our campus :)
Interview Preparation Tips
Experience: The written test did NOT involve general aptitude questions. Most questions were CS specific and pertained to some kind of algorithmic analysis, design of recursive solutions, designing and tracing out an algorithm on a given sample etc. About 50-60% of the candidates were eliminated in this round.
Round: Test
Experience: The next round was a coding assignment. For those familiar with code-chef, the coding assignment was similar to a medium level problem (in the practice section) and had to be done in C. The codingassignment by design, required algorithmic optimization to execute within the prescribed time limit. About 10 candidates (8 UG and 2 PG) were selected for interviews. Yahoo generally conducts 4 technical interviews and an HR interview. Typically, 2 of the 4 tech interviews will be with immediate seniors in teams that are interested in your profile. The remaining two will be with more senior engineers (in fact, one of my interviews was with the tech director of a vertical at Yahoo). Interviewers discuss with each other after each interview, and some candidates were eliminated after one poor interview. It is therefore quite important to do
General Tips: Apart from technical skills, your communication and social skills are what can make or break an interview and eventually, decide whether or not you get the job. Objectively speaking, most candidates who make it to the final round will be very technically proficient. Therefore, your aim should be to make the decision regarding your candidature anything BUT objective. The real advantage of an interview is to let the interviewer know YOU, beyond just your written test score or your academic credentials. Interviewers like confidence in a candidate and it can even make you seem better than you really are. It will also help to have a few well thought out questions in mind for your interviewer, to show him that you have put in more effort than other candidates to find out about the kind of work going on at the company. One thing youcan do is to find out who all the interviewers are during the pre-placement talk (Yes, attending the PPT CAN BE USEFUL). General Tips Preparation Look up their LinkedIn profiles and note what projects they have worked on or guided. Asking a few insightful questions about those specific projects is a good way to create a good impression of you. It is very difficult to truly judge a candidate during a 45 minute interview, so what matters a lot is the impression left in the interviewers mind about you. If possible, try to establish a social connect during your limited interaction with the interviewers, BEFORE the interviews take place. For example, one of my interviewers, a senior tech manager at Yahoo, was an NITK alumnus. Before the interviews, I spoke to him about his experience in college. As it turns out, he was one of the founders of the web club at NITK, of which I am a member. We spoke for about 15 minutes about how the club has grown and how the club has helped its members ever since.
Skill Tips: For a computer science student who intends to take up a technical job at a tier 1 company, spend as much time as possible, honing your technical skills. Start well before placement season, if possible, in 3rd year itself
College Name: NIT SURATHKAL
I appeared for an interview before Apr 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
- Q1.
Balanced Parentheses Combinations
Given an integer
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- Ans.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
- Q3.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
- Q1.
Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions t...
- Ans.
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
- Q2.
Merge Intervals Problem Statement
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
- Ans.
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
- Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
(4 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
- Q1.
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
- Ans.
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 ...
- Q2.
Power of 2 Problem Statement
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
Input:
The fir... - Ans.
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
- Q3. What are some advantages of using Object-Oriented Programming (OOP)?
- Ans.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
- Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
- Ans.
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
- Q1. Why should we hire you?
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
Selected
I applied via Campus Placement and was interviewed before Apr 2022. There were 4 interview rounds.
There were 3 coding and 1 SQL question.
(1 Question)
- Q1. This was regarding the coding test on your approach and how you came with that answer
(1 Question)
- Q1. Some technical questions about programming were there to know about your understanding with coding
Carwale Interview FAQs
Some of the top questions asked at the Carwale Full Stack Web Developer interview for freshers -
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
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Interview Questions from Similar Companies
|
Accounts Manager
135
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
