Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.

Interview Questions and Answers :: IpInfusion

Home > Experience Archives > IpInfusion > Interview Question Set 2
First Round (F-2-F) HR Round
    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    Non-Recursive
    ========

    void reverse(struct node ** head)
    {
    struct node* prev = NULL;
    struct node* current = *head;
    struct node* next;
    while (current != NULL)
    {
    next = current->next;
    current->next = prev;
    prev = current;
    current = next;
    }
    *head = prev;
    }
    This trick might help you
    there are three pointer ( prev, current, next)
    next = current*
    current* = prev
    prev = current
    current = next

    if we see from above logic then before = is like top to bottom then bottom to top .
    * marked pointer will have next.

    Recursive
    =======


    struct node * recLinkedList(struct node *head, struct node *prev)
    {
    struct node *tmp = head->next;
    head->next = prev;
    if ( tmp != NULL)
    recLinkedList(tmp, head);

    return head
    }

    int main()
    {
    struct node *head = recLinkedList (head, NULL);
    }
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

First Round (F-2-F) HR Round