2843. Count Symmetric Integers

2843. Count Symmetric IntegersDifficulty: EasyTopics: Math, EnumerationYou are given two positive integers low and high.An integer x consisting of 2 * n digits is symmetric if the sum of the first n d...
0 Read More

3272. Find the Count of Good Integers

3272. Find the Count of Good IntegersDifficulty: HardTopics: Hash Table, Math, Combinatorics, EnumerationYou are given two positive integers n and k.An integer x is called k-palindromic if: x is a pa...
0 Read More

1922. Count Good Numbers

1922. Count Good NumbersDifficulty: MediumTopics: Math, RecursionA digit string is good if the digits (0-indexed) at even indices are even and the digits at odd indices are prime (2, 3, 5, or 7). For ...
0 Read More

Leetcode - 61. Rotate List

🔄 Approach: Calculate the length of the list. Connect the tail to the head to make it circular. Find the new tail at position (length - k % length). Break the circle after the new tai...
0 Read More

Leetcode - 86. Partition List

🔍 Approach To solve this cleanly, we use the two-pointer technique: Create two dummy nodes: One (ldummy) for values less than x One (gdummy) for values greater than or equal to x T...
0 Read More