Placement Forum
Photo of sunset

Abhishek Prasad

CSE

Year Of Graduation : 2015

  • Round 1 Written Test

    Experience :

    I will share only the 2 coding questions that we got.
    The online test comprised of 20 MCQs from programming,OS,computer networks and a few from aptitude as well.
    There were 2 coding questions which can be coded in c/c++/java.
    Platform - HACKERRANK


    Few MCQ's which i remember are:
    1) Given a pre-order traversal of binary tree . what will be its post order?

    2) CP of 12 item is equal to SP of 16 items . what is the loss %?

    3) How many wrong combination are there for a 3 number - number lock?number are between 0 to 9

    4) Char * str = NULL;
        strcpy(str,"Hello World");
        printf("%s",str);
        What would be the output of the code (NULL, Compilation error, Hello world, or no output)
    CODING QUESTIONS:
    1) In the given string find the first letter which occurs only once in the string. If no such letter exists then return the string "NONE"

    For example "abcabdef"
    ans is 'c'.
    2) In a binary tree, the weight of node is defined as
    weight = value of node + weights of subtrees

    example
            2
           / \
         -1   3


    Weight of root is 2+-1+3=4

    Now we have to find the maximum weight of any node in a binary tree
    In both questions some code is given already and its uneditable.
    We have to just complete a function to find the result.
  • Round 3 Technical Interview

    Experience :


    INTERVIEW I
    Q.1 Write a program to check is a binary tree is BST?
    http://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/
    Q.2 Write a program to swap Kth node from start with Kth kth node from end ?
    http://www.geeksforgeeks.org/swap-kth-node-from-beginning-with-kth-node-from-end-in-a-linked-list/


    Q.3 Given a sorted array arr[] and a number x, write a function that counts the occurrences of x in arr[]. Expected time complexity is O(Logn).
    http://www.geeksforgeeks.org/count-number-of-occurrences-in-a-sorted-array/

    Q.4 What is process?What is thread? Tell the differences between them?

    Q.5 What are cookies?what is sesion?
    Note: These questions were asked because I did my summer internship in web domain.
    Note: Error free code was required for each coding quesion
    INTERVIEW II
    Interviewer :So from which topic should I ask?
    Me: Any thing except networks.
    Interviewer :I will ask a simple question related to networks.Tell me what happens when you type amazon.com on your browser?
    Ans: http://stackoverflow.com/questions/2092527/what-happens-when-you-type-in-a-url-in-browser

    Q.2 What did you do during internship? Tell each and every thing like mvc, Spring, UI, backend etc?
    What is auth token?(this discussion lasted for 30 min)

    Note: He asked me these things because I interned in a startup which was building reader like kindle and I knew everything about it.

    Q.3 What is heap?How it is implemented?Why array is used in implementing heap? What is the complexities of various function used in heap data-structure?Then he asked me to show heapsort on paper?Practical use of heap?
    http://cs.nyu.edu/courses/spring12/CSCI-GA.3033-014/Assignment3/heap.html
    http://www.geeksforgeeks.org/applications-of-heap-data-structure/


    Q.4 How will you implement heap using binary tree? Will the complexities remain same?what will be the new complexities?
    Note: He told me that I can modify the structure of binary tree little bit.
Photo of sunset

Priyank Jain

CSE

Year Of Graduation : 2015

  • Round 1 Written Test

    Experience :

    I will share only the 2 coding questions that we got.
    The online test comprised of 20 MCQs from programming,OS,computer networks and a few from aptitude as well.
    There were 2 coding questions which can be coded in c/c++/java.
    Platform - HACKERRANK
  • Round 3 Technical Interview

    Experience :


    INTERVIEW I:
    1) The first question I was asked was to traverse a tree in a zig-zag manner. For example

        1
      /   \
     2      3
      \    /  \
       4   5  6
           /     \
         7       8


    output should be 1-3-2-4-5-6-8-7
    (make sure u do a null check even if its not required :p)

    obviously we have to write a bug free code in all questions

    2) Then i was asked to build a heap for a given array of integers step by step.. sounds easy right?
    Then he asked me to write the basic structure of heap and the functions required. I told him beforehand that i ain't that good at heaps' coding so and he was quite supportive and he said its okay you don't need to code it completely.

    Then he asked me to do something so that the complexity of deletion in a heap can be reduced
    The obvious answer for me was to use maps. then this took the discussion to new topic of hashing and stuffs
    he asked me if i knew the backend code of STL maps, obviously i didn't.
    So he asked me not to use STL maps and create my own map which could even work for negative numbers.
    the only stupid idea i could get at that time was to find either the minimum number in the array and shift each number with abs(minimum number) so i gave him this idea and said this also that sir this is inefficient method but i cant think of anything else

    I also suggested to either shift all the numbers by abs(INT_MIN) so now we don't need to search for minimum number in array.

    Then he said he is done asking questions and also said i was pretty good :p
    I was surprised that i wasn't asked anything from my resume or regarding my projects even when i was pretty excited to tell them about my project :D

    Interview 2:

    Second interview was my favourite one because the interviewer was amazingly cool and he made me superb comfortable.

    We started with some fun talk first which made the atmosphere very light for me. and this really helped me to give my best shot at interview

    1) First question he asked was to print k(number of) smallest elements in an unsorted array.
    Within a second i answered this, so he said okay you know it so lets change question

    2) Then he asked me that i was given a file with words in it(you can assume array of strings). now i had to print the frequencies of words in order of their occurrences. remember complexity of everything matters here. O(n)!=O(2*n)
    ans he also asked me to code this.
    then he asked me what if the file is very huge and it has lots and lots of repeated words(imagine frequency of one word to be around 10^4), so he asked me suggest a data structure which could reduce complexity.

    3) a tree is given and suppose you are looking at it from left side, so print all the visible nodes...example

            1
         /   \
         2     3
       /   \ /   \
      9   4 5   6
         /   /    \
        10   7    8
               \
                11

    ans---->   1-2-9-10-11

    I was asked to code it.. he told me there was something wrong in the code but i was pretty confident that it was correct and bug-free. so i challenged him that he can't find any error in this. He was impressed by this and tried to find some small mistake.. He couldn't so he started making jokes :p

    4) then he asked me few questions on OS
    - what is paging and how it is done
    - what are threads and how are they different from process

    This interview was the best one i had. It was amazing. Thanks to interviewer :p
    And again i wasn't asked anything regarding projects and resume :(
    at the end he said he doesn't think there was any need to ask from resume.
    He even gave me a hint that i was selected :D
Photo of sunset

Akshat Singhal

CSE

Year Of Graduation : 2015

  • Round 1 Written Test

    Experience :

    I will share only the 2 coding questions that we got.
    The online test comprised of 20 MCQs from programming,OS,computer networks and a few from aptitude as well.
    There were 2 coding questions which can be coded in c/c++/java.
    Platform - HACKERRANK
  • Round 3 Technical Interview

    Experience :


    The interviewer first asked me the language I was most comfortable in? (my answer C and C++)
    He then asked me why I preferred C++ over C.

    Then he looked over my Resume and asked me about my projects.
    He wasn't much interested in the exact terms and technical details but rather how had we implemented and tested them. He also asked if I was using the projects made in our daily lives.

    The next thing I was asked was regarding data structures.
    1) Creation and Insertion in a heap (and it's various types)
    2) What is a RB tree and how it works
    3) B Trees and AVL trees
    4) Height balanced trees

    I was then asked to write a code to insert an element in a doubly linked list at the kth position (I forgot to check if the passed root node is NULL or not)
    Then he asked me about how STL classes work in the backend
    I wasn't asked a single algorithmic or application based question.(Just my luck)
Photo of sunset

Hitesh Sethi

CSE

Year Of Graduation : 2015

  • Round 1 Written Test

    Experience :

    I will share only the 2 coding questions that we got.
    The online test comprised of 20 MCQs from programming,OS,computer networks and a few from aptitude as well.
    There were 2 coding questions which can be coded in c/c++/java.
    Platform - HACKERRANK
  • Round 3 Technical Interview

    Experience :


    My Interview started with a behavioral question : Tell me about yourself and then about your project during my internship.
    (he also asked me to explain him the project in layman way as far as possible)
    Then he asked me following questions:
    1)In 3-d plane earth is there and M stars are there. I had to tell the first nearest N stars.
    I used merge sort first, then he asked why I haven't used any other sorting too.
    Follow-up: You can't store all M stars in memory.
    My Solution: Max heap of size N. Then Replace root with the new distance calculated if it is smaller than root. He was satisfied with my approach and then asked to code it.
    Also asked various questions on heaps, its complexity, Why code is like that...etc etc
    2)You are given row wise sorted 2-d Matrix which only contains 1s and 0's. I had to tell the row which contains max number of one's.

    Ex-
    1111000
    1100000
    My 1st Solution: Binary Search for first zero for each row. (solution is obvious I guess)
    Another Solution: Check for the number of ones in the first row. Then Traverse column wise. (Solution is obvious I guess)
    He was satisfied with the approach.
    Then he said your interview process is over and if you have any questions then ask?
    My bad luck, I asked the question which take me to the wrong direction. He perceived that I only know coding and nothing else(OS and networks).
    Then on the way he asked me that How wifi connects with laptop? I gave up.
    I was rejected.
    Tips :

    Never Give up. Try to say something. And your interview is in your hands and obv. Your interviewer :p . Mine was sarcastic and not missed the single opportunity to cross-question me.
    Overall not a good experience for me.:)
Photo of sunset

Kapil Agarwal

ECE QA Engineer

Year Of Graduation : 2012

  • Round 1 Written Test

    Experience :

    Total 4 Questions


    1)Coding - WPA to find kth Largest element in an array such that program has minimum space time complexity

    2)Give Test Scenarios to Test 'Add to Cart' section of Retail Website

    3)WPA to shortlist particular word from a list of words which follows particular pattern

    4)Give Test Data to test a hypothetical system which when feeded with a particular date ,increases the output date by 4
    Tips :

    For 2nd ques i gave 27 scenarios which was still less.So think more..
    In coding questions, what matters is approach & robustness of code in all scenarios.
  • Round 3 Technical Interview

    Experience :

    Technical Interview

    1st Interview - Give Test Scenarios to test a Cricket Bat (Gave 24,still less),What is severity & priority of a bug,Differnet kinds of testing .

    2nd Interview - Questions on Selenium & Appium,some questions on my previous project(N/A for freshers),How to Debug a website if its not loading,Some more questions on giving test scenarios .

    3rd Interview - One Coding question on Link List(Dont remember the ques) .

    Bar Raiser - Design Test Strategy keeping in mind limited no. of resources & strict time line,Prioritizing Manual & Automation efforts,Few more questions from Previous Project,Reason for changing the company .
    Tips :

    All the Interviews went for 1-2 hrs each.Since I had 2.5 yrs experience before going to Amazon,so lots of questions were asked on previous project

    Interviews are not stress Interviews.Interviewers consistently help you to get the answer.Bar raiser is the one where you should focus more as if Bar raiser feels you are not better than 50& of existing employees then he can reject you & all other interviews stand null & void.

    Try to find more relevant interviewing experience of candidates on Internet as questions & no. of Interview rounds vary for experienced proffesional & a fresher.
  • Round 4 HR Interview

    Experience :

    Normal Negotiation on Compensation.Most likely you are gonna accept what they are offering