Mike McMurdie’s Post

If you find LLMs intimidating or confusing, check out this GitHub from Ishan Anand. He managed to squeeze GPT 2.0 into a spreadsheet format. Yes, it's got its fair share of drawbacks—you can't exactly have a back-and-forth chat since it's all about entering prompts. However, it's still a pretty awesome way to glimpse what makes these models tick, especially the transformer architecture and how it decides the next word to throw at you (next-token prediction). Warning: The file's huge and doesn't play nice with Macs, so you'll need a PC to dive into this one. https://lnkd.in/gkuYsxvv #prospectresearch #fundraising #aifundraising

How to do #serverless inferencing on a Large Language Model from Hugging Face. A tutorial by Enrico Regge, Michael Magrian, and Finn Fassnacht https://lnkd.in/eVPsB_zb #IBMCloud #CodeEngine

🔥 Introducing CodiumAI 𝐂𝐡𝐚𝐭 𝐓𝐡𝐫𝐞𝐚𝐝𝐬 🔥 With Threads, you can now: ✅ Seamlessly ask about and refine the results generated when using CodiumAI's commands. ✅ Chat with #GPT-3.5-Turbo, or GPT-4-Turbo right inside your #IDE. Threads is now available in CodiumAI Plugin v0.7.29 for VS Code. Coming soon in JetBrains IDEs. Inside CodiumAI Chat, start with a free-text message or use a command, and then continue to chat about the generated results, or ask follow-up questions seamlessly. Do you still need ChatGPT if you can chat with GPT-3.5/4 right inside your IDE? Read more here: https://lnkd.in/dC5Wqt_v Try out the [FREE] CodiumAI VS Code Plugin: https://lnkd.in/dYR5C47y Find us on Discord: https://lnkd.in/d7PkZnM2

Tips how to be good at algorithms

: 🚀 Day [17] of #100DaysOfDSA: ◇ Tackling the 3-Sum Problem 🚀 Today I dived into a classic algorithm problem known as the 3-Sum Problem. This problem is a staple for honing problem-solving skills and understanding the importance of efficient algorithms. #100daysofdsa #Algorithm #takeuforward #rajvikramaditya

💡 Day 26 of #100DaysOfProgrammingChallenge 🚀 Challenge Accepted: #21 Merge Two Sorted Lists ✨ Let's delve into the world of linked lists and learn how to merge two sorted ones into a single sorted list! 🔗 Given the heads of two sorted linked lists, `list1` and `list2`, our task is to merge them by splicing together the nodes from both lists, maintaining the sorted order. Here's a quick example to illustrate: - Input: list1 = [1,2,4], list2 = [1,3,4] - Output: [1,1,2,3,4,4] Ready to tackle this problem and master the art of merging sorted linked lists? Join me in solving this elegant challenge! 💻 #CodingChallenge #Algorithms #DataStructures #LinkedLists

🚀 Excited to share that I've solved the "Count Number of Nice Subarrays" problem! 🚀 🔍 Initially tackled with brute force, generating all subarrays. Optimized using sliding window and two-pointer method for efficiency gains. 💡 💬 Let's connect to delve deeper into algorithmic optimizations and problem-solving strategies! #Algorithm #Optimization #ProblemSolving #CodingCommunity #LinkedInLearning

🚀 Unlocking Recursive Magic: Delving Deeper into Summations DAY-22 Problem Statement: Given an integer N, calculate the sum of the first N natural numbers. Input: N = 5 Output: Sum of the first 5 natural numbers: 1 + 2 + 3 + 4 + 5 = 15 💡 Algorithmic Approach: Base Case: If 'N' becomes 0, return 0. Recursive Step: Add the current number 'N' with the sum of the first N-1 natural numbers. 1. Function sumOfNaturalNumbers(N) 2. Input: N (integer) 3. Output: Sum of the first N natural numbers 4. Base Case:   - If N is 0, return 0. 5. Recursive Step:   - Return N + sumOfNaturalNumbers(N-1) if N > 0. 🚀 Let's explore the elegance of recursion and enhance our problem-solving skills! #Day22 #RecursionExploration #DSAChallenges #ProblemSolving #AlgorithmicThinking #NDThoughts #Persistence #Consistency

🔍 Day 7 of #100DaysOfDSA: Explored advanced sorting techniques like merge sort, quick sort, understanding their time and space complexities. Visualized the crucial role of recursion and embraced the divide and conquer concept. Completed step 2 of the A2Z sheet and progressed to step 3, solving three easy level array problems: "Largest element in an array", "Second largest element in an array", and "Check if the array is sorted or not". Momentum building up! 💪 #DataStructures #Algorithms #SortingAlgorithms #Recursion #ProblemSolving

Kicking off this series with💡 Logarithmic Time (Efficient Searching): Ever found a word in a dictionary faster by splitting the pages? 📖 That’s using smart shortcuts to speed things up, even in big tasks. It’s about being efficient, not harder, as things get bigger. #timecomplexity #codenewbie #computerscience #algorithms #womenwhocode #girlswhocode #blacksintech #softwareengineering #softwareengineerlife #lifehacks #thinksmarter #timeefficient #Logarithmic