📢 Announcement: A2SV G6 In-Person Application Update

Dear Applicants,

Thank you for submitting your applications for the A2SV G6 recruitment process. After carefully reviewing all submissions, we are excited to announce that the shortlist of candidates selected for interviews will be shared very soon! 🎉 Please check your emails regularly for updates. 📧

Starting Monday, shortlisted candidates will be able to schedule their technical interviews. 📅

We highly recommend that you begin preparing for the technical interview to ensure your success. 🚀 The key topics to focus on include:
- Sorting
- Two Pointers
- Prefix Sum
- Sliding Window
- Stack & Queues

Best of luck to all applicants, and we look forward to meeting you during the interview process! 💪

Sincerely,
The A2SV Team

Here are the resources for the topics covered so far. We've also linked them in the Resources tab of the Community Sheet

• Python Learning Path
• Time and Space Complexity Learning Path
• Sorting Learning Path
• Stack and Queue Learning Path
• Recursion Learning Path
• LinkedList Learning Path
• Sliding Window and Two Pointers Learning Path
• Prefix Sum Learning Path
• Heaps Learning Path

🌟🚀 @AceCoding Presents! 🚀🌟

📢 Important Update for A2SV G6 In person Education Cohort!

If you've received an email from A2SV, congratulations! 🎉 You’ve been shortlisted for an interview for the A2SV G6 Cohort!

🗓 Interviews Begin: on Tuesday
📌 Focus Areas: Make sure to prepare thoroughly on the topics mentioned in the email.

If you haven’t checked your email yet, go check it now and start your preparation! 📨

🚀 @AceCoding Presents! 🚀

🧠 Python Quiz: Predict the Output

arr = [[0]] * 5  
print(arr)  
arr[0][0] = 1  
print(arr)  

What will the output be? You can choose your answer below.

@AceCoding Presents!

✅ Explanation for the above question

©️ credit for ChatGPT 🤝

✅ Sliding window, Two pointers, and Hash Table problem

🟡 567. Permutation in String

https://leetcode.com/problems/permutation-in-string/submissions/1482104785/

🚀 @AceCoding Presents! 🚀

✅ Dynamic Sliding window and hashmap / hashset problem.

This problem has a pattern that repeats a lot : worth revising

🟡 3. Longest Substring Without Repeating Characters

https://leetcode.com/problems/longest-substring-without-repeating-characters/description/

🚀 @AceCoding Presents! 🚀

Substrings that begin and end with the same letter

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"
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   112131
Explanation:
The substrings of length 1 that start and end with the same letter are: "a", "b", "a", "c", "a", and "d" = 6.
The substrings of length 3 that start and end with the same letter are: "aba" and "aca" = 2.
The substring of length 5 that starts and ends with the same letter is: "abaca" = 1.

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.

question from today interview question

Question: Maximum Sum Score of an Array

You are given a 0-indexed integer array nums of length n. The sum score of nums at an index i (where 0 <= i < n) is defined as the maximum of:

• The sum of the first i + 1 elements of nums.

• The sum of the last n - i elements of nums.

Your task is to return the maximum sum score of nums at any index.

▎Examples:

1. Input: nums = [4, 3, -2, 5]
Output: 10
Explanation:

• At index 0: max(4, 4 + 3 - 2 + 5) = max(4, 10) = 10.

• At index 1: max(4 + 3, 3 - 2 + 5) = max(7, 6) = 7.

• At index 2: max(4 + 3 - 2, -2 + 5) = max(5, 3) = 5.

• At index 3: max(4 + 3 - 2 + 5, 5) = max(10, 5) = 10.

• The maximum sum score of nums is 10.

2. Input: nums = [-3, -5]
Output: -3
Explanation:

• At index 0: max(-3, -3 - 5) = max(-3, -8) = -3.

• At index 1: max(-3 - 5, -5) = max(-8, -5) = -5.

• The maximum sum score of nums is -3.

▎Challenge:

Write a function maximumSumScore(nums) that takes an integer array as input and returns the maximum sum score.

✅ Free leetcode questions which is 99% similar with the first question :

class Solution:
    def countSubstrings(self, s: str, c: str) -> int:
        count = s.count(c)
        return count * (count + 1) // 2

https://leetcode.com/problems/count-substrings-starting-and-ending-with-given-character/description/