16 replies to this topic

[varalu]

Given a linked list, find the 5th last element with Time complexity O(n) and minimal space complexity.

Note: If you know the answer and if you feel it is simple also please post the answers so that others will come to know about the answers.

What is a linked list?? /* this is for your further reference and reading */

Quote

In computer science, a linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes. The principal benefit of a linked list over a conventional array is that the order of the linked items may be different from the order that the data items are stored in memory or on disk, allowing the list of items to be traversed in a different order. A linked list is a self-referential datatype because it contains a pointer or link to another datum of the same type. Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow random access. Several different types of linked list exist: singly-linked lists, doubly-linked lists, and circularly-linked lists.

There are various kinds of linked lists available and can be implemented in many languages and in different ways.

Applications of Linked Lists

Quote

Linked lists are used as a building block for many other data structures, such as stacks, queues and their variations.

The "data" field of a node can be another linked list. By this device, one can construct many linked data structures with lists; this practice originated in the Lisp programming language, where linked lists are a primary (though by no means the only) data structure, and is now a common feature of the functional programming style.

Sometimes, linked lists are used to implement associative arrays, and are in this context called association lists. There is very little good to be said about this use of linked lists; they are easily outperformed by other data structures such as self-balancing binary search trees even on small data sets (see the discussion in associative array). However, sometimes a linked list is dynamically created out of a subset of nodes in such a tree, and used to more efficiently traverse that set.

even bad solutions are welcome... .

[pointybirds]

Hmm, presuming a singly linked list where you can't start at the end and work your way back, you could use a circular buffer with 5 elements (e.g. an array that can store the contents of the LL nodes) and traverse the list until you reach the end ... then, the "next" element in your circular buffer is the fifth last.

E.g.:

for (i=0; (e = next element) != null; i++%5) {
buf[i] = e
}
fifth_last = buf[i]

Something like that I guess. You'd also need to initialise your array to null and check for this at the end in case your LL < 5 elements.

[varalu]

yours is a nice solution... Better in usage of memory also. This circular buffer thing is very good.
What is i am giving you a constraint of
1. "NO EXTRA MEMORY"
2. No additional Data structures.

Give a solution with the above constraints.

Small Hint:
Do not make it complex...think very simple. --> for a simple solution.

[sanjay0828]

Ok.. here is a very simple solution

Have two pointers.

Initially, let both the pointers point to the first node of the linked list

Now move one of the pointers to the 5th node of the linked list.
This can be done in O(1) complexity i.e. constant time.

Example:-
1-->2-->3-->4-->5-->6-->7-->8-->9-->10->11-->12

Here, one pointer points to 5 while the other pointer points to 1

Now keep moving each pointer i.e. current node to next node, until the first pointer reaches the end of the linked list i.e. 12
The second pointer will now be pointing to the 5th last element i.e. 8

[jlhaslip]

$item= $array[count($array)-5];

untested

may need to perform this in steps though

$num = count($array);
$n = $num - 5;
$item = $array[ $n ];

[varalu]

@sanjay0828
Good one... the expected solution.

Again... i want a simpler solution. What will be the basic answer that comes to your mind if i give this problem.??
Very basic.. ..

If no answer i will be posting it in my next post.

[iGuest]

Use two variable (sum4 and sum5) to store the sum of last 4 nodes and last 5 nodes respectively. At the end of the loop, the 5th node data = sum5 - sum4.

-Grant

[totrap]

while(ptr->next->next->next->next->next!=NULL)
ptr=ptr->next;

//after loop, ptr points to the fifth last element in the list;

[songs2enjoy]

reverse the list and find the 5th element from the start,

Not simple though just an idea.

Varalu,

Can u plz post what's the simple idea ?

Thanks

[iGuest]

How to find the number of element in circular link list
Data Structures -- Linked List

Hi All,
If I have a circular link list and I want to count the no of element within it.I donot want to use first_pointer==last_pointer method.
Is there any other approach to count the element?

Thanks
Sarkar

-reply by Saugata Kanti Sarkar