leetcode

1 Random Problem

2 files changed, 18 insertions(+), 0 deletions(-)

diff --git a/ Problems/0436.cpp b/ Problems/0436.cpp

@@ -0,0 +1,17 @@

class Solution {

public:

vector<int> findRightInterval(const vector<vector<int>> &intervals) const {

const int n = size(intervals);

vector<int> res(n);

map<int, int> mp;

for (int i = 0; i < n; i++)

mp[intervals[i][0]] = i;

for (int i = 0; i < n; i++) {

const auto it = mp.lower_bound(intervals[i][1]);

res[i] = it != mp.end() ? it->second : -1;

}

return res;

}

};

diff --git a/ README.md b/ README.md

@@ -325,6 +325,7 @@ for solving problems. | 0430 | Medium | [Flatten a Multilevel Doubly Linked list](Problems/0430.cpp) | | 0433 | Medium | [Minimum Genetic Mutation](Problems/0433.cpp) | | 0435 | Medium | [Non-overlapping Intervals](Problems/0435.cpp) |

| 0436 | Medium | [Find Right Interval](Problems/0436.cpp) |

| 0437 | Medium | [Path Sum III](Problems/0437.cpp) | | 0438 | Medium | [Find All Anagrams in a String](Problems/0438.cpp) | | 0442 | Medium | [Find All Duplicates in an Array](Problems/0442.cpp) |