id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n public:\n const static int N = 205;\n bool vis[N][N];\n vector<pair<int, int>> fr = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};\n\n int n, m;\n bool corner;\n vector<vector<char>> v;\n vector<pair<int, int>> tr;\n\n bool valid(int i, int j) {\n return !(i < 0 || ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n public:\n const static int N = 205;\n bool vis[N][N];\n vector<pair<int, int>> fr = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};\n\n int n, m;\n bool corner;\n vector<vector<char>> v;\n vector<pair<int, int>> tr;\n\n bool valid(int i, int j) {\n return !(i < 0 || ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n int rows;\n int cols;\n vector<pair<int, int>> region;\n void solve(vector<vector<char>>& board) {\n rows = board.size();\n cols = board[0].size();\n if (rows == 0) return;\n vector<vector<int>> visited(rows, vector<int>(cols, 0));\n ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n\n\nvector<pair<int,int>>sta;\nvoid bfs(vector<vector<char>>& board,int i,int j,int &dis,int&n,int&m,vector<vector<char>>&vt)\n{ \n if(vt[i][j]=='X')\n { return;\n }\n \n sta.push_back({i,j});\n vt[i][j]='X';\n \n\n int arr1[]={1,-1,0,0},arr2[]={0,0,1... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n bool check(vector<vector<char>>& board, const int i, const int j, vector<char*> &v)\n {\n v.push_back(&board[i][j]);\n board[i][j]='A';\n bool edge{false};\n if(i>0)\n {\n if(board[i-1][j]=='O')\n edge=check(board,i-1,j,v... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n bool vis[210][210];\n vector<vector<char>>b;\n int rows,cols;\n int dir[4][4]={{1,0},{-1,0},{0,1},{0,-1}};\n vector<vector<pair<int,int>>>comps;\n void dfs(int i,int j,vector<pair<int,int>>&comp){\n comp.push_back({i,j});\n vis[i][j]=1;\n ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(int x , int y, vector<vector<int>>& visited ,vector<vector<char>>& board){\n if (x >= board.size() || y >= board[0].size() || x< 0 || y<0 || visited[x][y] == 1) return;\n\n if (board[x][y] == 'X') return;\n\n\n visited[x][y] = 1;\n \n\n ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n int xx[4] = {-1,0,1,0};\n int yy[4] = {0,-1,0,1};\n\n void dfs(int i, int j,\n int curr_comp,\n vector<vector<char>>& board,\n vector<vector<int>>& comp,\n unordered_map<int,bool>& region){\n \n int n = board.size();\n int m = boa... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n vector<pair<int, int>> directions = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; \n bool isSafe(int i, int j, int m, int n) {\n if(i<0 or j<0 or i>=m or j>=n) return false;\n return true;\n }\n void dfs(int i, int j, int m, int n, vector<vector<char>>&grid) {\... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\nbool isValid(int n ,int m,int r,int c)\n{\n if(r<0 || c <0 || r >n-1|| c>m-1 )\n {\n return false;\n }\n return true ; \n}\nvoid dfs(int r,int c,vector<vector<char>>&board,vector<vector<int>>&vis,bool &toTake,vector<pair<int,int>>&temp)\n{\n if(vis[r][c]==1)... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n int dir[4][2] = {{0,-1}, {-1,0}, {1,0}, {0,1}};\n\n bool dfs(int i, int j, vector<vector<bool>> &vis, vector<vector<char>> &board){\n vis[i][j] = 1;\n bool ans = 1;\n for(auto k: dir){\n int x = i + k[0];\n int y = j + k[1];\n ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n bool seen;\n void mark(vector<vector<char>>& board,int i,int j,int r,int c)\n {\n if(i<0 || i>r-1 || j<0 || j>c-1)\n return;\n if(board[i][j]=='X')\n return;\n \n board[i][j] = 'X';\n mark(board,i-1,j,r,c);\n mark(b... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n const int UNLANDED = -1;\npublic:\n void solve(vector<vector<char>>& board) {\n n = board.size();\n m = board[0].size();\n if (n <= 1)\n return;\n if (m <= 1)\n return;\n lands = vector<vector<int>>(n, vector<int>(m, UNLANDED... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\n const int UNLANDED = -1;\npublic:\n void solve(vector<vector<char>>& board) {\n n = board.size();\n m = board[0].size();\n if (n <= 1)\n return;\n if (m <= 1)\n return;\n lands = vector<vector<int>>(n, vector<int>(m, UNLANDED... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n void solve(vector<vector<char>>& board) {\n int rows = board.size();\n int cols = board[0].size();\n if (rows == 0) return;\n vector<vector<int>> visited(rows, vector<int>(cols, 0));\n bool surrounded = true;\n vector<pair<int, int>> ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n int rows;\n int cols;\n void solve(vector<vector<char>>& board) {\n rows = board.size();\n cols = board[0].size();\n if (rows == 0) return;\n vector<vector<int>> visited(rows, vector<int>(cols, 0));\n bool surrounded = true;\n v... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic: \n bool isSafe(int i, int j, int m, int n) {\n if(i<0 or j<0 or i>=m or j>=n) return false;\n return true;\n }\n void dfs(int i, int j, int m, int n, vector<vector<char>>&grid) {\n if(grid[i][j] == 'X') return;\n grid[i][j] = 'X';\n vecto... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n void dfs(vector<vector<char>>& board, int line, int col, bool& isOnEdge, vector<int>& visited, vector<pair<int,int>>& region)\n {\n int m = board.size();\n int n = board[0].size();\n if (line < 0 || line >= m || col < 0 || col >= n || board[line][col] ... |
130 | <p>You are given an <code>m x n</code> matrix <code>board</code> containing <strong>letters</strong> <code>'X'</code> and <code>'O'</code>, <strong>capture regions</strong> that are <strong>surrounded</strong>:</p>
<ul>
<li><strong>Connect</strong>: A cell is connected to adjacent cells horizontally o... | 3 | {
"code": "class Solution {\npublic:\n void solve(vector<vector<char>>& board) {\n int rows = board.size();\n int cols = board[0].size();\n if (rows == 0) return;\n vector<vector<int>> visited(rows, vector<int>(cols, 0));\n bool surrounded = true;\n // vector<pair<char, ch... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\n bool ispal ( string s) {\n int n = s.length() ;\n for ( int i = 0 ; i < n/2 ; i ++) if(s[i] != s[n-1-i]) return false ;\n return true ;\n }\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> ans;\n vector<string> t... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n int n = s.length();\n vector<vector<int>> valids(n, vector<int>(1,1));\n for (int i = 2; i <= n; i++){\n for (int j = 0; j <= n-i; j++){\n bool works = true;\n for (int k = 0; k < i/2 && work... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> combs;\n vector<string> comb;\n backtrack(s, combs, comb, \"\", 0);\n return combs;\n }\n\n void backtrack(string& s, vector<vector<string>>& combs, vector<string>& comb, s... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) \n {\n int n = s.size();\n\n auto is_palindrome =[&]( string str )\n {\n string rev_str = str;\n reverse( rev_str.begin() , rev_str.end() );\n return str == rev_str;\n }... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 1 | {
"code": "class Solution {\npublic:\n bool isPalin(string s){\n int start = 0;\n int end = s.size()-1;\n\n while(start < end){\n if(s[start] != s[end]){\n return false;\n }\n start++;\n end--;\n }\n\n return true;\n }... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 1 | {
"code": "class Solution {\npublic:\n\n bool isPalindrome(string temp) {\n string str = temp;\n reverse(temp.begin(), temp.end());\n return str == temp;\n }\n void bt(vector<vector<string>>& res, string s, vector<string>& str, int start) {\n if(start == s.size()) {\n r... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<string>ds;\n vector<vector<string>>ans;\n f(s, 0 ,ds, ans);\n return ans; \n }\nvoid f( string s, int ind , vector<string> &ds, vector<vector<string>> &ans){\n if(ind == s.size()){\n an... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool isPalindrome(string s, int start, int end){\n while(start <= end){\n if(s[start] != s[end]){\n return false;\n }\n start++;\n end--;\n }\n return true;\n }\npublic:\n void solve(int ind... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n static bool checkPalindrome(string currentSubstring,int start,int end){\n if(start>=end) return 1;\n if(currentSubstring[start]!=currentSubstring[end]){\n return 0;\n }\n return checkPalindrome(currentSubstring,start+1,end-1);\n }\n\n... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool isPalindrome(string s, int i, int j)\n {\n while(i <= j)\n {\n if(s[i] == s[j])\n {\n i++;\n j--;\n }\n else\n return false;\n }\n return true;\n }\... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution\n{\npublic:\n vector<vector<string>> partition(const string &s)\n {\n vector<vector<string>> result;\n vector<string> partitioning;\n solve(0, 1, s, partitioning, result);\n return result;\n }\n\nprivate:\n void solve(const int from, const int to, cons... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> result;\n vector<string> current{{s[0]}};\n backtracking(s, 1, current, result);\n return result;\n }\n\nprivate:\n void backtracking(const string& s, int index, vector<str... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool isPalindrom(string s) {\n if(s == \"\") return false;\n\n string rev = s;\n reverse(rev.begin(), rev.end());\n\n if(s == rev) return true;\n else return false;\n }\n\n void getPartitions(\n string &s,\n int n,\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n unordered_map <string,int> mpp;\n bool palin(string& s){\n int i = 0;\n int j = s.size() -1;\n while(i < j){\n if(s[i] != s[j]) return false;\n i++;\n j--;\n }\n return true;\n }\n bool checkpalin(ve... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "string curr;\nvector<string>stt;\nint n;\nstring cur;\nbool is_pal(int i, int j){\n bool ok=1;\n while(i<j){\n if(cur[i]==cur[j]){\n i++;\n j--;\n }\n else{\n return 0;\n }\n }\n return 1;\n}\nvector<vector<string>>ans;\nvoid slv(int ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\nprivate:\n bool isPalindrome(string &s) {\n for (int i = 0; i < s.size()/2; i++) {\n if (s[i] != s[s.size()-1-i])\n return false;\n }\n return true;\n }\n\n void partitionAux(string &s, int left, int right, vector<string> &currPartit... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\nprivate:\n bool isPalindrome(string &s) {\n for (int i = 0; i < s.size()/2; i++) {\n if (s[i] != s[s.size()-1-i])\n return false;\n }\n return true;\n }\n\n void partitionAux(string &s, int left, int right, vector<string> &currPartit... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\nvector<string>temp;\nvector<vector<string>>ans;\nprivate:\n\nbool isPalindrome(string s){\n string t=s;\n reverse(s.begin(),s.end());\n if(t==s) return true;\n return false;\n}\nvoid helper (string s){\n if(s==\"\"){\n ans.push_back(temp);\n return;\n }\n\n... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>>ans;\n bool ispalin(string str){\n string strrev=str;\n reverse(str.begin(),str.end());\n return str==strrev;\n }\n void allPalindromes(string& s,vector<string>&res,int idx){\n if(idx==s.size()){\n ans.push... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\nprivate:\n vector<vector<string>> v;\npublic:\n vector<vector<string>> partition(string s) {\n vector<string> t;\n pr(0, s, t);\n return v;\n }\n\n void pr(int ind, string s, vector<string>& t) {\n if(ind==s.size()) {\n // cout << \"add\"... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\nprivate:\n vector<vector<string>> v;\npublic:\n vector<vector<string>> partition(string s) {\n vector<string> t;\n pr(0, s, t);\n return v;\n }\n\n void pr(int ind, string s, vector<string>& t) {\n if(ind==s.size()) {\n // cout << \"add\"... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> result;\n vector<string> path;\n bool isPal(string s, int start, int end){\n for (int i = start, j = end; i < j; i++, j--) {\n if (s[i] != s[j]) {\n return false;\n }\n }\n return true;\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> ans;\n bool check(string s, int start, int end) {\n while(start <= end) {\n if(s[start] != s[end]) {\n return false;\n }\n start++;\n end--;\n }\n return true;\n }\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool isPan(string &s)\n {\n //cout<<\"s=\"<<s<<endl;\n for(int i=0;i<s.size()/2;i++)\n {\n if(s[i]!=s[s.size()-i-1])\n {\n return false;\n }\n }\n //cout<<\"return true\"<<endl;\n ret... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n const int len = s.size();\n vector<vector<string>> res;\n int gLen;\n\n if (len == 0)\n return {};\n\n res.push_back({string(1, s[0])});\n\n for (int i = 1; i < len; i++) {\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> out;\n vector<pair<size_t, size_t>> temp;\n backtrack(out, s, 0, temp);\n return out;\n }\n\n void backtrack(vector<vector<string>>& out, const string& s, size_t start, vec... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n cur.emplace_back(1,s[0]);\n dfs(s,1);\n return res;\n }\n void dfs(string& s, int i){\n if(cur.size() > 1 and !isPalindrome(*(cur.end()-2))) return;\n if(i == s.size()){ \n if(i... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> ans;\n bool isPalindrome(string &s) {\n int l = 0, r = s.size() - 1;\n while(r > l) {\n if(s[r--] != s[l++]) return false;\n }\n return true;\n }\n void solve(string &s, int idx, int end, vector<string> &r... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> res;\n unordered_set<string> palindromes;\n bool palindrome(string &word) {\n if (word.size() == 0) return false;\n if (palindromes.find(word) != palindromes.end()) return true;\n int n = word.size();\n for (int i = 0; ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> answer;\n vector<string> current;\n current.push_back(s);\n if (checkPalindrome(s)){\n answer.push_back(current);\n }\n backtracking(current, answer);\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool palindrome(string &x) {\n for(int i = 0; i < x.size() / 2; i++) {\n if(x[i] != x[x.size() - i - 1]) {\n return false;\n }\n }\n return true;\n }\n\n bool allPalindrome(vector<string> &v) {\n for(strin... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n std::vector<std::vector<std::vector<std::string>>> table;\n table.resize(s.size() + 1);\n\n std::vector<std::string> last_component_vec;\n table.back().push_back(std::move(last_component_vec));\n\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n std::vector<std::vector<std::vector<std::string>>> table;\n table.resize(s.size() + 1);\n\n std::vector<std::string> last_component_vec;\n table.back().push_back(std::move(last_component_vec));\n\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n void generatePartitions(string &s, vector<string> ¤tPartition, int start, vector<vector<string>> &allPartitions) {\n if (start == s.length()) {\n allPartitions.push_back(currentPartition);\n return;\n }\n\n for (int i = start; i < s.length(); ++i)... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\nprivate:\n bool isPalindrome(const string& s, int start, int end) {\n while (start < end) {\n if (s[start] != s[end]) return false;\n start++;\n end--;\n }\n return true;\n }\n\n vector<vector<string>> res;\n\npublic:\n\n v... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\n void rec(\n int i, \n string s, \n vector<string>& current,\n string undividedStr,\n vector<vector<string>>& res\n ) {\n if (i == s.size()) {\n res.push_back(current);\n return;\n }\n\n undividedStr += s[... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\n void rec(\n int i, \n string s, \n vector<string>& current,\n string undividedStr,\n vector<vector<string>>& res\n ) {\n if (i == s.size()) {\n res.push_back(current);\n return;\n }\n\n undividedStr += s[... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool ispallindrome(string s, int i) {\n\n int n = s.length();\n if (i >= n / 2)\n return true;\n if (s[i] != s[n - 1 - i]) {\n return false;\n }\n return ispallindrome(s, i + 1);\n }\n\n void sol(vector<vector<str... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool isPalindrome(string sub){\n if(sub.size()==1){\n return true;\n }\n stack<char> st;\n for(int i=0;i<sub.size();i++){\n st.push(sub[i]);\n }\n string temp=\"\";\n while(!st.empty()){\n temp+... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\nbool isPalindrome(string s){\n int l = 0, r = s.size()-1;\n while(l <= r){\n if(s[l] != s[r]) return false;\n l++;\n r--;\n }\n\n return true;\n}\nvoid solve(vector<vector<string>> &ans, vector<string> tmp, string s, int n){\n \n for(int i =... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n ans.clear();\n vector<string> cur_partition;\n do_backtracking(s, 0, cur_partition);\n return ans;\n }\nprivate:\n void do_backtracking(string &s, int i, vector<string> &cur_partition) {\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool palindrome(string s) {\n for (int i = 0, j = s.size() - 1; i < j; i++, j--) {\n if (s[i] != s[j]) {\n return false;\n }\n }\n return true;\n }\n vector<vector<string>> partition(string s) {\n vector<v... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string &s) {\n int n = s.size();\n vector<vector<string>> ans;\n\n for(int i = 0; i < (1<<n); i++){\n if(i & (1<<(n-1))){\n bool check = 1;\n vector<string> vec;\n\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> result;\n vector<int> curr_partitions;\n backtrack(1, s, curr_partitions, result);\n return result;\n }\n\nprivate:\n void backtrack(int start, const string& s, vector<int>... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool ispalindrom(vector<string>&vs){\n for(auto str:vs){\n int l=0,r=str.size()-1;\n while(r>=l){\n if(str[l]!=str[r])return false;\n l++;\n r--;\n }\n }\n return true;\n }\n vector<vector<stri... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<string>> finalans;\n vector<vector<string>> finalans2;\n\n bool mypalin(string s){\n int i,n=s.size();\n\n for(i=0;i<n;i++)\n if(s[i]!=s[n-i-1])\n return false;\n\n return true;\n }\n\n\n vector<vector<s... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\n vector<vector<string>> ans;\n bool Pali(string s, int i, int j){\n while(i<j){\n if(s[i]!=s[j]) return false;\n i++;\n j--;\n }\n return true;\n }\n void keepPartitioning(string s, int i, vector<string> cur){\n for... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\n bool check(string s){\n if(s.empty())return true;\n if(s.size()==1)return true;\n if(s[0]==s[s.size()-1]){\n return check(s.substr(1,s.size()-2));\n }\n return false;\n }\n void solve(string s, vector<string> path, vector<vector<stri... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\n bool check(string s){\n if(s.empty())return true;\n if(s.size()==1)return true;\n if(s[0]==s[s.size()-1]){\n return check(s.substr(1,s.size()-2));\n }\n return false;\n }\n void solve(string s, vector<string> path, vector<vector<stri... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\n bool ispalindrome(string& s){\n \n int i = 0 , j = s.length()-1;\n while(i<j){\n if(s[i]!=s[j]){\n return false;\n }\n i++;\n j--;\n }\n return true;\n }\n void sol(vector<string> str,v... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 2 | {
"code": "class Solution {\npublic:\n bool isPal(string &s){\n for(int i=0;i<s.size()/2;i++){\n if(s[i]!=s[s.size()-1-i]) return false;\n\n }\n return true;\n }\n vector<vector<string>> partition(string s) {\n int n=s.size();\n vector<vector<string>>ans;\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> ans;\n\n bool palindrome(int i, int j, string& str) {\n while(i < j) {\n if(str[i] != str[j]) return false;\n i++, j--;\n }\n return true;\n }\n\n void generateStrings(vector<int>& temp, string& s) {\n... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n vector<vector<string>> res;\n vector<string> curr;\n helper(s, 0, curr, res);\n return res;\n }\n\n void helper(string s, int index, vector<string>& curr, vector<vector<string>>& res) {\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool palindrome(string s,int f,int l)\n {\n while(f<=l)\n {\n if(s[f]!=s[l]) \n {\n return false; \n }\n f++;\n l--;\n }\n return true;\n }\n void f(int ind,vector <vect... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool palindrome(string s, int start, int end){\n while(start <= end){\n if(s[start] != s[end]){\n return false;\n }\n start++;\n end--;\n }\n return true;\n }\n\n void function(vector<vector... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> res;\n bool isPalindrome(string s){\n string rev = s;\n reverse(s.begin(), s.end());\n return s == rev;\n }\n\n void helper(string s, int start, int curr, vector<string>& subset){\n if(curr > s.length()){\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\n private:\n bool palindrome(int start,int end,string s)\n {\n string temp=s;\n while(start<end)\n {\n swap(s[start],s[end]);\n start++;\n end--;\n }\n return (s==temp);\n }\n private:\n void solve(int in... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool isPal(string s) {\n int l = 0, r = s.size()-1;\n while(l<r) {\n if(s[l++] != s[r--]) return 0;\n }\n return 1;\n }\n bool isAllPal(vector<string> &temp) {\n for(string str:temp) {\n if(!isPal(str)) return 0;\... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool isPalindrome(string s){\n for(int i = 0; i < s.size(); i++) if(s[i] != s[s.size() - 1 - i]) return false;\n return true;\n }\n\n vector<vector<string>> pp(vector<vector<vector<string>>>& dp, vector<bool>& visited, string& s, int i){\n if(i >= s... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n int N;\n bool dp[16][16];\n vector<vector<string>> st;\n vector<vector<string>> partition(string s) {\n N = s.size();\n for(int i = 0; i < N; ++i) {\n dp[i][i] = 1;\n }\n for(int i = N-2; i >= 0; --i) {\n for(int j = ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n // find all palindromes first (?) and their start and ends\n vector<vector<bool>> isP(s.size(), vector<bool>(s.size(), false));\n for (int i = 0; i < s.size(); i++) {\n isP[i][i] = true;\n }... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n\n bool pali(string s){\n bool check = true ;\n for(int i = 0 ; i < s.length() / 2 ; i++){\n if(s[i] != s[s.length() - 1 - i]){\n return false ;\n }\n }\n return true ;\n }\n \n void solve(string &s , in... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n\n bool pali(string s){\n bool check = true ;\n for(int i = 0 ; i < s.length() / 2 ; i++){\n if(s[i] != s[s.length() - 1 - i]){\n return false ;\n }\n }\n return true ;\n }\n \n void solve(string &s , in... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n\n vector<vector<int>> pal;\n vector<vector<string>> ans;\n\n void palcheck(int i,int j,int n,string& s){\n while(i>=0 && j<n && s[i]==s[j]){\n pal[i][j]=1;\n i--;\n j++;\n }\n }\n\n void solve(int ind,vector<string> t... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool isPalindrome(string a) {\n int i = 0, j = a.length() - 1;\n while(i < j) {\n if (a[i] != a[j]) {\n return false;\n }\n i++; j --;\n }\n return true;\n }\n\n void genPalSub(vector<vector<str... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\n private:\nbool isPalindrome(string&x){\n for(int i=0;i<x.size()/2;i++){\n if(x[i]!=x[x.size()-1-i]) return false;\n }\n return true;\n }\n void helper( vector<vector<string>>&res,string&s,vector<string>z,string x=\"\",int i=0){\n if(i==s.size... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool check(string t)\n {\n int l = 0, r = t.size()-1;\n while(l<r)\n if(t[l++]!=t[r--])\n return false;\n return true;\n }\n\n void part(string s, string t, vector<string> &v, set<vector<string>> &ans, int i, int n, int ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution \n{\npublic:\n vector<vector<string>> partitions;\n bool is_Palin(string& s,int start,int end)\n {\n while(start<end)\n {\n if(s[start]!=s[end])\n return false;\n start++;\n end--;\n }\n return true;\n }\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n Solution() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n }\n bool isPalindrome(string& s, int i, int j) {\n while(j < i) {\n if(s[j++] != s[i--])\n return false;\n }\n return true;\n }\n\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> ans;\n\n bool palindrome(const std::string& s, int i, int j) \n {\n while (i < j) {\n if (s[i] != s[j]) {\n return false;\n }\n i++;\n j--;\n }\n return true;\n }\n\n string substr(string s... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partitions;\n\n /*\n Approach 1: I think this is the same as approach 2 in essence, just more confusing\n \n void backtrack(string s, vector<string> sofar, int idx, int lastidx) {\n if (idx == s.size()) {\n if (lastidx == i... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "\n// template <>\n// struct std::hash<std::array<int, 2>>\n// {\n// std::size_t operator()(std::array<int, 2> & a) const\n// {\n// return ((std::hash<int>()(a[0]) ^ (std::hash<int>()(a[1]) << 1)) >> 1);\n// }\n// };\n\nstruct ArrayHash {\n std::size_t operator()(const std::array<int,... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>>ans;\n bool check(string s,int first , int last)\n {\n if(first >=last)\n {\n return true;\n }\n return ( (check(s,first+1,last-1)) && (s[last] == s[first]));\n }\n void helper(string s,vector<string>te... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool ifPalindrome(string &s)\n {\n int n= s.size(), i= 0, j= n-1;\n while(i < j)\n {\n if(s[i] != s[j])\n return false;\n i++, j--;\n }\n return true;\n }\n \n void doPartition(string &s, vect... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<string>> partition(string s) {\n int n = s.size();\n std::unordered_map<int, std::vector<std::vector<std::string>>> dp{};\n dp[n] = {{}};\n fn(s, dp, 0);\n return dp[0];\n }\n void fn(std::string const& s,\n st... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "#include <stack>\n#include <string_view>\n#include <ranges>\n\nstruct View {\n std::size_t begin;\n std::size_t end;\n};\n\nusing Palindromes = std::vector<View>;\n\nvector<Palindromes> scan(const string& str) {\n vector<Palindromes> res;\n res.emplace_back().emplace_back(View{0, 1});\n for(... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool check(string &t)\n {\n int beg=0;\n int end=t.size()-1;\n while(beg<end)\n {\n if(t[beg]==t[end])\n {\n beg++;\n end--;\n }\n else\n return false;\n ... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "using namespace std;\nclass Solution {\npublic:\n bool checkPal(string s, int st, int end) {\n int i=st, j=end;\n while(i<j)\n {\n if(s[i++]!=s[j--])\n return false;\n }\n return true;\n }\n\n vector<vector<string>> partition(string s) {... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\nbool pal(string s){\n int i = 0;\n int j = s.length()-1;\n while (i<j){\n if (s[i]!=s[j]){\n return false;\n }\n i++;\n j--;\n }\n return true;\n}\n vector<vector<string>> partition(string s) {\n int n = s.length();\... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool is_palindrom(int first, int last, string& s) {\n if (first == last) { return true; }\n while (first < last) {\n if (s[first] != s[last]) { return false; }\n ++first;--last;\n }\n return true;\n }\n\n\n\n vector<vect... |
131 | <p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\n vector<vector<string>> res;\n string str;\nbool isPalindrome(string s) {\n\n if (s == \"\")\n return false;\n\n if(s.size() == 1)\n return true;\n\n for (int i = 0; i < s.size() / 2; ++i) {\n if (s[i] != s[s.size() - i - 1])\n return false;\... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.