DevReach 2023’s Post

𝑳𝒆𝒗𝒆𝒍 𝑼𝒑 𝒀𝒐𝒖𝒓 𝑳𝑳𝑴 𝑨𝒑𝒑𝒔: 𝑺𝒂𝒚 𝑮𝒐𝒐𝒅𝒃𝒚𝒆 𝒕𝒐 𝑺𝒕𝒓𝒂𝒊𝒈𝒉𝒕 𝑳𝒊𝒏𝒆𝒔! LangGraph is a toolbox for building cooler LLM apps. Think of LLMs as super smart helpers, but stuck on a one-way street. LangGraph lets them chat back and forth, making your apps more flexible and powerful! It's easy to use, inspired by familiar tools, and lets your LLM apps loop and learn, just like real conversations. --- 👋 Hi it's sam , If you liked this, connect with me on LinkedIn for daily insights on #llms #guide #python #code #agents #langgraph #langchain

DSA Series #Post3 🔍 DSA Challenge Alert! Find the Duplicate Number 🧩 Hey #CodeEnthusiasts! 👋 Let's dive into another exciting problem from my Data Structures and Algorithms series. 📚 This time, we're on a mission to uncover the elusive duplicate number in an array. 🕵️♂️ 🔍 Problem Snapshot: Given an array of integers containing numbers from 1 to n, with one number repeating twice, your task is to identify and return the duplicated number. 💡 My Approach: For this brain-teaser, I employed a clever hashing strategy. 🗝️ I initialized a hash array of size n (because we know the numbers are from 1 to n) and traversed the input array. As I encountered each number, I incremented the count in the hash array. When a number's count reached 2, I confidently declared it as the duplicate we're searching for! 🕵️♂️ 👉 Code Snippet to run on CodeStudio platform:(C++): #include <bits/stdc++.h> int findDuplicate(vector<int> &arr, int n) { int hash[n] = {0}; for (int i = 0; i < n; i++) { hash[arr[i]] += 1; if (hash[arr[i]] == 2) { return arr[i]; } } } CodeStudio Link: https://lnkd.in/dZXPCUcg GitHub link (complete code to run on your machine): https://lnkd.in/dkmGXAhk 🚀 Exciting Journey Continues: This exhilarating challenge marks my third post in the ongoing DSA series on my profile! 📈 Join me as we unravel the mysteries of algorithms, data structures, and problem-solving techniques. 🧠 Together, we'll conquer the coding realm one challenge at a time! 💪 #DataStructures #Algorithms #ProblemSolving #CodingNinjas #DSAinAction

Hii Folks!! I jsut found a video on YouTube , in which Second Largest element in array LeetCode & GeeksforGeeks question was being taught wrongly in terms of writing code, approach, Time & Space. So, I just made the modifications in the Approach, algorithm & Time complexity in this video, you can just check it out once. 👉 Video link is in Comment section👈 ● Data structure and Algorithm is a mind refreshment if brain doesn't works properly while doing the work At Company. ● Do Learn Dsa, but with funny way!! Thanks to Priya to support me to make this video. #Secondlargestelement #leetcode #gfg #DataStructure #algorithm

🔍 Need to draw arbitrary polygons on images for your computer vision projects? Look no further! Introducing #PolygonZone, the ultimate tool for effortlessly retrieving coordinates of points you draw on images! 💡 Accompanying Roboflow Supervision, this Python library is a game-changer for computer vision enthusiasts. 🎉 Kudos to Piotr Skalski and the supervision team for developing this incredible tool! 🔗 GitHub: https://lnkd.in/d3tn-ujb 🌐 Web App: Try it out now! https://lnkd.in/d7i3YaXS 👨💻 To use PolygonZone: 1. Upload your image. 2. Draw your polygons. 3. Click "Enter" to save. 4. Copy the coordinates. 5. Repeat as needed! 🔍🖼️ #ComputerVision #PolygonZone #Roboflow #Innovation #TechTools #Python #CV #OpenSource #GitHub #DeveloperTools #ImageProcessing #AI Give it a try and supercharge your computer vision projects today! 🚀👁️✨

🚀 Day 1 of #100DaysOfCode 🚀 Today, I tackled the 9. Palindrome Number problem on leetcode. This problem involved finding whether the given number is palindrome or not. Checkout - Github: https://lnkd.in/gKFHiiZa Leetcode: https://lnkd.in/g-hbEeXp 💪 #CodingJourney #LeetCode #CodeStudio #ProblemSolving #Algorithm #TechSkills #ContinuousLearning  #DSAwithedSlash  edSlash LeetCode

Excited to announce that I've embarked on a coding journey with PIAIC's Web 3 course, Batch 51! 🚀 Currently diving into the fundamentals of TypeScript and JavaScript with Sir Hamzah Syed , and the possibilities seem limitless. Here's to discovering the incredible world of AI and Web 3. Let the coding adventure begin! 💻🌐 #CodingJourney #Web3 #AI #PIAIC #Batch51"

15/08/2023 ⭐ Day 81 of #100daysofcodechallenge => Solved 1 problem from Leetcode Daily Challenge.✔ => Solved 1 problem from the GeeksforGeeks POTD.✔ => Solved 1 Random Problem on GeekforGeeks Practice.✔ => Revised Some Arrays, and Vector Concepts & Solved 3-4 Random Problems on my Editor.✔ Leetcode (Medium) -1 GFG(Easy) - 2 Get my DSA code at:- https://lnkd.in/dYg7BHjs #dsacoding

30/08/2023 ⭐ Day 96 of #100daysofcodechallenge => Solved 1 problem from Leetcode Daily Challenge.✔ => Solved 1 problem from the GeeksforGeeks POTD.✔ Leetcode (Medium) -1 GFG(Easy) - 1 Get my DSA code at:- https://lnkd.in/dYg7BHjs #dsacoding

🚀 Day 11 : Mastering Binary Search! 🚀 Today was an exhilarating journey diving deeper into the world of algorithms with a focus on binary search. 💻 🎯 Here's a glimpse of what I accomplished: Solved the "Aggressive Cows" problem: Finding the maximum possible distance where 'k' cows can be placed in a line of stalls while maintaining minimum distance between them. Explored the "Allocation of Chapter Median in Two Sorted Arrays" challenge: Determining the median of two sorted arrays and finding the element at the kth position of the final sorted array. Delved into other fascinating binary search problems, honing my problem-solving skills. 🔥 What keeps me going? Motivation and drive! 💪 Each challenge fuels my passion for coding and problem-solving, pushing me to new heights. Every solved problem is a victory, driving me forward on this exhilarating journey of growth and learning. https://lnkd.in/dsgGQSgx https://lnkd.in/dEx3uqjm https://lnkd.in/dcpFxcS6 🌟 #100DaysOfCode #BinarySearch #CodingJourney #ProblemSolving #CodeChallenge #LearningIsFun

DSA Series #Post21 🧐 Problem Summary: Hey LinkedIn fam! 🌟 In my 21th post of the DSA series, I'm excited to tackle the "Quick Sort" challenge from CodeStudio. Quick Sort is a classic sorting algorithm known for its efficiency and elegance. You can find the problem description right here: https://lnkd.in/dxhGjmrc 📝 My Solution Approach: Here's a sneak peek at my C++ solution to this challenge. Make sure to run it on the CodeStudio platform for testing: int partitionArray(int input[], int start, int end) {   int pivot = input[start];   int i = start;   int j = end;   while (i < j) {     while (input[i] <= pivot && i <= end - 1) { // end-1 bcoz it makes sure that i doesn't go out of bounds of the array when incrementing       i++;     }     while (input[j] > pivot && j >= start + 1) { // start+1 bcoz it makes sure that j doesn't go out of bounds of the array when decrementing       j--;     }     if (i < j)       swap(input[i], input[j]);   }   swap(input[j], input[start]);   return j; } void quickSort(int input[], int start, int end) {   if (start < end) {     int pIndex = partitionArray(input, start, end);     quickSort(input, start, pIndex - 1);     quickSort(input, pIndex + 1, end);   } } 🔗 You can access the complete C++ solution on my GitHub: https://lnkd.in/dNr6NZAA Let's keep the coding spirit high! 💻 Feel free to reach out if you have any questions or want to discuss this algorithm. Stay tuned for more exciting challenges in the DSA series! 🚀 #DataStructures #Algorithms #CodingNinjas #QuickSort #LinkedInCodingChallenge #DSA