Explore tweets tagged as #Hashmap
Day 126 โ LeetCode 347 โ
.๐ฅ Top K Frequent Elements using Max Heap.Count frequency with map.Push into heap as {freq, num}.Pop top k โ result.โก Runtime: 0 ms.#LeetCode #C++ #Heap #HashMap #100DaysOfCode
1
0
17
#Day3 of #100DaysOfCode .โ
solved Two sum in O(n) time complexity using unordered_map AKA Hashmap . #DSA #leetcode #100DaysOfDiscipleship
1
1
7
Day 47/100 of #100DaysOfCode .Solved leetCode+ GFG POTD .GFG--> used arrays as HashMap for finding the correct position of positive numbers . leetcode--> used set for storing unique elements.
1
0
14
๐ย Day 367 of Codeย ๐. Solved :. โ
ย 3487. Maximum Unique Subarray Sum After Deletion. Todayโs problem required finding theย maximum sum of a subarrayย withย all unique elements, allowingย at most one deletion. #Day367 #LeetCode #DSA #SlidingWindow #HashMap #ArrayProblems
1
2
13
ไปๆฅใฎไธ้กใ767. Reorganize String. ้ฃๆฅใใๆๅญใใชใใใใซๆๅญๅใไธฆใณๆฟใใๅฟ
่ฆใใใใฎใงใๅๆๅญใฎๅบ็พ้ ปๅบฆ้ ใๆใคhashMapใไฝใใ.ใใผใใญใฅใผใไฝใฃใฆ้ ปๅบฆ้ ใซๆๅญใ็นใใฆใใใพใใใๅๅใฎๆๅญใไฝฟใใชใใใใซใใผใใใpop, pushใจใใๆไฝใๅฟ
่ฆใ.
1
0
3
HashSet in Java. A ๐๐๐ฌ๐ก๐๐๐ญ is a collection used to store unique elements with no guaranteed order. It is part of the java.util package and implements the Set interface, internally backed by a HashMap. ๐๐ฒ๐ ๐๐ฒ๐ฎ๐๐๐ฟ๐ฒ๐ ๐ผ๐ณ ๐๐ฎ๐๐ฎ ๐๐ฎ๐๐ต๐ฆ๐ฒ๐.๐นUniqueness:
1
12
129
Day 27 of #100DaysOfCode.โ
Solved LeetCode 904 (Fruit Into Baskets) using sliding window + hashmap. โ
Learned WebSockets & built a simple Ping-Pong app for real-time communication. Progress every day! ๐ฅ.#LeetCode #WebDev #JavaScript #NodeJS
0
0
2
๐ Day 1 of POTD โ A New Beginning!.๐
Started my GFG Problem of the Day challenge from today!.โ
Solved my first problem: Longest Substring with K Unique Characters.๐ง Learned the power of Sliding Window & HashMap combo. #Day1 #POTD #GeeksForGeeks #100DaysOfCode #DSAJourney
1
0
9
Master Sliding Window + HashMap to optimize string and array problems from O(nยฒ) โ O(n) time!. #DSA #Algorithms #DataStructures #CodingInterview #JavaScript #TechTips #SEOhacks #Leetcode #DevTips
0
0
5
์ค๋์ ๊ธฐ๋ค๋ ธ๋ ์ฃผ๋ฌธ ์๋น์ค์ ์นด๋๋ฆฌ ๋ฐฐํฌ์ผ์ด์๋ค. ์ฐ๋ฆฐ HashMap์ผ๋ก ์ด๋ฃจ์ด์ง ๋ ๊ฑฐ์ ์๋ฐ ์ฝ๋, JSP, jQuery, ๊ทธ๋ฆฌ๊ณ ์์ฒ ์ค์ ๋ฌํ๋ MyBatis ์ฟผ๋ฆฌ ์ฌ๋ฌ ๊ฐ์ ํฉ์ด์ง ๋ก์ง์ ๋ชจ๋ ๋ชจ์์ ์์ ๋๋ฉ์ธ ๋ชจ๋ธ์ ๋ง๋ค์ด๋๋ค. ๋ชจ๋ ์ ์ฆ์ผ์ด์ค์ ๋ํด ๋ฏฟ์์งํ ํ
์คํธ๋ ์๊ฒผ๋ค.
1
4
25
๐ Just solved the Fruit Into Baskets ๐๐ problem on LeetCode!.Used HashMap + Sliding windows.Optimized for O(n) time and passed all test cases โ
.Clean, efficient, and satisfying! ๐ช #LeetCode #Java #SlidingWindow #HashMap #100DaysOfCode
2
0
8