id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n map<string, map<string, int>> ticketsByOrigin = fillTicketsByOrigin(tickets);\n\n vector<string> itinerary;\n itinerary.push_back(\"JFK\");\n\n vector<string> lastTries;\n int... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n unordered_map<string, set<string>> routes;\n unordered_map<string, int> availableTickets;\n for(vector<string>& ticket: tickets){\n routes[ticket[0]].insert(ticket[1]);\n ... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\npublic:\n\n struct hashing{\n size_t operator() (const std::pair<std::string, std::string> & a) const{\n return std::hash<std::string>()(a.first) ^ std::hash<std::string>()(a.second)<<1;\n }\n };\n\n bool dfsForMinLexi(std::string next, st... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\npublic:\n\n struct hashing{\n size_t operator() (const std::pair<std::string, std::string> & a) const{\n return std::hash<std::string>()(a.first) ^ std::hash<std::string>()(a.second)<<1;\n }\n };\n\n bool dfsForMinLexi(std::string next, st... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\npublic:\n void dfs(vector<string>& ans, map<string, multiset<string>>& adj,\n string s) {\n while (adj[s].size()) {\n string v = *(adj[s].begin());\n adj[s].erase(adj[s].begin());\n dfs(ans, adj, v);\n }\n ans.push_back(... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\nprivate:\n using pq=priority_queue<string,vector<string>,greater<string>>;\n vector<string> ans;\n void dfs(string node,unordered_map<string,pq> &mp){\n while(!mp[node].empty()){\n string adjNode=mp[node].top();\n mp[node].pop();\n dfs(adjN... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\npublic:\n unordered_map<string,\n priority_queue<string, vector<string>, greater<string>>>\n adj;\n vector<string> result;\n void dfs(string u) {\n auto& edges = adj[u];\n\n while (!edges.empty()) {\n string v = edges.top();\n ... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\nprivate:\n using pq=priority_queue<string,vector<string>,greater<string>>;\n vector<string> ans;\n void dfs(string node,unordered_map<string,pq> &mp){\n while(!mp[node].empty()){\n string adjNode=mp[node].top();\n mp[node].pop();\n dfs(adjN... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 2 | {
"code": "class Solution {\nprivate:\n unordered_map<string, priority_queue<string, vector<string>, greater<string>>> flightMap;\n vector<string> itinerary;\n\n void dfs(string airport) {\n // While there are still flights departing from the airport\n while (!flightMap[airport].empty()) {\n ... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n for (auto ticket : tickets)\n targets[ticket[0]].insert(ticket[1]);\n visit(\"JFK\");\n return vector<string>(route.rbegin(), route.rend());\n }\n\n map<string, multiset<string... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\n\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n unordered_map<string, vector<string>> connections;\n for(int i=0;i<tickets.size();i++){\n connections[tickets[i][0]].push_back(tickets[i][1]);\n }\n for( auto &s:connec... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n unordered_map<string, vector<string>> flightGraph;\n \n // Store the final itinerary\n vector<string> itinerary;\n/*map<string, multiset<string>> targets;\nvector<string> route;\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n return find... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\n vector<string> res;\n unordered_map<string, vector<string>> G;\npublic:\n vector<string> findItinerary(vector<vector<string>>& T) {\n for(auto &t : T)\n G[t[0]].push_back(t[1]);\n for(auto &[a, v] : G)\n sort(v.rbegin(), v.rend());\n //... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\nprivate:\n unordered_map<string, vector<string>> graph;\n vector<string> route;\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n for (auto& ticket : tickets) {\n graph[ticket[0]].push_back(ticket[1]);\n }\n for (auto &en... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n vector<string> res;\n map<string,vector<string>> ma;\n for(int i=0;i<tickets.size();i++)\n {\n ma[tickets[i][0]].push_back(tickets[i][1]);\n }\n for(auto& el... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n void eulerPath(string u, map<string, vector<string>>& adj, map<string, int>& vis, vector<string>& path) {\n\n for (auto v: adj[u]) {\n string edge = u + \"_\" + v;\n if (vis[edge] != 0) {\n vis[edge]--;\n eulerPath(v,... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n vector<string> res;\n map<string,vector<string>> ma;\n for(int i=0;i<tickets.size();i++)\n {\n ma[tickets[i][0]].push_back(tickets[i][1]);\n }\n for(auto& el... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n sort(tickets.rbegin(), tickets.rend());\n\n unordered_map<string, vector<string>> graph;\n for(const auto& ticket : tickets)\n {\n graph[ticket.front()].push_back(ticket.b... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n void construct_itinerary(string current_city,\n vector<string> &results_array,map<string,vector<string>> &journey_path){\n // results_array.push_back(current_city);\n while(journey_path[current_city].size()!=0){\n string te... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n vector<string> findItinerary(vector<vector<string>>& tickets) {\n map<string, vector<string>> graph;\n for (auto ticket_pair : tickets){\n string from = ticket_pair[0];\n string to = ticket_pair[1];\n if (graph.find(from) == grap... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\nprivate:\n void dfsTraversal(map<string, vector<string>>& airport_graph, string& current, vector<string>& result) {\n while (airport_graph.contains(current) && airport_graph[current].size() > 0) {\n string destination = airport_graph[current].back();\n airp... |
332 | <p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>
<p>All of the tickets belong to a man who departs from <code>"JFK"</... | 3 | {
"code": "class Solution {\npublic:\n // We use a map to store the adjacency list of the graph.\n unordered_map<string, deque<string>> graph;\n \n vector<string> findItinerary(vector<vector<string>>& tickets) {\n // Step 1: Build the graph (adjacency list)\n for (const auto& ticket : ticket... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "static auto _ = []() {\n ios::sync_with_stdio(false);\n return true;\n}();\n\nclass Solution {\npublic:\n static constexpr bool increasingTriplet(const vector<int>& nums) {\n int n1 = INT_MAX, n2 = INT_MAX;\n for(auto n : nums) {\n if(n1 >= n) {\n n1 = n;\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n ios::sync_with_stdio(false);\n //c1<c2<c3 we try to make\n int c1=INT_MAX, c2=INT_MAX;\n for(auto &x: nums){\n if(x<=c1) c1=x;\n else if(x<=c2) c2=x;\n else return true;... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if ( nums.size() < 3) {\n return false;\n }\n \n int minOne = INT_MAX;\n int minTwo = INT_MAX;\n\n for (int num : nums) {\n if (num < minOne) {\n minOn... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& v) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n vector<int> ans;\n for (int& i : v) {\n auto it = lower_bound(ans.begin(), ans.end(), i);\n if (it == ans.end()) {\n... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) \n {\n int first_small = INT_MAX;\n int second_small = INT_MAX;\n for(int i=0;i<nums.size();i++)\n {\n if(nums[i]<=first_small)\n first_small=nums[i];\n else if( nums... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n // bool type=false;\n // int king = nums.size();\n // for(int i=0;i<king-2;i++){\n // if(nums[i]<nums[i+1] && nums[i+1]<nums[i+2]) {type=true; break;}\n // }\n // if(type==false){\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size();\n if (n < 3)\n return false;\n int f1 = INT_MAX;\n int f2 = INT_MAX;\n for (int i : nums) {\n if (i <= f1) {\n f1 = i;\n } els... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 0 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int x = INT_MAX;\n int y = INT_MAX;\n\n for (int i=0; i<nums.size();i++) {\n if (x >= nums[i]) {\n x = nums[i];\n } else if (y >= nums[i]) {\n y = nums[i];\... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 1 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size()<3){\n return false;\n }\n int a = INT_MAX;\n int b = INT_MAX;\n\n for (int num:nums){\n if (num<=a){\n a = num;\n } else if (num<=b)... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 1 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n=nums.size();\n int first=INT_MAX;\n int second=INT_MAX;\n for(int i=0;i<n;i++){\n if(nums[i]<=first){\n first=nums[i];\n }\n else if(nums[i]<=second... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int a = INT_MAX;\n int b = INT_MAX;\n for(int num : nums){\n if(num <= a) a = num;\n else if (num <= b) b = num;\n else return true;\n }\n return false;\n } \n}... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n // bool type=false;\n // int king = nums.size();\n // for(int i=0;i<king-2;i++){\n // if(nums[i]<nums[i+1] && nums[i+1]<nums[i+2]) {type=true; break;}\n // }\n // if(type==false){\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int small=INT_MAX,large=INT_MIN;\n vector<bool>store(nums.size(),false);\n for(int i=0;i<nums.size();i++){\n if(small<nums[i])store[i]=true;\n small=min(small,nums[i]);\n }\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int small=INT_MAX,large=INT_MIN;\n vector<bool>store(nums.size(),false);\n for(int i=0;i<nums.size();i++){\n if(small<nums[i])store[i]=true;\n small=min(small,nums[i]);\n }\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int small=INT_MAX,large=INT_MIN;\n vector<bool>store(nums.size(),false);\n for(int i=0;i<nums.size();i++){\n if(small<nums[i])store[i]=true;\n small=min(small,nums[i]);\n }\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n vector<bool> min2(nums.size(),false);\n\n int min1 = nums[0];\n for(int j=1;j<nums.size();j++)\n {\n if(nums[j]<=min1)\n {\n min1 = nums[j];\n }\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size() < 3) return false;\n set<int> s;\n for(int x : nums){\n s.insert(x);\n }\n if(s.size() < 3) return false;\n for(int i = 0; i < nums.size(); i++){\n\n }\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "typedef long long int;\n\nclass Solution {\n\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int totalNumbers = nums.size();\n set<int> ans(nums.begin(),nums.end());\n if(ans.size()>=3){\n\n for(int i = 0;i<totalNumbers;i++){\n for(int j=i+1;j<totalNumbers... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if (nums.size() < 3)\n return false;\n set<int> temp;\n for(int i : nums)\n temp.insert(i);\n if(temp.size() < 3)\n return false;\n for (int i = 0; i < nums.size(... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n bool right[600000]={}, left[600000]={};\n int mx = nums.back();\n int mxIndex = nums.size()-1;\n for(int i=nums.size()-2;i>=0;i--){\n if(nums[i]>=mx){\n mx = nums[i];\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n set<int> st;\n int n = nums.size();\n vector<bool> right(n, 0);\n stack<int> s;\n for(int i=n-1;i>-1;i--){\n while(s.size() && nums[s.top()] <= nums[i])\n s.pop();\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n=nums.size();\n \n unordered_map<int,int> triplets;\n for(int i=0;i<n;++i){\n int k=2;\n while(k>=0){\n\n if(!triplets.count(k)||triplets[k]>nums[i]) k--;\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n bool right[600000]={}, left[600000]={};\n int mx = nums.back();\n int mxIndex = nums.size()-1;\n for(int i=nums.size()-2;i>=0;i--){\n if(nums[i]>=mx){\n mx = nums[i];\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n\tbool increasingTriplet(vector<int>& nums) {\n\t\tif (nums.size() < 3) return false;\n\t\tunordered_map<int, bool> T;\n\t\tfor (auto s : nums) {\n\t\t\tT[s] = true;\n\t\t}\n\t\tif (T.size() < 3) return false;\n\t\tfor (int i = 0; i < nums.size(); i++) {\n\t\t\t//跳过降序区间\n\t\t\tin... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size()<3) return false;\n map<int,int>map;\n map[nums[nums.size()-1]]=1;\n if(nums[nums.size()-2]<nums[nums.size()-1]) map[nums[nums.size()-2]]=2;\n else{\n map[nums[nums.size(... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size()<3) return false;\n map<int,int>map;\n map[nums[nums.size()-1]]=1;\n if(nums[nums.size()-2]<nums[nums.size()-1]) map[nums[nums.size()-2]]=2;\n else{\n map[nums[nums.size(... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n std::unordered_set set ( nums.begin(), nums.end() );\n if(set.size() <= 2) return false; \n\n for(auto i {0}; i < std::ssize(nums) - 2; i++) {\n for(auto j {i + 1}; j < std::ssize(nums) - 1; j++) {\... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums)\n {\n unordered_set<int> uniqueNumbers;\n int s=nums.size(), a=0;\n\n for (int num : nums) {\n uniqueNumbers.insert(num); \n if (uniqueNumbers.size() == 3) { \n a=1;\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size()<3) return false;\n unordered_set<int> s(nums.begin(), nums.end());\n if(s.size()<3) return false; \n int j, k;\n for(int i = 0; i<nums.size()-2; i++){\n for(j = i+1; j<n... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n // for(int i=1;i<n && x<2;i++) x+=(nums[i-1]<nums[i]);\n // return x==2;\n int n=nums.size(),mi,ma[n];\n mi=nums[0],ma[n-1]=nums[n-1];\n for(int i=n-2;i>=0;i--) ma[i]=max(ma[i+1],nums[i]);\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n stack<int> s;\n int n = nums.size();\n int nb[n];\n for(int i=n-1;i>=0;i--) {\n while(s.size() && nums[s.top()] <= nums[i]) s.pop();\n if(s.size()) nb[i] = s.top();\n el... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size();\n int maxRight[n];\n maxRight[n - 1] = nums[n - 1];\n for (int i = n - 2; i >= 0; i--) {\n maxRight[i] = max(maxRight[i + 1], nums[i + 1]);\n }\n int minLef... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n //int i=0;\n int n=nums.size();\n if(n<3)return false;\n int m=nums[0];\n vector<int>v;\n for(int i=1;i<n;i++){\n if(nums[i]>m){\n v.push_back(nums[i]);\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n //int i=0;\n int n=nums.size();\n if(n<3)return false;\n int m=nums[0];\n vector<int>v;\n for(int i=1;i<n;i++){\n if(nums[i]>m){\n v.push_back(nums[i]);\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n // O(n*log(n)) to insert all values to BST. O(n*log(n)) to check if each value has values higher and smaller than him. \n if (nums.size() < 3) {\n return false;\n }\n // map of all occurences... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& a) {\n map<int,int> ls, rs ;\n int n=a.size() ;\n for(int i=0 ; i<n ; i++) {\n rs[a[i]]++ ;\n }\n for(int i=0 ; i<n ; i++) {\n ls[a[i]]++ ;\n if(ls.find(a[i])!=ls.begin() &... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& arr) {\n int a = INT_MAX;\n stack<int> st;\n int n = arr.size();\n for(int i=0; i<n; i++){\n if(arr[i] > a){\n return true;\n }\n if(!st.empty() && st.top() >= arr[... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size() ;\n int leftmin[n] ;\n int rightmax[n] ;\n leftmin[0] = nums[0] ;\n int i = 1 ;\n while ( i < n ) {\n leftmin[i] = min( leftmin[i-1] , nums[i] ) ;\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int l=nums.size();\n int left[l];\n int right[l];\n left[0]=nums[0];\n right[l-1]=nums[l-1];\n for(int i=1;i<l;i++){\n left[i]=min(left[i-1],nums[i]);\n }\n for(in... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size()<3){\n return false;\n }\n int n=nums.size();\n int left_min[n];\n int right_max[n];\n left_min[0]=nums[0];\n for(int i=1;i<nums.size();i++){\n l... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n ios_base::sync_with_stdio(0); cin.tie(0);\n int n = nums.size();\n int pref[n], suff[n];\n\n pref[0] = nums[0]; \n for (int i = 1; i < n; i++)\n pref[i] = min(nums[i], pref[i - 1]);\n\... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n \n int N = nums.size();\n int l_r_min[N]; \n int r_l_max[N];\n int maxx_num = INT_MIN;\n int minn_num = INT_MAX;\n for(int i =0; i < nums.size(); i++) {\n\n maxx_num = ma... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "\n\nclass Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n\n vector<int> largest(nums.size(), 0);\n\n int largestNum = nums.back(); // Start with the last element\n\n // Iterate the array in reverse to fill the `largest` vector\n for (int i = nums.size() -... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& A) {\n int n = A.size() , s = -1;\n \n vector<int> left(n, INT_MIN);\n s = A[0];\n // find smaller element to left of index\n for (int i=1 ; i<n ; i++) {\n if (A[i] > s) {\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n if(nums.size()<3){\n return false;\n }\n if(nums.size() == 3){\n return nums[0]<nums[1] && nums[1] < nums[2];\n }\n // arr -> 1 0 2 0 3 0 4 0 5 \n // brute force\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& A) {\n int n = A.size() , s = -1;\n \n vector<int> left(n, INT_MIN);\n s = A[0];\n // find smaller element to left of index\n for (int i=1 ; i<n ; i++) {\n if (A[i] > s) {\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n=nums.size();\n vector<int>suffix(n,0);\n for(int i=n-1;i>=0;i--){\n if(i==n-1)suffix[i]=nums[i];\n else{\n suffix[i]=max(suffix[i+1],nums[i]);\n }\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n set<int> convertToSet(vector<int> v){\n set<int> s;\n for (int x : v) {\n s.insert(x);\n }\n return s;\n }\n bool increasingTriplet(vector<int>& nums) {\n set<int> s = convertToSet(nums);\n if(s.size() <= 2){\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n // remove the impossible\n auto s = nums;\n sort(s.begin(), s.end());\n auto iter = unique(s.begin(), s.end());\n if (iter - s.begin() < 3)\n return false;\n \n int n = n... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size();\n if (n<3){\n return false;\n }\n int leftMin=nums[0];\n vector<int> right(nums.begin() + 2, nums.end());\n sort(right.begin(), right.end());\n int r... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size();\n if (n<3){\n return false;\n }\n int leftMin=nums[0];\n vector<int> right(nums.begin() + 2, nums.end());\n sort(right.begin(), right.end());\n int r... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) \n {\n int n = nums.size();\n map<int,int> mp;\n for(int i=0;i<n;i++)\n {\n mp[nums[i]] = i;\n }\n int l[n];\n l[0] = nums[0];\n int r[n];\n r[n-1] = nums[n-... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n=nums.size();\n int minP;\n minP=nums[0];\n int i,j;\n stack<int>s;\n for(i=n-1;i>0;i--)\n {\n if(s.empty() || nums[i]>s.top())\n s.push(nums[i]);\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "#include <ext/pb_ds/assoc_container.hpp> \n#include <ext/pb_ds/tree_policy.hpp> \nusing namespace __gnu_pbds; \n \n#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> \n\nclass Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n vector<int> a=nums;\n sort(a.begin(),a.end());\n map<int,int> m;\n for(int i=0;i<a.size();i++){\n m[a[i]]=i;\n }\n int c=3,k=INT_MIN;\n for(int i=0;i<nums.size();i++){\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "#include <utility>\n\nclass Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n vector<int> possible_middle; // track possible values\n int highest_subsequent_value = INT_MIN; // highest int from the end \n\n // find possible middle values;\n for (int i = nums... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "#include <utility>\n\nclass Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n vector<int> possible_middle, possible_first; // track possible values\n int highest_subsequent_value = INT_MIN; // highest int from the end \n\n // find possible middle values;\n f... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size();\n // min value before position i\n int* min = new int[n];\n // max value after position i\n int* max = new int[n];\n min[0] = nums[0];\n max[n - 1] = nums[n - 1... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n\tvector<int> findSequence(int iter, vector<int>& nums) {\n\t\tvector <int> passed;\n\t\tpassed.reserve(nums.size());\n\t\tint len = nums.size();\n\t\tint mx[len];\n\t\tmx[len-1] = INT_MIN;\n\n\t\tfor (int i = len-2; i >= 0; i--) {\n\t\t\tmx[i] = max(mx[i+1], nums[i+1]);\n\t\t\ti... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n\tvector<int> findSequence(int iter, vector<int>& nums) {\n\t\tvector <int> passed;\n\t\tpassed.reserve(nums.size());\n\t\tint len = nums.size();\n\t\tint mx[len];\n\t\tmx[len-1] = INT_MIN;\n\n\t\tfor (int i = len-2; i >= 0; i--) {\n\t\t\tmx[i] = max(mx[i+1], nums[i+1]);\n\t\t\ti... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n long long increasingTriplet(vector<int>& nums) {\n long long min_val[500005] = { 0, };\n long long reverse_max_val[500005] = { 0, };\n\n long long temp = nums[0];\n\n for (int i = 0; i < nums.size(); i++) {\n if (temp > nums[i])\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n long long increasingTriplet(vector<int>& nums) {\n long long min_val[500005] = { 0, };\n long long reverse_max_val[500005] = { 0, };\n\n long long temp = nums[0];\n\n for (int i = 0; i < nums.size(); i++) {\n if (temp > nums[i])\n ... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int len = nums.size();\n int max = len - 1;\n int min = 0;\n int i;\n int* smaller = new int[len];\n smaller[0] = -1;\n for(i = 1; i < len; i++) {\n if(nums[i] <= nums[mi... |
334 | <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
<p> </p>
... | 3 | {
"code": "class Solution {\npublic:\n bool increasingTriplet(vector<int>& nums) {\n int n = nums.size();\n vector<int>right(n);\n vector<int>left(n);\n \n left[0] = nums[0];\n for(int i = 1; i < n; i++){\n left[i] = min(left[i-1],nums[i]);\n }\n r... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 1 | {
"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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 1 | {
"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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 1 | {
"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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 1 | {
"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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 1 | {
"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... |
337 | <p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>
<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will auto... | 1 | {
"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.