Add office photos
Filter interviews by
Capillary Technologies Software Developer Intern Interview Questions and Answers
Capillary Technologies Software Developer Intern Interview Experiences
1 interview found
Anonymous
Selected
I applied via Campus Placement and was interviewed before Nov 2023. There were 2 interview rounds.
DSA test...focussed on Array
(2 Questions)
- Q1. React based questions
- Q2. Javascript based question
Top trending discussions
Interview questions from similar companies
I was interviewed in Dec 2020.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Hackerrank is a good paltform and very flexible, our webcam was turned on in order to prevent students from cheating
- Q1.
Find the Lone Set Bit
Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer
N. The representation contains exactly one '1' and the rest are... - Ans. Approach 1
If we observe a little, we can clearly see that only those integers, which can be represented as a power of 2 have a single set bit in their binary equivalent, and rest either have 0 or more than 1 set bits. Now, we only have to work on the integers which are a power of 2. We will start from the LSB end or the rightmost bit, and check every bit one by one.
- We are given a function findSetBit(), which tak...
- Q2.
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
- Ans. Brute Force
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...
Round duration - 40 minutes
Round difficulty - Hard
Round was conducted on zoom platform. There were 40 students there and then each one of them were assigned break-out rroms for interviews.
Interview Preparation Tips
Tip 1 : try to keep only those things in resume on which you have very good command and you should be able to answer all of the questions(upto moderate level) related to your technical skills
Tip 2 : mention your projects with brief description, try avoiding very high level description because some times reader might not be able to understand your work, keep it descriptive and understandable
Tip 1 : major team project is helpful
Tip 2 : list down only the related achievements with the role you are applying for
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 150 Minutes
Round difficulty - Medium
This first round was the Online test which was 1 Hour 95 Minutes Long. It was Divided
as Follows.
1. Aptitude Section (Arithmetic + Analytical) 14 Questions – 26 Minutes
2. Technical MCQs( Computer Science) 14 Questions – 19 Minutes
3. Coding Question – 20 Minutes
4. Coding Question – 30 Minutes
5. Coding Questions :
- Q1.
Water Equalization Problem Statement
You are provided with an array
ARRof positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the liters of water in ... - Ans. Using Sorting
The main idea is to use sorting the given array in reverse order and then check for the candidates for the water to be removed.
- Sort the array(waters array) in descending order.
- Assuming every bucket as a candidate finds the minimum amount of water needs to be removed. The result will be a minimum amount of water, among that.
- Every bucket which is on the left of the current bucket has more water t...
- Q2.
K Max Sum Combinations Problem Statement
Given two arrays/lists
AandB, each of sizeN, and an integerK, you need to determine theKmaximum and valid sum combinations from all possible combinations of ... - Ans. Brute
Generate all the possible sum combinations using two loops. Store the sum of all the sum combinations in an array/list and sort the array/list in descending order.
Finally, return the ‘K’ max sub-combinations from that array/list.
The Steps are as follows :
- Create an array/list ‘tempArray’ of size ('N' * ‘N’).
- Traverse the given arrays using two loops.
- In the outer loop, traverse the given array...
(1 Question)
Round duration - 150 Minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair: Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
- Q1.
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
- Ans. Dynamic programming
- For every fountain, we can try to find the pair area = (left, right), where left and right are the leftmost and the rightmost index respectively where the current fountain can reach.For every index 'I' = 0 to 'I' = 'N' -1, 'LEFT' = max(0, 'I' - 'ARR'['I']) and 'right' = min('I' + ('ARR'['I'] + 1), 'N').
- Now we can sort the array of pairs in non-decreasing order according to 'LEFT' to find the mi...
(2 Questions)
Round duration - 150 Minutes
Round difficulty - Medium
This was also an Online F2F Technical Round conducted on Codepair : Hackerrank.
Dynamic Programming Based Not So Easy Level:
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Dynamic Programming Based Not So Medium Level
Best Time to Buy and Sell Stock with Cooldown
Best Time to Buy and Sell Stock with Transaction Fee
Dynamic Programming Based Hard Level
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
They asked me a Lot of Questions like:
How did you arrive at this Solution ?
Why is this Approach Right ?
Can You do this in Better time & space complexities ? (Although I have done in Best time Complexity but they asked this to check my confidence level on my codes).
A lot of Variants based on Constraints.
- Q1.
Best Time To Buy and Sell Stock Problem Statement
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...
- Ans. Recursion
The main idea is to use recursion to reduce the big problem into several smaller subproblems.
Algorithm
- We will call a maxProfit function that returns us the maximum profit we can get from the array starting from i (here i denotes the starting index of PRICES) to N - 1. We will use a bool variable buy. If buy == true it denotes that we had bought a stock and now we can’t buy another until we sell it ...
- Q2.
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
- Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
Below is the detailed algorithm:
- Call ...
Interview Preparation Tips
Tip 1 : Solve atleast 300 coding questions.
Tip 2 : Have some good projects on resume.
Tip 3 : Be truthful.
Tip 1 : Have 2 or 3 good projects.
Tip 2 : Don't lie on your resume.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 80 minutes
Round difficulty - Easy
This round was scheduled in the evening hours around 7pm at Hackerrank platform and all the participants were required to fill a form which was shared 2 days prior to the test date. 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.
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. Space Complexity: Explanation: Time Complexity: Explanation:
(1 Question)
Round duration - 45 minutes
Round difficulty - Hard
This round was conducted on Zoom platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 20th August and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.
- Q1.
First Negative Integer in Every Window of Size K
Given an array of integers 'ARR' and an integer 'K', determine the first negative integer in every contiguous subarray (or window) of size 'K'. If a window...
- Ans. Brute Force
Run two loops. In the outer loop, take all windows of size ‘K’.
In the inner loop, get the first negative integer of the current window.
Space Complexity: O(1)Explanation:O(1).
As we are not using an auxiliary space to store data. Hence, the Space complexity is O(1).
Time Complexity: OtherExplanation:O(N*K), where ‘N’ is the size of the array and ‘K’ is the size of each window.
There are...
Interview Preparation Tips
Tip 1 : Practice all DSA questions from interview bit
Tip 2 : Do Atleast 3 project one should be major, if it's in web dev it would be beneficial.
Tip 3 : Should be good in communication skills
Tip 1 : resume should be short and descriptive
Tip 2 : mention all the important projects that you have worked on
Tip 3 : better if resume is enclosed in single page
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Hard
This was a pure coding round consisting of three questions where time allotted for one easy question was 15 minutes while the other two questions were to solved in 30 minutes each.
total time = 15+30+30= 75 minutes
- Q1.
Binary Ones Count Problem
Develop a program to determine the number of '1's in the binary form of a given integer.
Input:
The input consists of a single line containing an integer N.Output:
The outpu... - Ans. Looping through bits Approach
- Here we are converting the number into binary, and during the conversion, we are checking the remainder part.
- If it is 1, then we increment the value of count by 1.
O(1)
We are using constant extra space.
Time Complexity: O(logn)Explanation:O(log(N)), where ‘N’ is the given integer.
Since we are iterating through each bit of binary representation of the ... - Q2.
Longest Increasing Subsequence Problem Statement
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
- Ans. Brute force approach
The idea is to find strictly increasing subsequences for all the elements of the array once including the elements in the sequence and once excluding it. In order to do this, we use a recursive function, 'LIS_HELPER' which returns the length of LIS possible from the current element (maximum of the lengths of subsequences once including the current element and once excluding it).
Algorithm:
- Recur...
(1 Question)
Round duration - 45 minutes
Round difficulty - Hard
There were 2 interviewers and the round was carried out on code pair platform of HackerRank
- Q1.
Candy Distribution Problem Statement
Prateek, a kindergarten teacher, needs to distribute candies to his class. Each child has a performance grade, and all students stand in a line.
The rules for distrib...
- Ans. Brute Force
There can be four cases :
CASE 1: STUDENTS[i - 1] > STUDENTS[i] < STUDENTS[i + 1]
CASE 2: STUDENTS[i - 1] < STUDENTS[i] < STUDENTS[i + 1]
CASE 3: STUDENTS[i - 1] > STUDENTS[i] > STUDENTS[i + 1]
CASE 4: STUDENTS[i - 1] < STUDENTS[i] > STUDENTS[i + 1]
- For case 1, the ‘i’th child will get one candy.
- For case 2, the ‘i’th child will ge...
Interview Preparation Tips
Tip 1 : Single page resume but brief
Tip 2 : Major team product is must
Tip 3 : Regular coding practice on GFG, Leetcode and coding ninjas type platforms
Tip 1 : Consists the brief of your skill set
Tip 2 : Github link of projects should be provided
Tip 3 : Mention clearly if you have done a team project
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
2 coding questions
- Q1.
Check if Binary Search Tree (BST)
Given a binary tree with 'N' nodes, verify whether this tree is a Binary Search Tree (BST). Return true if it is a BST and false otherwise.
Definition:
A Binary Search ...
- Ans. Approach 1
- For each node, store the minimum and maximum value allowed for that node.
- Initially, for the root node as all the integer values are allowed, the minimum value would be -10^9 and the maximum value should be 10^9. Here we can also use built-in INT_MIN and INT_MAX constants.
- If the value of that node is not in the bounded range of minimum and maximum value, then return false.
- For the left subtree of a node with da...
- Q2.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Maintain three pointers next, curr, previous and at every stage make prev=curr, curr=next and next=next->next
At the end when null occurs, make curr as head and return head
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
- Q1.
Validate BST Problem Statement
Given a binary tree with
Nnodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, returntrue; otherwise, returnfalse.A binary search tree (BST)...
- Ans.
Maintain three pointers next, curr, previous and at every stage make prev=curr, curr=next and next=next->next
At the end when null occurs, make curr as head and return head
Interview Preparation Tips
Tip 1 : Practice more.
Tip 2 : Solve questions on Coding ninjas and Leetcode.
Tip 3 : Make good projects.
Tip 1 : Keep it short.
Tip 2 : Mention your projects in brief.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in the evening at around 7:00 p.m.
The hackerrank environment is clearly the best for conducting coding exams as it provides a decent interface for debugging and testing purposes.
There were 3 questions- 1 of easy level and 2 of medium level.
- Q1.
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
Input:
The first lin... - Ans. Brute Force
- One simple naive solution is to try every possible triplet present in the array as a candidate for the pythagorean triplet.
- So, we simply run three nested loops, and pick three integers and check if they follow the property given in the problem statement( i.e for three integers a,b and c a^2 b^2 = c^2).
- If we find any required triplet, we return true. Otherwise, if we can't find any valid triplet, we return fa...
- Q2.
Ways to Arrange Balls Problem
You are given 'a' balls of type 'A', 'b' balls of type 'B', and 'c' balls of type 'C'. Determine the total number of ways to arrange these balls in a straight line so that no...
- Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion. We will keep track of the next ball we want to add in the line. Initially, we have three options, to begin with. We can start by adding A or B or C. After that, at each step, we have two options. We can find the number of ways to make t...
- Q3.
Longest Common Subsequence of Three Strings
Given three strings A, B, and C, the task is to determine the length of the longest common subsequence across these three strings.
Explanation:
A subsequence ...
- Ans.
1. It was a variation of a direct standard problem so I solved it on the go though it was of medium level.
2. The exact approach I applied is given in the link given in the problem statement.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The round was conducted on CodePair platform which provides a IDE along with a video call for interviews.
There were 2 interviewers and both were friendly.
I was first asked about the various subjects I have studied in my curriculum. Then I was asked about my favourite programming language to which I answered Python.
After this, they asked various confusing questions based on function calling, argument passing and pass by object reference concept in Python.
Then they asked about the implementation of dictionary in Python and wanted me to design one with the help of lists(arrays) and optimize its search, add and delete operations. (Could be done with hashing and probing).
Then they asked questions from subjects like Computer Architecture and Theory of Computation (Basic questions were asked so you should just remember the key topics in the subject).
- Q1.
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co... - Ans.
1. Firstly I asked the interviewer if there was any other node reference given in the linked list.
2. Then I asked if it was a singly or doubly linked list.
3. After that, I was stuck as I was attempting to delete the node memory from the linked list but on expressing my problem the interviewer guided me that I should just delete the data in that node.
4. Then I instantly replied with an algorithm to swap the data of the ...
Interview Preparation Tips
Tip 1 : For an intern position in any big company, the most important thing is practicing data structures. Solve as many questions as you can on platforms like Coding Ninjas. First start picking up questions topic-wise and once you gain a decent confidence in every topic, start hitting harder questions randomly on various platforms. (Practice a minimum of 300 questions).
Tip 2 : If you are stuck at solving any question, instead of looking up for a code solution try to read discussions and see various approaches people are applying. This will surely make you prepared for the way in which the interviews are designed. Always keep a clock ticking while solving a problem as spending too much time while practicing surely makes you slow in the Online Tests and Interviews.
Tip 3 : Again specifically for internship preparation, focus mainly on the subjects that have been taught to you till now. As in many colleges Database Management, Operating Systems and Computer Networks are not taught till the 4th semester so you could easily focus on subjects in your curriculum. OOPS concepts are very important!
Tip 1 : In On-Campus internship drives it is generally not required to have a very charming resume with a load of projects as the companies understand the candidate as a 4th semester student.
Tip 2 : But still if there is even a single decent project genuinely build by the student then it is more than sufficient.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Hard
It was a coding round on Hackerrank.
- Q1.
Validate BST Problem Statement
Given a binary tree with
Nnodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, returntrue; otherwise, returnfalse.A binary search tree (BST)...
- Ans.
Keep the maximum and minimum range of values that are possible for each and every node and keep on recursively calling the same function for the children of current node, if it's not satisfying at any point, return false
- Q2.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Maintain three pointers next, curr, previous and at every stage make prev=curr, curr=next and next=next->next
At the end when null occurs, make curr as head and return head
Interview Preparation Tips
Tip 1 : Practice on gfg
Tip 2 : Compete on codechef
Tip 3 : Learn DSA
Tip 1 : Mention all projects
Tip 2 : Don't write anything that you don't know
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 75 minutes
Round difficulty - Easy
Smooth platform of Hackerrank.
Nice user interface.
- Q1.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
Steps:
&...
Interview Preparation Tips
Tip 1 : Do at-least 2 projects.
Tip 2 : Practice on coding ninjas.
Tip 1 : Mention if you have any experience in past.
Tip 2 : Put your competitive profiles URL.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 95 Minutes
Round difficulty - Easy
The complete test was Audio and Video Proctored.
The test was divided into 3 sections:
1) Aptitude: (14 MCQs in 28 minutes)
2) Technical: (12 MCQs in 17 minutes)
3) coding: (2 questions - first in 20 minutes, second in 30 minutes)
- Q1.
Equalize Water in Buckets
You are provided with an array,
ARR, of positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the water volume in each bucket ... - Ans. Using Sorting
The main idea is to use sorting the given array in reverse order and then check for the candidates for the water to be removed.
- Sort the array(waters array) in descending order.
- Assuming every bucket as a candidate finds the minimum amount of water needs to be removed. The result will be a minimum amount of water, among that.
- Every bucket which is on the left of the current bucket has more water t...
- Q2.
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
- Ans. Using BFS
The idea is to first create an undirected graph of the given binary tree and then doing a bfs traversal of the undirected graph starting from the start node. We will keep a variable ‘count’ that will be incremented at each level of bfs traversal. ‘count-1’ is the required time needed to burn the whole tree.
Algorithm
- Initialize an unordered map ‘M’ that maps from integer to array of integers that sto...
Interview Preparation Tips
Tip 1 : Strengthen DSA skills initially, know the basics and understand the working of different data structures
Tip 2 : Solve atleast 300 Questions from websites like leetcode and Hackerrank
Tip 3 : Learn to implement them and enhance your coding skills. Make mistakes and learn from them instead of just cramming everything before practicing.
Tip 4 : To enhance coding skills, try your best to crack a question instead of giving up and looking at the solution..this will improve your problem-solving skills.
Tip 5 : It's a must to do the standard coding questions under every category of data structure and algorithms
Tip 6 : To study the topics and practice coding questions refer to GeeksforGeeks and regularly take part in coding contests.
Tip 7 : Be thorough with OOPs, DBMS, and the technologies on which you have worked for the interview.
Tip 8 : Have at least 2 projects in your resume and make sure you can answer the questions related to them.
Tip 9 : For HR interviews prepare questions, prepare questions such as introduce yourself, your strengths, your weakness.
Confidence is the key you need to be an expert in. I was not aware of some things the interviewer asked during my interviews. But due to my confidence, he skipped that part.
Tip 10 : Do all the questions from the book 'cracking the coding interview'
Tip 1 : Make sure your resume fits everything into a single page.
Tip 2 : Have at least 2 projects on your resume.
Tip 3 : Only Mention only those technical skills that you are confident in. Do not put false things on your resume.
Tip 4 : Mention the work you have done during your internships.
Tip 5 : Include an objective in your resume.
Skills evaluated in this interview
Capillary Technologies Interview FAQs
Tell us how to improve this page.
Capillary Technologies Interviews By Designations
- Capillary Technologies Business Analyst Interview Questions
- Capillary Technologies Software Developer Interview Questions
- Capillary Technologies Analyst Interview Questions
- Capillary Technologies Customer Success Manager Interview Questions
- Capillary Technologies Data Science Associate Interview Questions
- Capillary Technologies Incident Management Analyst Interview Questions
- Capillary Technologies Intern Interview Questions
- Capillary Technologies Sde1 Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Intern Interview Questions
- Software Engineer Trainee Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Capillary Technologies Software Developer Intern Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
Business Analyst
64
salaries
|  ₹3.5 L/yr - ₹10 L/yr |
|
Customer Success Executive
34
salaries
| ₹3 L/yr - ₹6 L/yr |
|
Software Engineer
31
salaries
| ₹2.8 L/yr - ₹8.7 L/yr |
|
Software Development Engineer
30
salaries
| ₹6 L/yr - ₹20 L/yr |
|
Customer Success Associate
28
salaries
| ₹3.2 L/yr - ₹8.5 L/yr |
Netcore Cloud Private Limited
MoEngage
CleverTap
Freshworks
- Home >
- Interviews >
- Capillary Technologies Interview Questions >
- Capillary Technologies Software Developer Intern Interview Questions
