Leetcode 203 Remove Linked List Elements
A useful tool: sentinel node
Mar 5, 20243 min read24
Command Palette
Search for a command to run...
Series
Leetcode
This is a blog series dedicated to simplifying LeetCode challenges using JavaScript. Get ready to sharpen your skills, one problem at a time!.
Leetcode 206. Reverse Linked List
Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input: head = [1,2] Output: [2,1] Example 3: Input: head = [] Output: [] Constraints: Th...
Mar 6, 20244 min read17
Leetcode 24 Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.) Example 1: Input: head = [1,2,3,4] Output: [2,1,4,3] E...
Mar 7, 20243 min read10
Leetcode 19 Remove Nth Node From End of List
Given the head of a linked list, remove the n<sup>th</sup> node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Example 2: Input: head = [1], n = 1 Output: [] Example 3: Input: head = [1,...
Mar 8, 20244 min read30
Leetcode 142. Linked List Cycle II
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Inte...
Mar 10, 20243 min read5
Leetcode 242. Valid Anagram
Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: In...
Mar 11, 20243 min read16