Coding Round
This is an online coding round conducted on CodeChef and generally consists of 2 to 3 questions. One needs to pass through maximum successful test cases to make it to the next technical rounds. Few questions that one can refer to are:
- Standard 0/1 knapsack problem.
- Given a binary tree in the form of an array such that 1st element is root. For a node i, 2*i is the left child and 2*i+1 is the right child if they exist, considering 1-based indexing. Now each node has a value, the ith node has value A[i]. You need to tell max sum path between any 2 leaf nodes.
Directi Recruitment Process
This article will give you information about the company, its recruitment process, sample questions that have been asked previously, lots of experiences shared by other aspirants, and the portal where you can apply.
Table of Content
- About the Company:
- Recruitment Process:
- MCQ Round (Additional for Operation Engineers):
- Coding Round:
- Technical Rounds:
- HR-cum-Technical Round: