ConsultAdd Interview Questions and Answers for Freshers

Find the longest subsequence in a string

• Iterate through the string and keep track of the longest subsequence found so far

• Use a hashmap to store the last index of each character seen

• Update the longest subsequence length when a character is repeated

To implement a queue using a stack, use two stacks and simulate the queue operations.

• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.

Calculate sum of all elements in a given array of strings

• Iterate through the array and convert each element to integer before adding to sum

• Handle edge cases like empty array or non-numeric elements

• Return the final sum after iterating through all elements

A requirement is a specific need or expectation that must be met in order to achieve a desired outcome.

• A requirement is a statement of what a product or service must do or how it must perform.

• Requirements can be functional (what the product must do) or non-functional (how well it must do it).

• Requirements should be clear, concise, and measurable.

• Examples of requirements include: the ability to save and retrieve data, a response time of less than 2 seconds, and compatibility wi...read more

Use a sorting algorithm to move the nose to the front of the LinkedIn list.

• Implement a sorting algorithm that moves the nose to the front of the list.

• Identify the nose in the list and swap it with the first element.

• Update the LinkedIn list with the nose at the front.

Reverse array of strings

• Iterate through the array and swap elements from start to end

• Use two pointers, one at the beginning and one at the end, and swap elements until they meet

Reverse a given string

• Use built-in functions like reverse() or loop through the string in reverse order

• Create a new string and append characters from the original string in reverse order

• Convert the string to an array of characters, reverse the array, and then join it back into a string