Codeforces|Leetcode|Codechef free solutions

Uber Oa help available Dm @Cpsoln

Arcesium slots available Dm @Cpsoln

Oracle oa all test cases passed Dm @Cpsoln to book slot for coding rounds

Oracle Counting Analogous array done ✅✅✅

Oracle oa slots available Dm @Cpsoln

Uber oa slots available Dm @Cpsoln

Company name - Siemens Role : Software Engineer - C++ Salary - 8-15 LPA Due - 17 July Batch - 2022,2023,2024 Location- Chennai Link : https://shorturl.at/bkKNQ

Since your placement and intern session is coming 🤓🤓 So don't miss any opportunity in this recession😇😇😇😇 📌📌📌📌📌📌📌📌📌📌📌📌 No scam No fraud because we are not like other telegram channels. If you want help in coding round of any company then Dm @Cpsoln and book your slot ✅✅✅✅

Company name - Siemens Role : Software Engineer - C++ Salary - 8-15 LPA Due - 17 July Batch - 2022,2023,2024 Location- Chennai Link : https://shorturl.at/bkKNQ

Leetcode D right code

class Solution { public: int longestValidSubstring(string word, vector& forbidden) { int n = word.length(); vector n) continue; for (int i = len -1; i < n; i++) { if (i >= len && word.substr(i-len + 1, len) == s && dp[i- len]) ( dp[i]= false; } } } for (int i = 0; i < n; i++) { if (dp[i]) { longestValid - max(longestValid, i+1) } } return longestValid; }

Leetcode D

class Solution { public:     int longestValidSubstring(string word, vector& forbidden) {         int n = word.length();         vector dp(n, true);         int longestValid = 0;                 for (const string& s : forbidden) {             int len = s.length();             if (len > n) continue;                         for (int i = len - 1; i < n; i++) {                 if (i >= len && word.substr(i - len + 1, len) == s && dp[i - len]) {                     dp[i] = false;                 }             }         }                 for (int i = 0; i < n; i++) {             if (dp[i]) {                 longestValid = max(longestValid, i + 1);             }         }                 return longestValid;     } };

Tomorrow oracle oa slots available Dm @Cpsoln

De shaw 3rd ques done ✅✅✅

Dm @Cpsoln fast

De shaw 2nd ques done ✅✅✅

De shaw first ques done

Maximise collection done ✅✅

Dm @Cpsoln