Scribd
Upload
2 views

DSA Coding Tasks Prep Doc

The document outlines the pre-screening test for EPAM's recruitment process, focusing on assessing candidates' problem-solving skills. It lists essential data structures, algorithm techniques, sorting algorithms, string algorithms, searching algorithms, and graph/tree traversal algorithms that candidates should prepare for. Candidates are encouraged to practice on platforms like LeetCode, HackerRank, or HackerEarth to qualify for the test.

Uploaded by

anwarudemy11
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

DSA Coding Tasks Prep Doc

The document outlines the pre-screening test for EPAM's recruitment process, focusing on assessing candidates' problem-solving skills. It lists essential data structures, algorithm techniques, sorting algorithms, string algorithms, searching algorithms, and graph/tree traversal algorithms that candidates should prepare for. Candidates are encouraged to practice on platforms like LeetCode, HackerRank, or HackerEarth to qualify for the test.

Uploaded by

anwarudemy11
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PRE-SCREENING TEST FOR SELECTING

FEARLESS PROBLEM SOLVERS –


EPAM RECRUITMENT PROCESS

As part of the pre-screening activity, we are assessing on candidates problem-solving skills.

There are two problems to solve in this test. The problems may be solved using any of the data
structure and/or algorithm techniques. We would recommend you practice problems in leetcode,
hackerrank or hackerearth, so that you can easily qualify for the recruitment process. Please
learn the following topics. The candidate can prepare with the following topics to appear the
Codility test.

 Data Structures
o Arrays
o Linked Lists
o Doubly Linked Lists
o Maps
o Sets
o Graphs
o Trees
o Queues
o Heaps
o Disjoint Sets
 Algorithm Techniques
o Recursion
o Divide and Concur
o Greedy Method
o Backtracking
o Dynamic Programming
o Union Find
 Sorting Algorithms
o Bucket Sort or Radix Sort
o Bubble sorting
o Merge Sort
o Select Sort
o Quick Sort
 String Algorithms
o Pattern Searching Algorithms
o String Matching Algorithms
o Palindrome Check
o String Transformations
o Regular Expression
o LCS
 Searching Algorithms
o Linear Search
o Binary Search
o Jump Search
o Interpolation Search
o Exponential Search
o Tree-Based Search
o Hash-Based Search
o Trie Search
 Graph and Tree Traversal Algorithms
o DFS
o BFS
o Shortest Path Algorithms
o Minimum Spanning Tree Algorithms
o Connectivity Algorithms
o Topological Sorting
o Cycle Detection

You might also like