Add office photos
Filter interviews by
Caw Studios SDE-2 Interview Questions and Answers
Caw Studios SDE-2 Interview Experiences
1 interview found
Rishabh Sharma
I applied via Naukri.com and was interviewed in Sep 2023. There were 4 interview rounds.
Just gave me an assignment based on reactjs where have to implement cart, order approval, print the list of items, product edit modal (quantity & price) and search features.
(2 Questions)
- Q1. Service Worker vs Web Workers in JS
- Ans.
Service Worker runs in the background and handles network requests, while Web Workers run scripts in parallel to the main thread.
Service Worker is used for caching and handling network requests in the background.
Web Workers are used for running scripts in parallel to the main thread to improve performance.
Service Workers can intercept and cache network requests, making web apps faster and more reliable.
Web Workers can ...
- Q2. Hoisting in JS, Closures, Temporal Dead Zone, Hooks: useRef, useMemo and useCallback and custom hooks in reactjs
(1 Question)
- Q1. SSR, CSR in NextJS, how does it work internally and many advance questions
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Anonymous
I was interviewed in Apr 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Timing: 10AM-11AM
Interviewer was quite supportive and helpful.
Environment was normal as usual and it was morning time
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
Timing: 11AM-12PM
The interviewer was SDE2
He was checking the code for edge cases and was hinting if required
- Q1.
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
- Ans. Array representation of heap
- Since the heap is maintained in the form of a complete binary tree, the heap can be easily represented in the form of an array.
- To keep the tree complete and shallow, while inserting a new element insert it in the leftmost vacant position in the last level i.e., at the end of our array, and perform some operation to maintain the property of the heap.
- Similarly, for deleting the maximum e...
- Q2.
Ninja and the Bulbs Challenge
Ninja owns an electronic shop and possesses 'N' bulbs. To verify the quality of the bulbs, Ninja performs a unique technique. After 'N' rounds of this process, bulbs that rem...
- Ans. Brute Force
Approach:
A brute force solution to this problem is to turn on and off the bulbs N time, then at last check the number of bulbs that are on.
Algorithm:
- Take a boolean array of ‘BULBS’ of size N+1.
- Itertate on ‘i’ from 1 to ‘N’
- Iterate on ‘j’ form ‘i’ to ‘N’ and each time increment ‘j’ as ‘j’ += ‘i’.
- if(BULBS[j] == true) then make it false.
- If (BULBS[j]==false) then make it true.
- Iterate on ‘j’ form ‘i’ to ‘N’ and each time increment ‘j’ as ‘j’ += ‘i’.
- Intialise a variable ‘COUNT’ =...
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
Timing: 6PM-7PM
The interviewer was not interactive and didn't gave any feedback whatsoever.
It was Hiring Manager Round
Interviewer was Software Development Manager at Amazon
- Q1.
Maximize the Sum Through Two Arrays
You are given two sorted arrays of distinct integers,
ARR1andARR2. If there is a common element in both arrays, you can switch from one array to the other.Your task...
- Ans. Recursive
In this problem, our primary focus is on the common elements i.e. an element that is present in both the arrays. Then, we have to decide whether we have to make a switch. So for that, first we store all the elements of ‘ARR1’ and ‘ARR2’ into ‘MAP1’ and ‘MAP2’ respectively.
Now we call our ‘maximiseSumHelper’ function. We call this function for both cases i.e starting with ‘ARR1’ and starting with ‘A...
Interview Preparation Tips
Tip 1 : Focus on internals of Data structure on how it actually works
Tip 2 : Implement the Data Structure from scratch, later you can use the inbuilt packages no problem but you must know the implementation
Tip 3 : Understand System Design concepts
Tip 1 : Highlight your contributions you made and how it impacted the business and be real
Tip 2 : Mention the improvement figures like x% reduction in page load size, improved SEO ranking by x figure, reduce memory usage by y%
Skills evaluated in this interview
I applied via Recruitment Consultant and was interviewed in Nov 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Length of smallest subarray with given sum in linear time complexity
- Ans.
Find length of smallest subarray with given sum in linear time complexity
Use sliding window technique to keep track of subarray sum
Initialize two pointers at start of array
Move right pointer until sum is greater than or equal to given sum
Move left pointer until sum is less than given sum
Repeat until end of array is reached
Return length of smallest subarray found
Interview Preparation Tips
Skills evaluated in this interview
I was interviewed in Dec 2020.
(1 Question)
Round duration - 30 minutes
Round difficulty - Medium
It was in the morning about 10:00AM-10:40AM. The platform used for this round was hackerrank. There are 15 MCQ's which cover portions of Aptitude, Data Structures, DBMS, SQL
- Q1.
Minimum Operations Problem Statement
You are given an array
'ARR'of size'N'consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...
Round duration - 15 minutes
Round difficulty - Easy
It was in the night around 7:00PM-7:20PM. Platform used for this round was skype. Interviewer was very serious while taking my interview.
Interview Preparation Tips
Tip 1 : Practice as much as you can
Tip 2 : Try to get a good hold in Data Structures
Tip 3 : Do atleast 2 projects
Tip 1 : It should not be too long or too short.
Tip 2 : Each skill should be mentioned properly.
I was interviewed before May 2021.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
It is online round and it was conducted around 11 AM on campus. Difficulty was medium. 2 coding questions were asked. One question is based on arrays(easy) and the other question is based on usage of oops concepts like Inheritance, polymorphism. Everything went smooth.
- Q1.
Subarray With Given Sum Problem Statement
Given an array
ARRof N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exis... - Ans.
I started with brute force method but test cases were failed due to time complexity. Use a similar approach to a sliding window. Start with an empty subarray, add elements to the subarray until the sum is less than x. If the sum is greater than x, remove elements from the start of the current subarray
(4 Questions)
Round duration - 50 minutes
Round difficulty - Medium
Round started with self introduction and discussion of project. Everything went fine.
Note: we didn't have hr round due to time constraint. You can expect hr round.
- Q1.
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
- Ans.
Step 1: create an array of fixed size 256 as 256 ascii characters are available. Initialise all the elements of array with 0.
Step 2: iterate over array and store the frequency of every character.
Step 3: Iterate over the array and print the characters with frequency more than 1.
Note: problem can be solved using maps too. - Q2. Can you explain the concept of normalization and its types?
- Ans.
Tip 1 : Explain everything clearly.
Tip 2 : Don't use the words that you are not confident about. Interviewer might ask questions based on your answers. - Q3. Can you explain the ACID properties in the context of database management systems?
- Ans.
Tip 1 : Go through DBMS concepts thoroughly.
- Q4. Can you explain the concepts of Object-Oriented Programming (OOP) with real-life examples?
- Ans.
Tip 1 : Go through oops concepts thoroughly
Interview Preparation Tips
Tip 1 : Don't get frustrated if not selected, keep believing yourself.
Tip 2 : Prepare data structures and algorithms well. Practice coding daily. OOPS in any programming language will do. Prefer quality of codes to quantity.
Tip 3 : If possible do a project on full stack development.
Tip 1 : Keep it simple and try to adjust everything in one page. As a fresher it is better if you can have 2 projects in your cv.
Tip 2 : Don't add unnecessary details such as parents details.
Skills evaluated in this interview
I was interviewed before May 2021.
(1 Question)
Round duration - 30 minutes
Round difficulty - Medium
- Q1.
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...
- Ans.
use the LinkedHashSet (Set Interface) to retain the original insertion order of the elements into the set.
The main factor that we must keep in mind when dealing with arrays is not the elements that have duplicates. The main problem here is removing the duplicates instead. Arrays are static data structures that are of fixed length, thus not possible to be altered. So, to delete elements from arrays, you need to create n...
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
- Q1.
Reverse String Operations Problem Statement
You are provided with a string
Sand an array of integersAof sizeM. Your task is to performMoperations on the string as specified by the indices in arrayA... - Ans.
Declare a string.
Take out the length of that string.
Loop through the characters of the string.
Add the characters in reverse order in the new string.
String str = "hello";
String reverse = "";
int length = str.length();
for (int i = 0; i < length; i++) {
reverse = str.charAt(i) + reverse;
}
System.out.println(reverse);
Round duration - 50 minutes
Round difficulty - Medium
Interview Preparation Tips
Tip 1 : Prepare well for resume & confidence for basic part of CS.
Tip 2 : Good knowledge of skills set which mentioned in CV.
Tip 3 : Explain about projects which you have worked earlier & your roles and responsibilities.
Tip 1 : Mentioned all the skills & certificate till date update your resume every 3 month's.
Tip 2 : Proper skills set with project explanation and duration of project which you have worked on
Skills evaluated in this interview
I was interviewed in Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Started with brief intro(5 mins) about interviewer.
Problem solving question, question was already there in the codelink shared by the interviewer. He explained the problem again with sample testcase.
The Interviewer was friendly.
- Q1.
Course Schedule II Problem Statement
You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...
- Ans. Breadth-First Search
Our current algorithm is based on the idea of the BFS approach. We first process all the courses with 0 in-degree implying no prerequisite courses required. If we remove all these courses from the graph, along with their outgoing edges, we can find out the courses/nodes that should be processed next. These would again be the nodes with 0 in-degree. We can continuously do this until all the courses h...
- Q2. Design a live video broadcast platform.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
There were 2 interviewers(India HM and Seattle HM), India HM was just shadowing and didn't ask any questions. Started with intro, he asked in detail about what I do at current company(10 mins). Again, jumped into LP's(25 mins).
- Q1.
Distance Between Two Nodes in a Binary Tree
Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...
- Ans. Naive Approach
In any rooted tree, the distance between two nodes 'U' and 'V' can be found by finding the lowest common ancestor (LCA), ‘x’ of two nodes. The lowest common ancestor (LCA) between nodes 'U' and 'V' is defined as the lowest node in the tree that has both 'U' and 'V' as descendants, where we define each node to be a descendant of itself (so if 'U' has a direct connection from 'V', 'V' is the lowest common a...
- Q2.
Median in a Stream Problem Statement
Your task is to determine the median of integers as they are read from a data stream. The median is the middle value in the ordered list of numbers. If the list length...
- Ans. Brute force approach
Store the incoming data elements in a vector. Sort the vector everytime you need to output the median.
Algorithm:
- Store the incoming elements of the data stream in a vector.
- Step by step insert one element and sort the vector as soon as any element is added in the vector.
- If the size of the vector is odd, print the middle element of the sorted vector.
If the size of the vector is even, return the mean of...
Round duration - 60 minutes
Round difficulty - Medium
There was only 1 interviewer in this round and We had no video sharing in this round so it was becoming difficult to understand each other.
Interview Preparation Tips
Tip 1 : Bookmark the GFG Amazon Archives. It helped me a lot during my preparations. Reading other’s interview experiences is one of the best ways to get yourselves ready for the next job interview. Practice daily atleast 5 questions.
Tip 2 : Most commonly asked topics in Amazon Interviews ( as per the mail I received from my recruiter ) :
BFS/DFS/Flood fill, Binary Search, Tree traversals, Hash tables, Linked list, stacks, queues, two pointers/sliding window
Binary heaps, Ad hoc/string manipulations.
Tip 3 : Highly recommended sites for practicing questions ( usually practice medium and hard level questions) :
Leetcode (highly encouraged)
Geeksforgeeks (highly encouraged)
CodeZen( highly encouraged)
Codeforces
Tip 4 : This is a great bigocheatsheet that could be of great help https://www.bigocheatsheet.com/
Tip 1 : Mention past working experience in detail as how you were important to your previous company.
Tip 2 : Try to keep your resume to 1 page if work experience < 5 years
Tip 3 : Update your resume according to role you are applying for and never put false things on resume.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 360 minutes
Round difficulty - Hard
Timing- Any 6 hours of my choice in the 24 hour window. (10:00 p.m. to 4:00 a.m. I selected)
Environment was very friendly and easy to use.
No significant activity.
This was the only coding round.
- Q1.
Prime Time Again Problem Statement
You are given two integers
DAY_HOURSandPARTS. The integer 'DAY_HOURS' represents the number of hours in a day, and the day can be divided into 'PARTS' equal parts. You...
Round duration - 10-15 minutes
Round difficulty - Easy
Timing- 12:15 p.m.
Environment was very good .
Not any significant activity.
The interviewer was very friendly and talked like friends.
Round duration - 20 minutes
Round difficulty - Medium
Timing- 12:30 p.m. to 12:45 p.m
Environment was very comfortable.
No other significant activity.
Interviewer was very good and talking very politely & friendly.
Interview Preparation Tips
Tip 1 : Make sure what you have learnt in DSA you can do it practically by writing codes.
Tip 2 : Must have a hands-on experience in writing SQL commands.
Tip 3 : Do atleast 3-4 projects so that you have an option to explain any one of them if the interviewer asks.
Tip 1 : Write only true data in resume. Don't bluff as you may get caught which will be very embarrassing.
Tip 2 : Have some latest technology related projects in your resume.
Skills evaluated in this interview
I was interviewed in Mar 2021.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 15 minutes prior to the start of the online coding round. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.
- Q1.
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
- Ans. Recursion
- The idea is to use recursion.
- For a particular coin, we have two options either include it or exclude it.
- If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
- If we exclude that coin, then recur for the same amount that we have to make.
- Our final answer would be the total number of ways either by including or excluding.
- There will be two edg...
- Q2.
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...
- Ans. BST property
The approach is based on the fact that the value of each node in a BST is greater than the value of all the nodes in the left subtree and smaller than the value of all the nodes in the right subtree.
Here is the complete algorithm-
- For each node, we store the minimum and maximum value allowed for that node. Initially, for the root node, the minimum value would be -10^9 and the maximum value should be 10...
(1 Question)
Round duration - 60 minutes
Round difficulty - Hard
This round was on call where I was just supposed to answer the tech questions that were asked. It started with a brief interview with one another and then moved to questions on DBMS, operating systems, computer networks and all. Almost 20-25 questions were asked and I probably answered 90% of them correctly.
- Q1.
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. Recursive Approach
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
Algorithm
- If the list contains only one node, return the head of the list.
- Else, divide the ...
Round duration - 30 minutes
Round difficulty - Hard
There was only one interviewer for this round. He continuously interacted with me and was giving me some good situational problems that were not very easy to answer. Basically those were open-minded questions which can be answered oth ways and that's why I found it quiet hard as per my nature but at the end things went well for me.
Interview Preparation Tips
Tip 1 : practice on gfg and coding ninjas
Tip 2 : compete on codechef and codeforces
Tip 3 : learn DSA and practice regularly
Tip 1 : put your entire valuable experience in brief
Tip 2 : put the handle of you competitive coding profiles
Tip 3 : try to put those things that really attracts the recruiter, will be better if your past experiences relates to the company
Skills evaluated in this interview
I was interviewed in Sep 2020.
(1 Question)
Round duration - 180 minutes
Round difficulty - Hard
Timing: 8 a.m. to 11a.m.
Environment was optimum.
No significant activity.
- Q1.
Edit Distance Problem Statement
Given two strings
SandTwith lengthsNandMrespectively, your task is to find the "Edit Distance" between these strings.The Edit Distance is defined as the minimum nu...
- Ans. Recursive Approach
- We will write a recursive approach.
- The base case would be if the length of the first string is 0 then we need to add all the characters of the second string to the first string hence return the length of the second string. Similarly, if the length of the second string is 0 return length of the first string.
- Now the recurrence relation is as follows:
- If the last characters of two strings are not the same...
Round duration - 30 minutes
Round difficulty - Medium
Timing: 12:00 p.m. to 12:30 p.m.
The environment was quite good.
No significant activity.
Interviewers were very friendly. They were behaving like friends.
Round duration - 15 minutes
Round difficulty - Easy
Timing: 3:00 p.m. to 3:20 p.m.
Environment was very good.
No significant activity was monitored.
HR was very good and friendly.
Interview Preparation Tips
Tip 1 : Do minimum 3 projects
Tip 2 : Prepare every topic of DSA for interview
Tip 3 : Hands on experience in performing MySql commands
Tip 1 : Be precise and don't bluff
Tip 2 : Learn atleast 2 programming languages
Tip 3 : Do projects on latest technologies like Artificial Intelligence and Machine Learning
Skills evaluated in this interview
Caw Studios Interview FAQs
Tell us how to improve this page.
Caw Studios Interviews By Designations
- Caw Studios Devops Engineer Interview Questions
- Caw Studios QA Engineer Interview Questions
- Caw Studios SDE-2 Interview Questions
- Caw Studios Sdet Automation Test Engineer Interview Questions
- Caw Studios Senior Quality Assurance Engineer Interview Questions
- Caw Studios Software Engineer Interview Questions
Interview Questions for Popular Designations
Caw Studios SDE-2 Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
|
Software Development Engineer II
18
salaries
|  ₹10 L/yr - ₹20 L/yr |
|
Software Development Engineer
16
salaries
| ₹6 L/yr - ₹18.5 L/yr |
|
Software Developer
12
salaries
| ₹6 L/yr - ₹12 L/yr |
|
Quality Analyst
12
salaries
| ₹3 L/yr - ₹7 L/yr |
|
Software Engineer
7
salaries
| ₹8 L/yr - ₹12.5 L/yr |
Red Chillies Entertainment
Yash Raj Films
Dharma Productions
Balaji Telefilms
- Home >
- Interviews >
- Caw Studios Interview Questions >
- Caw Studios SDE-2 Interview Questions
