Are you an African who dreams of building Google-level software engineering skills?

Applications are now open for A2SV G7 Education!

This is your moment to learn, grow, and prepare for the top tech companies you’ve always aspired to join.
At A2SV Education, you’ll join a vibrant community that challenges you to think bigger, code smarter, and create real impact across Africa 🌍.

⏱️ It only takes 7 minutes to apply. Take your shot at joining A2SV G7 Education today!

👉 Apply now: https://form.typeform.com/to/wOWdCFrZ

📣 Spread the word! Tag a friend, share this post, and help us reach more brilliant African minds ready to transform their future through A2SV.
Together, we empower Africa’s next generation of world-class engineers and tech entrepreneurs! 💪 💻

#A2SV #Education #Generation7 #TopTech #ApplicationsAreOpen #SoftwareEngineering #AfricaTech

@Amkiru is a true frontend nerd. I met him at the INSA Summer Camp, and we were in the same project group. He’s still in high school, but already has 5 years of coding experience (pretty sure he started coding in his mom’s belly 😃). He told me about NALTH, and I was impressed. I even got to review it, some parts were beyond my level (JS isn’t my main language), but I encouraged him to make it public. Now he’s getting amazing feedback from developers everywhere!
Go check out his work, give the repo a ⭐️ on GitHub.

@R0bstack

Am I the only one?🤔

i’ve been doom scrolling on insta for hours.
but here’s the weird part, i feel productive😃. Cause the feed’s are full of “useful tips,” “how to grow,” “stay consistent” kinda stuff.
but it’s been hours.
no real work done.
no moves made.
just poor me thinking i am improving when i am just scrolling.
wtf.🤯

@R0bstack

its your reminder to have one.

Lets solve leetcode together🦾

once i understood the problem well, coming up with a solution wasn't that hard

        stack = []
        for dir_name in path.split('/'):
            if dir_name == '..':
                if stack: stack.pop()
            elif dir_name == '' or dir_name == '.':
                continue
            else:
                stack.append(dir_name)
        return '/' + '/'.join(stack)

This was my first accepted soln

        for num in nums[1:]:
            cur_sum = max(num, cur_sum + num)
            max_sum = max(max_sum, cur_sum)
        return max_sum   

but later i checked there is a better soln with less Runtime(9ms)

currSum = 0
        maxSum = nums[0]
        for num in nums:
            if currSum < 0:
                currSum = num
            else:
                currSum += num
            if currSum > maxSum:
                maxSum = currSum
        return maxSum

Enough for today. I solved 10 problems all day, and if you want to solve more, check out my friend @bella_devs_squad. He's kind of a pro😎

@R0bstack

Sup everyone 🤓,I am redoing LeetCode problems I did in the previous days, and this is what happened:
🕯️some of the problems I struggled to solve yesterday or the day before I solved easily today.
🕯️Still, there are some problems I understand the concept and know how to solve, but I struggle with the implementation.
🕯️There are also some that make me wonder, did I really solve this one🤔😁?
Overall, I reinforced my learning, and I don't think I will miss these questions on interviews🤓. I highly recommend you guys to redo LeetCode problems you solved yesterday before starting to solve new ones.

@R0bstack

Happy Sunday, may solving errors be this easy 😌☕

@R0bstack