Infoedge Interview – Set 1

Company : Infoedge India (Naukri.com on BSE)

1 written + 3 tech rounds + 1HR

- Written will consist few puzzles, C programs of array and string, sql’s.
- Tech rounds will be on Data structure, SQL, Basic Oops concepts.

Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.

Technical interview:

Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.

Q1. Find loop in link list and remove it.
Q2. In an array of 0′s and 1′s club all 0′s and 1′s together.
Q3. Find the no of set bits in a number.
Q4. In a string find characters that are unique.
Q5. In array find elements that has max occurrences. optimize it?
Q6. Delete a node from link list.
Q7. Find the middle node of link list.
Q8. Insert a node in binary tree (algo).
Q9. Reverse a string.
Q10. Y shape linked list intersection point?
Q11. Frequency of a number in array?
Q12. What is indexing in mysql?
Q13. Query problems on self join?
Q14. Overloading and Overridding?
Q15. Inheritence, Interface, Abstract Class?
Q16. Delete, Drop and Truncate Differnece?
Q17. Hashing?

Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.

Thanks Shivam for sharing your experience. If you would like to contribute, mail us your interview experience at [email protected] or write it here: Google Form . We will like to publish it on CrazyforCode and help other job seekers.

3 Thoughts on “Infoedge Interview – Set 1

  1. jss ejwzbotiv on August 11, 2014 at 7:30 am said:

    program for question 2

    #include
    #include
    #include
    int main()
    {
    int a[9]={1,1,0,1,0,1,0,1,1};
    int i,temp,j=0,c=1;
    for(i=0;i<9;i++)
    {

    j=i+1;
    while(c!=0 && j<9)
    {
    if(a[i]==a[j])
    {
    temp=a[i+1];
    a[i+1]=a[j];
    a[j]=temp;
    c==0;
    }
    j++;
    }
    }

    for(i=0;i<9;i++)
    {
    printf("%d\n",a[i]);
    }

    }

    • experience jss on August 7, 2015 at 8:06 pm said:

      #include
      int main()
      {
      int a[9]={1,1,0,1,0,1,0,1,1},zero=0,one=0;
      int i,temp,j=0,c=1;
      for(i=0;i<9;i++)
      {
      if(a[i]%2==1)
      {
      one++;
      }
      else zero++;
      }
      while(j<zero)
      {
      printf("%d",0);
      j++;
      }
      j=0;
      while(j<one)
      {
      printf("%d",1);
      j++;
      }
      } /*easy approach*/

  2. Akash Tewari on August 8, 2015 at 3:41 am said:

    #include
    main()
    {
    int a[]={1,1,1,0,0,1,0,1,0,0};
    int i,one=0,zero=0;
    for(i=0;i0;one–)
    {
    a[one]=1;
    }
    for(i=zero;i<10;i++)
    {
    a[i]=0;
    }

    }

Leave a Reply to Akash Tewari Cancel reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Post Navigation