ar
Feedback

لا تقع ضحية للمخادعين! تيليمتريو يكتشف ويُميّز هذه القنوات 👉 إذا كنت تريد رؤية العلامة، اشترك

Leetcode with dani

Leetcode with dani

الذهاب إلى القناة على 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

إظهار المزيد
1 240
المشتركون
لا توجد بيانات24 ساعات
-47 أيام
-2230 أيام
أرشيف المشاركات
Question Description You are given a 0-indexed string s consisting of only lowercase English letters. Return the number of substrings in s that begin and end with the same character. A substring is a contiguous non-empty sequence of characters within a string. Example 1: Input: s = "abcba" #"a", "b", "c", "b","a",abcba","bcb" a:2 b:2 c : 1 Output: 7 Explanation: The substrings of length 1 that start and end with the same letter are: "a", "b", "c", "b", and "a". The substring of length 3 that starts and ends with the same letter is: "bcb". The substring of length 5 that starts and ends with the same letter is: "abcba". Example 2: Input: s = "abacad" Output: 9 Explanation: The substrings of length 1 that start and end with the same letter are: "a", "b", "a", "c", "a", and "d". The substrings of length 3 that start and end with the same letter are: "aba" and "aca". The substring of length 5 that starts and ends with the same letter is: "abaca". Example 3: Input: s = "a" Output: 1 Explanation: The substring of length 1 that starts and ends with the same letter is: "a". Constraints: 1 <= s.length <= 105 s consists only of lowercase English letters
03 أبريل 2025, 07:41

Repost from Codeforces Official
Educational Codeforces Round 177 (rated for Div. 2) starts on the 3rd of April at 14:35 UTC. Please, join by the link https://codeforces.com/contests/2086
02 أبريل 2025, 11:43

If anyone has questions or is interviewed by A2SV today, please share the questions with me. I'll post them in this channel! @zprogramming_bot
02 أبريل 2025, 04:14

Repost from Codeforces Official
🤪April Fools Day Contest 2025🤪 will take place on the 1st of April at 14:35 UTC. Please, join by the link https://codeforces.com/contests/2095
31 مارس 2025, 12:28

31 مارس 2025, 09:40
26 أبريل 2025, ~03:50

Eid Mubarak! Wishing you a day full of joy and blessings!
29 مارس 2025, 12:26

Repost from Codeforces Official
Codeforces Round 1014 (Div. 2) will take place on the 29th of March at 14:35 UTC.  Please, join by the link https://codeforces.com/contests/2092?locale=en
28 مارس 2025, 14:46

In-person Conversion Registration is Open! 🚀 We’re excited to welcome students for the A2SV in-person conversion! This is yo
In-person Conversion Registration is Open! 🚀 We’re excited to welcome students for the A2SV in-person conversion! This is your chance to take your learning to the next level and be part of a vibrant tech community. Open to current students from Addis Ababa University (AAU), Addis Ababa Science and Technology University (AASTU), and Adama Science and Technology University (ASTU). 📅 Registration Dates: March 24 - March 28 ✅ Requirements: - At least 150 solved problems - At least 30 active days 📚 Topics to Cover: Two Pointers, Sorting, Sliding Window, Stack, Queue, Monotonicity, Linked List, Recursion. Don’t miss this opportunity—apply now! 🔗 Apply here: link #A2SV #TechEducation #CodingJourney #LevelUp
24 مارس 2025, 14:50

Repost from Codeforces Official
Codeforces Round 1013 (Div. 3) will take place on the 25th of March at 14:35 UTC.  Please, join by the link https://codeforces.com/contests/2091?locale=en
24 مارس 2025, 11:02

23 مارس 2025, 10:19

🔵 1823. Find the Winner of the Circular Game 📌 Problem: There are n friends sitting in a circle, numbered 1 to n. Starting from friend 1, count k friends clockwise (including the current one). The k-th friend leaves the circle. Repeat the process, starting from the next friend. The last remaining friend is the winner. 📌 Input: n → Number of friends. k → Step count for elimination. 📌 Output: The winner's number. 📌 Example 1: 🔹 Input: n = 5, k = 2 🔹 Output: 3 🔹 Explanation: Friends leave in this order: 2 → 4 → 1 → 5 → (Winner: 3) 📌 Example 2: 🔹 Input: n = 6, k = 5 🔹 Output: 1 🔹 Explanation: Friends leave in this order: 5 → 4 → 6 → 2 → 3 → (Winner: 1) 🔎 Can you find the last friend standing? 😃
23 مارس 2025, 04:27

can solve this question using recursion ?
23 مارس 2025, 04:27

photo content
23 مارس 2025, 03:54

class Solution:
    def countOperations(self, num1: int, num2: int) -> int:
        count = 0
        while num1 and num2:
            if num1>=num2:
                count +=  num1//num2
                num1 =  num1%num2
            else:
                count +=  num2//num1
                num2 =  num2%num1
        return count
23 مارس 2025, 03:53

▎2169. Count Operations to Obtain Zero ▎Problem You are given two non-negative integers, num1 and num2. In one operation, do the following: • If num1 >= num2, subtract num2 from num1. • If num1 < num2, subtract num1 from num2. Repeat this until either num1 or num2 becomes zero. Return the total number of operations performed. ▎Examples ▎Example 1 Input: num1 = 2, num2 = 3 Output: 3 ▎Example 2 Input: num1 = 10, num2 = 10 Output: 1 ▎Constraints • 0 ≤ num1, num2 ≤ 10⁵
23 مارس 2025, 03:52

+1
A2SV__Trees I_2025(Without Code).pdf1.17 MB
22 مارس 2025, 14:20

Codeforces Round #1012 (Div. 1, Div. 2) will take place on the 23rd of March at 05:35 UTC. Please, join by the link https://codeforces.com/contests/2089,2090?locale=en
22 مارس 2025, 02:37

Repost from Codeforces Official
Codeforces Round 1011 (Div. 2) will take place on the 22nd of March at 14:35 UTC.  Please, join by the link https://codeforces.com/contests/2085?locale=en
21 مارس 2025, 13:25

class Solution:
    def averageOfLevels(self, root: Optional[TreeNode]) -> List[float]:

        def helper(qu):
            if not qu:
                return

            i = len(qu)
            leng = len(qu)
            total = 0

            while i > 0:
                poped = qu.popleft()
                total += poped.val

                if poped.left:
                    qu.append(poped.left)
                if poped.right:
                    qu.append(poped.right)            

                i -= 1
            ans.append(total/leng)
            helper(qu)
        qu = deque()
        qu.append(root)
        ans = []

        helper(qu)

        return ans
21 مارس 2025, 10:21