Oracle Interview Question for Senior Software Development Engineers

Country: India
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
of 0 vote

I think Question 2 would be like this-

Prove that complexity for searching in arraylist is o(1) and adding is o(n).

Please make sure question is correct or not

- Deval Mehta August 05, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 vote

class MaxProfit{
	public static int maxProfit(int[] stockPrices){
		int profit = 0;

		for(int i=0; i<stockPrices.length-1;  ++i)
			for(int j=i+1; j<stockPrices.length;  ++j)
				if(profit < stockPrices[j] - stockPrices[i])
					profit = stockPrices[j] - stockPrices[i];

		return profit;

	public static void main(String[] args) {
		int[] stockPrices = {8, 6, 3, 1, 10, 6, 20, 7};
		// int[] stockPrices = {8, 6, 3, 2, 1};


- Simon March 27, 2019 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More