Chargebee Software Engineer Interview Questions and Answers

Q1. Edit distance problem
Ans. 
The edit distance problem involves finding the minimum number of operations required to transform one string into another.
• The edit distance problem can be solved using dynamic programming.

• Common operations include insertion, deletion, and substitution of characters.

• Example: Given strings 'kitten' and 'sitting', the edit distance is 3 (substitute 'k' with 's', insert 'g', substitute 'n' with 'g').
Answered by AI
Add your answer
Q2. Light switch puzzle
Add your answer

2 Medium level DSA question

Q1. Mirror binary tree
Add your answer
Q2. Optimally find n^m
Ans. 
Use the exponentiation by squaring algorithm to optimally find n^m.
• Use the exponentiation by squaring algorithm to reduce the number of multiplications needed.

• Divide the exponent by 2 and recursively calculate the result.

• Handle the cases when the exponent is even or odd separately.

• Example: n^5 = n * n^2 * n^2
Answered by AI
Add your answer

A coding test on hackerrank with some basic graph problems

Q1. The interviewer asked about my projects
Add your answer

2 coding , 2 SQL with some quants

Q1. Remove redundant parentheses in a expression
Ans. 
Remove redundant parentheses in a expression
• Identify the innermost parentheses

• Evaluate the expression inside the innermost parentheses

• Replace the innermost parentheses with the evaluated expression

• Repeat until no more redundant parentheses exist
Answered by AI
Add your answer

Q1. Why do you want to join Chargebee?
Add your answer