Error
|
|
---|---|
@Ibrahim Nash | 6381 |
@blackshadows | 6329 |
@mb1973 | 5388 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@1905439 | 553 |
@terabaap123 | 508 |
@smitadiwedi1991 | 279 |
@DevanandJayakumar | 250 |
@atishagusain | 244 |
@gupta_10 | 226 |
@shubhamkhullar7 | 224 |
@nipun edara | 224 |
@balunagar | 204 |
@sharmachandan487 | 204 |
@arshjit_singh7 | 190 |
Complete Leaderboard |
Given a singly linked list. The task is to find the length of the linked list, where length is defined as the number of nodes in the linked list.
Example 1:
Input: LinkedList: 1->2->3->4->5 Output: 5 Explanation: Count of nodes in the linked list is 5, which is its length.
Example 2:
Input: LinkedList: 2->4->6->7->5->1->0 Output: 7 Explanation: Count of nodes in the linked list is 7. Hence, the output is 7.
Your Task:
Your task is to complete the given function getCount(), which takes a head reference as an argument and should return the length of the linked list.
Expected Time Complexity : O(N)
Expected Auxilliary Space : O(1)
Constraints:
1 <= N <= 105
1 <= value <= 103
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes