Insert a Node at the Tail of a 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 complexity. Problem Statement You are given the pointer to the head node of … Read more
Dynamic Array 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 complexity. Problem Statement Personal Note : The original problem statement is quite confusing as it is not clear on what we … Read more
Cycle Detection is a coding challenge with medium 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 complexity. Problem Statement A linked list is said to contain a cycle if any node is visited more than once while traversing the … Read more
Sparse Arrays is a coding challenge with medium 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. Problem Statement There is a collection of input strings and a collection of query strings. For each query string, determine how many times it … Read more
If you’re given a string, how do you check if it is a palindrome in JavaScript? Note : A palindrome is a string that if spelled backwards or forwards will be the same. e.g. “level” spelled backwards or forwards is still “level”. Below is the solution I came up with utilizing JavaScript built-in functions. We … Read more