Capillary Technologies Customer Success Manager Interview Questions and Answers

They give one topic for discussion

Pen paper test. Questions on Java and sql

Question on sql , question on maths and logical and technical questions

Q1. Family background
Add your answer
Q2. Internship done
Add your answer

Q1. Basic questions on project management techniques. How to handle a team of members. Behavioural type of questions and based on my project
Add your answer

Q1. 2nd round was with vp from US. The interview went very well. VP asked me qns about my current project. Will i be able to work in us timings. Some ans on pm techniques
Add your answer

They gave me a questionnaire which was like behavioural round

Q1. Final round is HR. They want to know whether we oblige to companies policy and culture
Add your answer

Q1. Tell me about yourself?
Add your answer
Q2. Final year project ?
Add your answer

Q1. Joins , type of join explain with example?
Ans. 
Joins are used to combine data from two or more tables based on a related column.
• Inner join returns only the matching rows from both tables.

• Left join returns all the rows from the left table and matching rows from the right table.

• Right join returns all the rows from the right table and matching rows from the left table.

• Full outer join returns all the rows from both tables.

• Cross join returns the Cartesian product of bot
Answered by AI
Add your answer
Q2. Difference between truncate and delete?
Ans. 
Truncate removes all data from a table, while delete removes specific rows.
• Truncate is faster than delete as it doesn't log individual row deletions.

• Truncate resets the identity of the table, while delete doesn't.

• Truncate can't be rolled back, while delete can be.

• Truncate doesn't fire triggers, while delete does.
Answered by AI
Add your answer

Easy test to pass, just normal aptitude questions and SQL queries

Q1. SQL questions mostly
Add your answer
Q2. .net basics and oops
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Easy questions, duration will be enough to solve all

Easy to moderate level of questions

Q1. Here he asked me some formula around ML, like precision , recall etc
Add your answer

Q1. As my resume was tailored around full stack he asked me questions on MVC, file structure of a project, routes exceptional handling, and OAuth etc
Add your answer