en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels πŸ‘‰ If you want to see the tag, subscribe

Leetcode with dani

Leetcode with dani

Open in Telegram

Join us and let's tackle leet code questions together: improve your problem-solving skills Preparing for coding interviews learning new algorithms and data structures connect with other coding enthusiasts

Show more
1 241
Subscribers
No data24 hours
-47 days
-1630 days
Posts Archive
03 Jun 2025, 13:30

01 Jun 2025, 02:51

can u solve this question? with bit manipulation in constant extra space and linear time complexity β–ŽTitle: 137. Single Number II Difficulty: Medium Description: Given an integer array nums where every element appears three times except for one, which appears exactly once, find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space. Example 1: Input: nums = [2,2,3,2] Output: 3 Example 2: Input: nums = [0,1,0,1,0,1,99] Output: 99 Constraints: β€’ 1 <= nums.length <= 3 * 10^4 β€’ -2^31 <= nums[i] <= 2^31 - 1 β€’ Each element in nums appears exactly three times except for one element which appears once.
01 Jun 2025, 02:50

photo content
31 May 2025, 09:22

photo content
+1
30 May 2025, 16:57

28 May 2025, 13:17

28 May 2025, 11:38

photo content
+1
28 May 2025, 11:37

28 May 2025, 05:52

photo content
+3
28 May 2025, 05:51

28 May 2025, 05:50
28 May 2025, ~05:50

can u solve this question β–ŽTitle: 201. Bitwise AND of Numbers Range Difficulty: Medium Description: Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive. Example 1:
Input: left = 5, right = 7  
Output: 4
Explanation:
5 = 101
6 = 110
7 = 111
Bitwise AND of all numbers in the range [5, 7] is 4 (binary 100). Example 2:
Input: left = 0, right = 0  
Output: 0
Example 3:
Input: left = 1, right = 2147483647  
Output: 0
Explanation: There is no common bit position that stays 1 throughout the range, so the result is 0. Constraints:
0 <= left <= right <= 2^31 - 1
22 May 2025, 03:58

photo content
20 May 2025, 03:56

Repost from Hanix
Summer Camp and Internships 1. INSA Cyber Talent Challenge – 2017 E.C. Tracks: Cybersecurity | Development | Embedded Systems | Aerospace Apply: Here 2.iCog Labs AI Internship – 2025 Batch 1 Tracks: AI | ML | Robotics | Bioinformatics | Blockchain Deadline: July 31 Apply:Here 3. Kuraz Technologies Hybrid Internship Type: Summer | Unpaid | Hybrid Deadline: May 31 Apply: Here 4. Tewanay Engineering Summer Internship Tracks: Front-End | Back-End | Mobile App Development Deadline: May 31 Apply: Here @HanixJourney #Internship
20 May 2025, 00:43

--- β–ŽBitwise Tricks in Python β–Ž1. Check Even/Odd
def is_odd(n: int) -> bool:
    return bool(n & 1)

# Usage:
n = 7
print("Odd" if is_odd(n) else "Even")  # Output: Odd
Try: β€œCheck if a Number is Odd or Even” on GeeksforGeeks (GfG) --- β–Ž2. Swap Two Numbers Without a Temp Variable
def xor_swap(a: int, b: int) -> tuple[int, int]:
    a ^= b
    b ^= a
    a ^= b
    return a, b

# Usage:
x, y = 5, 9
x, y = xor_swap(x, y)
print(x, y)  # Output: 9 5
Note: In real Python, you can simply use x, y = y, x. --- β–Ž3. Turn Off the Rightmost Set Bit
def clear_lowest_bit(n: int) -> int:
    return n & (n - 1)

# Usage:
n = 0b10110  # 22
print(bin(clear_lowest_bit(n)))  # Output: 0b10100 (20)
Try: β€œCount Set Bits in an Integer” on GfG (use this in a loop) --- β–Ž4. Isolate the Rightmost Set Bit
def lowest_bit(n: int) -> int:
    return n & -n

# Usage:
n = 0b10110  # 22
print(bin(lowest_bit(n)))  # Output: 0b10 (2)
Try: β€œFind Position of Rightmost Different Bit” on GfG --- β–Ž5. Check Power of Two
def is_power_of_two(n: int) -> bool:
    return n > 0 and (n & (n - 1)) == 0

# Usage:
for x in [1, 2, 3, 16, 18]:
    print(x, is_power_of_two(x))
Try: β€œCheck if a Number is a Power of Two” on GfG --- β–Ž6. Count Set Bits (Brian Kernighan’s Algorithm)
def count_set_bits(n: int) -> int:
    count = 0
    while n:
        n &= (n - 1)
        count += 1
    return count

# Usage:
print(count_set_bits(29))  # Output: 4, since 29 is 11101β‚‚
Try: β€œCount Set Bits” on GfG (Python) --- β–Ž7. Add Two Numbers Without β€˜+’
def add(a: int, b: int) -> int:
    MASK = 0xFFFFFFFF
    while b != 0:
        carry = (a & b) & MASK
        a = (a ^ b) & MASK
        b = (carry << 1) & MASK
    
    return a if a <= 0x7FFFFFFF else ~(a ^ MASK)

# Usage:
print(add(15, 27))  # Output: 42
print(add(-5, 3))   # Output: -2
Try: β€œSum of Two Integers” on LeetCode (Python) --- β–Ž8. Test Opposite Signs
def opposite_signs(a: int, b: int) -> bool:
    return (a ^ b) < 0

# Usage:
print(opposite_signs(5, -3))   # Output: True
print(opposite_signs(-4, -2))  # Output: False
Try: β€œCheck if Two Numbers Have Opposite Signs” on GfG --- β–Ž9. Reverse Bits of a 32-bit Integer
def reverse_bits(n: int) -> int:
    result = 0
    for _ in range(32):
        result = (result << 1) | (n & 1)
        n >>= 1
    return result & 0xFFFFFFFF

# Usage:
x = 0b00000010100101000001111010011100
print(bin(reverse_bits(x)))  
Try: β€œReverse Bits” on LeetCode (Python) --- β–Ž10. Gray Code Conversion
def to_gray(n: int) -> int:
    return n ^ (n >> 1)

def gray_to_binary(g: int) -> int:
    mask = g
    while mask:
        mask >>= 1
        g ^= mask
    return g

# Usage:
for i in range(8):
    g = to_gray(i)
    print(f"{i:3} β†’ Gray {g:3} β†’ Back {gray_to_binary(g):3}")
Try: β€œGray Code” on LeetCode (Python) --- β–ŽπŸŽ― Next Steps: 1. Pick one or two of these tricks. 2. Find the corresponding GfG problem in Python and implement it. 3. Time yourself and compare it to a straightforward solution.
19 May 2025, 03:02

β–ŽBitwise Tricks and Techniques for Competitive Programming β–Ž1. Check Even/Odd β€’ Trick: n & 1 β€’ Why it works: The least significant bit (LSB) of an integer is 1 if it’s odd, 0 if it’s even. β€’ Usage:    
    if (n & 1) // n is odd 
    else // n is even 
    
β€’ Try it on: β€œCount Odd Numbers in an Interval Range” (easy) --- β–Ž2. Swap Two Numbers Without a Temp Variable β€’ Trick: a ^= b; b ^= a; a ^= b; β€’ Why it works: XORing twice cancels out, effectively swapping the values. β€’ Usage:    
    a ^= b; 
    b ^= a; 
    a ^= b; 
    
β€’ Try it on: β€œSwap Two Numbers” (basic exercise) --- β–Ž3. Turn Off the Rightmost Set Bit β€’ Trick: n & (n - 1) β€’ Why it works: Subtracting 1 flips all bits from the rightmost 1 to the end; ANDing clears that rightmost 1. β€’ Usage:    
    n = n & (n - 1); // removes lowest set bit 
    
β€’ Try it on: β€œCount Set Bits in an Integer” (you can loop with this trick) --- β–Ž4. Isolate the Rightmost Set Bit β€’ Trick: n & -n β€’ Why it works: The two’s complement of n (-n) has only the rightmost set bit in common with n. β€’ Usage:    
    int lowbit = n & -n; 
    
β€’ Try it on: β€œPower of Two” (check n & (n - 1) == 0, then use n & -n to identify which bit it is) --- β–Ž5. Check Power of Two β€’ Trick: (n & (n - 1)) == 0 and n > 0 β€’ Why it works: Powers of two have exactly one set bit; subtracting 1 clears that bit. β€’ Usage:    
    bool isPow2 = (n > 0) && ((n & (n - 1)) == 0); 
    
β€’ Try it on: β€œCheck if a Number is a Power of Two” (classic) --- β–Ž6. Count Set Bits Faster (Brian Kernighan’s Algorithm) β€’ Trick: Repeatedly do n &= (n - 1) until zero, counting iterations. β€’ Why it works: Each operation removes one set bit, so the loop runs in O(# bits set). β€’ Usage:    
    int count = 0; 
    while (n) { 
        n &= (n - 1); 
        ++count; 
    } 
    
β€’ Try it on: β€œCount Set Bits in an Integer” (better than O(32) per bit) --- β–Ž7. Compute a + b Without Plus β€’ Trick: Use XOR and AND with shifts:    
    while (b) { 
        unsigned carry = a & b; 
        a = a ^ b; 
        b = carry << 1; 
    } // a now holds the sum 
    
β€’ Why it works: XOR gives sum without carry; AND + shift gives carry bits until none remain. β€’ Try it on: LeetCode β€œSum of Two Integers” --- β–Ž8. Test if Two Integers Have Opposite Signs β€’ Trick: (a ^ b) < 0 β€’ Why it works: The sign bit differs if XOR’s sign bit is 1. β€’ Usage:    
    bool oppSigns = (a ^ b) < 0; 
    
β€’ Try it on: β€œCheck if Two Integers Have Opposite Signs” (easy) --- β–Ž9. Reverse Bits β€’ Trick: Use lookup tables for small chunks (e.g., 8 bits) or iterative bitwise swaps:    
    n = (n >> 16) | (n << 16); 
    n = ((n & 0xff00ff00) >> 8) | ((n & 0x00ff00ff) << 8); 
    // …and so on 
    
β€’ Why it works: Repeatedly swap bit-groups to reverse order in logβ‚‚(width) steps. β€’ Try it on: LeetCode β€œReverse Bits” --- β–Ž10. Gray Code Conversion β€’ Trick to get Gray from binary: g = n ^ (n >> 1) β€’ Trick to get Binary from Gray: Loop with shifting and XOR. β€’ Try it on: β€œGray Code” generation problems ---
19 May 2025, 02:58
19 May 2025, ~03:00

photo content
+1
16 May 2025, 15:23

photo content
+1
16 May 2025, 15:22
16 May 2025, ~15:22

16 May 2025, 15:21

08 May 2025, 08:23