Given a binary tree, which is not necessarily balanced, print the nodes in the tree in a level-wise manner. Also, nodes on the same level should be printed on a single line. A modification of the question was added later in which I cannot really add a "level" variable in the structure of the node in the tree.
Implement a method called printNonComments() which prints out a extract of text with comments removed. For example, the input: hello /* this is a multi line comment */ all Should produce: hello all You have access to a method called getNextLine() which returns the next line in the input string.
1. Tell me about yourself 2. Given each abc letter has a value (a=1, b=2, ... , z=26), compute the number of ways one can decode a given integer. e.g. 23 --> 2 [ 2, 3 ; 23 ], 456 --> 1 [ 4, 5, 6 ], 123 --> 3 [ 1, 2, 3 ; 1, 23 ; 12, 3 ]
Your photo-sharing app displays a system notification when the user receives a photo. Your app should display the photo when the user taps the notification. Which of the following do you need to attach to the Notification object that you pass to NotificationManager? A. An Activity reference B. A PendingIntent C. A BroadcastReceiver D. A Fragment transaction
(Phone screen questions) 1. For a given binary tree, print paths from root to all leaf nodes, one path per line. 2. Given a sequence of positive integers "seq" and an integer "total", return whether a contiguous sequence of "seq" sums up to "total". (Onsite interview questions are covered by NDA therefore can't post, but it can be said that the knowledge of data structures and handling edge cases are important for the coding interviews)
Give the count and the number following in the series. for e.g 1122344 first line output : 21221324 next line : 12112211121214 and so on...
Given an unsorted string, determine if it can be presented as a palindrome. 'MMO'-True, 'DOOR'-False
The same list, back to inorder binary tree
Given a collection of words, return a collection of anagrams found in the given collection
You are given a set of numbers 0 - n. Given a k, print all subsets of size k. Give the time complexity of the algorithm.
Viewing 761 - 770 interview questions