LeetCode

LeetCode | Daily challenge : 7 March @leetcodeofficial @leetcodeofficial @leetcodeofficial class Solution { public: ListNode* middleNode(ListNode* head) { ListNode*fast = head; ListNode*slow = head; while(fast!=NULL && fast->next !=NULL){ slow=slow->next; fast = fast->next->next; } return slow; } }; @leetcodeofficial @leetcodeofficial @leetcodeofficial LeetCode | Daily challenge : 7 March

C++ Problem of the Day 7 March Geeks for Geeks @gfg_official @gfg_official @gfg_official class Solution { public: string longestSubstring(string str, int n) { vector<vector<int>> dp(n+1,vector<int>(n+1,0)); int maxLen = 0, index = 0; for(int i=1;i<n+1;i++) { for(int j=1;j<n+1;j++) { if(str[i-1] == str[j-1] && i!=j) { if(i+dp[i-1][j-1] < j) { dp[i][j] = 1+dp[i-1][j-1]; if(dp[i][j] > maxLen) { maxLen = dp[i][j]; index = i-maxLen; } } } } } if(maxLen == 0) return "-1"; else return str.substr(index,maxLen); } }; C++ Problem of the Day 7 March Geeks for Geeks @gfg_official @gfg_official @gfg_official

𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝘁𝗼 𝗽𝗿𝗮𝗰𝘁𝗶𝗰𝗲 𝗰𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗼𝗿 𝘄𝗮𝗻𝘁 𝘁𝗼 𝗽𝗮𝗿𝘁𝗶𝗰𝗶𝗽𝗮𝘁𝗲 𝗶𝗻 𝗰𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗰𝗼𝗻𝘁𝗲𝘀𝘁𝘀 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲𝘀𝗲 𝗯𝗲𝗹𝗼𝘄 𝗴𝗿𝗼𝘂𝗽𝘀👇👇. 𝟭. 𝗚𝗲𝗻𝗲𝗿𝗮𝗹 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @cp_discussion_group @cp_coding_grp @allcodingsolution_official 𝟮. 𝗟𝗘𝗘𝗧𝗖𝗢𝗗𝗘 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @leetcode_cp 𝟯. 𝗖𝗢𝗗𝗘𝗙𝗢𝗥𝗖𝗘𝗦 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @codeforces_cp 𝟰. 𝗖𝗢𝗗𝗘𝗖𝗛𝗘𝗙 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @codechef_group 𝟱. 𝗚𝗘𝗘𝗞𝗦𝗙𝗢𝗥𝗚𝗘𝗘𝗞𝗦 𝗗𝗜𝗦𝗖𝗨𝗦𝗦𝗜𝗢𝗡 𝗚𝗿𝗼𝘂𝗽: @gfg_discuss 𝟲. 𝗖𝗢𝗗𝗜𝗡𝗚 𝗡𝗜𝗡𝗝𝗔𝗦 𝗗𝗜𝗦𝗖𝗨𝗦𝗦𝗜𝗢𝗡 𝗚𝗿𝗼𝘂𝗽: @coding_ninjas_discuss 𝟳. 𝗔𝗧𝗖𝗢𝗗𝗘𝗥 𝗗𝗜𝗦𝗖𝗨𝗦𝗦𝗜𝗢𝗡 𝗚𝗥𝗢𝗨𝗣: @atcoder_discuss

𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝗿𝗲𝗳𝗲𝗿𝗿𝗮𝗹𝘀 𝗮𝗻𝗱 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗼𝗽𝗽𝗼𝗿𝘁𝘂𝗻𝗶𝘁𝗶𝗲𝘀 𝗳𝗿𝗼𝗺 𝗧𝗼𝗽 𝗣𝗿𝗼𝗱𝘂𝗰𝘁 𝗕𝗮𝘀𝗲𝗱, 𝗦𝗲𝗿𝘃𝗶𝗰𝗲 𝗕𝗮𝘀𝗲𝗱 𝗮𝗻𝗱 𝗦𝘁𝗮𝗿𝘁 𝘂𝗽  𝗖𝗼𝗺𝗽𝗮𝗻𝗶𝗲𝘀 𝗹𝗶𝗸𝗲 𝗔𝗺𝗮𝘇𝗼𝗻, 𝗚𝗼𝗼𝗴𝗹𝗲, 𝗠𝗶𝗰𝗿𝗼𝘀𝗼𝗳𝘁, 𝗜𝗕𝗠, 𝗧𝗖𝗦, 𝗖𝗼𝗴𝗻𝗶𝘇𝗮𝗻𝘁, 𝗪𝗶𝗽𝗿𝗼, 𝗖𝗧𝗦, 𝗚𝗼𝗹𝗱𝗺𝗮𝗻 𝗦𝗮𝗰𝗵𝘀, 𝗢𝗹𝗮, 𝗨𝗯𝗲𝗿, 𝗭𝗼𝗺𝗮𝘁𝗼, 𝗦𝘄𝗶𝗴𝗴𝘆, 𝘂𝗽𝗚𝗿𝗮𝗱, 𝗖𝘂𝗿𝗲 𝗙𝗶𝘁, 𝗛𝗮𝗰𝗸𝗲𝗿𝗿𝗮𝗻𝗸, 𝗚𝗲𝗲𝗸𝘀𝗳𝗼𝗿𝗴𝗲𝗲𝗸𝘀 𝗮𝗻𝗱 𝗺𝗮𝗻𝘆 𝗺𝗼𝗿𝗲, 𝗰𝗮𝗻 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲𝘀𝗲 𝗯𝗲𝗹𝗼𝘄 𝗰𝗵𝗮𝗻𝗻𝗲𝗹𝘀 👇👇   𝗝𝗼𝗶𝗻 𝗻𝗼𝘄 @jobsandinternshipsupdates @jobsandinternshipsindia 🔥🔥 𝗟𝗮𝘁𝗲𝘀𝘁 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗨𝗽𝗱𝗮𝘁𝗲𝘀 𝗳𝗼𝗿 𝟮𝟬𝟭𝟳, 𝟮𝟬𝟭𝟴, 𝟮𝟬𝟭𝟵, 𝟮𝟬𝟮𝟬, 𝟮𝟬𝟮𝟭, 𝟮𝟬𝟮𝟮, 𝟮𝟬𝟮𝟯, 𝟮𝟬𝟮𝟰, 𝟮𝟬𝟮𝟱 𝗮𝗻𝗱 𝟮𝟬𝟮𝟲 𝗕𝗮𝘁𝗰𝗵.

CODECHEF Group for today's contest👇 @codechef_group @codechef_group @codechef_group

𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝗿𝗲𝗳𝗲𝗿𝗿𝗮𝗹𝘀 𝗮𝗻𝗱 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗼𝗽𝗽𝗼𝗿𝘁𝘂𝗻𝗶𝘁𝗶𝗲𝘀 𝗳𝗿𝗼𝗺 𝗧𝗼𝗽 𝗣𝗿𝗼𝗱𝘂𝗰𝘁 𝗕𝗮𝘀𝗲𝗱, 𝗦𝗲𝗿𝘃𝗶𝗰𝗲 𝗕𝗮𝘀𝗲𝗱 𝗮𝗻𝗱 𝗦𝘁𝗮𝗿𝘁 𝘂𝗽  𝗖𝗼𝗺𝗽𝗮𝗻𝗶𝗲𝘀 𝗹𝗶𝗸𝗲 𝗔𝗺𝗮𝘇𝗼𝗻, 𝗚𝗼𝗼𝗴𝗹𝗲, 𝗠𝗶𝗰𝗿𝗼𝘀𝗼𝗳𝘁, 𝗜𝗕𝗠, 𝗧𝗖𝗦, 𝗖𝗼𝗴𝗻𝗶𝘇𝗮𝗻𝘁, 𝗪𝗶𝗽𝗿𝗼, 𝗖𝗧𝗦, 𝗚𝗼𝗹𝗱𝗺𝗮𝗻 𝗦𝗮𝗰𝗵𝘀, 𝗢𝗹𝗮, 𝗨𝗯𝗲𝗿, 𝗭𝗼𝗺𝗮𝘁𝗼, 𝗦𝘄𝗶𝗴𝗴𝘆, 𝘂𝗽𝗚𝗿𝗮𝗱, 𝗖𝘂𝗿𝗲 𝗙𝗶𝘁, 𝗛𝗮𝗰𝗸𝗲𝗿𝗿𝗮𝗻𝗸, 𝗚𝗲𝗲𝗸𝘀𝗳𝗼𝗿𝗴𝗲𝗲𝗸𝘀 𝗮𝗻𝗱 𝗺𝗮𝗻𝘆 𝗺𝗼𝗿𝗲, 𝗰𝗮𝗻 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲𝘀𝗲 𝗯𝗲𝗹𝗼𝘄 𝗰𝗵𝗮𝗻𝗻𝗲𝗹𝘀 👇👇   𝗝𝗼𝗶𝗻 𝗻𝗼𝘄 @jobsandinternshipsupdates @jobsandinternshipsindia 🔥🔥 𝗟𝗮𝘁𝗲𝘀𝘁 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗨𝗽𝗱𝗮𝘁𝗲𝘀 𝗳𝗼𝗿 𝟮𝟬𝟭𝟳, 𝟮𝟬𝟭𝟴, 𝟮𝟬𝟭𝟵, 𝟮𝟬𝟮𝟬, 𝟮𝟬𝟮𝟭, 𝟮𝟬𝟮𝟮, 𝟮𝟬𝟮𝟯, 𝟮𝟬𝟮𝟰, 𝟮𝟬𝟮𝟱 𝗮𝗻𝗱 𝟮𝟬𝟮𝟲 𝗕𝗮𝘁𝗰𝗵.

𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝘁𝗼 𝗽𝗿𝗮𝗰𝘁𝗶𝗰𝗲 𝗰𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗼𝗿 𝘄𝗮𝗻𝘁 𝘁𝗼 𝗽𝗮𝗿𝘁𝗶𝗰𝗶𝗽𝗮𝘁𝗲 𝗶𝗻 𝗰𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗰𝗼𝗻𝘁𝗲𝘀𝘁𝘀 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲𝘀𝗲 𝗯𝗲𝗹𝗼𝘄 𝗴𝗿𝗼𝘂𝗽𝘀👇👇. 𝟭. 𝗚𝗲𝗻𝗲𝗿𝗮𝗹 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @cp_discussion_group @cp_coding_grp @allcodingsolution_official 𝟮. 𝗟𝗘𝗘𝗧𝗖𝗢𝗗𝗘 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @leetcode_cp 𝟯. 𝗖𝗢𝗗𝗘𝗙𝗢𝗥𝗖𝗘𝗦 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @codeforces_cp 𝟰. 𝗖𝗢𝗗𝗘𝗖𝗛𝗘𝗙 𝗗𝗶𝘀𝗰𝘂𝘀𝘀𝗶𝗼𝗻 𝗚𝗿𝗼𝘂𝗽: @codechef_group 𝟱. 𝗚𝗘𝗘𝗞𝗦𝗙𝗢𝗥𝗚𝗘𝗘𝗞𝗦 𝗗𝗜𝗦𝗖𝗨𝗦𝗦𝗜𝗢𝗡 𝗚𝗿𝗼𝘂𝗽: @gfg_discuss 𝟲. 𝗖𝗢𝗗𝗜𝗡𝗚 𝗡𝗜𝗡𝗝𝗔𝗦 𝗗𝗜𝗦𝗖𝗨𝗦𝗦𝗜𝗢𝗡 𝗚𝗿𝗼𝘂𝗽: @coding_ninjas_discuss 𝟳. 𝗔𝗧𝗖𝗢𝗗𝗘𝗥 𝗗𝗜𝗦𝗖𝗨𝗦𝗦𝗜𝗢𝗡 𝗚𝗥𝗢𝗨𝗣: @atcoder_discuss

LeetCode | Daily challenge : 6 March @leetcodeofficial @leetcodeofficial @leetcodeofficial class Solution { public: bool hasCycle(ListNode *head) { if (head == NULL || head->next == NULL) return false; ListNode *slow = head; ListNode *fast = head; while (fast->next && fast->next->next) { slow = slow->next; fast = fast->next->next; if (slow == fast) { return true; } } return false; } }; @leetcodeofficial @leetcodeofficial @leetcodeofficial LeetCode | Daily challenge : 6 March

C++ Problem of the Day 6 March Geeks for Geeks @gfg_official @gfg_official @gfg_official vector<int> prefix_function(string s) { int n = (int)s.length(); vector<int> pi(n); for (int i = 1; i < n; i++) { int j = pi[i-1]; while (j > 0 && s[i] != s[j]) j = pi[j-1]; if (s[i] == s[j]) j++; pi[i] = j; } return pi; } class Solution { public: vector <int> search(string pat, string txt) { string look = pat + '?' + txt; vector<int> kmp = prefix_function(look); vector<int> ans; int start = 2 * pat.size(); for(int i = start; i < look.size(); i++){ if(kmp[i] == pat.size()) ans.push_back(i - start + 1); } return ans; } }; C++ Problem of the Day 6 March Geeks for Geeks @gfg_official @gfg_official @gfg_official

𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝗿𝗲𝗳𝗲𝗿𝗿𝗮𝗹𝘀 𝗮𝗻𝗱 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗼𝗽𝗽𝗼𝗿𝘁𝘂𝗻𝗶𝘁𝗶𝗲𝘀 𝗳𝗿𝗼𝗺 𝗧𝗼𝗽 𝗣𝗿𝗼𝗱𝘂𝗰𝘁 𝗕𝗮𝘀𝗲𝗱, 𝗦𝗲𝗿𝘃𝗶𝗰𝗲 𝗕𝗮𝘀𝗲𝗱 𝗮𝗻𝗱 𝗦𝘁𝗮𝗿𝘁 𝘂𝗽  𝗖𝗼𝗺𝗽𝗮𝗻𝗶𝗲𝘀 𝗹𝗶𝗸𝗲 𝗔𝗺𝗮𝘇𝗼𝗻, 𝗚𝗼𝗼𝗴𝗹𝗲, 𝗠𝗶𝗰𝗿𝗼𝘀𝗼𝗳𝘁, 𝗜𝗕𝗠, 𝗧𝗖𝗦, 𝗖𝗼𝗴𝗻𝗶𝘇𝗮𝗻𝘁, 𝗪𝗶𝗽𝗿𝗼, 𝗖𝗧𝗦, 𝗚𝗼𝗹𝗱𝗺𝗮𝗻 𝗦𝗮𝗰𝗵𝘀, 𝗢𝗹𝗮, 𝗨𝗯𝗲𝗿, 𝗭𝗼𝗺𝗮𝘁𝗼, 𝗦𝘄𝗶𝗴𝗴𝘆, 𝘂𝗽𝗚𝗿𝗮𝗱, 𝗖𝘂𝗿𝗲 𝗙𝗶𝘁, 𝗛𝗮𝗰𝗸𝗲𝗿𝗿𝗮𝗻𝗸, 𝗚𝗲𝗲𝗸𝘀𝗳𝗼𝗿𝗴𝗲𝗲𝗸𝘀 𝗮𝗻𝗱 𝗺𝗮𝗻𝘆 𝗺𝗼𝗿𝗲, 𝗰𝗮𝗻 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲𝘀𝗲 𝗯𝗲𝗹𝗼𝘄 𝗰𝗵𝗮𝗻𝗻𝗲𝗹𝘀 👇👇   𝗝𝗼𝗶𝗻 𝗻𝗼𝘄 @jobsandinternshipsupdates @jobsandinternshipsindia 🔥🔥 𝗟𝗮𝘁𝗲𝘀𝘁 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗨𝗽𝗱𝗮𝘁𝗲𝘀 𝗳𝗼𝗿 𝟮𝟬𝟭𝟳, 𝟮𝟬𝟭𝟴, 𝟮𝟬𝟭𝟵, 𝟮𝟬𝟮𝟬, 𝟮𝟬𝟮𝟭, 𝟮𝟬𝟮𝟮, 𝟮𝟬𝟮𝟯, 𝟮𝟬𝟮𝟰, 𝟮𝟬𝟮𝟱 𝗮𝗻𝗱 𝟮𝟬𝟮𝟲 𝗕𝗮𝘁𝗰𝗵.