Connectwise India Senior Software Engineer 1 Interview Questions and Answers

Q1. Previous experience
Add your answer

Scenario based questions

Q1. Java 8 , Microservices, AWS
Add your answer

Q1. Explain Angular life cycle hooks
Ans. 
Angular life cycle hooks are methods that allow developers to tap into specific moments in the component's life cycle.
• There are eight life cycle hooks in Angular: ngOnChanges, ngOnInit, ngDoCheck, ngAfterContentInit, ngAfterContentChecked, ngAfterViewInit, ngAfterViewChecked, ngOnDestroy

• ngOnChanges is called when an input property changes

• ngOnInit is called after the first ngOnChanges

• ngDoCheck is called during every cha...read more
Answered by AI
Add your answer
Q2. Explain data binding in angular
Ans. 
Data binding in Angular is a way to synchronize data between the model and the view.
• Data binding allows for automatic updates to the view when the model changes and vice versa.

• There are three types of data binding in Angular: Interpolation, Property binding, and Event binding.

• Interpolation is used to display data in the view using double curly braces {{}}.

• Property binding is used to set a property of a directive or com...read more
Answered by AI
Add your answer

Few MCQ's and along with couple of SQL scenario questions

Q1. More of the project experience, skillset acquired and willing to learn or not
Add your answer

Q1. More of a skillset related and also the attitude
Add your answer

Q1. Compensation related and also the benefits
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Mcq + Data structures questions

Q1. 
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...read more
Ans. Brute Force Approach
1. Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
2. The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
3. Keep track of the maximum element in the inner loop and print it.
Space Complexity: O(1)Explanation:
O(1) because the extra space being used (looping vari...read more
Answered Anonymously
View 1 more answer

Round duration - 70 minutes
Round difficulty - Medium

Standard System Design round

Q1. Design a Doctor Appointment System and provide some test cases.
Ans. 
Tip 1 : Implement using OOPs 
Tip 2 : Try to tell your approach to the interviewer as much as you can side by side
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Interview of DSA + OOPS + Databse(SQL query) + Operating System

Q1. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. Recursive Approach
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:
O(N), where ‘N’...read more
Answered Anonymously
Add your answer
Q2. What is the difference between CHAR and VARCHAR2 data types in SQL?
View 1 more answer
Q3. What are the various types of constructors in C++?
Add your answer
Q4. What is the difference between overloading and overriding?
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Hr round - normal hr questions + situational 

Thoughtworks community discussion

Q1. Why should we hire you?
Ans. 
Tip 1 : Read all Thoughtworks community page and be honest

Tip 2 : Be open-minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.

Tip 3 : The cross-questioning can go intense sometimes, think before you speak.
Answered Anonymously
Add your answer

Q1. What is treeset and weakhashmap?
Ans. 
TreeSet is a sorted set implementation in Java. WeakHashMap is a hash table-based Map implementation with weak keys.
• TreeSet is implemented using a tree structure and maintains elements in sorted order.

• WeakHashMap is a Map implementation that allows keys to be garbage collected when they are no longer referenced.

• WeakHashMap is useful for caching or memoization where the keys are not always needed and can be garbage coll
Answered by AI
Add your answer
Q2. What is comparable and comparator?
Ans. 
Comparable and Comparator are interfaces used for sorting objects in Java.
• Comparable interface is used to define the natural ordering of objects based on their own class.

• Comparator interface is used to define the ordering of objects based on a separate class.

• Comparable interface has compareTo() method while Comparator interface has compare() method.

• Comparable interface is implemented by the class whose objects need to ...read more
Answered by AI
Add your answer