Optimized solution for Finding length of Linked List.

[Kolwankar-Siddhiraj]

[SSoC'23] The Time Complexity of currently written solution for finding length of linked list is O( n ). I want to optimize this solution and bring time complexity as low as O( n/2 ).

Please assign me this issue.

[Kolwankar-Siddhiraj]

I have written a optimized solution for this issue. And reduced time complexity of finding length of linked list from O(n) to O(n/2).

Please assign me this issue because I have solution ready to merge for this issue.

[Khushi-74]

I have a proper approach with explanation please assign me this under ssoc'23

[Soumya6Tiwari]

@Kumar-laxmi sir kindly assign me this issue, I can code this using c, c++

[Soumya6Tiwari]

I have written a optimized solution for this issue. And reduced time complexity of finding length of linked list from O(n) to O(n/2).

Please assign me this issue because I have solution ready to merge for this issue.

Please correct me as I may be wrong but I think time complexity O(n/2) is equivalent to O(n) only as here the factor 1/2 is constant so O(kn) =O(n)

[Kolwankar-Siddhiraj]

I have written a optimized solution for this issue. And reduced time complexity of finding length of linked list from O(n) to O(n/2).

Please assign me this issue because I have solution ready to merge for this issue.

Please correct me as I may be wrong but I think time complexity O(n/2) is equivalent to O(n) only as here the factor 1/2 is constant so O(kn) =O(n)

I didn't get your point. Can you please explain to me by giving an example.

[pro-utkarshM]

Please assign me this!

[github-actions[bot]]

Stale issue message