id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 1 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n \n vector<int> a(26);\n vector<int> target(26);\n \n for(auto x:word2)\n {\n target[x-'a']+=1;\n }\n \n long long ans=0;\n \n ... |
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 1 | {
"code": "class Solution {\npublic:\n long long a[27];\n long long m[27];\n bool check() {\n for (int i = 0; i < 26; i++) {\n if (m[i] < a[i]) return false;\n }\n return true;\n }\n long long validSubstringCount(string w, string word2) {\n for (int i = 0; i < wor... |
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 1 | {
"code": "class Solution {\npublic:\n long long a[27];\n long long m[27];\n bool check() {\n for (int i = 0; i < 26; i++) {\n if (m[i] < a[i]) return false;\n }\n return true;\n }\n long long validSubstringCount(string w, string word2) {\n for (int i = 0; i < wor... |
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 2 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n vector<int> v(26);\n for (char c : word2) {\n ++v[c - 'a'];\n }\n long long r = 0;\n const int n = word1.length();\n vector<vector<int>> p(n + 1, vector<int>(26)... |
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 2 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n \n vector<int> a(26);\n vector<int> target(26);\n \n for(auto x:word2)\n {\n target[x-'a']+=1;\n }\n \n long long ans=0;\n \n ... |
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 2 | {
"code": "\nclass Solution {\n int helper(vector<vector<int>>& pre, vector<int>& f, int p) {\n int l = p, r = pre.size() - 2, res = pre.size() - 1;\n auto check = [&](int x) {\n for(int i = 0; i < 26; i++) {\n if(pre[x+1][i] - pre[p][i] < f[i]) return false;\n }\... |
3,573 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 3 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n int freq[26] = {0};\n for(auto ch : word2) freq[ch - 'a']++;\n int n = word1.size();\n vector<vector<int>> prefix(n, vector<int>(26, 0));\n for(int i = 0; i < n; i++) {\n ... |
3,572 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 0 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n int freq[26] = {0};\n for(auto ch : word2) freq[ch - 'a']--;\n long long n = word1.size();\n int r = 0, l = 0;\n int ct = 0;\n for(auto it:freq) if(it==0) ++ct;\n lo... |
3,572 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 1 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n int freq[26] = {0};\n for(auto ch : word2) freq[ch - 'a']--;\n long long n = word1.size();\n int r = 0, l = 0;\n long long res = n * (n + 1) / 2;\n \n while(r < n) {... |
3,572 | <p>You are given two strings <code>word1</code> and <code>word2</code>.</p>
<p>A string <code>x</code> is called <strong>valid</strong> if <code>x</code> can be rearranged to have <code>word2</code> as a <span data-keyword="string-prefix">prefix</span>.</p>
<p>Return the total number of <strong>valid</strong> <span d... | 1 | {
"code": "class Solution {\npublic:\n long long validSubstringCount(string word1, string word2) {\n \n vector<int> a(26);\n vector<int> target(26);\n \n for(auto x:word2)\n {\n target[x-'a']+=1;\n }\n \n long long ans=0;\n \n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.