Write an efficient algorithm to check if a string is a palindrome. A string is a palindrome if the string matches the reverse of string. Example: 1221 is a palindrome but not 1121.
Write an efficient algorithm to find K-complementary pairs in a given array of integers. Given Array A, pair (i, j) is K- complementary if K = A[i] + A[j];
Given a large file that does not fit in memory (say 10GB), find the top 100000 most frequent phrases. The file has 50 phrases per line separated by a pipe (|). Assume that the phrases do not contain pipe. Example line may look like: Foobar Candy | Olympics 2012 | PGA | CNET | Microsoft Bing …. The above line has 5 phrases in visible region.
Given array of integers. Output should be an array, where values are multiplications
of all digits in input element but current index.
For example:
int[] input = new int[]{3, 1, 6, 4};
int[] expected = new int[]{24, 72, 12, 18};
//24 = 1 * 6 * 4
//72 = 3 * 6 * 4
//etc..Write a method which will accept HTML string and will strip out all its tags left only text.
Example:
stripHtmlTags("<h1>Hello World!</h1> <p>something</p>") == "Hello World! something"; //truePeter is solving 5 tasks per day. Evan is solving 6 tasks per day.
Peter is 1 task ahead. How many days is Evan needs to overtake Peter by solved tasks?
Answer: 2 days. 1 day to reach Peters level and another to take the lead.
Write function which will take problem solving tempo of Peter and Evan, plus amount of problems Peter is ahead,
and returns days needed to take the lead. If it's impossible to take the lead, return -1.
int daysToOvertake(int aheadSolveTempo, int behindSolveTempo, int tasksDelta);
daysToOvertake(3,5,1) == 1;
daysToOvertake(4,5,1) == 2;
daysToOvertake(6,5,1) == -1;Write simple least frequently used cache.