Question 1

Valid Parentheses — EPAM Systems Interview Question

Accepted Answer

"Valid Parentheses" is a easy difficulty problem asked at EPAM Systems interviews. It covers the following topics: String, Stack. You can practice it on LeetCode: https://leetcode.com/problems/valid-parentheses

Question 2

Longest Substring Without Repeating Characters — EPAM Systems Interview Question

Accepted Answer

"Longest Substring Without Repeating Characters" is a medium difficulty problem asked at EPAM Systems 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 3

Two Sum — EPAM Systems Interview Question

Accepted Answer

"Two Sum" is a easy difficulty problem asked at EPAM Systems interviews. It covers the following topics: Array, Hash Table. You can practice it on LeetCode: https://leetcode.com/problems/two-sum

Question 4

Group Anagrams — EPAM Systems Interview Question

Accepted Answer

"Group Anagrams" is a medium difficulty problem asked at EPAM Systems interviews. It covers the following topics: Array, Hash Table, String, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/group-anagrams

Question 5

Minimum Operations to Make a Uni-Value Grid — EPAM Systems Interview Question

Accepted Answer

"Minimum Operations to Make a Uni-Value Grid" is a medium difficulty problem asked at EPAM Systems interviews. It covers the following topics: Array, Math, Sorting, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid

Question 6

Longest Palindromic Substring — EPAM Systems Interview Question

Accepted Answer

"Longest Palindromic Substring" is a medium difficulty problem asked at EPAM Systems interviews. It covers the following topics: Two Pointers, String, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/longest-palindromic-substring

#	Question Title	Difficulty	Frequency	Topics
1	Valid Parentheses	EASY	100.0	StringStack
2	Longest Substring Without Repeating Characters	MEDIUM	100.0	Hash TableStringSliding Window
3	Two Sum	EASY	97.6	ArrayHash Table
4	Group Anagrams	MEDIUM	97.6	ArrayHash TableString+1
5	Minimum Operations to Make a Uni-Value Grid	MEDIUM	97.6	ArrayMathSorting+1
6	Longest Palindromic Substring	MEDIUM	91.8	Two PointersStringDynamic Programming
7	Longest Common Prefix	EASY	84.5	StringTrie
8	Valid Anagram	EASY	84.5	Hash TableStringSorting
9	Valid Palindrome	EASY	79.8	Two PointersString
10	Merge Sorted Array	EASY	79.8	ArrayTwo PointersSorting

Explore 450+ Companies

Companies

EPAM Systems

Want to see more?

EPAM Systems 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

EPAM Systems

Want to see more?

EPAM Systems Interview Questions

Ai Assistant Kas