LeetCode 133. Clone Graph
Description https://leetcode.com/problems/clone-graph/ Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/clone-graph/ Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in…
Description https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ Given a string s and an integer k, return the length of the longest substring of s that contains at most k distinct characters. Example 1: Input:…
Description https://leetcode.com/problems/valid-palindrome-ii/ Given a string s, return true if the s can be palindrome after deleting at most one character from it. Example 1: Input: s =…
Description https://leetcode.com/problems/binary-tree-right-side-view/ Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you…
Description https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/ Given an integer array nums and an integer k, return the maximum length of a subarray that sums to k. If there isn’t…
Description https://leetcode.com/problems/encode-and-decode-tinyurl/ Note: This is a companion problem to the System Design problem: Design TinyURL. TinyURL is a URL shortening service where you…
Description https://leetcode.com/problems/one-edit-distance/ Given two strings s and t, return true if they are both one edit distance apart, otherwise return false. A string s is said to be…
Description https://leetcode.com/problems/letter-case-permutation/ Given a string s, we can transform every letter individually to be lowercase or uppercase to create another string.…
Description https://leetcode.com/problems/excel-sheet-column-title/ Given an integer columnNumber, return its corresponding column title as it appears in an Excel sheet. For example: A ->…
Description https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/ You have n boxes. You are given a binary string boxes of length n, where boxes[i] is ‘0’ if the ith box is empty, and ‘1’ if it contains one ball. In one operation,…