Gourav Giri

Got AIR 381 in AtCoder's Beginner Contest 374 ❤️🎉 Greetings connections 😊 , Yesterday, I participated in AtCoder's Beginner's contest. I was able to solve the problems ranging from A-D, was able to solve E, right after the contest, as it took some time to figure out the reason behind failing test cases. . . Here're my approaches to the problems - C. Separated Lunch In this problem, we're given a set of departments in an organization, we need to form 2 groups (group A and B). While doing so, we need to ensure that the maximum number of people in either groups is minimum. Owing to the constraints, 2≤N≤20, and 1≤Ki≤108, we can easily use a DP based approach to try out all the possible ways of assignment to the groups. T.C. - O(N) D. Laser Marking In this question, we're a given a laser printing machine, and we are required to print N line segments on a sheet of paper, whose end points are given as a tuple - (x1,y1,x2,y2). We're required to find the minimum possible time to print the line segments given that the laser beam has 2 different speeds, one while printing and other while just moving, S and T. it reminded of the disk scheduling algorithms, SCAN, C-SCAN, LOOK, C-LOOK. so, I basically simulated the problem statement, as N<=6, I tried to out all the possible permutations along with the permutation of the 2 ends of the line segments. It was an interesting problem. ❤️ E. Sensor Optimization Dilemma 2 It was really a good problem, it tested our Binary search solving approach. In this question, we had to find maximum achievable production capacity, where production capacity as the minimum of i=1 to n(Wi). We're given 2 kinds of machines for each process, with different capacity and price. We need to efficiently purchase these machines to maximize the production capacity. A and B were quite simple questions. Inspiration : Aryan C. sir , Badal Kumar sir. #codeforces #leetcode #atcoder #gfg #contest #programming #competitiveprogramming #dsa #development #developer #dailychallenge

32

Excited to share that today I participated in the #CodeChef #Contest #Starters130 and successfully solved 4 questions! Looking forward to more such competitions and continuous learning! #CodeChef #CodingContest #Starter130 #Programming

9

1 Comment

Day 12/30 Java+DSA 🔥 Tried one problem on BST but, not able to solve with my own knowledge. 🔥 Problem : -Printing bst elements in a range. 🔥 Solved by referring to Swaroop VITB anna tutorial from his course , after referring to the code I understood the approach to code,but on my own knowledge I was not able to solve this problem and I got mood off for today. 🔥 I will start recursion playlist from kunal kushwah channel and come this more clarity on recursion. #java #geeksforgeeks #javadsa

6

Hello everyone!!! today's Leet code POTD was simple yet interesting one. problem statement: You have observations of n + m 6-sided dice rolls with each face numbered from 1 to 6. n of the observations went missing, and you only have the observations of m rolls. Fortunately, you have also calculated the average value of the n + m rolls. Return an array of length n containing the missing observations such that the average value of the n + m rolls is exactly mean. approach: in this question first we find the missing sum that we required to make our mean equal to given mean. let, sum=sum of given rolls (size=m). k=missing sum. formula to find k=mean*(n+m)-sum; if(k<n || k>6*n) then you cannot create array of length n, so return empty array. (Because 6*n is the max sum value that the array of length n can have and value in array should be (>=1 && <=6) so, you can't create array in that case also) now after finding k, we will make a vector/list ans of size n to store missing observations. first, we will evenly distribute the value (>=1 && <=6) in the ans by k/n; then we will find remainder (k%n). by using for loop we will evenly distribute the remainder to the elements in the ans till the remainder !=0. then just return ans. Happy coding!!!!! 🚀🚀🚀🚀🚀🚀🚀🚀🚀

12

Day #6 🚀 Problem-Solving Journey Continues on LeetCode! Today, I solved an interesting problem: 242. Valid Anagram on LeetCode. This one’s all about determining if two strings are anagrams by comparing character counts and ensuring both strings have identical compositions. 🔄 🔍 Solution Highlights: 1. Checked if both strings have the same length – a basic but essential step. 2. Used an integer array to count the occurrences of each character in the first string. 3. Decremented the character count based on the second string, ensuring a balanced count for each letter. 4. Returned false if any count was negative, indicating a mismatch in characters. Result: Solution accepted with optimal runtime – efficient and concise! ⚡ #ProblemSolving #LeetCode #CodingJourney #Java #Anagram #CodingSkills #TechEnthusiast #LearningEveryday

16

✅ Day 22 Completed of #100DaysofDSA Hello everyone! Welcome back to my 100 Days of DSA challenge. Today, I dived into the depths of the Standard Template Library (STL) in C++. The STL is a powerful library that provides a collection of generic classes and functions, which can save us time and effort when implementing common data structures and algorithms. 🔍 What is the STL? The STL is a set of C++ template classes that provide general-purpose classes and functions with templates that implement many popular and commonly used algorithms and data structures like vectors, lists, queues, and stacks. The STL has four components: 1. Algorithms 2. Containers 3. Functions 4. Iterators 🔑 Key Components of the STL: 📦 Containers Containers are objects that store collections of data. The STL provides several different types of containers: - Sequence Containers:`vector`, `deque`, `list`, `array`, `forward_list`. - Associative Containers: `set`, `map`, `multiset`, `multimap`. - Unordered Associative Containers:`unordered_set`, `unordered_map`, `unordered_multiset`, `unordered_multimap`. - Container Adapters:`stack`, `queue`, `priority_queue`. ⚙️ Algorithms Algorithms act on containers and provide various operations like searching, sorting, counting, manipulating, etc. The `<algorithm>` header defines a collection of functions especially designed to be used on ranges of elements. 🔄 Iterators Iterators are used to point at the memory addresses of STL containers. They are primarily used to traverse through the elements of a container. They are used just as pointers in arrays. 🎯 Benefits of Using STL - Simplicity: Provides pre-written code for common tasks. - Efficiency: STL implementations are highly optimized. - Reusability: Helps in writing reusable code. - Consistency: Standardized methods and naming conventions across different containers. 🔹here is the learning resource: (https://lnkd.in/dchabJnh) (https://lnkd.in/d5MC9AZJ) 📝 Conclusion Today’s journey through the STL in C++ was both enlightening and empowering. Mastering the STL allows us to write cleaner, more efficient, and more understandable code. The STL is a treasure trove of tools and utilities that every C++ programmer should be familiar with. Thank you Community for your support. 😊 Keep coding and happy learning! 🚀 #DataStructures #CodingJourney #TechLearning #DSAchallenge #CppStdLibrary

4

100 𝘿𝙖𝙮𝙨 𝙤𝙛 𝘾𝙤𝙙𝙞𝙣𝙜 𝘾𝙝𝙖𝙡𝙡𝙚𝙣𝙜𝙚: 𝙁𝙧𝙤𝙢 𝙎𝙩𝙧𝙪𝙜𝙜𝙡𝙚𝙨 𝙩𝙤 𝘾𝙤𝙣𝙨𝙞𝙨𝙩𝙚𝙣𝙘𝙮 𝙖𝙣𝙙 𝙂𝙧𝙤𝙬𝙩𝙝 When I started my second semester in college, I had zero awareness about platforms like LeetCode, Codeforces and every time I tried to write code, I struggled to make progress. It wasn’t until I interacted with my friend Arjun Budda that I got a better idea of how to approach coding challenges. This conversation opened my eyes to new resources, and from there, I started exploring various YouTube channels to gain more insight. 𝗢𝗻𝗲 𝗼𝗳 𝘁𝗵𝗲 𝗯𝗶𝗴𝗴𝗲𝘀𝘁 𝘁𝘂𝗿𝗻𝗶𝗻𝗴 𝗽𝗼𝗶𝗻𝘁𝘀 𝗶𝗻 𝗺𝘆 𝗷𝗼𝘂𝗿𝗻𝗲𝘆 𝘄𝗮𝘀 𝗱𝗶𝘀𝗰𝗼𝘃𝗲𝗿𝗶𝗻𝗴 Raj Vikramaditya(𝗦𝘁𝗿𝗶𝘃𝗲𝗿𝘀), 𝗮 𝗬𝗼𝘂𝗧𝘂𝗯𝗲𝗿 𝘄𝗵𝗼 𝗶𝗻𝘀𝗽𝗶𝗿𝗲𝘀 𝗰𝗼𝘂𝗻𝘁𝗹𝗲𝘀𝘀 𝘀𝘁𝘂𝗱𝗲𝗻𝘁𝘀 𝘁𝗵𝗿𝗼𝘂𝗴𝗵 𝗵𝗶𝘀 𝘀𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲𝗱 𝗰𝗼𝗻𝘁𝗲𝗻𝘁. Following Strivers' A-to-Z speed sheet gave me a clear starting point and motivated me to continue solving problems daily. 𝐈 𝐪𝐮𝐢𝐜𝐤𝐥𝐲 𝐫𝐞𝐚𝐥𝐢𝐳𝐞𝐝 𝐭𝐡𝐚𝐭 𝟏𝟎𝟎 𝐝𝐚𝐲𝐬 𝐦𝐢𝐠𝐡𝐭 𝐧𝐨𝐭 𝐛𝐞 𝐞𝐧𝐨𝐮𝐠𝐡 𝐭𝐨 𝐜𝐫𝐚𝐜𝐤 𝐜𝐨𝐝𝐢𝐧𝐠 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰𝐬 𝐟𝐨𝐫 𝐩𝐫𝐨𝐝𝐮𝐜𝐭-𝐛𝐚𝐬𝐞𝐝 𝐜𝐨𝐦𝐩𝐚𝐧𝐢𝐞𝐬, 𝐛𝐮𝐭 𝐭𝐡𝐞 𝐭𝐫𝐮𝐞 𝐯𝐚𝐥𝐮𝐞 𝐨𝐟 𝐭𝐡𝐢𝐬 𝐜𝐡𝐚𝐥𝐥𝐞𝐧𝐠𝐞 𝐥𝐚𝐲 𝐢𝐧 𝐜𝐨𝐧𝐬𝐢𝐬𝐭𝐞𝐧𝐜𝐲. 𝐈𝐭 𝐰𝐚𝐬𝐧’𝐭 𝐚𝐛𝐨𝐮𝐭 𝐬𝐨𝐥𝐯𝐢𝐧𝐠 𝐚 𝐡𝐮𝐠𝐞 𝐧𝐮𝐦𝐛𝐞𝐫 𝐨𝐟 𝐩𝐫𝐨𝐛𝐥𝐞𝐦𝐬 𝐢𝐧 𝐚 𝐬𝐡𝐨𝐫𝐭 𝐭𝐢𝐦𝐞; 𝐢𝐭 𝐰𝐚𝐬 𝐚𝐛𝐨𝐮𝐭 𝐛𝐮𝐢𝐥𝐝𝐢𝐧𝐠 𝐚 𝐡𝐚𝐛𝐢𝐭 𝐨𝐟 𝐩𝐫𝐨𝐛𝐥𝐞𝐦-𝐬𝐨𝐥𝐯𝐢𝐧𝐠 𝐭𝐡𝐚𝐭 𝐢𝐦𝐩𝐫𝐨𝐯𝐞𝐝 𝐦𝐲 𝐬𝐤𝐢𝐥𝐥𝐬 𝐢𝐧𝐜𝐫𝐞𝐦𝐞𝐧𝐭𝐚𝐥𝐥𝐲. Here are some highlights from my 100 Days Coding Challenge: Solved 150+ problems on LeetCode: https://lnkd.in/dQAS6iEA Took part in bi-weekly and weekly contests on LeetCode, which helped sharpen my skills under time constraints. Expanded my horizon by solving 110+ problems on Codeforces: https://lnkd.in/dBbbXtTq Along the way, I earned some significant milestones, including the 50-day and 100-day consistency badges on LeetCode. These small wins motivated me to continue pushing myself, and the journey has only just begun. 🎯The 100-day challenge might be complete, but the habit of consistent coding is something I intend to carry forward. 𝙁𝙤𝙧 𝙖𝙣𝙮𝙤𝙣𝙚 𝙡𝙤𝙤𝙠𝙞𝙣𝙜 𝙛𝙤𝙧 𝙜𝙪𝙞𝙙𝙖𝙣𝙘𝙚 𝙤𝙣 𝙬𝙝𝙚𝙧𝙚 𝙩𝙤 𝙨𝙩𝙖𝙧𝙩 𝙤𝙧 𝙨𝙚𝙚𝙠𝙞𝙣𝙜 𝙖 𝙨𝙩𝙧𝙪𝙘𝙩𝙪𝙧𝙚𝙙 𝙧𝙤𝙖𝙙𝙢𝙖𝙥 𝙛𝙤𝙧 𝙩𝙝𝙚𝙞𝙧 𝙤𝙬𝙣 𝙘𝙤𝙙𝙞𝙣𝙜 𝙟𝙤𝙪𝙧𝙣𝙚𝙮, 𝙛𝙚𝙚𝙡 𝙛𝙧𝙚𝙚 𝙩𝙤 𝘿𝙈 𝙢𝙚. 𝙄'𝙙 𝙡𝙤𝙫𝙚 𝙩𝙤 𝙨𝙝𝙖𝙧𝙚 𝙩𝙝𝙚 𝙧𝙚𝙨𝙤𝙪𝙧𝙘𝙚𝙨 𝙖𝙣𝙙 𝙨𝙩𝙧𝙖𝙩𝙚𝙜𝙞𝙚𝙨 𝙩𝙝𝙖𝙩 𝙝𝙚𝙡𝙥𝙚𝙙 𝙢𝙚 𝙖𝙡𝙤𝙣𝙜 𝙩𝙝𝙚 𝙬𝙖𝙮! "ᴛʜᴇ ᴄᴏɴᴛᴇɴᴛ ᴀʙᴏᴠᴇ ɪꜱ ɴᴏᴛ ᴄᴏᴘɪᴇᴅ; ɪᴛ ʀᴇꜰʟᴇᴄᴛꜱ ᴛʜᴇ ʀᴇᴀʟ ꜰᴀᴄᴛꜱ ᴏꜰ ᴍʏ 100-ᴅᴀʏ ᴄᴏɴꜱɪꜱᴛᴇɴᴄʏ ᴄʜᴀʟʟᴇɴɢᴇ. ɪ ʜᴀᴠᴇɴ’ᴛ ᴜꜱᴇᴅ ᴀɴʏ ᴀɪ ᴛᴏᴏʟꜱ, ɪɴᴄʟᴜᴅɪɴɢ ᴄʜᴀᴛɢᴘᴛ, ᴛᴏ ᴄʀᴇᴀᴛᴇ ᴛʜɪꜱ ᴄᴏɴᴛᴇɴᴛ." #100DaysOfCode #CodingJourney #LeetCode #Strivers #Consistency #ProblemSolving #TechCareer #CodingChallenge

21

3 Comments

Hello Everyone, ✨ Day 58/100 - #100DaysOfDSA ✨ Completed solving "3243. Shortest Distance After Road Addition Queries I", a Medium-level problem on LeetCode. 🚀 🔍 Problem Overview: The task involved finding the shortest path from city 0 to city n-1 after each query that adds a new road between two cities. The challenge demanded efficient use of graph traversal and shortest path concepts to handle dynamic updates in the graph. 🧠 Key Takeaways: ✔️ Implemented DFS for dynamic distance updates after adding roads. ✔️ Focused on optimizing recursive updates to ensure the solution scales effectively. ✔️ Enhanced understanding of graph structures, unidirectional edges, and shortest-path strategies. 🎯 Results: Successfully achieved 0ms runtime, reflecting an optimized solution for this dynamic problem. 🎉 This journey is boosting my problem-solving and algorithm design skills, especially in the graph domain, preparing me for top-tier coding challenges in placements. 💡 💻 Next Steps: More graph-based problems to strengthen concepts! 🏗️ #LeetCode #GraphAlgorithms #DSAChallenge #ProblemSolving #PlacementsPreparation #CodingLife

10

Day - 17 of #100daysofcodingchallenge Problem: Populate Inorder Successor of all nodes Platform: GFG #drgvishwanathanchallenge #100daysofcodingchallenge #geeksforgeeksDay

4

1 Comment

Hi #Connections As I’m solving problems on LeetCode with the help of my mentor Kunika Malhotra at Bosscoder Academy I’m able to come to LeetCode 75! LeetCode Problem 75, also known as Sort Colors, is a classic algorithmic problem that tests your ability to manipulate arrays efficiently.⭐  The Dutch National Flag problem inspires the problem and requires you to sort an array containing only 0s, 1s, and 2s, in linear time and without using extra space for another array.🚃 Also here are the new things that I’ve been exploring 🟢Array manipulation✅ 🟢String manipulation✅ 🟢Binary search✅ 🟢Sliding window techniques✅ 🟢Hashmap utilization✅ Figuring out this problem wasn't just about finding the answer but It's about really getting into how data is organized and how algorithms work.✅✅ #LeetCode #ProblemSolving #Algorithm #ArrayManipulation #StringManipulation #BinarySearch #SlidingWindow #Hashmap #TechSkills #CodingChallenge

14

1 Comment

Day27: Question: Length of Last Word Example 1: Input: s = "Hello World" Output: 5 Explanation: The last word is "World" with length 5. Example 2: Input: s = "  fly me  to  the moon " Output: 4 Explanation: The last word is "moon" with length 4. Example 3: Input: s = "luffy is still joyboy" Output: 6 Explanation: The last word is "joyboy" with length 6. Answer Approach: For solving this question, Firstly creating a variable named "length" initialised with zero to store the length of last word and creating variable "i" for iterating string from last so initialised i= StringLength -1. Then skip trailing spaces using while loop by moving the pointer "i" backwards until finding non-space character or reach the beginning of the string. When reached the last non-space character or the beginning of the string, start counting the length of the last word by moving the pointer "i" backwards until we encounter a space or reach the beginning of the string. For each non-space character encountered in above step, we increment the "length". Then at last, return the value of length. For codes and complete questions, click on the given link: https://lnkd.in/g4PAUiTR #Leetcode #problemsolving #100days100problem #Hiring #hiring #google #facebook #Amazon #Coding #microsoft

1

**Day 9 of #DrGViswanathanChallenge #100DaysOfCode** Solved the "Increasing Triplet Subsequence" problem today! 🔺🔻 **My Approach:** - Used two variables to track the smallest and second smallest numbers while iterating through the array. - As soon as I found a third number greater than both, the solution was confirmed! Key takeaway: Optimized the solution to O(n) time and O(1) space—it's all about keeping track of the right values! 💡 #Coding #Java #LeetCode #ProblemSolving #Algorithms #100DaysOfCode #VITBhopal #VITBhopalLions

7

Day 6 of my LeetCode Journey: Fibonacci Series Mastered! Today, I took on the classic Fibonacci series problems on LeetCode, and it was a great experience to strengthen my problem-solving skills. Solving these problems not only deepened my understanding of dynamic programming and recursion but also helped me appreciate the elegance of efficient algorithms. Key Takeaways: Enhanced my approach to recursive solutions. Optimized performance using memoization and tabulation techniques. Refined understanding of space and time complexity. A big shoutout to Prajjal Dhar and the team at REGex Software Services for their constant support and guidance in this journey! 🙌 Next milestone—keep pushing forward! 💪 #LeetCode #Fibonacci #ProblemSolving #DynamicProgramming #CodingJourney #100DaysOfCode #MERNStack

8

Day 44 of my DSA Problem Solving Journey! Today, I tackled the LeetCode problem "Max Consecutive Ones." This problem helped me refine my approach to handling binary arrays and efficiently finding the longest sequence of consecutive 1's. It was a great exercise in optimizing the use of loops and conditionals to track consecutive elements. I also got to practice thinking about edge cases, such as arrays with only 0's or 1's. Big thanks to my mentor, Prajjal Dhar, at REGex Software Services for continuing to provide invaluable guidance. Your support keeps me focused and motivated as I work through these challenges. Feeling energized and ready for more! On to the next one! 💪 #DSA #LeetCode #ProblemSolving #Thankful #Mentorship #CodingJourney

8

𝙄 𝙢𝙞𝙨𝙨 𝙮𝙤𝙪, 𝙝𝙤𝙥𝙚 𝙮𝙤𝙪 𝙘𝙤𝙢𝙚 𝙗𝙖𝙘𝙠 𝙖𝙜𝙖𝙞𝙣........ .......𝙡𝙤𝙖𝙙𝙨 𝙤𝙛 𝙢𝙚𝙢𝙤𝙧𝙞𝙚𝙨 𝙬𝙞𝙩𝙝 𝙮𝙤𝙪 𝙎𝙖𝙮𝙞𝙣𝙜 𝙤𝙛𝙛𝙞𝙘𝙞𝙖𝙡𝙡𝙮 𝙜𝙤𝙤𝙙𝙗𝙮𝙚🙌❤ 1.Solved 70 leetcode questions, participated in 3 contests with a rank of 2271,Codechef contests too. 2.Guided 10+ students and inspired others to start their LinkedIn journey. 3.Learnt 5 new tech skills improved myself every single day. 4.Achieved 500+ days of learning French with a perfect streak for July month. 5. Got 43k+ impression in a week and crossed 3k followers(LinkedIn). 6.Completed 3 professional certifications and 2 remote internships and completed 2 mini projects. 7. Got selected for Headstarer and met people and connected people from different countries and making projects,interviews. 8.Not only studies, travelled too, saw the latest movies, eat lots of roadside food It was the most productive month till now of this year, I wish every month is like July for me . How was your July? I didn't expect to achieve this much but it's rightly said "𝘐𝘯𝘴𝘢𝘢𝘯 𝘴𝘢𝘣 𝘬𝘶𝘤𝘩 𝘬𝘢𝘳 𝘴𝘢𝘬𝘵𝘢 𝘩𝘢, 𝘪𝘯𝘴𝘢𝘢𝘯 𝘩𝘪 𝘵𝘰𝘩 𝘬𝘢𝘳𝘵𝘢 𝘩𝘢 𝘯𝘢". #𝘑𝘶𝘭𝘺𝘮𝘦𝘮𝘰𝘳𝘪𝘦𝘴 #𝘱𝘳𝘰𝘥𝘶𝘤𝘵𝘪𝘷𝘪𝘵𝘺 #𝘭𝘦𝘢𝘳𝘯𝘪𝘯𝘨

455

52 Comments

🚀 Starting My DSA Journey! 🚀 I've begun my Data Structures and Algorithms (DSA) program, mentored by Jithin K narayanan. Day 1 was packed with learning. Here's a snapshot of what I covered: Stack: A stack follows Last-In-First-Out (LIFO). Think of it as a stack of plates. The last one you put on top is the first one you take off. Queue: A queue follows First-In-First-Out (FIFO). Like waiting in line at a store, the first one in is the first one out. Linked List: A linked list is a series of connected nodes. Each node holds a value and a reference to the next node. Great for dynamic memory allocation. Linear Search: Checks each element one by one until it finds the target. Simple but works well for small datasets. Binary Search: Divides the search interval in half. Requires sorted data but is much faster for large datasets. Time Complexity: Measures how the runtime of an algorithm grows with the input size. Critical for writing efficient code. Space Complexity: Measures how much memory an algorithm uses. Important for optimizing resource usage. Understanding these concepts is essential for efficient coding. I'm excited to apply them to real-world projects. Stay tuned for more updates! #Edapt #DataStructures #Algorithms #Coding #TechSkills

6

Task 3 ✅️ of InternPe (Python) Classic Snake Game using Tkinter Platform: Jupyter Notebook Extra Features :- -Press 'R' to restart the game. -Displays high score to challenge yourself.

9

#Day5 of #DPseries LQ)1137.N-th Tribonacci Number(Easy) Today I tackled the "N-th Tribonacci Number" problem on LeetCode . Utilizing C++, I successfully applied the tabulation concept to solve this easy-level problem. Open to suggestions and feedback, so feel free to share your thoughts! 😇 Karthik Paila,Pradeep Kumar Puvvala ,Praveen Kumar Inti ,Sahu Akshaya,Jyothi Padala, Santosh Mode ,Kumar Mahesh K. #coding #programming #leetcode #cplusplus #day5

17