Search for a command to run...
Articles tagged with #leetcode-solution
Problem Given a string s consisting of lowercase English characters, determine the total number of distinct non-empty substrings present in the string. A substring is defined as a contiguous block of characters within the string. Two substrings are c...
Problem Given an array of strings words[], find the longest string such that every prefix of it is also present in words[]. If multiple strings have the same maximum length, return the lexicographically smallest one. (link) If no such string is found...
Problem You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons. If you burst the ith balloon, you will get nums[i - 1] * nums[i] * nums[i + ...
Problem Given a wooden stick of length n units. The stick is labelled from 0 to n. For example, a stick of length 6 is labelled as follows: (link) Given an integer array cuts where cuts[i] denotes a position you should perform a cut at. You should p...
Problem Given an array arr[] which represents the dimensions of a sequence of matrices where the ith matrix has the dimensions (arr[i-1] x arr[i]) for i>=1, find the most efficient way to multiply these matrices together. The efficient way is the one...
Problem You are given two strings s1 and s2. Your task is to print all distinct longest common subsequences in lexicographical order. Note: A subsequence is derived from another string by deleting some or none of the elements without changing the ord...