--- title: "#counting articles | Hashnode" description: "Explore 13 articles tagged #counting on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/counting" --- Tag # #counting 13 posts · 0 followers [The Invariant](https://hashnode.com/@theinvariant) · [Jun 12](https://hashnode.com/posts/you-were-never-just-counting-you-were-remembering/6a2c9364287456eb626dd075) ### [You were never just counting, you were remembering.](https://projectinvariant.hashnode.dev/you-were-never-just-counting-you-were-remembering?utm_source=hashnode&utm_medium=feed) b- a+1 through a normalized lens. 7 min read · [projectinvariant.hashnode.dev](https://projectinvariant.hashnode.dev/you-were-never-just-counting-you-were-remembering?utm_source=hashnode&utm_medium=feed) [Phương Nguyễn](https://hashnode.com/@nphuong302) · [Dec 7, 2025](https://hashnode.com/posts/huong-dan-chon-phien-ban-yolo-phu-hop-cho-dem-nguoi-tu-yolov5-den-yolo11/69353d8fe8dd9b81a332874c) ### [Hướng Dẫn Chọn Phiên Bản YOLO Phù Hợp Cho Đếm Người: Từ YOLOv5 Đến YOLO11](https://yolo-model-for-human-counting-systems.hashnode.dev/huong-dan-chon-phien-ban-yolo-phu-hop-cho-dem-nguoi-tu-yolov5-den-yolo11?utm_source=hashnode&utm_medium=feed) Hướng dẫn chọn phiên bản YOLO từ YOLOv5 đến YOLO11 để đếm người hiệu quả 3 min read · [yolo-model-for-human-counting-systems.hashnode.dev](https://yolo-model-for-human-counting-systems.hashnode.dev/huong-dan-chon-phien-ban-yolo-phu-hop-cho-dem-nguoi-tu-yolov5-den-yolo11?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 11, 2025](https://hashnode.com/posts/leetcode-problem-1356-sort-integers-by-the-number-of-1-bits-easy-java-onlogn/68709e584aa4170ab5e777a3) ### [LeetCode Problem 1356 Sort Integers by The Number of 1 Bits (Easy, Java, O(nlogn))](https://huanganni.hashnode.dev/leetcode-problem-1356-sort-integers-by-the-number-of-1-bits-easy-java-onlogn?utm_source=hashnode&utm_medium=feed) An example of boxing and unboxing 7 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-problem-1356-sort-integers-by-the-number-of-1-bits-easy-java-onlogn?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 3, 2025](https://hashnode.com/posts/leetcode-daily-challenge-2014-longest-subsequence-repeated-k-timeshard/68664cb19468d38cc3f4b9a0) ### [LeetCode Daily Challenge-2014. Longest Subsequence Repeated k Times(Hard)](https://huanganni.hashnode.dev/leetcode-daily-challenge-2014-longest-subsequence-repeated-k-timeshard?utm_source=hashnode&utm_medium=feed) DFS with Iterator-Based Validation for Complex Subsequence Problems 5 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-2014-longest-subsequence-repeated-k-timeshard?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jun 22, 2025](https://hashnode.com/posts/leetcode-daily-challenge-3085-minimum-deletions-to-make-string-k-special/68578820b1c1212302ce77e5) ### [LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special](https://huanganni.hashnode.dev/leetcode-daily-challenge-3085-minimum-deletions-to-make-string-k-special?utm_source=hashnode&utm_medium=feed) Greedy Algorithms Can Miss Global Optimums: Why Always Targeting the Maximum Isn't Always Optimal 5 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-3085-minimum-deletions-to-make-string-k-special?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jun 21, 2025](https://hashnode.com/posts/leetcode-daily-challenge-3443-maximum-manhattan-distance-after-k-changes/6856c2d5e1d597187daac879) ### [LeetCode Daily Challenge-3443. Maximum Manhattan Distance After K Changes](https://huanganni.hashnode.dev/leetcode-daily-challenge-3443-maximum-manhattan-distance-after-k-changes?utm_source=hashnode&utm_medium=feed) To go far, stay on track. 2 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-3443-maximum-manhattan-distance-after-k-changes?utm_source=hashnode&utm_medium=feed) [Tech Beastz](https://hashnode.com/@techbeastz) · [Apr 11, 2025](https://hashnode.com/posts/counting-crows-and-connecting-with-nature-the-rise-of-citizen-science/67f8a374eda8eb03ec3b49f8) ### [Counting Crows and Connecting with Nature: The Rise of Citizen Science](https://techbeast.hashnode.dev/counting-crows-and-connecting-with-nature-the-rise-of-citizen-science?utm_source=hashnode&utm_medium=feed) There's something undeniably captivating about watching birds. Whether you're marveling at a hummingbird's iridescent feathers or listening to a robin's cheerful song, these creatures have a unique way of tugging at our heartstrings. But lately, bir... 2 min read · [techbeast.hashnode.dev](https://techbeast.hashnode.dev/counting-crows-and-connecting-with-nature-the-rise-of-citizen-science?utm_source=hashnode&utm_medium=feed) [Tapan Rachchh](https://hashnode.com/@tapanrachchh) · [Mar 17, 2025](https://hashnode.com/posts/2206-divide-array-into-equal-pairs/67d84c773b557663b0ab227d) ### [2206\. Divide Array Into Equal Pairs](https://tapanrachchh.hashnode.dev/2206-divide-array-into-equal-pairs?utm_source=hashnode&utm_medium=feed) class Solution: def divideArray(self, nums: List\[int\]) -> bool: c = Counter(nums) for e in c: if c\[e\] % 2 != 0: return False return True 1 min read · [tapanrachchh.hashnode.dev](https://tapanrachchh.hashnode.dev/2206-divide-array-into-equal-pairs?utm_source=hashnode&utm_medium=feed) [Tapan Rachchh](https://hashnode.com/@tapanrachchh) · [Jan 13, 2025](https://hashnode.com/posts/3223-minimum-length-of-string-after-operations/678549cc56046abf95702b7d) ### [3223\. Minimum Length of String After Operations](https://tapanrachchh.hashnode.dev/3223-minimum-length-of-string-after-operations?utm_source=hashnode&utm_medium=feed) class Solution: def minimumLength(self, s: str) -> int: c = Counter(s) def removals(n): if n >= 3: if n % 2 == 0 : return n - 2 return n - 1 return 0 ... 1 min read · [tapanrachchh.hashnode.dev](https://tapanrachchh.hashnode.dev/3223-minimum-length-of-string-after-operations?utm_source=hashnode&utm_medium=feed) [Tapan Rachchh](https://hashnode.com/@tapanrachchh) · [Jan 11, 2025](https://hashnode.com/posts/1400-construct-k-palindrome-strings/678213de2a7aa6895e1c5460) ### [1400\. Construct K Palindrome Strings](https://tapanrachchh.hashnode.dev/1400-construct-k-palindrome-strings?utm_source=hashnode&utm_medium=feed) class Solution: def canConstruct(self, s: str, k: int) -> bool: l = len(s) if l < k: return False if l == k: return True c = Counter(s) oddCount = 0 for e in c: ... 1 min read · [tapanrachchh.hashnode.dev](https://tapanrachchh.hashnode.dev/1400-construct-k-palindrome-strings?utm_source=hashnode&utm_medium=feed)