Within 2-3 hours write a program that reads words from a large file, counts how many times an individual word occurs and output them in the order of decreasing number of occurrences. The language doesn't matter, just negotiate the programming environment you prefer in advance.
Given a sequence consisting of letters and numbers, re-arrange the sequence so that the numbers come together first, while maintaining their initial order in the sequence (not allowed to use additional memory) e.g. Input : 12gh45fd3, Output : 12453ghfd
The 2-minutes part is a bit unexpected, I am not a native language speaker, I read a bit slow, so I can only finish about 60% percent of the questions.
Choose any programming language of your choose and write a for loop that counts backwards from 10.
Find the dominator in an array.
Implement a method 'find' that will find the starting index (zero based) where the second list occurs as a sub-list in the first list. It should return -1 if the sub-list cannot be found. Arguments are always given, not empty. Sample Input 1 list1 = (1, 2, 3) list2 = (2, 3) Sample Output 1 1 Explanation As second list (2, 3) is sub-list in first list (1, 2, 3) at index 1 Sample Input 2 list1 = (1, 2, 3) list2 = (3, 2) Sample Output 2 -1
given numbers 1 4 2 0 2 0, move all zeros to beginning using minimum sorting technique
Given a list 1,0,3,5,0,0,34,5,0,36 push all the zeroes to the end. Develop an in-place algorithm
How do you detect for the first repeated character in a string? How do you detect whether or not a word is a palindrome?
How would you test if a binary tree were symmetrical and balanced.
Viewing 391 - 400 interview questions