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
technologies, not algorithms nor data structures
Given an array of numbers, create another array of numbers. Calculate each new array number by multiplying all input array numbers, except for the current number position in the new array.
Input is a string like "AAAAABBCCAA" and it should print "5A2B2C2A". 5 being the continuous number of occurance for character 'A'. Same is with other characters also.
You are given a circular road with petrol pumps at regular intervals & you know the average of your car. Each petrol pump has given certain quantity of petrol. Now you need to find if you can complete that circle & from which point i.e. petrol pump you need to start.
How would you scale access to a system like Twitter
General Java Questions which one can see over the Internet.
I have been asked about Technologies, Clean Code, Software Architecture and more detail discussion on my resume and software architecture and also some challenging scenarios to be discussed. It took almost 2 hours
Read whatever questions you can see on Google for your profile.
1) Update the existing map without creating another map. 2) Write code to show the deadlock. 3) Find the maximum number from the given array. 4) Write the signature of service returning all the records from the provided table. 5) Explain about the Json format.
Viewing 11 - 20 interview questions