## One Edit Distance

Given two strings s and t, return true if they are both one edit distance apart, otherwise return false

Given two strings s and t, return true if they are both one edit distance apart, otherwise return false

Given two strings s and t, return the minimum window in s which will contain all the characters in t. If there is no such window in s that covers all characters in t, return the empty string “”.

We are given a binary tree (with root node root), a target node, and an integer value K. Return a list of the values of all nodes that have a distance K from the target node.

Given a string s, find the length of the longest substring without repeating characters.

Given the root of a binary tree and an array of TreeNode objects nodes, return the lowest common ancestor (LCA) of all the nodes in nodes.

Medium Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

HARD Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or […]

Medium Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the constructor. The […]