## Linked List Deletion

Given a singly linked list node, and an integer target, return the same linked list with all nodes whose value is target removed.

Given a singly linked list node, and an integer target, return the same linked list with all nodes whose value is target removed.

Given a list of [x, y] coordinates in a Cartesian plane, return whether the coordinates form a straight line segment.

You are given integers n, a and b. You are standing in a line of n people. You don’t know which position you’re in, but you know there are at least a people ...

You are given three positive integers n, lower, and upper. You want to create a list of length n that is strictly increasing and then strictly decreasing and...

Given a string s, return the lexicographically smallest string that can be made if you can make at most one swap between two characters in the string.

Given a binary tree root return a level order traversal of the node values.

Given a binary tree root, convert it to a singly linked list using level order traversal.

Given a binary tree root, return values of the nodes in each level, alternating from going left-to-right and right-to-left.

Given a singly linked list node, return its length. The linked list has fields next and val.

Given a binary tree root, find the value of the deepest node. If there’s more than one deepest node, then return the leftmost one.

Given a binary tree root, return the leftmost node’s value on each level of the tree.

Given a binary tree root, return whether all leaves are at the same level.