Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Merging …
Given an array of n integers where n > 1, nums, return an array output such that output is equal to the product of all the elements of nums …
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only …
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 …
This problem was inspired by this original tweet by Max Howell: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree …
You are given an array x of n positive numbers. You start at point (0,0) and moves x metres to the north, then x metres to the west, x …