Conga Solutions Software Engineer Interview Questions and Answers

Q1. Rotate array leetcode question
Add your answer
Q2. Longest palindormic substring
Ans. 
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
• Use dynamic programming to solve this problem efficiently.

• Iterate through the string and expand around each character to find the longest palindrome.

• Consider both odd and even length palindromes.

• Example: Input 'babad', Output 'aba' or 'bab'.
Answered by AI
Add your answer

Q1. Print all the subsequences of a string
Ans. 
Generate all possible subsequences of a given string.
• Use recursion to generate all possible combinations of characters in the string.

• At each step, include or exclude the current character to form subsequences.

• Store each subsequence in an array of strings.
Answered by AI
Add your answer
Q2. Print longest substring with k unique values
Ans. 
Find and print the longest substring with k unique characters in an array of strings.
• Iterate through the array of strings and keep track of the longest substring with k unique characters.

• Use a sliding window approach to efficiently find the longest substring.

• Keep a hashmap to store the frequency of characters in the current window.

• Update the window boundaries based on the number of unique characters.

• Return the longest
Answered by AI
Add your answer

Q1. Behaviour quesions
Add your answer

Q1. General DSA question leetcode style
Add your answer

Q1. Discussion on previous project
Add your answer

It was a machine coding round

Q1. Similar to the other question
Add your answer
Q2. Give an array and an element sort the array with difference of that number to array elements
Ans. 
Sort an array of strings by the difference of a given element to each array element.
• Iterate through the array and calculate the absolute difference between the given element and each array element.

• Sort the array based on the calculated differences.

• Return the sorted array.
Answered by AI
Add your answer

3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round

Q1. Implement an app similar to splitwise
Add your answer

1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION

Q1. React hooks implemetation
Add your answer
Q2. Node event loop
Add your answer

Q1. What is deep copy ?
Ans. 
Deep copy is a copy of an object that duplicates all of its attributes, including nested objects, rather than just copying references.
• Deep copy creates a new object with its own unique memory space.

• Changes made to the original object do not affect the deep copy.

• Deep copy is often used when you need to modify an object without affecting the original.

• Example: Using JSON.parse(JSON.stringify(object)) in JavaScript to crea
Answered by AI
Add your answer