Construct K Palindrome Strings | Leetcode 1400

Поделиться
HTML-код
  • Опубликовано: 3 фев 2025
  • This video explains Construct K Palindrome Strings using the most optimal hashmap counting approach.
    ----------------------------------------------------------------------------------------------------------------------------------------------------------------
    🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: +91 8918633037
    🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
    🔵 LinkedIn: / surya-pratap-kahar
    🔴 INSTAGRAM: / techdose_official
    🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
    ---------------------------------------------------------------------------------------------------------------------------------------------------------------
    𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

Комментарии • 10

  • @bhavukkalra1786
    @bhavukkalra1786 23 дня назад +1

    Another great explaination!

  • @yahiko5777
    @yahiko5777 23 дня назад

    why should we consider 10 power 8 as optimal? what is the criteria

    • @ashirvadmohanty5331
      @ashirvadmohanty5331 23 дня назад

      if your algorithm goes above 10^8 you will get a time limit exceeded (tle) error

    • @techdose4u
      @techdose4u  23 дня назад +1

      1 sec = 10^8 computations is taken as standard

  • @fellowviber7792
    @fellowviber7792 23 дня назад

    bhai kya hua video mast late hogaya, neetcode ka solution use keya fir mei ne

    • @techdose4u
      @techdose4u  23 дня назад +1

      Busy in LIVE sessions :)

    • @fellowviber7792
      @fellowviber7792 21 день назад

      @@techdose4u good , don't neglect health bro

    • @techdose4u
      @techdose4u  21 день назад

      Yea I couldnt get sleep.
      You will find this in some of my daily videos 😅