Optum Interview Questions — 6 DSA Problems

5 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Optum LeetCode questions for software engineering interviews.

Reverse Prefix of Word (EASY) — Two Pointers, String, Stack
Bank Account Summary (MEDIUM) — Database
Longest Common Subsequence (MEDIUM) — String, Dynamic Programming
Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming

Interview Prep/Companies/Optum

O

Optum

6 questions tracked5 with solutions

🔍

Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 6 of 6 questions

1

EasyReverse Prefix of Word✓ Our Solution

100

Two PointersStringStack

LeetCode ↗86% acc.

2

MediumBank Account Summary

100

Database

LeetCode ↗52% acc.

3

MediumLongest Common Subsequence✓ Our Solution

73

StringDynamic Programming

LeetCode ↗58% acc.

4

MediumLongest Substring Without Repeating Characters✓ Our Solution

64

Hash TableStringSliding Window

LeetCode ↗37% acc.

5

MediumSort Colors✓ Our Solution

64

ArrayTwo PointersSorting

LeetCode ↗68% acc.

6

MediumMaximum Subarray✓ Our Solution

64

ArrayDivide and ConquerDynamic Programming

LeetCode ↗52% acc.