Question Implement wildcard pattern matching with support for ‘?’ and ‘*’. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence). The matching should cover the entire input string (not partial). The function prototype should be: bool isMatch(const char *s, const char *p) This question is provided by LeetCode.
QUESTION Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once. This question is provided by Leetocode.
QUESTION Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a time Each intermediate word must exist in the dictionary Note: Return 0 if there is no such transformation sequence. All words have the same Read the full article…
QUESTION Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’. A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region . This question is provided by Leetocode.
QUESTION Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. This question is provided by Leetocode.
Question Implement regular expression matching with support for ‘.’ and ‘*’. This question is provided by LeetCode.
QUESTION Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. This question is provided by LeetCode.
QUESTION The n-queens puzzle is the problem of placing n queens on an n*n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. Each solution contains a distinct board configuration of the n-queens’ placement, where ‘Q’ and ‘.’ both indicate a queen and Read the full article…
QUESTION Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. For example: Given array A = [2,3,1,1,4] The minimum number Read the full article…
QUESTION Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. This question is provided by LeetCode.