原创 [Leetcode 113, Medium] Path sum II

Problem: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For e

原创 [Leetcode 221, Medium] Maximal square

Problem: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its

原创 [Leetcode 44, Hard] Wildcard match

Problem: mplement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Match

原创 C++ outline and interview questions (2): Pointers

2.1. Contents 2.1.1There are two main issues of pointers: dangling pointers or memory leaking. 2.1.2Generally speaking

原创 [Leetcode 68, Hard] Text Justification

Problem: Given an array of words and a length L, format the text such that each line has exactly L characters and is

原创 [Leetcode 240, Medium] Search a 2D Matrix II

Problem: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following pro

原创 [Leetcode 242, Easy] Valid Anagram

Problem: Given two strings s and t, write a function to determine if t is an anagram of s. For example,s = "anagram"

原创 [Leetcode 227, Medium] Basic Calculator II

Problem: Implement a basic calculator to evaluate a simple expression string. The expression string contains only no

原创 [leetcde 212, Hard] Word Search II

Problem: Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be co

原创 [Leetcode 124, Hard] Binary Tree Maximum Path Sum

Problem: Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For ex