EPAM Systems Interview Questions — 43 DSA Problems
43 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked EPAM Systems LeetCode questions for software engineering interviews.
- Valid Parentheses (EASY) — String, Stack
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Two Sum (EASY) — Array, Hash Table
- Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
- Minimum Operations to Make a Uni-Value Grid (MEDIUM) — Array, Math, Sorting, Matrix
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- Longest Common Prefix (EASY) — String, Trie
- Valid Anagram (EASY) — Hash Table, String, Sorting
- Valid Palindrome (EASY) — Two Pointers, String
- Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
- Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
- Maximum Difference Between Node and Ancestor (MEDIUM) — Tree, Depth-First Search, Binary Tree
- Two Sum II - Input Array Is Sorted (MEDIUM) — Array, Two Pointers, Binary Search
- Pow(x, n) (MEDIUM) — Math, Recursion
- 3Sum (MEDIUM) — Array, Two Pointers, Sorting
- Palindrome Number (EASY) — Math
- Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
- Merge Two Sorted Lists (EASY) — Linked List, Recursion
- Reverse String (EASY) — Two Pointers, String
- Reverse Linked List II (MEDIUM) — Linked List
- Rotate Array (MEDIUM) — Array, Math, Two Pointers
- First Missing Positive (HARD) — Array, Hash Table
- Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
- First Unique Character in a String (EASY) — Hash Table, String, Queue, Counting
- Running Sum of 1d Array (EASY) — Array, Prefix Sum
- Merge Intervals (MEDIUM) — Array, Sorting
- Duplicate Emails (EASY) — Database
- String Compression (MEDIUM) — Two Pointers, String
- Binary Search (EASY) — Array, Binary Search
- House Robber (MEDIUM) — Array, Dynamic Programming
- Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
- Reverse Integer (MEDIUM) — Math
- Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
- Partition Equal Subset Sum (MEDIUM) — Array, Dynamic Programming
- Managers with at Least 5 Direct Reports (MEDIUM) — Database
- Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
- Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
- Ugly Number II (MEDIUM) — Hash Table, Math, Dynamic Programming, Heap (Priority Queue)
- To Be Or Not To Be (EASY) —
- Asteroid Collision (MEDIUM) — Array, Stack, Simulation
- Isomorphic Strings (EASY) — Hash Table, String
- Linked List Cycle (EASY) — Hash Table, Linked List, Two Pointers
- Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
ES
EPAM Systems
43 questions tracked43 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 43 of 43 questions
2Hash TableStringSliding Window
4ArrayHash TableStringSorting
6Two PointersStringDynamic Programming
12TreeDepth-First SearchBinary Tree
13ArrayTwo PointersBinary Search
17ArrayTwo PointersDynamic ProgrammingStack+1
23ArrayHash TableDivide and ConquerSorting+4
24Hash TableStringQueueCounting
31ArrayHash TableUnion Find
33ArrayDivide and ConquerSortingHeap (Priority Queue)+1
37ArrayDynamic ProgrammingBreadth-First Search
38Hash TableMathDynamic ProgrammingHeap (Priority Queue)
42Hash TableLinked ListTwo Pointers