Pulkit Malhotra
Pulkit Malhotra
  • 300
  • 47 199
POTD- 28/12/2024 | Find All Triplets with Zero Sum | Problem of the Day | GeeksforGeeks
POTD: www.geeksforgeeks.org/problems/find-all-triplets-with-zero-sum/1
Code: discuss.geeksforgeeks.org/comment/05b60431-30e7-4580-94a7-335c12752a42/practice
Timestamp:
00:00 - Explanation
Connect with me :
LinkedIn: www.linkedin.com/in/thepulkitmalhotra/
Twitter: mobile. PulkitMalhotraa
GitHub: github.com/PulkitMalhotra161001
#coding #programming #GeeksforGeeks #ProblemofTheDay #CodingQuestions #POTD #problemsolving #practice #dsa #gfgpotd #gfg #dailychallenge #cpp #java #datastructures #algorithms #PulkitMalhotra #microsoft #amazon #google #flipkart #facebook #adobe #faang #interviewquestions
Переглядів: 12

Відео

POTD- 27/12/2024 | Count pairs with given sum | Problem of the Day | GeeksforGeeks
Переглядів 142 години тому
POTD: www.geeksforgeeks.org/problems/count-pairs-with-given-sum 150253/1 Code: discuss.geeksforgeeks.org/comment/7417593a-c98f-4952-ac76-0c173ff1054b/practice Timestamp: 00:00 - Explanation Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #GeeksforGeeks #ProblemofTheDay #Co...
POTD- 26/12/2024 | Two Sum - Pair with Given Sum | Problem of the Day | GeeksforGeeks
Переглядів 444 години тому
POTD: www.geeksforgeeks.org/problems/key-pair5616/1 Code: discuss.geeksforgeeks.org/comment/37977950-4adf-4980-9e8b-38644c38acf4/practice Timestamp: 00:00 - Explanation 00:43 - Approach 05:23 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #GeeksforGeeks #ProblemofT...
POTD- 25/12/2024 | Set Matrix Zeroes | Problem of the Day | GeeksforGeeks
Переглядів 247 годин тому
POTD: www.geeksforgeeks.org/problems/set-matrix-zeroes/1 Code: discuss.geeksforgeeks.org/comment/cdb90f07-1eb6-4ff8-93ec-35a68ed7fa29/practice Timestamp: 00:00 - Explanation 00:53 - Approach 07:25 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #GeeksforGeeks #Probl...
POTD- 24/12/2024 | Search in a sorted Matrix | Problem of the Day | GeeksforGeeks
Переглядів 679 годин тому
POTD: www.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1 Code: discuss.geeksforgeeks.org/comment/0e6897f7-4930-4c3c-a071-729885903669/practice Timestamp: 00:00 - Explanation 00:37 - Approach 09:52 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #Geeksfor...
POTD- 23/12/2024 | Search in a row-wise sorted matrix | Problem of the Day | GeeksforGeeks
Переглядів 6314 годин тому
POTD: www.geeksforgeeks.org/problems/search-in-a-row-wise-sorted-matrix/1 Code: discuss.geeksforgeeks.org/comment/505b7189-d006-45ec-8aae-19d9cae4fd6b/practice Timestamp: 00:00 - Explanation 00:42 - Approach 02:59 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #Gee...
POTD- 22/12/2024 | Search in a Row-Column sorted matrix | Problem of the Day | GeeksforGeeks
Переглядів 2514 годин тому
POTD: www.geeksforgeeks.org/problems/search-in-a-matrix17201720/1 Code: discuss.geeksforgeeks.org/comment/7281390e-9be1-428e-9330-cc6eb55a9d4d/practice Timestamp: 00:00 - Explanation 00:41 - Approach 04:29 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #GeeksforGee...
POTD- 21/12/2024 | Rotate by 90 degree | Problem of the Day | GeeksforGeeks
Переглядів 5716 годин тому
POTD: www.geeksforgeeks.org/problems/rotate-by-90-degree-1587115621/1 Code: discuss.geeksforgeeks.org/comment/afea7aef-caea-4be5-86a8-0574b2421b4d/practice Timestamp: 00:00 - Explanation 00:37 - Approach 1 11:00 - Code 1 11:50 - Approach 2 16:23 - Code 2 Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhot...
POTD- 20/12/2024 | Spirally traversing a matrix | Problem of the Day | GeeksforGeeks
Переглядів 3319 годин тому
POTD: www.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1 Code: discuss.geeksforgeeks.org/comment/c5ed2861-7b2b-4f04-a0dc-1783fb297cfc/practice Timestamp: 00:00 - Explanation 00:40 - Approach 08:15 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming...
POTD- 19/12/2024 | Kth Missing Positive Number in a Sorted Array| Problem of the Day | GeeksforGeeks
Переглядів 8821 годину тому
POTD: www.geeksforgeeks.org/problems/kth-missing-positive-number-in-a-sorted-array/1 Code: discuss.geeksforgeeks.org/comment/ee47db34-924a-4c21-8c1a-0582d1a156f0/practice Timestamp: 00:00 - Explanation 01:55 - Approach 1 05:21 - Code 1 10:50 - Approach 2 20:59 - Code 2 Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.c...
POTD- 18/12/2024 | Allocate Minimum Pages | Problem of the Day | GeeksforGeeks
Переглядів 120День тому
POTD: www.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1 Code: discuss.geeksforgeeks.org/comment/81d63eec-78fa-4d5e-be65-1fcbcdf41725/practice Timestamp: 00:00 - Explanation 03:16 - Approach 17:32 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #G...
POTD- 17/12/2024 | Aggressive Cows | Problem of the Day | GeeksforGeeks
Переглядів 236День тому
POTD: www.geeksforgeeks.org/problems/aggressive-cows/1 Code: discuss.geeksforgeeks.org/comment/d36413c7-7c69-4dc1-8063-fb736f889e6b/practice Timestamp: 00:00 - Explanation 02:00 - Approach 10:09 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #GeeksforGeeks #Problem...
POTD- 16/12/2024 | K-th element of two Arrays | Problem of the Day | GeeksforGeeks
Переглядів 73День тому
Similar: ua-cam.com/video/_rjD7M_2myU/v-deo.html POTD: www.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array1317/1 Code: discuss.geeksforgeeks.org/comment/83a627bc-f0ad-4853-9263-0308fea8edba/practice Timestamp: 00:00 - Explanation 00:42 - Approach 09:11 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github...
POTD- 15/12/2024 | Peak element | Problem of the Day | GeeksforGeeks
Переглядів 116День тому
POTD: www.geeksforgeeks.org/problems/peak-element/1 Code: discuss.geeksforgeeks.org/comment/026492e2-4943-42a2-9d5d-54a4d78691dd/practice Timestamp: 00:00 - Explanation 01:35 - Approach 05:44 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #GeeksforGeeks #ProblemofT...
POTD- 14/12/2024 | Search in Rotated Sorted Array | Problem of the Day | GeeksforGeeks
Переглядів 14514 днів тому
POTD: www.geeksforgeeks.org/problems/search-in-a-rotated-array4618/1 Code: discuss.geeksforgeeks.org/comment/19093a4d-b3e3-452b-91c5-ac9119c3a5f0/practice Timestamp: 00:00 - Explanation 00:32 - Approach 05:14 - Code Connect with me : LinkedIn: www.linkedin.com/in/thepulkitmalhotra/ Twitter: mobile. PulkitMalhotraa GitHub: github.com/PulkitMalhotra161001 #coding #programming #Geeksfor...
POTD- 13/12/2024 | Sorted and Rotated Minimum | Problem of the Day | GeeksforGeeks
Переглядів 7014 днів тому
POTD- 13/12/2024 | Sorted and Rotated Minimum | Problem of the Day | GeeksforGeeks
POTD- 12/12/2024 | Number of occurrence | Problem of the Day | GeeksforGeeks
Переглядів 2314 днів тому
POTD- 12/12/2024 | Number of occurrence | Problem of the Day | GeeksforGeeks
POTD- 11/12/2024 | Merge Without Extra Space | Problem of the Day | GeeksforGeeks
Переглядів 5114 днів тому
POTD- 11/12/2024 | Merge Without Extra Space | Problem of the Day | GeeksforGeeks
POTD- 10/12/2024 | Non-overlapping Intervals | Problem of the Day | GeeksforGeeks
Переглядів 16214 днів тому
POTD- 10/12/2024 | Non-overlapping Intervals | Problem of the Day | GeeksforGeeks
POTD- 09/12/2024 | Insert Interval | Problem of the Day | GeeksforGeeks
Переглядів 1814 днів тому
POTD- 09/12/2024 | Insert Interval | Problem of the Day | GeeksforGeeks
POTD- 08/12/2024 | Overlapping Intervals | Problem of the Day | GeeksforGeeks
Переглядів 10021 день тому
POTD- 08/12/2024 | Overlapping Intervals | Problem of the Day | GeeksforGeeks
POTD- 07/12/2024 | Count Inversions | Problem of the Day | GeeksforGeeks
Переглядів 3421 день тому
POTD- 07/12/2024 | Count Inversions | Problem of the Day | GeeksforGeeks
POTD- 06/12/2024 | Find H-Index | Problem of the Day | GeeksforGeeks
Переглядів 19921 день тому
POTD- 06/12/2024 | Find H-Index | Problem of the Day | GeeksforGeeks
POTD- 05/12/2024 | Sort 0s, 1s and 2s | Problem of the Day | GeeksforGeeks
Переглядів 11521 день тому
POTD- 05/12/2024 | Sort 0s, 1s and 2s | Problem of the Day | GeeksforGeeks
POTD- 04/12/2024 | Strings Rotations of Each Other | Problem of the Day | GeeksforGeeks
Переглядів 4421 день тому
POTD- 04/12/2024 | Strings Rotations of Each Other | Problem of the Day | GeeksforGeeks
POTD- 03/12/2024 | Min Chars to Add for Palindrome | Problem of the Day | GeeksforGeeks
Переглядів 32021 день тому
POTD- 03/12/2024 | Min Chars to Add for Palindrome | Problem of the Day | GeeksforGeeks
POTD- 02/12/2024 | Search Pattern (KMP-Algorithm) | Problem of the Day | GeeksforGeeks
Переглядів 67421 день тому
POTD- 02/12/2024 | Search Pattern (KMP-Algorithm) | Problem of the Day | GeeksforGeeks
POTD- 01/12/2024 | Non Repeating Character | Problem of the Day | GeeksforGeeks
Переглядів 4221 день тому
POTD- 01/12/2024 | Non Repeating Character | Problem of the Day | GeeksforGeeks
POTD- 30/11/2024 | Anagram | Problem of the Day | GeeksforGeeks
Переглядів 5828 днів тому
POTD- 30/11/2024 | Anagram | Problem of the Day | GeeksforGeeks
POTD- 29/11/2024 | Add Binary Strings | Problem of the Day | GeeksforGeeks
Переглядів 5428 днів тому
POTD- 29/11/2024 | Add Binary Strings | Problem of the Day | GeeksforGeeks

КОМЕНТАРІ

  • @Ziggler-e9f
    @Ziggler-e9f День тому

    Were all the rounds virtual ?

  • @jeevan-23
    @jeevan-23 2 дні тому

    The question was a simple dfs right? btw how many days did it took to get an interview call after the oa

  • @naturesrevolution
    @naturesrevolution 3 дні тому

    👍

  • @commander9173
    @commander9173 3 дні тому

    no worried bro you will make something big than amazon just keep working! thanks a lot for interview experience❤❤

  • @naturesrevolution
    @naturesrevolution 4 дні тому

    but understoor

  • @naturesrevolution
    @naturesrevolution 4 дні тому

    from middle of the video

  • @naturesrevolution
    @naturesrevolution 4 дні тому

    audio not available

  • @aizad786iqbal
    @aizad786iqbal 23 дні тому

    expected is linear,

  • @naturesrevolution
    @naturesrevolution 23 дні тому

    why c++?

  • @naturesrevolution
    @naturesrevolution 23 дні тому

    Bro you won't sleep?..

  • @naturesrevolution
    @naturesrevolution 24 дні тому

    Thank you sir

  • @prasannakumarmoturi8844
    @prasannakumarmoturi8844 25 днів тому

    Nice Explanation

  • @naturesrevolution
    @naturesrevolution 26 днів тому

    Thank you

  • @Ajiteshsonkar2008
    @Ajiteshsonkar2008 26 днів тому

    Sir tell more about the class 10 coding

  • @naturesrevolution
    @naturesrevolution 26 днів тому

    Thanks a lot for uploading early 🙏

  • @thekartiks
    @thekartiks Місяць тому

    I always start practicing DSA questions, but I am unable to stay consistent for 2 to 3 days. I get stuck, and I’m unable to think through the question or create a solution. I feel demotivated and tired of solving questions when they start to feel hard.

    • @PulkitMalhotra
      @PulkitMalhotra Місяць тому

      it happens to everyone in starting. keep pushing yourself, you can do it

    • @thekartiks
      @thekartiks Місяць тому

      Can you give list of questions for logic building

    • @PulkitMalhotra
      @PulkitMalhotra Місяць тому

      just follow striver A2Z sheet

  • @kuchv7297
    @kuchv7297 Місяць тому

    very nice explanation , was not getting clear from others

  • @ganeshjaggineni4097
    @ganeshjaggineni4097 Місяць тому

    NICE SUPER EXCELLENT MOTIVATED

  • @amitvaishnavofficial4033
    @amitvaishnavofficial4033 Місяць тому

    clear approach and intution

  • @tarun2038
    @tarun2038 Місяць тому

    Great concept pulkit sir 😊

  • @aizad786iqbal
    @aizad786iqbal Місяць тому

    you uploaded the same video...

    • @PulkitMalhotra
      @PulkitMalhotra Місяць тому

      question is same. check the code in description for reference

  • @PulkitMalhotra
    @PulkitMalhotra Місяць тому

    There's a slight change between Majority Vote and Majority Vote 2, so read the problem description and check out the solution in the description box.

  • @aizad786iqbal
    @aizad786iqbal Місяць тому

    your code is wrong very strange how it passed in the first place.. return any index pair(i, j) in an array such that sum(arr[0..i]) = sum(arr[i+1..j]) = sum(arr[j+1..n-1]) per your code, your i would always be 0...

    • @PulkitMalhotra
      @PulkitMalhotra Місяць тому

      It is working fine. Check 10:22. As you already said sum(arr[0..i]) and we can return any pair so in the first pair i is 0 and i am returning the first pair indices.

  • @aizad786iqbal
    @aizad786iqbal Місяць тому

    it's not working, and why are you using -- (0,end) ?? how will that divide the array in 3 parts ? also u created freq but didn't use it anywhere...

  • @aizad786iqbal
    @aizad786iqbal Місяць тому

    class Solution { static int minRepeats(String s1, String s2) { // code here int ans = 0; StringBuilder sb = new StringBuilder(); boolean[] set1 = new boolean[26]; boolean[] set2 = new boolean[26]; for(int i=0; i<s1.length(); i++){ char ch = s1.charAt(i); set1[ch-'a'] = true; } for(int i=0; i<s2.length(); i++){ char ch = s2.charAt(i); set2[ch-'a'] = true; } for(int i=0; i<26; i++){ if(set2[i] == true && set1[i] == false ){ return -1; } } while( sb.length() < 2 * s2.length() ){ sb.append(s1); ans++; if(sb.toString().contains(s2)){ return ans; } } return -1; } }; why is my code giving TLE,

  • @naturesrevolution
    @naturesrevolution Місяць тому

    Try to upload early 🙏

    • @PulkitMalhotra
      @PulkitMalhotra Місяць тому

      Sure. I will try my best to upload early

  • @naturesrevolution
    @naturesrevolution Місяць тому

    kindly explain space and time complexity of each problem...

  • @naturesrevolution
    @naturesrevolution Місяць тому

    We can simply take transpose and reverse it... ?

  • @naturesrevolution
    @naturesrevolution Місяць тому

    sir will you upload videos daily?

  • @naturesrevolution
    @naturesrevolution Місяць тому

    atlast I found video in english thankyou..

  • @nithishkumarramasamy9985
    @nithishkumarramasamy9985 Місяць тому

    Great Thanks

  • @kthamim7552
    @kthamim7552 2 місяці тому

    in my side they were giving only one paramter as head of the linked list ,not a array ,low and hight and queestion also as oneline not as you showing a question why?

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      just build a function. For reference check code in description.

  • @bipulasarcomilla9105
    @bipulasarcomilla9105 2 місяці тому

    would you please give me the link of quick sort problem?

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      check description

    • @bipulasarcomilla9105
      @bipulasarcomilla9105 Місяць тому

      @@PulkitMalhotra quicksort problem in gfg

    • @PulkitMalhotra
      @PulkitMalhotra Місяць тому

      www.geeksforgeeks.org/problems/quick-sort/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card

  • @ritual.boy097
    @ritual.boy097 2 місяці тому

    Bhai English mei nahi aa rha hai toh Hindi mei daal de Aaj hi global audience attract krega kya ye bta Matlab kuch bhi daalo explanantion dekh tu pehle bhai apni

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      I'll try to be more concise in the future.

  • @AbdurRahim-ry7tj
    @AbdurRahim-ry7tj 2 місяці тому

    nice explanation bro

  • @abhijitmanna4524
    @abhijitmanna4524 2 місяці тому

    Explanation is very poor, you getting stuck in between explanation breaking the momentum of explanation.

  • @vardhanadoni2308
    @vardhanadoni2308 2 місяці тому

    great explanation

  • @galepraveen
    @galepraveen 2 місяці тому

    Great explanation, you covered what I couldn't 🙌🙌

  • @tarifahmed4956
    @tarifahmed4956 2 місяці тому

    voice is very low please next time explain with a louder voice

  • @aizad786iqbal
    @aizad786iqbal 2 місяці тому

    i would suggest to type the code instead, like u did yesterday, it may take more time, but it's better...

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      I had less time yesterday so I did the coding while making the video.

  • @rc_0112
    @rc_0112 2 місяці тому

    can you solve this question without using hashmap

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      We can use array but that will be costlier in terms of space complexity.

  • @test-nature
    @test-nature 2 місяці тому

    I requested to explain quetion fully. I don't know where i missed I didn't understand the question also

  • @gowthamkumar4622
    @gowthamkumar4622 2 місяці тому

    Did you even understand the P.S. ? Please don't do this for views by copying the code from comments and explaining it.

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      There's a high chances that you are not a Java programmer. In the driver code XOR function is not written.

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      Check out this video (C++ language) : ua-cam.com/video/JCDxVovAIRo/v-deo.html

  • @harsh-pandey
    @harsh-pandey 2 місяці тому

    Keep it up brother

  • @aizad786iqbal
    @aizad786iqbal 2 місяці тому

    Hangup (SIGHUP) Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 41 out of bounds for length 41 at GFG.main(GFG.java:18) I am getting this, can you please check yours, I have reported this issue, even with your code this is coming for a very big test case

    • @aizad786iqbal
      @aizad786iqbal 2 місяці тому

      that error is now fixed and only shown when using as custom input, data is too huge more than 50, 000 chars that's why my code gets this, even though it's same as yours, except variables names.... even chatgpt didn't find any issues and not much difference in our code.. Hangup (SIGHUP) Exception in thread "main" java.lang.StackOverflowError at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solution.dfs(GFG.java:47) at Solutio

  • @kartikkaushik4743
    @kartikkaushik4743 2 місяці тому

    Hi u were stammering a lot can u pls speak in hindi

  • @tarifahmed4956
    @tarifahmed4956 2 місяці тому

    great explanation bhaiya

  • @tusharjainchintu
    @tusharjainchintu 2 місяці тому

    Kal se kuch n kuch problem aari hai geeksforgeeks mai code bhe sahi hota hai, fir bhe problm aari hai..

  • @MRDELL-mc6zo
    @MRDELL-mc6zo 2 місяці тому

    what if there are more than two elements of frequency more than n/3 ?

    • @amanqureshi3222
      @amanqureshi3222 2 місяці тому

      it can not be possible.

    • @PulkitMalhotra
      @PulkitMalhotra 2 місяці тому

      The freq. have to be greater than n/3 >n/3 There's only two values possible Let's Take the min. freq a freq = (n/3)+1 b freq = (n/3)+1 n - (a freq) - (b freq) n - (n/3 + 1) - (n/3 + 1) n - 2n/3 - 2 (3n - 2n - 6)/3 (n-6)/3 n/3 - 2 Means third candidate freq is not greater than n/3