Cognizant Interview Questions and Answers

Modified Balanced Parentheses where characters can be matched with any other character.

• Use a stack to keep track of opening characters

• When encountering a closing character, check if it matches the top of the stack

• If it matches, pop from the stack, else return false

• Continue until end of string, return true if stack is empty

Print all possible combinations of strings by picking one character from each string in the array.

• Iterate through each character of the first string and combine it with each character of the second string.

• Repeat the process for all strings in the array to get all possible combinations.

• Use nested loops to generate combinations efficiently.

Java program to calculate date n days after given date without using Date parsing libraries.

• Parse the input date string to extract day, month, and year components.

• Calculate the total number of days represented by the input date.

• Add the specified number of days to the total days calculated.

• Convert the final total days back to day, month, and year components to get the new date.

Use backtracking to find all combinations of numbers in an array that sum up to a given number.

• Start by sorting the array in non-decreasing order to easily identify combinations.

• Use backtracking to recursively find all combinations that sum up to the target number.

• Keep track of the current combination and the remaining sum as you traverse the array.

• Add the current combination to the result when the sum equals the target number.

Print Pythagorean triplets within a given range.

• Iterate through all possible combinations of a, b, and c within the given range

• Check if a^2 + b^2 = c^2 for each combination

• Print the triplets that satisfy the Pythagorean theorem