Leetcode with dani

i am trying it and it seems interesting

I know this one is a little bit harder question — I don’t expect you to get the solution right away. But I’m sharing it because trying to solve this will help you deeply understand the Binary Indexed Tree (BIT) concept. You might not get it in one go — and that’s okay. Just keep pushing, and eventually it will click. 🔗 Problem: Create Sorted Array through Instructions 🎥 Helpful video/Ans: YouTube Explanation Once you solve this, you’ll be confident with how BIT works in real problems — from prefix sums to range frequency queries.

this is typical BIT quesiton start with this, i will add more Range Sum

Guys, have you heard of the BIT (Binary Indexed Tree)? I learned about it a few days ago — it transforms both prefix‐sum queries and point updates from O(n) down to O(log n)! In problems with frequent range‐sum queries and multiple updates, a simple prefix‐sum array fails (you’ll hit TLE). BIT handles every query and update in O(log n) time, so even with many operations your total cost stays around O(n log n) instead of O(n²). Give it a try next time you see “range‑sum with updates”! s if u want to know more about it give me thumbs up i will share some questions that can be solved with with this algo with a video explanation about the topic

🧠 INSA Summer Camp Past Questions — Test Your Logic! 1️⃣ Family Logic Given: + = husband / = sister × = son - = wife What does W × Y / Z mean? A) Son of Z's brother B) Son of Z's sister C) Daughter of Z's sister D) Daughter of Z's sister 2️⃣ Code Puzzle A girl student sleeps → Vtp htj 1 A priest teaches tonight → Vxp wyz 2 A queen speaks tonight → Tsp wyz 1 "A lady speaks tonight"? A) Vtp Tsp B) Tsp Wyz C) Wyz 2 htj D) Tsp Wyz 1 3️⃣ Word Match Imaginative Dynamic Learning = Sue Deb Can Complex Dynamic System = Sue Rob Be Complex Revolutionary Thinking = Mol De Be What is Sue Be? A) Revolutionary System B) Dynamic System C) Complex Dynamic D) Imaginative Learning 👇👇👇 Answers: 1️⃣ B 2️⃣ D 3️⃣ B 🔥 Comment your score! More coming soon.

If you applied for the INSA summer camp, please check their Telegram account for the names of students who were accepted in the first phase. https://t.me/cteinsa

📢 Official Call for Teams: ETCPC 2025 Registration Now Open! 🎓💻

The 10th Ethiopian Collegiate Programming Contest (ETCPC 2025) is officially accepting team registrations. This is your opportunity to represent Addis Ababa University in Ethiopia's most prestigious coding competition. Competition Details: 📅 Date: August 3–4, 2025 ⏳ Registration Deadline: Sunday, Midnight 12:00 AM 👥 Team Composition: 3 students per team RSVP HERE: Register now and secure your spot. 📍 Important Notes: ✔️ Only fully registered teams will be accepted ✔️ Official rules & details will be emailed after signup ✔️ All members must be eligible AAU students

📢 Official Call for Teams: ETCPC 2025 Registration Now Open! 🎓💻

The 10th Ethiopian Collegiate Programming Contest (ETCPC 2025) is officially accepting team registrations. This is your opportunity to represent Addis Ababa University in Ethiopia's most prestigious coding competition. Competition Details: 📅 Date: August 3–4, 2025 ⏳ Registration Deadline: Sunday, Midnight 12:00 AM 👥 Team Composition: 3 students per team RSVP HERE: Register now and secure your spot. 📍 Important Notes: ✔ Only fully registered teams will be accepted ✔ Official rules & details will be emailed after signup ✔ All members must be eligible AAU students This is your moment to shine - will you rise to the challenge? ⚡🏆 #ETCPC2025 #CodeToWin #GDGAAU

📢 Official Call for Teams: ETCPC 2025 Registration Now Open! 🎓💻

The 10th Ethiopian Collegiate Programming Contest (ETCPC 2025) is officially accepting team registrations. This is your opportunity to represent Addis Ababa University in Ethiopia's most prestigious coding competition. Competition Details: 📅 Date: August 3–4, 2025 ⏳ Registration Deadline: July 12 Sunday, Midnight 12:00 AM 👥 Team Composition: 3 students per team RSVP HERE: Register now and secure your spot. 📝 For those who don't have a team, Fill out this form, and we'll match you with fellow coders. Kindly submit your details before the deadline 📍 Important Notes: ✔️ Only fully registered teams will be accepted ✔️ Official rules & details will be emailed after signup ✔️ All members must be eligible AAU students This is your moment to shine - will you rise to the challenge? ⚡️🏆 Follow us for updates: | Telegram  | LinkedIn  | Instagram | TikTok | Face Book | X #ETCPC2025 #CodeToWin #GDGAAU

If you're procrastinating and if being focus is hard for u ,read this great book

🚨 16 Billion Logins Leaked in Historic Data Breach Cybersecurity researchers have uncovered one of the largest breaches ever. Over 16 billion login credentials—including social media, corporate, VPN, and email accounts—have been leaked online. The data is recent and weaponizable, gathered through malware from unsecured databases. It includes: * Usernames, passwords, and URLs * Apple accounts, Telegram-linked accounts, and more * Datasets originating from the Russian Federation Experts warn this leak is a blueprint for mass exploitation, enabling identity theft, phishing, and account takeovers. Check if your email was exposed: Using this link Protect yourself now: * Enable Two‑Factor Authentication (2FA) * Use a password manager * Rotate your passwords regularly Stay safe.

እንኳን ለ1,446 ኛው የኢደል-አድሀ [አረፋ] በዓል በሰላም አደረሳችሁ.

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.