Skip to content

Tag Archives: Rockstand

Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More
Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More
Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More
Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More
Given two unsorted arrays that represent two sets (elements in every array are distinct), find the union and intersection of two arrays. Example:  arr1[] =… Read More
Recently i applied online at rockstand the process took three days to complete. There were 4 rounds for this process at their office. 1st round–… Read More
Given an array and a number K where K is smaller than the size of the array. Find the K’th smallest element in the given… Read More
Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More
Given the root of a Directed graph, The task is to check whether the graph contains a cycle if yes then return true, return false… Read More

Start Your Coding Journey Now!