Animesh Singh’s Post

🌟 Exciting Journey Begins: 50-Day Coding Challenge! 🌟 I am thrilled to share that I have embarked on a 50-day coding challenge initiated by my college. Although I have been solving problems daily, this structured challenge is designed to push my boundaries, making me more grateful and thrilled about coding. 🔹 Challenge Overview: Our CP and DSA mentor, Deepak Kumar Gour sir, will provide us with a daily challenge problem. Today's problem was to merge two sorted arrays. Even though I had solved this problem before, revisiting it today served as a great revision of the concept. Problem Overview: 🔹Time Complexity : O(N+M) 🔹Space Complexity : O(1) 🔹 Learning Outcomes: The solution involved merging two sorted arrays in-place, ensuring efficient use of time and space. This exercise reinforced my understanding of array manipulation and efficient coding practices. I am looking forward to tackling more challenges and sharpening my data structure and algorithm skills in the coming days! A big thank you to Syed Zabi Ulla sir, Mehul Khandhedia sir,Anurag Tiwari sir, and Deepak Kumar Gour sir, Md Imran A sir for this initiative. This competitive challenge will surely help us all enhance our concepts and problem-solving abilities. Stay tuned for more updates on this exciting journey! 🚀 #CodingChallenge #DataStructures #Algorithms #LearningJourney #Grateful #CompetitiveProgramming #PWIOI

🎉 Exciting Experience! 🎉 I’m thrilled to announce that I’ve successfully completed a 2-month bootcamp organized by Galgotias University in collaboration with Ritambhara Technologies 🚀. The bootcamp focused on: 🖥️ Coding 🧠 System Design ⚙️ Object-Oriented Programming (OOPs) 📊 Data Structures and Algorithms (DSA) During these two months, I sharpened my problem-solving skills 🧩, learned how to design scalable systems 🏗️, and worked on real-world projects 💻. This hands-on experience has given me a solid foundation in building efficient and scalable applications. I’m excited to apply these new skills in upcoming projects and continue growing as a developer 💡👨💻. #KeepLearning #Coding #SystemDesign #TechJourney

I am thrilled to share that I have successfully cleared the capstone project - Introduction to Computer Programming while pursuing Certification in Full Stack Data Science and AI program at #AlmaBetter #Certification-in-Full-Stack-Data-Science-and-AI

🚀 Day 67 of 180 Days of Coding Challenge 🚀 Today marked a significant milestone in our coding journey as we delved into the fascinating world of Data Structures and Algorithms (DSA). Our focus was on an ancient yet incredibly powerful algorithm called the Sieve of Eratosthenes. The Sieve of Eratosthenes is a brilliant method for finding all prime numbers up to a specified integer. It operates by iteratively marking the multiples of each prime number starting from 2, thereby eliminating non-prime numbers and leaving behind only the primes. In our session, led by the knowledgeable Mohammad F. , we gained a deep understanding of how this algorithm functions and its underlying principles. We learned about its time complexity, which is typically O(N log log N), making it remarkably efficient for generating prime numbers. Furthermore, Mohammad F. enlightened us on techniques to optimize the Sieve of Eratosthenes to achieve a linear time complexity of O(N), ensuring even greater efficiency in our coding endeavors. I am immensely grateful to Mohammad F. for his invaluable guidance and for providing such an enlightening session. The knowledge gained today will undoubtedly serve as a solid foundation as we continue to explore the vast realm of DSA. Let's keep pushing the boundaries of our coding skills and embracing every opportunity to learn and grow together! 💻🌟 #180DaysOfCoding #DSA #SieveOfEratosthenes #LearningAndGrowing #Thankful

"Day 45 of #100daysofcodingchallenge of Alpha Plus Course, led by the illustrious Shradha Didi from Apna College. 💡 Hey LinkedIn community, today I delved deeper into the intricacies of Chapter 17: LinkedList, exploring some advanced concepts that enrich our understanding and broaden our coding horizons. Here's a breakdown of what I learned: 1. **Doubly Linked List**: A doubly linked list is a type of linked list where each node contains a pointer to the next node as well as a pointer to the previous node. This bidirectional connectivity allows traversal in both forward and backward directions, enhancing versatility and efficiency. 2. **Reverse Doubly Linked List**: Reversing a doubly linked list involves flipping the direction of pointers, effectively reversing the order of elements in the list. This operation is valuable for various applications, such as optimizing traversal or solving specific problems. 3. **Circular Linked List**: In a circular linked list, the last node's pointer points back to the first node, creating a circular structure. This circularity offers advantages in certain scenarios, such as implementing circular buffers or managing resources in a cyclical manner. 4.Solving Practice Questions: Practice questions help reinforce concepts learned and improve problem-solving skills. Examples may include implementing basic operations on linked lists, such as insertion, deletion, searching, and traversal. Exploring these concepts not only deepens our understanding of data structures but also hones our problem-solving abilities. Let's continue to learn, grow, and tackle challenges head-on! 💡🚀 #LinkedLists #DoublyLinkedList #CircularLinkedList #ProblemSolving #CodingCommunity #LearningAndDevelopment"

Embarking on a 100-Day Coding Challenge! 🚀 I’m excited to announce that I’m starting a 100-day journey dedicated to mastering Data Structures and Algorithms (DSA)! 🎯💻 Over the next 100 days, I’ll be diving deep into the heart of DSA, tackling a new problem each day, and revisiting key concepts to solidify my understanding. This challenge is not only about coding but also about cultivating a problem-solving mindset and improving efficiency in algorithm design. Here’s to pushing boundaries, expanding knowledge, and growing as coders! 🌟 #100DaysOfCoding #DSA #CodingChallenge #TechCommunity #LearningTogether #CodingJourney Day 1: Kth smallest and largest element in an array Approach - 1 : Sorting In this approach, we will use sorting. We will use the fact that in a sorted array the kth largest element will be present at the kth position from the end. The intuition behind this approach is that we will not require any extra space. So we will just sort the array and return the element arr[n-k]. Time Complexity : O(N∗LogN) Space Complexity : 𝑂(1) Approach - 2 : Using Min Heap for Kth largest element In this approach, we will use a Min Heap of size k and insert the k largest elements of the array into it. We will use the fact that if we put the k largest elements of the array in a min-heap, then the kth largest element will be present on the top of the min-heap, and we can easily return this element. Using Mx Heap for Kth smallest element In this approach, we will use a max Heap of size k and insert the k smallest elements of the array into it. We will use the fact that if we put the k smallest elements of the array in a max-heap, then the kth smallest element will be present on the top of the max-heap, and we can easily return this element. Time Complexity : 𝑂(𝑁∗𝐿𝑜𝑔𝐾) O(N∗LogK) Space Complexity : 𝑂(𝑁)

🚀 Exciting update on my coding expedition! 🌟 Just conquered the realm of basic sorting algorithms, mastering the intricacies of selection sort, insertion sort, and bubble sort. 🔄📊 Navigating through the mechanics of rearranging elements efficiently has been an enlightening journey. These foundational sorting techniques are the building blocks for more advanced algorithms ahead. 💻🔍 Ready to wield the power of sorting in my coding arsenal, and eager to tackle more complex challenges on the horizon. Here's to continuous learning and growth! 🌐💡 #SortingAlgorithms #CodeMilestone #DSAJourney #LearningProgress #StriversA2ZDSA

🌟 Day 82 of the #100DaysOfCodingChallenge promises to be an exciting journey packed with coding achievements and insightful discoveries! 💻 Here's a preview of today's fascinating task: Student Attendance Record II: Today, I'm diving into the intriguing challenge of Student Attendance Record II. This task involves determining the number of valid attendance records a student can have over a certain number of days, where records are strings consisting of 'A' (Absent), 'L' (Late), and 'P' (Present). With a blend of analytical skills and algorithmic expertise, I'll explore dynamic programming and combinatorial techniques to identify all valid attendance combinations. By leveraging innovative strategies and meticulous planning, I aim to develop an efficient algorithm that calculates the number of valid records, providing valuable insights and enhancing my understanding of string manipulation and combinatorial optimization. As I continue this exhilarating coding journey, each challenge propels me closer to mastery and innovation. 💡 With unwavering perseverance and a thirst for knowledge, I eagerly embrace the myriad opportunities for growth and discovery that await on the horizon! #CodeToConquer #CodingJourney #Day82 #100DaysOfCode #CodeTriumph #InnovationDriven 🚀🌟💻 Parul University byteXL Santosh Nair

🚀 Day 68 of the #100DaysOfCodingChallenge has been an invigorating journey filled with coding exploration and discovery! 💻 Here are the highlights: Largest Local Values in a Matrix: Embarking on the task of finding the largest local values in a matrix, I delved into strategies to identify and extract these significant data points. Leveraging matrix traversal techniques and algorithmic analysis, I developed an efficient solution to pinpoint the largest local values within the matrix, enabling insightful data analysis and interpretation. As I persist in delving deeper into coding challenges, each endeavor propels me further on my journey of skill development and innovation. 💡 Excited to tackle more coding adventures and continue expanding my knowledge and expertise! #CodeToConquer #CodingJourney #Day68 #100DaysOfCode #CodeTriumph #InnovationDriven 🌟🚀💻 Parul UniversitybyteXL Santosh Nair

🌟 Day 62 of the #100DaysLeetCodeChallenge Update: Navigating Challenges! 💻 Today's focus was on the Problem of the Day, a medium-level puzzle that tested my skills: 1️⃣ Remove Nodes From Linked List (Medium Level): Conquered this challenge, refining my algorithmic prowess and data structure understanding. Every problem unlocks new insights and fuels my coding journey! 🚀💡 #LeetCodeProgress #CodeChallenge #TechJourney #KeepLearning #CodeMastery #ProgressUpdate Parul University byteXL