Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1] has the largest sum = 6.
Desarrollador Web Java Senior Interview Questions
98,188 desarrollador web java senior interview questions shared by candidates
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
Did you bring the presentation that we did not ask you to bring?
Read whatever questions you can see on Google for your profile.
Find the sqrt of a number
Write a program to find out the duplicates in the given list of objects. Explain the time complexity of your solution (Big O Notation)
Python question: what is the difference between "[x for x in range(3)]" and "(x for z in range(3))"
When was a time you were most dissatisfied in your career?
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.
Multiply 2 long numbers without using multiplication.
Viewing 281 - 290 interview questions