Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 300 views

    Nagarro

    Uploaded by

    Kanika Luthra
    The document summarizes a candidate's experience with the first round of an aptitude test for a company called nagarro. It includes 3 coding questions asked in the test: 1) checking if a decimal number forms a palindrome in binary, 2) replacing words of even length >=4 with spaces between halves, and 3) sorting an array of 0s and 1s. The candidate passed this round and proceeded to an interview involving discussing their approaches and coding additional questions testing string matching using an character array and hashing.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Nagarro

    Uploaded by

    Kanika Luthra
    300 views1 page
    The document summarizes a candidate's experience with the first round of an aptitude test for a company called nagarro. It includes 3 coding questions asked in the test: 1) checking if a decimal number forms a palindrome in binary, 2) replacing words of even length >=4 with spaces between halves, and 3) sorting an array of 0s and 1s. The candidate passed this round and proceeded to an interview involving discussing their approaches and coding additional questions testing string matching using an character array and hashing.

    Original Description:

    Nagarro placement data

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document summarizes a candidate's experience with the first round of an aptitude test for a company called nagarro. It includes 3 coding questions asked in the test: 1) checking if a decimal number forms a palindrome in binary, 2) replacing words of even length >=4 with spaces between halves, and 3) sorting an array of 0s and 1s. The candidate passed this round and proceeded to an interview involving discussing their approaches and coding additional questions testing string matching using an character array and hashing.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    300 views1 page

    Nagarro

    Uploaded by

    Kanika Luthra
    The document summarizes a candidate's experience with the first round of an aptitude test for a company called nagarro. It includes 3 coding questions asked in the test: 1) checking if a decimal number forms a palindrome in binary, 2) replacing words of even length >=4 with spaces between halves, and 3) sorting an array of 0s and 1s. The candidate passed this round and proceeded to an interview involving discussing their approaches and coding additional questions testing string matching using an character array and hashing.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 1

    4

    th
    April 2014
    First Round
    It is the usual nagarros apti round which included the mathematical portion and analytical reasoning
    and all. As I was not that much comfortable with the first part of the paper so I attempted the second
    half first which is the reasoning portion. I did attempted few questions from the first part for which I was
    sure. The coding paper included the following questions:-
    Ques 1. Given a decimal number when converted into its binary form forms a palindrome or not.
    Bool IsBinaryPalindrome(int decimalNumber)
    Ques 2. You are given a sentence contained in a given string S. Write a function which will replace all the
    words within the sentence whose length is even and greater than equal to 4, with a space between the
    two equal halves of the word.
    Input:
    Men have become the tool of their tools
    Output:
    Men ha ve bec ome the to ol of their tools
    String ReplaceEvenWord(string S)
    Ques 3. To sort an array containing 0s and 1s in O(n) time.
    For example:-
    Arr[] = {1,0,0,0,1,0,1,1,0,1,1,0}
    Sorted array
    Arr []={0,0,0,0,0,1,1,1,1,1,1}
    After completing this paper I got to know that I have cleared my first paper and I have to move forward
    for the interview.
    The questions asked by the interviewer:
    The interviewer first asked me the questions I did, my approaches. Dry run with few examples. Then he
    asked me to code few questions for him.
    Given array of characters and a string we need to check whether the characters of the string are there in
    the array of characters in the same sequence as that of the string.
    Second question I dont remember but that requires the application of hashing.

    You might also like