Find k’th node from the end of a linked list
Given a linked list and a positive integer k, find the k’th node from the end of the list.
Tag: Easy
Construct a linked list by merging alternate nodes of two given lists
Given two linked lists, merge their nodes to make one list, taking nodes alternately between the two lists. If either list runs out, all the nodes should be taken from the other list.
Move the front node of a linked list in front of another list
Given a linked list, move its front node in front of another given list.
Remove duplicates from a sorted linked list
Given a linked list sorted in increasing order, write a function that removes duplicate nodes from the list by traversing it only once.
Split nodes of a linked list into the front and back halves
Given a list, split it into two sublists – one for the front half and one for the back half. If the total number of elements is odd, the extra element should go in the front list.
Insert a node to its correct sorted position in a sorted linked list
Given a sorted list in increasing order and a single node, insert the node into the list’s correct sorted position. The function should take an existing node and rearranges pointers to insert it into the list.
Pop operation in a linked list – C, Java, and Python
Write a pop() function that is the inverse of push(). The pop() function takes a non-empty list, deletes the head node, and returns the head node’s data.
Delete a linked list in C/C++
Write a function that takes a linked list, deallocates all of its memory, and sets its head pointer to NULL (the empty list).
Clone a Linked List
Write a function that takes a singly linked list and returns a complete copy of that list.
Find all n-digit binary numbers without any consecutive 1’s
Given a positive integer n, count all n–digit binary numbers without any consecutive 1’s.
Generate binary numbers between 1 to `n` using a queue
Given a positive number n, efficiently generate binary numbers between 1 and n using the queue data structure in linear time.
Run Length Encoding (RLE) Data Compression Algorithm
Run–length encoding (RLE) is a simple form of lossless data compression that runs on sequences with the same value occurring many consecutive times. It encodes the sequence to store only a single value and its count.