tgindex

Code With MEMO

описание

Join a community of passionate learners and builders! We dive deep into: 🔹 Machine Learning (Algorithms, Models, MLOps) 🔹 Coding Tips & Best Practices (Python, AI/ML, Automation) 🔸 collaborative problem solving (challenges ,Q&A....) @codewithmemo

← к каналу@codewithmemo
202
подписчиков
Охват к подписчикам
22,8%
ERR
Реакции к просмотрам
2,09%
37 на 31 постов
Пересылки к просмотрам
0,06%
1
Постов в день
0,3
всего 32

Где отзываются чаще

доля реакций к просмотрам
  • 26 мар.без подписи10,91%
  • 22 июл.for security purpose😁8,33%
  • 13 авг.🚀 Hey everyone! Quick one for the Blockchain devs & builders here 👀 There’s a $15K hackathon happening right now — BUIDL CTC 2026 Fall. 🏆 $10K — 1st place 🥈 $3K — 2nd place 🥉 $2K — 3rd place If you’ve been looking for a chance to build, experiment, and put your skills to work, this could be a good one 🔥 Check it out 👇 https://dorahacks.io/hackathon/buidl-ctc-2026-fall/detail Who’s joining? 👀 @solomon_insight7,69%
  • 8 авг.I’ve officially opened my GitHub Sponsors profile. Who will be my first sponsor? 😁 🔗 github.com/Mebrie-Awoke #Sponsor #Mebrie #Github6,25%
  • 26 июл.Sunday❤️ enjoy the vibe and take rest🫡6,00%
  • 29 окт.📅 Nexus Batch 4 Registration Opens November 1! Are you interested in learning programming and coding but not sure how or where to start? Nexus Tutorial is back with a unique 2-month online tech training program (Batch 4) — designed to open doors to the digital world and help you start your coding journey with confidence! 🎯 See details of each track we offer: 💠 Front-End Development (Beginners) 💠 Front-End Development (Advanced) 💠 Back-End Development (Beginners) 💠 Data Structures & Algorithms with python Build a strong foundation and gain real-world skills to kickstart your tech journey. What You’ll Get: 🎓 High-quality instruction from experienced mentors 🤝 A supportive learning community 📜 Certificate to validate your skills and boost your credibility 📅 Registration opens on November 1! ⚡️ Seats are limited, so don’t miss your chance! Join our Nexus Tutorial Telegram Channel to stay updated. #NexusTutorial #SoftwareDevelopment #Registration #Batch4 #Programming5,71%
  • 21 июл.🎉 Thank You, Kidus Shimels! 🎉 On behalf of the ISHUB Educational Team and the ISHUB community, we thank you for the inspiring in-person workshop on Retrieval-Augmented Generation (RAG). Your expertise, insights, and real-world experience provided valuable learning opportunities and inspired participants to explore AI deeply. We appreciate your time, knowledge, and dedication. Your contribution made a lasting impact. Wishing you continued success. You remain a valued part of the ISHUB family. 💙 Telegram|LinkedIn|YouTube | Tiktok4,17%
  • 30 июл. 2025 г.🎯 Reminder: Special Session – Problem Solving & Competitive Programming 📅 Today – Wednesday, July 30, 2025 🕗 Time: 8:00 PM 📍Live in our Telegram channel 🎙 Hosted by: Haymanot Gebeyehu Meet our guest: 👨‍💻 Bernabas Mulugeta Deputy Lead Head of Education at A2SV (backed by Google) Backend Engineer | Competitive Programmer | Electrical & Computer Engineering Student at AAU Bernabas is a standout talent who transitioned from being a student in A2SV's Generation 4 to leading its education team. He has: 🔹 Led 100+ training sessions 🔹 Built scalable backend systems 🔹 Mentored students in advanced DSA 🔹 Organized coding contests for 250+ learners 🔥 In this session, we’ll explore: ✨ How to improve your problem-solving skills ✨ Why competitive programming matters especially as a student ✨ How to prepare for tech interviews and coding contests ✨ Tips from Bernabas' personal journey through A2SV and beyond If you’re passionate about code, challenges, and growth this one’s for you! #A2SV #TechLeadership #BackendDev4,04%
  • 13 июл.People who can accept different viewpoints and still support you, are my kind of people3,51%
  • 8 июн. 2025 г.Hello fam! Funny Mirage from Owner 😆😆😆 "Last night, I had the wildest dream… I saw a glowing mirage (yes, mirage—not mirage, but mirage 😆) : ‘ MEMO will be the largest software company in the world in just a few years!😅😅’ At first, I was like, *‘Wow, my subconscious is really ambitious!’* Then I realized—my brain was just running a beta version of our future🙃🙃😳😁. But think about it: ❤️ MEMO – the next tech giant? ❤️We – the next accidental billionaire? ❤️ Our first product? Probably an app that turns ‘we’ll do it later🙃'! Stay tuned… or wake me up when we’re acquired by Google. 😴✨ #MEMOTakesOver"😳 @codewithmebrie #finding...#python2,58%
  • 2 маябез подписи2,50%
  • 27 окт.In Python, lists are versatile mutable sequences with built-in methods for adding, removing, searching, sorting, and more—covering all common scenarios like dynamic data manipulation, queues, or stacks. Below is a complete breakdown of all list methods, each with syntax, an example, and output, plus key built-in functions for comprehensive use. 📚 Adding Elements ⦁ append(x): Adds a single element to the end. lst = [1, 2] lst.append(3) print(lst) # Output: [1, 2, 3] ⦁ extend(iterable): Adds all elements from an iterable to the end. lst = [1, 2] lst.extend([3, 4]) print(lst) # Output: [1, 2, 3, 4] ⦁ insert(i, x): Inserts x at index i (shifts elements right). lst = [1, 3] lst.insert(1, 2) print(lst) # Output: [1, 2, 3] 📚 Removing Elements ⦁ remove(x): Removes the first occurrence of x (raises ValueError if not found). lst = [1, 2, 2] lst.remove(2) print(lst) # Output: [1, 2] ⦁ pop(i=-1): Removes and returns the element at index i (default: last). lst = [1, 2, 3] item = lst.pop(1) print(item, lst) # Output: 2 [1, 3] ⦁ clear(): Removes all elements. lst = [1, 2, 3] lst.clear() print(lst) # Output: [] 📚 Searching and Counting ⦁ count(x): Returns the number of occurrences of x. lst = [1, 2, 2, 3] print(lst.count(2)) # Output: 2 ⦁ index(x[, start[, end]]): Returns the lowest index of x in the slice (raises ValueError if not found). lst = [1, 2, 3, 2] print(lst.index(2)) # Output: 1 📚 Ordering and Copying ⦁ sort(key=None, reverse=False): Sorts the list in place (ascending by default; stable sort). lst = [3, 1, 2] lst.sort() print(lst) # Output: [1, 2, 3] ⦁ reverse(): Reverses the elements in place. lst = [1, 2, 3] lst.reverse() print(lst) # Output: [3, 2, 1] ⦁ copy(): Returns a shallow copy of the list. lst = [1, 2] new_lst = lst.copy() print(new_lst) # Output: [1, 2] 📚 Built-in Functions for Lists (Common Cases) ⦁ len(lst): Returns the number of elements. lst = [1, 2, 3] print(len(lst)) # Output: 3 ⦁ min(lst): Returns the smallest element (raises ValueError if empty). lst = [3, 1, 2] print(min(lst)) # Output: 1 ⦁ max(lst): Returns the largest element. lst = [3, 1, 2] print(max(lst)) # Output: 3 ⦁ sum(lst[, start=0]): Sums the elements (start adds an offset). lst = [1, 2, 3] print(sum(lst)) # Output: 6 ⦁ sorted(lst, key=None, reverse=False): Returns a new sorted list (non-destructive). lst = [3, 1, 2] print(sorted(lst)) # Output: [1, 2, 3] These cover all standard operations (O(1) for append/pop from end, O(n) for most others). Use slicing lst[start:end:step] for advanced extraction, like lst[1:3] outputs ``. #python #lists #datastructures #methods #examples #programming ⭐ @DataScience42,08%