Chargebee Senior Sdet Engineer Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Easy

The test had it's webcam on, we were not allowed to go out of the frame.

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
The program calculates the Nth Fibonacci number using a recursive formula.
• The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.

• The program uses a recursive function to calculate the Nth Fibonacci number.

• The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
Answered by AI
Add your answer
Q2. 
Longest Consecutive Sequence Problem Statement
You are provided with an unsorted array/list ARR of N integers. Your task is to determine the length of the longest consecutive sequence present in the array...read more
Ans. 
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
• Sort the array to bring consecutive numbers together

• Iterate through the sorted array and keep track of the current consecutive sequence length

• Update the maximum length if a longer sequence is found
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

The interview was online from home.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
• Iterate through the string from the last character to the first character and append each character to a new string.

• Alternatively, you can use built-in string reversal functions or methods available in your programming language.

• To solve the follow-up question with O(1) space complexity, you can use a tw...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals . 
The interviewer was very understanding and supportive.

2 easy level coding questions to be solved

Q1. One dsa question which needs to be live coded in 45 mins
Ans. 
Implement a function to find the longest substring without repeating characters.
• Use a sliding window approach to track the current substring.

• Utilize a hash map to store the last index of each character.

• Expand the window by moving the right pointer and contract from the left when duplicates are found.

• Example: For input 'abcabcbb', the output should be 3 ('abc').

• Time complexity is O(n) and space complexity is O(min(n, m)...read more
Answered by AI
Add your answer

Q1. Same as first round . But 2 coding questions might be asked
Add your answer

Q1. Did not happen . Don’t know why
Add your answer

4 coding ques + 15 technical aptitude

4 Coding Ques + 10 technical aptitude

Q1. Coding question
Add your answer
Q2. Group by query, dbms
Add your answer

Coding round and level was good, one araay question and two dp questions

Q1. Interview round was also good, questions asked from stack and queues, puzzle, dbms, sql, and dsa problem
Add your answer

Reverse Linked List
Pallindrome of String

Flyover building in team with strength

Aptitude test was there in exam

Coding 3 questions were there in exam

Q1. There were different rounds for different clge students .
Add your answer
Q2. Coding questions were asked
Add your answer

Q1. Move negative elements to right side of array
Add your answer