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.
Choose any programming language of your choose and write a for loop that counts backwards from 10.
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
Find the dominator in an array.
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
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
Implement the MyStack. (A lot of questions about multi-threading) @protocol Stack -(void)pushObject:(nonnull id)obj; -(nonnull id)popObjext; @property(nonatomic,assign)NSInteger count; @end @interface MyStack : NSObject <Stack> @end @implementation MyStack @end
Given a text file containing the text for Hamlet (/usr/share/file.txt), return the top 5 most frequent words with count.
String,String buffer,String builder difference. Can u write your own immutable class n how? hashmap implementation and hashcode(),equals() method he asked me to write 2 logical testing programs with reduced complexity( 0,1,1,2,4,5,3,3,1,0,1 traverse once only n get the duplicate number's along with the count). printing pascal triangle duplicate letter from a string with less complexity reversing words of string individually(this is a tree---o/p: siht si a eert)
Viewing 371 - 380 interview questions