Optum | SDE-1 | Java Full-stack | Hyderabad | March 2025 [selected]

optum logo
optum
SDE-1 | Java Full-stackHyderabad1.1 years
March 30, 20254 reads

Summary

I was selected for the SDE-1 Java Full-stack role at Optum in Hyderabad after two rounds of interviews. The interviews covered Data Structures & Algorithms, Core Java, Spring Boot, React, SQL, and project-specific behavioral questions.

Full Experience

Current Experience: 1.10 Years College: Tier-2 Previous Organization: One of the MNCs

I got a call from a recruiter through Naukri. Here are the questions I was asked:

1st Round: Buy and sell stock 1: You are given an array 'prices' where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Input: prices = [7,1,5,3,6,4] Output: 5

What is ConcurrentModificationException? How to prevent it? Question about Stream API: Input: javaCopyList sentences = Arrays.asList( "Java is fun", "Java is powerful", "Coding in Java is fun");

Output: {java: 3, is: 3, ...} Calculate word frequency and return the output using Stream API.

What is dependency injection? How many ways can DI be done in Spring Boot? How to handle exceptions in Spring Boot? Write an exception handler class.

Project: How did you ensure 100% accuracy in data migration from oracleDB to postgreSQL?

2nd Round:

Given an array of elements, return a pair with maximum product. Handle negative values. Write an O(n) time complexity solution.

How many React components did you make in your project? What is the Virtual DOM? Write a SQL query to find users who logged in more than 2 times. What challenges did you face in your project? How did you solve them?

Questions about Core Java: What is the static keyword? How to handle exceptions in Core Java?

Verdict: Selected

Interview Questions (11)

Q1
Best Time to Buy and Sell Stock I
Data Structures & AlgorithmsEasy

You are given an array 'prices' where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Input: prices = [7,1,5,3,6,4] Output: 5

Q2
What is ConcurrentModificationException and how to prevent it?
Other

What is ConcurrentModificationException? How to prevent it?

Q3
Calculate Word Frequency using Java Stream API
Other

Question about Stream API: Input: javaCopyList sentences = Arrays.asList( "Java is fun", "Java is powerful", "Coding in Java is fun");

Output: {java: 3, is: 3, ...} Calculate word frequency and return the output using Stream API.

Q4
Dependency Injection and Exception Handling in Spring Boot
Other

What is dependency injection? How many ways can DI be done in Spring Boot? How to handle exceptions in Spring Boot? Write an exception handler class.

Q5
Ensuring Data Migration Accuracy
Behavioral

Project: How did you ensure 100% accuracy in data migration from oracleDB to postgreSQL?

Q6
Find Pair with Maximum Product in an Array
Data Structures & AlgorithmsMedium

Given an array of elements, return a pair with maximum product. Handle negative values. Write an O(n) time complexity solution.

Q7
React Components and Virtual DOM
Other

How many React components did you make in your project? What is the Virtual DOM?

Q8
SQL Query: Users with Multiple Logins
Other

Write a SQL query to find users who logged in more than 2 times.

Q9
Project Challenges and Solutions
Behavioral

What challenges did you face in your project? How did you solve them?

Q10
What is the static keyword in Java?
Other

What is the static keyword?

Q11
How to handle exceptions in Core Java?
Other

How to handle exceptions in Core Java?

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!