id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
513 | <p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;" />
<pre>
<strong>Input:</strong> r... | 3 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int n = ring.size(), m = key.size();\n int dp[n][m];\n memset(dp, -1, sizeof(dp));\n for (int i=0;i<n;++i) {\n if(ring[i]!=key[m-1]) continue;\n dp[i][m - 1] = 0;\n }\n... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n static int findRotateSteps(const string &ring, const string &key) {\n constexpr uint8_t ASIZE = 26, DSIZE = 100;\n const uint8_t r = ring.size(),\n k = key.size();\n uint8_t pos[ASIZE][r+1u]; // todo shorten it\n for (uint8_t j... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n int dp[100][100]; // curr,prev,key_index\n string ring, key;\n vector<int> adj[26];\n\n int slv(int curr, int keyIndex) {\n if (keyIndex == key.size())return 0;\n int &ret = dp[curr][keyIndex];\n if (~ret)return ret;\n ret = 1e9;\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n int dp[100][100]; // curr,prev,key_index\n string ring, key;\n vector<int> adj[26];\n\n int slv(int curr, int keyIndex) {\n if (keyIndex == key.size())return 0;\n int &ret = dp[curr][keyIndex];\n if (~ret)return ret;\n ret = 1e9;\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n\n int findMinDist(int center,int ringIdx,int ringLen){\n int distance = abs(center- ringIdx);\n int wrapAroundDist = ringLen - distance;\n return min(distance,wrapAroundDist);\n }\n /*\n int calMinSteps(int center,int ki, int ringLen,string& key... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\n unordered_map<char,vector<int>>pos;\n int dp[101][102];\n int solve(int i,int prevpos,string &ring,string &key){\n int n = key.size();\n int m = ring.size();\n if(i>=n)return 0;\n char ch = key[i];\n int ans = 1e9;\n if(dp[i][prevpos+1] != -1)return... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n unordered_map<char, vector<int>> locs;\n for (int i = 0; i < ring.size(); ++i) {\n char c = ring[i];\n locs[c].push_back(i);\n }\n vector<pair<int, int>> active_pos; // position... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int dp[ring.size()][key.size()];\n map<char, vector<int>> table;\n vector<int> path;\n\n for(int i=0;i<ring.size();i++){\n table[ring[i]].emplace_back(i);\n if(ring[i] == key[ke... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 0 | {
"code": "// Time: O(k) ~ O(k * r^2)\n// Space: O(r)\n\nclass Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n unordered_map<char, vector<int>> lookup;\n for (int i = 0; i < ring.size(); ++i) {\n lookup[ring[i]].emplace_back(i);\n }\n \n vector<... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(std::string ring, std::string key)\n {\n std::unordered_map<char, std::vector<int>> positions;\n for (auto i = 0; i < ring.size(); ++i) {\n positions[ring.at(i)].push_back(i);\n }\n\n // Key and value contain the p... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(std::string ring, std::string key)\n {\n std::unordered_map<char, std::vector<int>> positions;\n for (auto i = 0; i < ring.size(); ++i) {\n positions[ring.at(i)].push_back(i);\n }\n\n // Key and value contain the p... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int dist(int x, int y, int n){\n int a = max(x,y);\n int b = min(x,y);\n return min(a-b,b+n-a);\n }\n\n int findRotateSteps(string ring, string key) {\n int ans = key.size(), n = ring.size(), m = key.size();\n vector<vector<long long>>... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int dist(int x, int y, int n){\n int a = max(x,y);\n int b = min(x,y);\n return min(a-b,b+n-a);\n }\n\n int findRotateSteps(string ring, string key) {\n int ans = key.size(), n = ring.size(), m = key.size();\n vector<vector<long long>>... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n map<char,vector<int>> mp;\n int n;\n map<int,map<int,int>> dp;\n\n int fn(int pos, string& str,int x) {\n if(x>=str.length())\n return 0;\n if(dp[x][pos] )\n return dp[x][pos];\n int p = INT_MAX;\n for(auto v: mp[str[... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\nprivate:\n unordered_map<string, int> memo; // Map directly to an int for memoization\n unordered_map<char, vector<int>> char_positions;\n\n int f(string &ring, string &key, int ring_pos, int key_pos) {\n if (key_pos == key.size()) return 0;\n\n string memo_key = t... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n\n int recursive(unordered_map<int,vector<int>>& left, unordered_map<int,vector<int>>& right, string &key, int i, int j, int n, vector<vector<int>>& dp){\n if(i==key.length()) return 0;\n\n if(dp[i][j]!=-1) return dp[i][j];\n\n int leftind=left[j][key[i]-'... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Node{\n public:\n char c;\n Node* l;\n Node* r;\n Node(char b) {this->c = b;}\n};\nclass Solution {\npublic:\n vector<Node*> nodels;\n unordered_map<Node*, unordered_map<int, int>> mp;\n int traverse(Node* node, const string& key, int i) {\n if(i >= key.size()) return 0;\n if(... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n map<char, vector<int>> m;\n vector<vector<int>> dp;\n int ring_size;\n int f(int index, string key, int n) {\n int minm = INT_MAX;\n if (n == 0) return 0;\n for (auto u: m[key[0]]) {\n if (dp[u][n - 1] == -1) {\n dp[u][n... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n\n int n = ring.size();\n int m = key.size();\n\n struct node {\n char spell;\n int val;\n int lvl;\n int sum;\n };\n\n bool memo[n+1][m+1];\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n\n\n int n = ring.size();\n int m = key.size();\n\n string rings = ring + ring + ring;\n n = rings.size();\n string keys = ring[0] + key;\n m = keys.size();\n vector<vector<int>> ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n\n\n int n = ring.size();\n int m = key.size();\n\n string rings = ring + ring + ring;\n n = rings.size();\n string keys = ring[0] + key;\n m = keys.size();\n vector<vector<int>> ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int sol = INT_MAX;\n vector<vector<int>> grid(key.size() + 1, vector<int>(ring.size(), INT_MAX));\n queue<pair<int, int>> q;\n q.push({0, 0});\n grid[0][0] = 0;\n while (!q.empty()) {\n int curK = q.front().first;\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int dis(int i,int j,int n){\n return min(abs(j-i),n-abs(i-j));\n }\n int findRotateSteps(string ring, string key) {\n int dist[26][26]; \n int n=ring.size();\n unordered_map<char,vector<int>> mp;\n for(int i=0;i<ring.size();i++)... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> dp;\n int calc(string &ring, string &key, int ir, int ik) {\n if(ik == key.length()) {\n return 0;\n }\n // if(ring[ir] == key[ik]) {\n // return dp[ir][ik] = calc(ring, key, ir, ik + 1);\n // }\n\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> dp;\n int calc(string &ring, string &key, int ir, int ik) {\n if(ik == key.length()) {\n return 0;\n }\n int res = INT_MAX;\n if(dp[ir][ik] != -1) {\n return dp[ir][ik];\n }\n for(int i = 0... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int k;\n int n;\n \n int solve(int idx, int head, const map<char, vector<int>>& m, const string& key,vector<vector<int>>&dp) {\n if (idx >= k) return 0;\n if(dp[idx][head]!=-1) return dp[idx][head];\n int result = INT_MAX;\n for (int pos :... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findDistance(int n, int start, int target){\n int forward = abs(start - target);\n int backward = n - forward;\n\n return min(forward, backward);\n }\n\n int modifiedDijkstra(string& ring, string& key, unordered_map<char, vector<int>>& adj){\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n map<char, vector<int>> m;\n vector<vector<int>> dp;\n int ring_size;\n int f(int index, string key, int n) {\n int minm = INT_MAX;\n if (n == 0) return 0;\n string key1 = key.substr(1, n - 1);\n for (auto u: m[key[0]]) {\n if (d... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n queue<pair<pair<int,int>,int>> q;\n q.push({{0,0},0});\n vector<vector<int>> vis(ring.size(),vector<int>(key.size(),0));\n while(!q.empty()){\n int sz = q.size();\n for(int i=0;... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int countSteps(int ringIndex, int i, int n) {\n int dist = abs(i - ringIndex);\n int wrapAround = n - dist;\n \n return min(dist, wrapAround);\n }\n \n int findRotateSteps(string ring, string key) {\n int n = ring.length();\n... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "/* Scroll down to see JAVA code also */\n/*\n MY YOUTUBE VIDEO ON THIS Qn : https://www.youtube.com/watch?v=yUNjMFE1tGo\n Company Tags : GOOGLE\n Leetcode Link : https://leetcode.com/problems/freedom-trail\n DP Solution : https://github.com/MA... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n \n int countSteps(int ringIdx, int i, int n){\n int dist = abs(i-ringIdx);\n int reverse_dist = n - dist;\n\n return min(dist, reverse_dist);\n }\n int findRotateSteps(string ring, string key) {\n int n = ring.size();\n int m = key.... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\nint countsteps(int i , int j , int n ){\n int dist = abs( i -j);\n int wrap = n- dist;\n return min(dist , wrap);\n}\n int findRotateSteps(string ring, string key) {\n \n int n = ring.length();\n int m = key.length();\n unordered_map<char ,... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n unordered_map<char,vector<int>>mp;\n // vector<vector<int>>dp;\n int n;\n\n // int solve(string&ring, string&key,int keyIndex,int prevIndex){\n // if(keyIndex>=key.size()){\n // return 0;\n // }\n // if(dp[keyIndex][prevIndex]!=-1)retu... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int ringLen = ring.length();\n int keyLen = key.length();\n \n // HashMap to store the indices of occurrences of each character in the ring\n unordered_map<char, vector<int>> characterIndices;... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int ringLen = ring.length();\n int keyLen = key.length();\n \n // HashMap to store the indices of occurrences of each character in the ring\n unordered_map<char, vector<int>> characterIndices;... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 2 | {
"code": "// f(i, j) = minimum number of steps to spell key[j..)\n// assuming we start with a ring rotated clockwise\n// i times (i.e., ring[i] is at 12:00)\n\n//\n// clockwise(i, c) = first occurrence of character c rotating\n// clockwise starting with ring[i] at 12:00... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "// f(i, j) = minimum number of steps to spell key[j..)\n// assuming we start with a ring rotated clockwise\n// i times (i.e., ring[i] is at 12:00)\n\n//\n// clockwise(i, c) = first occurrence of character c rotating\n// clockwise starting with ring[i] at 12:00... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n typedef pair<int,pair<int,int>> p;\n int minSteps(int ri, int i, int n){\n int dist = abs(ri-i);\n int wrapAround = n-dist;\n return min(dist, wrapAround);\n }\n int findRotateSteps(string ring, string key) {\n unordered_map<char, vector<i... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\nprivate:\n int dp[101][101];\n vector< int >indexes[ 26 ];\n int len , key_len;\npublic:\n Solution() {\n ios_base :: sync_with_stdio( false );\n cin.tie( nullptr ) , cout.tie( nullptr );\n memset( dp , -1 , sizeof(dp) );\n }\n int fun(int n , string... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n\n // int solve(string ring, string key, int i, int j){\n // int n = ring.length();\n // int m = key.length();\n\n // if(i==n || j==m) return 0;\n // int tans = INT_MAX;\n // if(ring[i] == key[j]){\n // tans = min(tans, 1+solve(rin... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n long long int solve(string ring,string key,int i,int j,vector<vector<int>>&dp){\n if(i>=key.length()){\n return 0;\n }\n if(dp[i][j]!=-1){\n return dp[i][j];\n }\n //check clockwise\n long long clockwise=0;\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n for (int i = 0; i < ring.size(); i++)\n {\n mMapToCharPos[ring[i]].push_back(i);\n }\n\n return minNumSteps(0, 0, key, ring.size());\n }\n\n int minNumSteps(int starting, int keyNum,... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int f(int i,int p, int n, int m, string key,vector<vector<int>> &id,vector<vector<int>> &dp){\n if(i>=key.length()) return 0;\n if(dp[i][p]!=-1) return dp[i][p];\n int mini = 1e8; \n for(auto x : id[key[i]-'a']){\n int cost = min(... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\nprivate:\n // Recursive function to perform DFS with memoization\n int dfs(int index, int pos, int n, int m, unordered_map<char, vector<int>>& adj, string key, vector<vector<int>>& dp) {\n // Base Case: If we have processed all characters in the key\n if (index >= m) {... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\nprivate:\n // int dp[101][101];\n vector< int >indexes[ 26 ];\n int len , key_len;\npublic:\n Solution() {\n ios_base :: sync_with_stdio( false );\n cin.tie( nullptr ) , cout.tie( nullptr );\n // memset( dp , -1 , sizeof(dp) );\n }\n int fun(int n , ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\nprivate:\n unordered_map<char, vector<int>> adj; \n int dfs(int index, int pos, int n, int m,string key, vector<vector<int>>& dp) {\n \n if (index >= m) {\n return 0;\n }\n \n if (dp[index][pos] != -1) {\n return dp[index][pos]... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int n;\n vector<vector<int>> minSteps;\n vector<vector<int>> cache;\n unordered_map<char, vector<int>> potential_idxs;\n int findRotateSteps(string ring, string key) {\n // we only have two decisions: clockwise or anti-clockwise\n // in the string, t... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n\n pair<int,int> fclock(string ring, char target, int ind) {\n int n = ring.length();\n int ans = 0;\n int j = ind;\n int count1 = 0;\n while(ring[j]!=target)\n {\n count1++;\n j = (j+1)%n;\n }\n cou... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n // i = current state of key ring, index of string\n int solve(string ring, string key, int i, int j, vector<vector<int>>& dp){\n int rs = ring.size();\n int k = key.size();\n // base case\n if (j == k){\n return 0;\n }\n\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n // i = current state of key ring, index of string\n int solve(string ring, string key, int i, int j, vector<vector<int>>& dp){\n int rs = ring.size();\n int k = key.size();\n // base case\n if (j == k){\n return 0;\n }\n\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\nint dp[101][101];\n int countstep(int ri, int i, int n) {\n int clkw = abs(i - ri);\n int anticlw = n - clkw;\n return min(clkw, anticlw);\n }\n int solve(int ri, int ki, string ring, string key) {\n if (ki == key.size()) {\n return... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int dp[101][101];\n int solve(string ring, string key,int ke,int i)\n {\n if(i==key.size())\n return 0;\n if(dp[ke][i]!=-1)\n return dp[ke][i];\n int n=ring.size();\n int cnt=n,j=ke,jj=ke;\n int ans=INT_MAX;\n whil... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\n\n int solve(string &ring,string &key,int i,int j,int dir,vector<vector<vector<int>>>&dp){\n if(j>=key.size())return 0;\n if(i==-1)i=ring.size()-1;\n if(i==ring.size())i=0;\n if(dp[i][j][dir]!=-1)return dp[i][j][dir];\n\n int w1=INT_MAX,w2=INT_MAX;\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int f(int pos, int ind, string ring, vector<vector<int>>&dp, string key){\n if(ind == key.size()){\n return 0;\n }\n if(dp[ind][pos]!=-1) return dp[ind][pos];\n if(ring[pos]==key[ind]){\n return f(pos, ind+1, ring, dp, key)+1;... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n\n int n , m;\n\n int minSteps(string & ring , string & key , int i , int j, int direction, vector<vector<vector<int>>> & dp)\n {\n if(j >= m) return 0;\n if(i >= n) i = 0;\n if(i < 0) i = n-1;\n\n if(dp[i][j][direction == 1] != -1) return dp[... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "#include<bits/stdc++.h>\nclass Solution {\npublic:\n int dp[1001][1001];\n int solve(string ring,string key,int i,int j,int dp[1001][1001]){\n int ans = 1e9;\n int n = key.size();\n int m = ring.size();\n if(i>=n){\n return 0;\n }\n if(dp[i][j] != ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int vini(int ind, string& ring, string& key, int rp, int c,\n vector<vector<vector<int>>>& dp) {\n int n = ring.length();\n if (ind == key.length())\n return 0;\n if (dp[ind][rp][c] != -1)\n return dp[ind][rp][c];\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int findRightShortestPath(int ringPos, int keyPos, string ring, string key) {\n int n = ring.size();\n int pathCount = 0;\n while(pathCount <= n && (ring[(ringPos + pathCount) % n] != key[keyPos])) {\n pathCount++;\n }\n return pa... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution \n{\npublic:\n int method(int i1,int i2, string ring, string key,int m,int n, vector<vector<int>>&dp)\n {\n if(i2==n)\n return 0;\n if(dp[i1][i2]!=-1)\n return dp[i1][i2];\n int ans = INT_MAX;\n for(int i=0;i<m;i++)\n {\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n\n int solve(string ring,string key,int n,int m,int i,int j,vector<vector<int>> &dp){\n if(j==m) return 0;\n if(dp[i][j]!=-1) return dp[i][j];\n int ans=INT_MAX;\n for(int k=0;k<n;k++){\n if(ring[k]==key[j]){\n int diff=abs(k-i);\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution \n{\npublic:\n int method(int i1,int i2, string ring, string key,int m,int n, vector<vector<int>>&dp)\n {\n if(i2==n)\n return 0;\n if(dp[i1][i2]!=-1)\n return dp[i1][i2];\n int ans = INT_MAX;\n for(int i=0;i<m;i++)\n {\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution \n{\npublic:\n int method(int i1,int i2, string ring, string key,int m,int n, vector<vector<int>>&dp)\n {\n if(i2==n)\n return 0;\n if(dp[i1][i2]!=-1)\n return dp[i1][i2];\n int ans = INT_MAX;\n for(int i=0;i<m;i++)\n {\n ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int dist(int next,int curr,int ringSize){\n int a=abs(curr-next);\n int b=ringSize-a;\n return min(a,b);\n }\n int solve(int ringIndex,int keyIndex,string ring, string key,vector<vector<int>>&t){\n if(keyIndex>=key.size()){\n retur... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int solve(string ring, string key, int ptr, int index, int n, int m, vector<vector<int>>&dp){\n //base\n if(index >= m) return 0;\n if(dp[ptr][index]!= -1) return dp[ptr][index];\n int ans =1e9;\n // choice\n for(int i=0; i<n; ++i){\n... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int n = ring.size(), m = key.size();\n vector<vector<int>> v(26);\n vector<vector<int>> memo(n, vector<int>(m));\n for (int i = 0; i < n; ++i) v[ring[i] - 'a'].push_back(i);\n return helper(ri... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n unordered_map<char, vector<int>> m;\n vector<vector<int>> memo(ring.size(), vector<int>(key.size()));\n for (int i = 0; i < ring.size(); i++) m[ring[i]].push_back(i);\n return helper(m, ring, key, 0,... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int minStepsToRotate(int i, int j,string ring, string key, \n unordered_map<char, vector<int>> &ringIndex, vector<vector<int>> &dp){\n if(j>=key.length()) return 0;\n \n if(dp[i][j]!=-1) return dp[i][j];\n\n int steps = INT_MA... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n unordered_map<int, unordered_map<int, int>> bestSteps;\n return tryLock(0, 0, ring, key, INT_MAX, bestSteps);\n }\n\nprivate:\n // Find the minimum steps between two indexes of ring\n int countSteps(int c... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int check(string ring, string key, int ind, int start,vector<vector<int>> &dp){\n if(ind == key.size()){\n return 0;\n }\n if(dp[ind][start]!=-1){\n return dp[ind][start];\n }\n int ans = 1000000000;\n for(int i... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int func(int i,int k, string ring ,string key,vector<vector<int>> &dp) {\n if(i >= ring.size())return 1e6;\n if(k >= key.size())return 0;\n if(ring[i] == key[k]) return dp[i][k]=1 + func(i, k + 1, ring, key, dp);\n int n = ring.size();\n int... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n \n vector<vector<int>> dp;\n \n int m,n;\n \n int help(string ring, string key, int indx, int ptr)\n {\n if(indx == n)\n {\n return 0;\n }\n \n if(dp[indx][ptr] != -1)\n {\n return dp[indx][ptr]... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n \n vector<vector<int>> dp;\n \n int m,n;\n \n int help(string ring, string key, int indx, int ptr)\n {\n if(indx == n)\n {\n return 0;\n }\n \n if(dp[indx][ptr] != -1)\n {\n return dp[indx][ptr]... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n\n map<pair<int,int>,int>dp;\n\n int solve(map<char,vector<int>>&clock, string key, int index, int pos, int n) {\n if(index==key.size())\n return 0;\n if(dp.find({index,pos})!=dp.end())\n return dp[{index,pos}];\n auto v = clock[key[index]... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n int findRotateSteps(string ring, string key) {\n int n = ring.size();\n int m = key.size();\n vector<vector<int>> visited(n, vector<int>(m + 1, INT_MAX)); // Track minimum cost to reach (position, key_index)\n unordered_map<char, vector<int>> char_... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\nint step(int k,int i,string ring){\n int dist = abs(i-k);\n return min(dist,(int)ring.size()-dist);\n}\nint solve(string ring ,string key,int i,int j,vector<vector<int>>&dp){\n if(j==key.size())return 0;\n if(dp[i][j]!=-1)return dp[i][j];\n int ans=INT_MAX;\n fo... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\npublic:\n\n int countSteps(int ring_idx, int key_idx, string ring) {\n int n = ring.size();\n int step1 = abs(key_idx - ring_idx);\n int step2 = n - step1;\n return min(step1, step2);\n }\n\n int solve(vector<vector<int>> &dp, int ring_idx, int key_idx... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\n public:\n int findRotateSteps(string ring, string key) {\n return dfs(ring, key, 0, {}) + key.length();\n }\n\n private:\n // Returns the number of rotates of ring to match key[index..n).\n int dfs(const string& ring, const string& key, int index,\n unordered_map<string, ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\n public:\n int findRotateSteps(string ring, string key) {\n return dfs(ring, key, 0, {}) + key.length();\n }\n\n private:\n // Returns the number of rotates of ring to match key[index..n).\n int dfs(const string& ring, const string& key, int index,\n unordered_map<string, ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\n public:\n int findRotateSteps(string ring, string key) {\n return dfs(ring, key, 0, {}) + key.length();\n }\n\n private:\n // Returns the number of rotates of ring to match key[index..n).\n int dfs(const string& ring, const string& key, int index,\n unordered_map<string, ... |
514 | <p>In the video game Fallout 4, the quest <strong>"Road to Freedom"</strong> requires players to reach a metal dial called the <strong>"Freedom Trail Ring"</strong> and use the dial to spell a specific keyword to open the door.</p>
<p>Given a string <code>ring</code> that represents the code engrav... | 3 | {
"code": "class Solution {\n public:\n int findRotateSteps(string ring, string key) {\n return dfs(ring, key, 0, {}) + key.length();\n }\n\n private:\n // Returns the number of rotates of ring to match key[index..n).\n int dfs(const string& ring, const string& key, int index,\n unordered_map<string, ... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
515 | <p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style="width: 300px; ... | 0 | {
"code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNod... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.