SoCalledMentor
SoCalledMentor
  • 69
  • 1 826
2997. Minimum Add to Make Parentheses Valid (Medium) || Leetcode || POTD
In this video, we have discussed a medium level leetcode problem which we have solved using the concept of stack data structure.
problem link: tinyurl.com/4vnk42sy
solution link: tinyurl.com/44ubk47h
มุมมอง: 17

วีดีโอ

Find First and Last Position of Element in Array - Binary Search33:54Find First and Last Position of Element in Array - Binary Search
Find First and Last Position of Element in Array - Binary Search
มุมมอง 42 ชั่วโมงที่ผ่านมา
In this video, we have discussed a problem from Leetcode named "Find First and Last Position of Element in Array" which we have solved using the binary search algorithm. For getting the better understanding of what we have done in this video, I strongly suggest you to watch the first video of this binary search series. I have discussed all the related concept in that video. problem link: tinyur...
Search Insert Position - Binary Search20:03Search Insert Position - Binary Search
Search Insert Position - Binary Search
มุมมอง 32 ชั่วโมงที่ผ่านมา
In this video, we have discussed a problem from Leetcode named Search Insert Position which we have solved using the binary search algorithm. For getting the better understanding of what we have done in this video, I strongly suggest you to watch the first video of this binary search series. I have discussed all the related concept in that video. problem link: tinyurl.com/ms8unuun solution link...
Floor in a Sorted Array22:02Floor in a Sorted Array
Floor in a Sorted Array
มุมมอง 22 ชั่วโมงที่ผ่านมา
In this video, we have discussed a problem from geeksforgeeks named Floor in a Sorted Array which we have solved using the binary search algorithm. For getting the better understanding of what we have done in this video. I strongly suggest you to watch the first video of this binary search series. I have discussed all the related concept in that video. problem link: tinyurl.com/yvuphymp solutio...
Binary Search - Time Complexity Analysis14:07Binary Search - Time Complexity Analysis
Binary Search - Time Complexity Analysis
มุมมอง 12 ชั่วโมงที่ผ่านมา
In this video, we have discussed about the time complexity of binary search algorithm.
Binary Search - An Introduction53:01Binary Search - An Introduction
Binary Search - An Introduction
มุมมอง 42 ชั่วโมงที่ผ่านมา
This is the first video of our binary search series. In this video, we have discussed about how to identify that we can use binary search algorithm in problems, how to avoid tle and also discussed a template that we can use across various binary search problems.
2997. Number Complement (Easy) || Leetcode || POTD26:162997. Number Complement (Easy) || Leetcode || POTD
2997. Number Complement (Easy) || Leetcode || POTD
มุมมอง 7หลายเดือนก่อน
In this video, we have discussed two approaches to do the problem. One is more intuitive. It's time complexity is O(log(n)) while other is using bits operation and is completely utilising bit manipulation. Time Complexity is O(1). problem link: tinyurl.com/yamy6jd6 solution link: tinyurl.com/4ntwmv8c
2997. Minimum Number of Operations to Make Array XOR Equal to K (Medium) || Leetcode || POTD17:302997. Minimum Number of Operations to Make Array XOR Equal to K (Medium) || Leetcode || POTD
2997. Minimum Number of Operations to Make Array XOR Equal to K (Medium) || Leetcode || POTD
มุมมอง 205 หลายเดือนก่อน
It is the solution video of the Problem of the day of 29th April 2024, from the Leetcode. problem link: tinyurl.com/2cdcxcfx solution link: tinyurl.com/58fuw29w
1137. N-th Tribonacci Number (Easy) || Leetcode || POTD21:451137. N-th Tribonacci Number (Easy) || Leetcode || POTD
1137. N-th Tribonacci Number (Easy) || Leetcode || POTD
มุมมอง 255 หลายเดือนก่อน
It is the solution video of the Problem of the day of 24th April 2024, from the Leetcode. problem link: tinyurl.com/4xkk8p5f solution link: tinyurl.com/mr3jhyya
310. Minimum Height Trees (Medium) || Leetcode || POTD38:22310. Minimum Height Trees (Medium) || Leetcode || POTD
310. Minimum Height Trees (Medium) || Leetcode || POTD
มุมมอง 265 หลายเดือนก่อน
It is the solution video of the Problem of the day of 23rd April 2024, from the Leetcode. problem link: tinyurl.com/5n749fx3 solution link: tinyurl.com/5n7r6vbc
752. Open the Lock (Medium) || Leetcode || POTD32:41752. Open the Lock (Medium) || Leetcode || POTD
752. Open the Lock (Medium) || Leetcode || POTD
มุมมอง 395 หลายเดือนก่อน
It is the solution video of the Problem of the day of 22nd April 2024, from the Leetcode. problem link: tinyurl.com/bvkysr69 solution link: tinyurl.com/mpmy4huj
1992. Find All Groups of Farmland (Medium) || Leetcode || POTD26:371992. Find All Groups of Farmland (Medium) || Leetcode || POTD
1992. Find All Groups of Farmland (Medium) || Leetcode || POTD
มุมมอง 645 หลายเดือนก่อน
It is the solution video of the Problem of the day of 20th April 2024, from the Leetcode. problem link: tinyurl.com/mvwc9837 solution link: tinyurl.com/n9hmbp74
463. Island Perimeter(Easy) || Leetcode || POTD17:42463. Island Perimeter(Easy) || Leetcode || POTD
463. Island Perimeter(Easy) || Leetcode || POTD
มุมมอง 125 หลายเดือนก่อน
It is the solution video of the Problem of the day of 18th April 2024, from the Leetcode. problem link: tinyurl.com/2tru9rkt solution link: tinyurl.com/396js2bw
988. Smallest String Starting From Leaf (Medium) || Leetcode || POTD16:38988. Smallest String Starting From Leaf (Medium) || Leetcode || POTD
988. Smallest String Starting From Leaf (Medium) || Leetcode || POTD
มุมมอง 265 หลายเดือนก่อน
It is the solution video of the Problem of the day of 17th April 2024, from the Leetcode. problem link: tinyurl.com/mznvj68r solution link: tinyurl.com/29jhfhyb
623. Add One Row to Tree (Medium) || Leetcode || POTD19:32623. Add One Row to Tree (Medium) || Leetcode || POTD
623. Add One Row to Tree (Medium) || Leetcode || POTD
มุมมอง 235 หลายเดือนก่อน
It is the solution video of the Problem of the day of 16th April 2024, from the Leetcode. problem link: tinyurl.com/mrxrjrav solution link: tinyurl.com/529eud7a
129. Sum Root to Leaf Numbers (Medium) || Leetcode || POTD24:24129. Sum Root to Leaf Numbers (Medium) || Leetcode || POTD
129. Sum Root to Leaf Numbers (Medium) || Leetcode || POTD
มุมมอง 275 หลายเดือนก่อน
129. Sum Root to Leaf Numbers (Medium) || Leetcode || POTD
42. Trapping Rain Water (Hard) || Leetcode || POTD20:2242. Trapping Rain Water (Hard) || Leetcode || POTD
42. Trapping Rain Water (Hard) || Leetcode || POTD
มุมมอง 295 หลายเดือนก่อน
42. Trapping Rain Water (Hard) || Leetcode || POTD
402. Remove K Digits (Medium) || Leetcode || POTD14:42402. Remove K Digits (Medium) || Leetcode || POTD
402. Remove K Digits (Medium) || Leetcode || POTD
มุมมอง 195 หลายเดือนก่อน
402. Remove K Digits (Medium) || Leetcode || POTD
950. Reveal Cards in Increasing Order (Medium) || Leetcode || POTD19:24950. Reveal Cards in Increasing Order (Medium) || Leetcode || POTD
950. Reveal Cards in Increasing Order (Medium) || Leetcode || POTD
มุมมอง 455 หลายเดือนก่อน
950. Reveal Cards in Increasing Order (Medium) || Leetcode || POTD
2073. Time Needed to Buy Tickets (Easy) || Leetcode || POTD15:172073. Time Needed to Buy Tickets (Easy) || Leetcode || POTD
2073. Time Needed to Buy Tickets (Easy) || Leetcode || POTD
มุมมอง 126 หลายเดือนก่อน
2073. Time Needed to Buy Tickets (Easy) || Leetcode || POTD
1700. Number of Students Unable to Eat Lunch (Easy) || Leetcode || POTD15:351700. Number of Students Unable to Eat Lunch (Easy) || Leetcode || POTD
1700. Number of Students Unable to Eat Lunch (Easy) || Leetcode || POTD
มุมมอง 516 หลายเดือนก่อน
1700. Number of Students Unable to Eat Lunch (Easy) || Leetcode || POTD
1249. Minimum Remove to Make Valid Parentheses (Medium) || Leetcode || POTD19:341249. Minimum Remove to Make Valid Parentheses (Medium) || Leetcode || POTD
1249. Minimum Remove to Make Valid Parentheses (Medium) || Leetcode || POTD
มุมมอง 316 หลายเดือนก่อน
1249. Minimum Remove to Make Valid Parentheses (Medium) || Leetcode || POTD
1544. Make The String Great (Easy) || Leetcode || POTD20:271544. Make The String Great (Easy) || Leetcode || POTD
1544. Make The String Great (Easy) || Leetcode || POTD
มุมมอง 196 หลายเดือนก่อน
1544. Make The String Great (Easy) || Leetcode || POTD
1614. Maximum Nesting Depth of the Parentheses (Easy) || Leetcode || POTD19:301614. Maximum Nesting Depth of the Parentheses (Easy) || Leetcode || POTD
1614. Maximum Nesting Depth of the Parentheses (Easy) || Leetcode || POTD
มุมมอง 96 หลายเดือนก่อน
1614. Maximum Nesting Depth of the Parentheses (Easy) || Leetcode || POTD
79. Word Search (Medium) || Leetcode || POTD41:5279. Word Search (Medium) || Leetcode || POTD
79. Word Search (Medium) || Leetcode || POTD
มุมมอง 326 หลายเดือนก่อน
79. Word Search (Medium) || Leetcode || POTD
205. Isomorphic Strings (Easy) || Leetcode || POTD14:24205. Isomorphic Strings (Easy) || Leetcode || POTD
205. Isomorphic Strings (Easy) || Leetcode || POTD
มุมมอง 246 หลายเดือนก่อน
205. Isomorphic Strings (Easy) || Leetcode || POTD
58. Length of Last Word (Easy) || Leetcode || POTD18:2358. Length of Last Word (Easy) || Leetcode || POTD
58. Length of Last Word (Easy) || Leetcode || POTD
มุมมอง 226 หลายเดือนก่อน
58. Length of Last Word (Easy) || Leetcode || POTD
2444. Count Subarrays With Fixed Bounds (Hard) || Leetcode || POTD27:122444. Count Subarrays With Fixed Bounds (Hard) || Leetcode || POTD
2444. Count Subarrays With Fixed Bounds (Hard) || Leetcode || POTD
มุมมอง 976 หลายเดือนก่อน
2444. Count Subarrays With Fixed Bounds (Hard) || Leetcode || POTD
992. Subarrays with K Different Integers (Hard) || Leetcode || POTD40:03992. Subarrays with K Different Integers (Hard) || Leetcode || POTD
992. Subarrays with K Different Integers (Hard) || Leetcode || POTD
มุมมอง 166 หลายเดือนก่อน
992. Subarrays with K Different Integers (Hard) || Leetcode || POTD
2958. Length of Longest Subarray With at Most K Frequency (Medium) || Leetcode || POTD37:202958. Length of Longest Subarray With at Most K Frequency (Medium) || Leetcode || POTD
2958. Length of Longest Subarray With at Most K Frequency (Medium) || Leetcode || POTD
มุมมอง 186 หลายเดือนก่อน
2958. Length of Longest Subarray With at Most K Frequency (Medium) || Leetcode || POTD

ความคิดเห็น

  • @fffooccc9801
    @fffooccc9801 6 หลายเดือนก่อน

    try this , simple and coincise : bool isIsomorphic(string s, string t) { if(s.length()!=t.length()) return false; map<char,char> mp_a; map<char,char> mp_t; for(int i=0;i<s.length();i++){ if(mp_a.find(s[i])==mp_a.end()) mp_a.insert({s[i],t[i]}); else if(t[i]!=mp_a[s[i]]) return false; if(mp_t.find(t[i])==mp_t.end()) mp_t.insert({t[i],s[i]}); else if(s[i]!=mp_t[t[i]]) return false; } return true; }

    • @rishisharma0930
      @rishisharma0930 6 หลายเดือนก่อน

      Ok, thanks for sharing your approach

  • @deepshikhadhakrey54
    @deepshikhadhakrey54 6 หลายเดือนก่อน

    The idea of looking it as linked list is great and your explanation is quite helpful.

    • @rishisharma0930
      @rishisharma0930 6 หลายเดือนก่อน

      Glad it was helpful ! Thanks for the feedback.

  • @sudhadevi6692
    @sudhadevi6692 6 หลายเดือนก่อน

    Good explanation bhaiya❤

    • @rishisharma0930
      @rishisharma0930 6 หลายเดือนก่อน

      thanks for giving feedback. I hope you understood the solution

  • @ShivamRajput-cm7nl
    @ShivamRajput-cm7nl 7 หลายเดือนก่อน

    Easy and logical explanation🔥

    • @rishisharma0930
      @rishisharma0930 6 หลายเดือนก่อน

      thanks for giving feedback. I hope you understood the solution.