MTS 1

You are given a singly Linked List of integers. Your task is to return true if the given singly linked list is a palindrome otherwise returns false.

For example:

The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.

It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward​.

Follow Up:

Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?

I was given an array of numerical strings and a window size K . I had to find out the maximum number formed in the k-size window by adding the digits of the numerical string.

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .

Return true if the given string 'S' is balanced, else return false.

For example:

'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.

Given N pairs of parentheses, write a function to generate and print all combinations of well-formed parentheses. That is, you need to generate all possible valid sets of parentheses that can be formed with a given number of pairs.

Questions on Normalization, keys, ACID properties, Concurrency, and transactions.
SQL queries.

Question on how an HTTP protocol works, process when a URL is hit.

Questions related to react and java script were asked which includes designing a component in react, DOM, virtual DOM, significance of redux etc.

Introduce Yourself.

Why do you want to join us?