LeetCode 44. Wildcard Matching
Description https://leetcode.com/problems/wildcard-matching/ Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/wildcard-matching/ Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any…
Description https://leetcode.com/problems/task-scheduler/ Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different…
Description https://leetcode.com/problems/design-add-and-search-words-data-structure/ There is an undirected graph with n nodes, where each node is numbered between 0 and n – 1. You are given a 2D array graph,…
Description https://leetcode.com/problems/design-add-and-search-words-data-structure/ Design a data structure that supports adding new words and finding if a string matches any previously added…
Description https://leetcode.com/problems/binary-search-tree-iterator/ 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…
Description https://leetcode.com/problems/read-n-characters-given-read4/ Given a file and assume that you can only read the file using a given method read4, implement a method to…
Description https://leetcode.com/problems/binary-tree-vertical-order-traversal/ Given the root of a binary tree, return the vertical order traversal of its nodes’ values. (i.e., from top to bottom, column…
Description https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/ Given the root of a binary tree, return the lowest common ancestor of its deepest leaves. Recall that: The node of a…
Description https://leetcode.com/problems/find-all-anagrams-in-a-string/ Given two strings s and p, return an array of all the start indices of p‘s anagrams in s. You may return the answer…
Description https://leetcode.com/problems/divide-two-integers/ Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor.…