Oyebanjo Semiat
92 posts

Oyebanjo Semiat
@tumi0106
Leaning HTML and CSS
Lagos, Nigeria Beigetreten Eylül 2024
81 Folgt50 Follower

🚀 Day 16/30
Built a school timetable using HTML tables.
What looked simple turned into a real challenge. Figuring out rowspan and colspan works took a lot of trial and error, but I got it working. 💻
@TechSphereAcad
#30DaysOfTech #LearningWithTS

English

Day 22 ✅ of #SDESheetChallenge completed!
Solved:
• Implement Max Heap
• K-th Largest Element in Array
• Maximum Sum Combination
All accepted. Good session on heaps and priority queues.
Catching up steadily.
Thanks @takeuforward_ 🔥
#SDESheetChallenge #DSA #Striver #Heap

English

Day 1 of learning React Native
I installed the necessary tools needed: android studio & expo go
Created a react native project
Learnt about View component and how its the most fundamental component for building a UI in react native
Also understood how react native works.

dan.@defidahn
Starting the month with learning in public?😬🌝 #reactnative
English

Day 481 of #1001DaysOfCode
- Solved 5 DSA
✅ Find the Safest Path in a Grid
✅ Minimum Cost to Convert String II
✅ Valid Arrangement of Pairs
✅ Shortest Path with Alternating Colors
✅ Maximum Subarray Sum by Removing at Most One Element
✅ 2 Codeforces problems




English

Day-26 of Summer break
>Started with Matrix Calculus
>Did some problems on Directional Derivatives and read about level curves
>Started with Chapter-3 of LLMs from Scratch
>Started with langchain too




metaneuron@metaneurons
Day-25 of Summer break >was not feeling well today ~break
English

Day 15/100
Today I learned about implicit type (coercion) in JavaScript.
The more I learn, the more everything starts to make sense. 💜
#100DaysOfCode #JavaScript #FrontendDev

English

so today i solved a LeetCode problem and now I'm watching a lecture on TreeSet. Later, I'll solve a few hashing problems from practice que sheet.
today's tasks:
-LeetCode ☑️
-TreeSet
-Hashing practice
#buildinpublic #learninpublic

English

#LSPPDay31 Today, I applied recursion to solve fast exponentiation using divide and conquer to compute power in O(log n) and binary search by recursively halving the search space. #LearningWithLeapfrog #60DaysOfLearning2026 @lftechnology


English

@tumi0106 Taking notes is very important may be as comment In your code cause you must code along to learn faster
English

























