Find Merge Point of Two Lists is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n2) time and O(1) space. Problem Statement Given pointers to the head nodes of 2 linked lists that merge together at some point, find … Read more
Delete duplicate-value nodes from a sorted linked list is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement You are given the pointer to the head node of a sorted linked … Read more
Merge two sorted linked lists is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(n) space. Problem Statement Given pointers to the heads of two sorted linked lists, merge them into a single, sorted … Read more
Get Node Value is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement Given a pointer to the head of a linked list and a specific position, determine the data value … Read more
Compare two linked lists is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement You’re given the pointer to the head nodes of two linked lists. Compare the data in the … Read more