Ethio CodeToolkit

📢 A2SV past years interview questions 📝

You have some apples and a basket that can carry up to 5000 units of weight. Given an integer array weight where weight[i] is the weight of the ith apple, 

return the maximum number of apples you can put in the basket.

Example 1:

Input: weight = [100,200,150,1000]

Output: 4

Explanation: All 4 apples can be carried by the basket since their sum of weights is 1450.

Example 2:

Input: weight = [900,950,800,1000,700,800]

Output: 5

Explanation: The sum of weights of the 6 apples exceeds 5000 so we choose any 5 of them.

Constraints:

1 <= weight.length <= 1000

1 <= weight[i] <= 1000

🌟 A2SV Past Interview Questions 🌟 Hey everyone! 📢 If you're preparing for an A2SV interview, here are some common questions you might encounter. Get ready to shine! ✨ Common Questions: 1.Tell me about yourself. 2. What do you know about A2SV and why do you want to join us? 3. Describe a time when you had to step out of your comfort zone to achieve something. 4. How do you give back to your community? 5. What are your strengths and weaknesses? Additional Questions: Introduce yourself 👩. What is the hardest decision you've had to make? Tell us about a time when there was a disagreement in a group. How did you resolve it? How did you hear about A2SV? Are you committed to the cause? Good luck with your preparations! You've got this. 💪😊 Feel free to reach out if you need more tips or have any questions. Let's conquer this together! 🚀👩‍💻👨‍💻 I hope this will makes you feel more prepared and confident! If there's anything more you'd like to add or adjust, just let me know in the discussion group 😊.

For students in ASTU,AASTU, and AU now you can apply for in-person education at A2SV

Applications are Open for A2SV G6 Education! The time has come for A2SV to welcome new members! We’re looking for team-oriented individuals with a never-give-up mentality, ready to drive tech excellence and solve impactful challenges. 📅 Application opens: November 14, 2024 📅 Deadline: November 20, 2024, at 11:59 PM EAT 🎓 Eligibility Open to current students from Addis Ababa University (AAU), Addis Ababa Science and Technology University (AASTU), and Adama Science and Technology University (ASTU). If you're not from these schools or have already graduated, stay tuned for future remote applications! 🔍 Requirements - Familiarity with at least one programming language - Experience with platforms like LeetCode or Codeforces - Completed at least 40 problems on LeetCode or Codeforces 🤖 Selection Process - First Round Filtering: Initial application review - Technical & Behavioral Interviews: For selected candidates, to assess skills and fit for the program ⌛️ Don’t wait! Start your application early to ensure a standout submission. 🎯 🔗 Apply now: link #A2SV #TechEducation #EmpoweringAfrica #ApplyNow

🌒 Yesterday leetcode two pointers problems solutions 🚀🚀🚀 28. Find the Index of the First Occurrence in a String

class Solution:
    def strStr(self, haystack:

 str, needle: str) -> int:
        if len(needle)>len(haystack):
            print(-1)
        n = len(needle)
        start = 0

        while n<=len(haystack):
            if needle == haystack[start:n]:
                return start
            else:
                start+=1
                n+=1
        return -1

125. Valid Palindrome

class Solution:
    def isPalindrome(self, s: str) -> bool:
        s = s.lower()
        pan = []
        for i in s:
            if i.isalpha() or i.isalnum():
                pan.append(i)
        if pan[::-1] == pan:
            print(pan)
            return True
        return False

167. Two Sum II - Input Array Is Sorted

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        left = 0
        right = len(numbers)-1
        while left<right:
            _sum = numbers[left] + numbers[right]
            if _sum == target:
                return [left+1,right+1]
            elif _sum > target:
                right-=1
            else:
                left+=1

11. Container With Most Water

class Solution:
    def maxArea(self, height: List[int]) -> int:
        n = len(height)
        start,end=0,n-1
        max_area = 0
        while start<end:
            width = n-start-(n-end)
            con_height = height[end] if height[end]<=height[start] else height[start]
            cur_area = width*con_height
            if cur_area>max_area:
                max_area=cur_area
            if height[end]>height[start]:
                start+=1
            else:
                end-=1
        return max_area

Stay Hard 💪💪💪💪

👇👇👇👇👇👇👇👇👇👇

For you who want to learn about binary search, segment tree,two pointers,etc ... in deep You can find free courses and practice problems by ITMO Academy: pilot course in codeforce https://codeforces.com/edu/course/2

two pointers practice problems in codeforce https://codeforces.com/problemset/problem/1791/C https://codeforces.com/problemset/problem/1462/A https://codeforces.com/problemset/problem/1840/A https://codeforces.com/problemset/problem/1972/A https://codeforces.com/problemset/problem/1843/B first try for you self i will post the solutions soon Stay Hard 💎💎💎

We are too many 😱😱😱💪💪💪 In just 12 days

🧑‍💻 Tips and Tricks for Using Two-Pointer Technique in Python 🐍 The two-pointer technique is a powerful tool in your programming toolkit, especially for solving problems involving arrays and strings. Here's how to use it effectively: 1.Understand When to Use It-: Sorted Arrays: This technique works best on sorted arrays for problems like finding pairs that sum up to a target value. Two Ends Approach: Use it when you need to process elements from both ends towards the center, such as valid palindrome,finding pairs, or reversing an array. 2. Initialize Pointers Left and Right Pointers: Typically, initialize one pointer at the start (left = 0) and the other at the end of the array (right = len(arr) - 1). 3. Move Pointers Based on Conditions Conditional Movement: Adjust the pointers based on your conditions. For example, move the left pointer to the right (left += 1) or the right pointer to the left (right -= 1) based on comparisons. try to solve this two pointers problems in leetcode https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string?envType=problem-list-v2&envId=two-pointers https://leetcode.com/problems/valid-palindrome?envType=problem-list-v2&envId=two-pointers https://leetcode.com/problems/two-sum-ii-input-array-is-sorted?envType=problem-list-v2&envId=two-pointers https://leetcode.com/problems/container-with-most-water?envType=problem-list-v2&envId=two-pointers The solution will be posted 🔜 Join discussion group 👏 👏 👏

📈 Level up your DSA skills: Time and Space Complexity Cheat sheets Hey everyone, 👋 👋 👋 Are you ready to take up your Data Structure and Algorithm(DSA) skill to next level? 📨 Let's discuss ! Share your thoughts , questions, or insight in the comments below . Let's learn together #DSA #TimeComplexity #Algorithms #SpaceComplexity

Ask any chatgpt you use frequently Based on what you know of me, draw a picture of what you think my life looks like

The Answer is A=[9, 7, 6, 2, 3, 5]