OneDirect Interview Process

Position Software Engineer 1 (Experience 1-2 years)
1. Resume Screening Round
2. Assignment Round
3. Technical Round
4. Technical + Managerial Round

First round is telephonic round including questions from project and technology you have worked on and some questions are
What you do to learn new technology?
which technology you are passionate about?
What are your responsibilities/role in the current project?
Explain the modules you have worked on?
Challenges you faced in your project?
What are your achievement in current organization?
Rate yourself in Data Structure and Problem Solving Skills?
Why are you looking for change?

Second Round is Assignment round
which included 4 questions( 2 Programming + 2 Design questions)
1. Find the distance between two nodes in Binary Tree.
2. Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .., Sm}
valued coins, how many ways can we make the change?
For example, for N = 4 and S = {1, 2, 3}, there are four solutions: {1, 1, 1, 1}, {1, 1, 2}, {2, 2}, {1, 3}. So output should be 4.
For N = 10 and S = {2, 5, 3, 6}, there are five solutions: {2, 2, 2, 2, 2}, {2, 2, 3, 3}, {2, 2, 6}, {2, 3, 5} and {5, 5}.
So the output should be 5 and also print all the solutions.
3. Design the Online Assessment System using java and oops concept.
4. Design the Communication System to send mail, notification. User can send mail to different user at one time and receive multiple notification. Design High Level Design and Low Level Design.

Third round and Fourth round  some technical questions
Introduction, basic questions from technology you have mentioned in your resume and some more programming questions
1. If there is device whose result is not specific . It’s result is changing all time. so result is calculated by counting the longest common sequence be get in result.
for eg:
result = {true, false, true, false, true, true, true, false}
count the longest sequence of “true”
output=3

result = {true, true, true, true, false, true, false, true, true, true, false}
output = 4

result = {true, false, true, false, true, false}
output = 1

result = {false, false, false}
output = 0

static void getLongestSeq(Boolean a[], int n)
{
    int max = 0, current = 0;
    for (int k = 0; k < n; k++) {
        if (a[k] == true) {
            current++;
        }
        else {
            if (current > max) {
                max = current;
            }
            current = 0;
        }
    }
    if (max > 0) {
        System.out.print("Count " + max);
    }
    else
        System.out.println("No true result");
    return;
}

2. Connect n ropes with minimum cost.(use priority queue)
3. Clone Linked list with using next and random pointer.
4. How to sort data of 20gb
5. Hashmap implementation using Arraylist
6. Managing Hierarchical Data