Important technical questions:
·
You’re given a Boolean 2D matrix, can you find the number of islands?
· Given an array of strings, find if the given strings can be chained to form a circle. A string X can be put before another string Y in circle if the last character of X is same as first character of Y.
· Tell us an efficient data structure for minimizing the following operations if we have an array arr[0 . . . n-1].
· Add a value x to array from index l to r where 0 <= l <= r <= n-1
· Find the value of a specified element of the array arr[i] where 0 <= i <= n-1
· Is {a, n, d} a palindrome? If you are given a random string, is it a palindrome or not?
· Questions on Implementation of AVL tree.