Question 1

Reverse Prefix of Word — Optum Interview Question

Accepted Answer

"Reverse Prefix of Word" is a easy difficulty problem asked at Optum interviews. It covers the following topics: Two Pointers, String, Stack. You can practice it on LeetCode: https://leetcode.com/problems/reverse-prefix-of-word

Question 2

Bank Account Summary — Optum Interview Question

Accepted Answer

"Bank Account Summary" is a medium difficulty problem asked at Optum interviews. It covers the following topics: Database. You can practice it on LeetCode: https://leetcode.com/problems/bank-account-summary

Question 3

Longest Common Subsequence — Optum Interview Question

Accepted Answer

"Longest Common Subsequence" is a medium difficulty problem asked at Optum interviews. It covers the following topics: String, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/longest-common-subsequence

Question 4

Longest Substring Without Repeating Characters — Optum Interview Question

Accepted Answer

"Longest Substring Without Repeating Characters" is a medium difficulty problem asked at Optum interviews. It covers the following topics: Hash Table, String, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/longest-substring-without-repeating-characters

Question 5

Sort Colors — Optum Interview Question

Accepted Answer

"Sort Colors" is a medium difficulty problem asked at Optum interviews. It covers the following topics: Array, Two Pointers, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/sort-colors

Question 6

Maximum Subarray — Optum Interview Question

Accepted Answer

"Maximum Subarray" is a medium difficulty problem asked at Optum interviews. It covers the following topics: Array, Divide and Conquer, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/maximum-subarray

#	Question Title	Difficulty	Frequency	Topics
1	Reverse Prefix of Word	EASY	100.0	Two PointersStringStack
2	Bank Account Summary	MEDIUM	100.0	Database
3	Longest Common Subsequence	MEDIUM	73.3	StringDynamic Programming
4	Longest Substring Without Repeating Characters	MEDIUM	64.3	Hash TableStringSliding Window
5	Sort Colors	MEDIUM	64.3	ArrayTwo PointersSorting
6	Maximum Subarray	MEDIUM	64.3	ArrayDivide and ConquerDynamic Programming

Explore 450+ Companies

Companies

Optum

Optum Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Optum

Optum Interview Questions

Ai Assistant Kas