Chaayos Software Developer Interview Questions and Answers

Q1. Arrays problems
Add your answer
Q2. Sliding window problem
Ans. 
Sliding window problem involves finding a subarray of fixed size k with maximum sum.
• Use a sliding window approach to iterate through the array and calculate the sum of each subarray of size k.

• Keep track of the maximum sum encountered so far.

• Move the window by one element at a time and update the sum accordingly.

• Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and k = 3, the subarray with maximum sum is [5, 3, 6] with su
Answered by AI
Add your answer

2 coding questions from dsa. one quest was from trees ds

Q1. Why did you choose target
Add your answer
Q2. Minus points in you that you can share with us
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Medium

This was the technical round, held around at 10 AM IST on Google Meet.
Firstly she greeted me and asked me to tell something about myself, to which I introduced myself, explaining my academic and some projects also.
After that we moved on to the Hackathon project, which was smart cart self-checkout system. I explained the project along with the code, wherever necessary.
Every word you say while explaining should be clear to you.I used Firebase and SQL while explaining my project, to which she asked some questions related to it, 
Then she moved to the DBMS part, types of joins,what is indexing, how to approach if you were to design a payment system.
At last she asked me some Data Structure questions, which were of medium complexity

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list given the position 'K'.
• Traverse the list to find the length 'N' of the linked list.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Traverse the list again and remove the node at the calculated position.
Answered by AI
Add your answer
Q2. 
House Robber Problem Statement
Consider Mr. X, a professional robber who is planning to rob houses along a street. These houses are arranged in a circle, which means the first house is a neighbor to the l...read more
Ans. 
House Robber problem where adjacent houses have connected security system, find maximum money Mr. X can rob without triggering security.
• Use dynamic programming to keep track of maximum money robbed at each house.

• At each house, decide whether to rob the current house or skip it based on maximum money robbed so far.

• Handle the circular nature of houses by considering two cases: robbing the first house and not robbing the ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The interviewer was very frank and cheerful. This was held at 2:30 PM IST on Google Meet.
He firstly greeted me and asked me how I was doing.
How was my previous round, any technical difficulties?
Then he asked me to introduce myself.
He started telling about his journey to Lowe's and his technical background.
Then he asked some HR related questions

Basic java question, design questions, 1 data structure question

Q1. Asked puzzle and previous project experience
Add your answer
Q2. Monitor microservices using Spring actuator
Ans. 
Spring Actuator provides endpoints to monitor and manage microservices in a Spring Boot application.
• Add Spring Boot Actuator dependency in pom.xml

• Enable Actuator endpoints in application.properties or application.yml

• Access Actuator endpoints like /actuator/health, /actuator/info, etc.

• Customize Actuator endpoints using configuration properties
Answered by AI
Add your answer
Q3. How webflux works
Ans. 
Webflux is a reactive programming framework for building non-blocking, event-driven applications on the JVM.
• Webflux is part of the Spring Framework and provides support for reactive programming.

• It allows developers to build asynchronous, non-blocking applications that can handle a large number of concurrent connections.

• Webflux uses Project Reactor, a reactive library for building reactive applications.

• It supports both ...read more
Answered by AI
Add your answer

The test was quite simple but the interviewer was not ready to accept the solution. Even with complete dry run and working output he denied the solution giving a very vague reason.

Q1. In this design round , they asked me to demonstrate how to build cowin app. Gave a complete overview including HLD and LLD for each showcased feature still got negative response.
Add your answer

Q1. Coding round related to Android
Add your answer

Q1. Current project in detail
Add your answer

Q1. Why string arr immutable
Ans. 
String arrays are immutable because they cannot be changed once created.
• Strings in an array cannot be modified individually

• Any changes to a string array result in a new array being created

• Immutable arrays ensure data integrity and prevent unintended side effects
Answered by AI
Add your answer
Q2. How we can create a custom immutable class
Ans. 
To create a custom immutable class, use final keyword for class, private final fields, and no setter methods.
• Use the final keyword for the class to prevent inheritance

• Declare all fields as private and final to prevent modification

• Do not provide setter methods for the fields to maintain immutability

• Provide getter methods to access the fields
Answered by AI
Add your answer

2 DSA questions and some MCQ on Java and Spring

Q1. Longest palindromic substring
Ans. 
A palindromic substring is a string that reads the same forwards and backwards.
• Use dynamic programming to find the longest palindromic substring.

• Start by considering each character as the center of a potential palindrome.

• Expand outwards from each center to check for palindromes of odd and even lengths.
Answered by AI
Add your answer
Q2. Remove duplicates in place from a 1D array
Ans. 
Remove duplicates from a 1D array of strings in place
• Iterate through the array and use a HashSet to keep track of unique elements

• Replace duplicates with null or an empty string to remove them in place
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Search min element in a rotated sorted array with duplicate elements
Ans. 
Search for the minimum element in a rotated sorted array with duplicate elements.
• Use binary search to find the minimum element in the rotated sorted array.

• Handle the case where duplicate elements are present by adjusting the search conditions.

• Consider cases where the array is not rotated or contains only one element.
Answered by AI
Add your answer
Q3. Ways of declaring singleton class
Ans. 
A singleton class is a class that can only have one instance created throughout the application.
• Declare a private static instance variable of the class

• Create a private constructor to prevent external instantiation

• Provide a public static method to access the instance
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Behavioural questions
Add your answer