Check If Array Pairs Are Divisible by k | Leetcode 1497

This video explains check if array pairs are divisible by K problem using the modulo arithmetic and counting frequency using hashmap.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@priyathakur6418]

I have not seen your video before as it was 1 hour before it updated and had few views and wandered towards the older videos that had more views but your explanation beats the older videos and makes me understand the question in a very easy and better way......!!!!!!!! Thanks nice explanation😇😇

[@techdose4u]

:P As people say, don't judge a book by its cover :)

[@pranavsharma7479]

crisp clear as always

[@techdose4u]

Thanks :)

[@VISHALMISHRA-ff2ih]

Your explanation is always nice👍

[@techdose4u]

thanks

[@DharmendraKumar-m7l4w]

clear and focused explanations

[@techdose4u]

THanks

[@sameersah-p3b]

In arithmetics, reminder must always be positive. Check modulo of negative number for more details.

[@techdose4u]

yepp :)

[@sailendrachettri8521]

Thank you sir :) See you again tomorrow !

[@techdose4u]

cya :)

[@moha3381]

that was just perfect, really thank you brother! but i have one note can you make the words on the background more clear and not connected cuz some of them hard to read and again thank you for your effort

[@techdose4u]

Point noted My handwritting is trash. Just trying to work around it :)

[@anupamkumartejaswi9210]

Great solution and nicely explained

[@techdose4u]

thanks

[@Khadijah_Shabir]

thank you. It was helpful

[@techdose4u]

Welcome

[@anshvajpai4850]

nice explaination

[@techdose4u]

Thanks :)

[@YASHBHARDWAJ-f9i]

always provide java code also in github or in video

[@techdose4u]

I will try

[@tapu_]

My implementation worked only on positive numbers. I messed up which languages do positive remainders

[@taskeen_fatimaa]

Thankyou sir

[@techdose4u]

welcome :)

[@vaibhavchougule2]

arr = [75,5,-5,75,-2,-3,88,10,10,87] , k = 85 which are the 5 pairs that gives sum which is completely divided by k i.e 85 i got only four (10 , 75) (5 , -5) (-2 , 87) (-3 , 88)

[@rmaravind940]

true

[@BananaButcher]

I really like this type of vidoes along with the questions form the leetcode. but i would like to have the python code alongside. can you do that sir

[@techdose4u]

I guess have to try making that available in repo

[@BananaButcher]

@@techdose4u Thank you for responding

[@himanshuwadhwa4945]

Clear

[@techdose4u]

👍🏼

[@xboy2374]

noice

[@techdose4u]

:)