Data Structure/Algorithm Challenger I

[pradeep_agrawal]

Great work Sahana, good going.

I had few more solution, but this is the most optimized option among that. The algorithm has a time complexity of O(n) and very much optimized in terms of space complexity.

-Pradeep

[pradeep_agrawal]

Posting a sample code as per the solution stated by Sahana.

int IsCircle(node* head) {
    node *tmp1;
    node *tmp2;
    int result = 0;        //Specify no circular path exist

    tmp2 = tmp1 = head;
    while((tmp1 != NULL) && (tmp2 != NULL)) {
        //increment tmp1 by 1 and tmp2 by 2
        tmp1 = tmp1->next;
        tmp2 = tmp2->next;
        if(tmp2 != NULL) {
            tmp2 = tmp2->next;
        } else {
            break;
        }

        if((tmp1 == tmp2) && (tmp2 != NULL)){
            result = 1;        //specify existence of circular path
            break;
        }
    }

    return result;
}

-Pradeep