Kushal Vijay

I've become a Specialist on Codeforces, and I have something to share. About six months ago, I watched Pranav Mehta demonstrate how he solves a CP problem faster , and I was amazed by the speed at which he tackled those challenges. To be honest, it also intimidated me a bit, and I found myself questioning my own skills for a moment. That was my first introduction to competitive programming. I was fascinated by how quickly competitive programmers could come up with solutions, and I would spend hours staring at their implementations, trying to make sense of what they were doing. Before I started following Aryan C., I had no idea you could determine the parity of a number using bitwise AND, or that you didn’t always need to write for(int i = 0; i < n; i++) to iterate over all elements. It was frustrating and confusing when I couldn’t even figure out how to take input for a CF question or how to run a while loop to solve all the test cases. I struggled with solving 1000-rated problems and never imagined I’d come close to reaching Specialist. Things got better eventually as I improved my approach and kept practicing. I won’t go into details about how I improved since this post is just to share how I felt when I started—many people feel this way, whether it’s in CP, DSA, or anything else in life. My message to everybody is that just find something that you're compassionate about and keep putting that work and you will reach there one day! (If you’re interested in the specifics of how I practiced and which resources I followed, leave a comment, and I’ll try to write a separate post on that.) #codeforces #coding #cp #programming #CompetitiveProgramming #Codeforces #Specialist #CodingJourney #ProgrammingLife #CPMilestone #KeepHustling #DSA #TechGoals #CodingCommunity #ProblemSolving #CodeChallenge

832

30 Comments

I come from a Layoff Batch 😞 (Tier-3 College) I didn’t receive a PPO from Amazon. I had to work a 10 AM to 7 PM shift 😬 (not counting the commute time) But despite that I never gave up. Deep down, I knew my goal was to be part of an MNC. 🌟 So, I created this strategy for Myself 👇: 📌 Started checking job portals and created a well-structured profile. 📝 📌 ⁠Applied to at least 20 jobs daily, either through referrals or recruiters. 📤 📌 Solved at least two DSA questions a day (one medium, one hard, or one easy). 🔍 📌 Stuck to one specific DSA sheet instead of hopping between multiple sheets. 📑 📌 Continuously updated my resume with projects. 🔄 It sounds overwhelming because it was!😅 At this time, my applications were Rejected, I Failed Interviews, Struggled with Consistency… And things got really difficult to manage but I didn’t let it stop me💪🏻 If you’re also feeling the same, don’t give up and don’t worry, you’re not alone. I had to create my path on my own but you can save the efforts with 1:1 support and guidance from experts. Connect with them for a FREE session at Preplaced- https://lnkd.in/gtrBbibH They will help you achieve your MNC dream by personalizing your strategy, training on DSA, helping with resumes, conducting mock interviews and even arranging referrals. Remember, MNCs are tough to crack but not impossible and now you even have the best support🔥 #rejections #careerjourney #collab #preplacedcollab #interview #tier3 Preplaced Long-Term Mentorship

1,209

35 Comments

Codechef Starters 139 : Editorial: Div1 : 1-3 1. Find the sum of prime numbers less than or equal to the least prime factor of K and output K*Sum, why? suppose P*K where P > lp[k], then I can write this same product as lp[k] *(K*P/lp[k]) now clearly, K*P/lp[k] > K, hence it's not possible for primes P > lp[k]. 2. Since node 1 is already visited, you can minimise the cost of breaking bridges by either selecting the smaller ones only and the bigger ones only and club them with 1st node, the minimum among these 2 case will give the minimum value to seperate the whole graph in 2 parts of size say s1 and n-s1 where s1 is the size of group which contains the 1st node,. if this cost < C, then you can just visit s1 nodes, do this iteratively for starting from (1,n-1),(2,n-2)..... till you get yr minimum answer. 3. Observation 1 - any 2 elements which are smaller than their previous element can't be consecutive else answer would be 0 as you can't sort them. Observation 2 - minimum K will be the maximum of a[i-1]-a[i]. Observation 3 - suppose a1,a2,a3,a4,a5,a6 where a2 and a6 are bad elements , now maximum by which you can increase and still the array will be sorted can be obtained by the maximum difference b/w consecutive elements present b/w a2 and a6 (a2 inclusive a6 exclusive) now extend this observation to arrays with multiple bad elements, in that case the maximum K by which array will still be K sorted will be get by the minimum among all the maximum value of difference b/w consecutive elements present b/w any 2 bad elements ex - a1,a2,a3,a4,a5,a6,a7,a8, suppose a2,a5,a8 are bad elements and suppose a4-a3 is max b/w a2 and a5 and, a6-a5 is max b/w a5 and a8, then Kmax = min(a6-5,a4-3). Now you have got the minimum and the maximum, just output the sum of this range :) #codechef #codeforces #leetcode #DSA

118

3 Comments

🎓🌟 One Piece of Advice for College Students! 🌟🎓 I typically don't write these kinds of posts, but after receiving numerous queries on how to crack top product-based companies during the first and second years of college, I'm tempted to share this advice. College is a time to explore and learn new things. From failing in GSoC to diving into a sales and marketing internship, I've done it all. I was surrounded by toppers; one friend was the institute's gold medalist, and another friend scored twice as much as me while studying just as hard. I always admired their dedication, but I found my balance and followed my curiosity. 🚀 Just one piece of advice to all the fresh entrants: you have four years before you dive into the rat race. So, sit back, enjoy, and explore the areas that spark your interest. You can crack product-based companies while still enjoying yourself. PS: You all know the gold medalist friend I am talking about. #college #life #learning #content #engineering #enjoy #explore

177

3 Comments

✨ 𝗟𝗲𝗲𝘁𝗖𝗼𝗱𝗲 𝗟𝗲𝗮𝗿𝗻𝗶𝗻𝗴: 𝗙𝗶𝗻𝗱𝗶𝗻𝗴 𝘁𝗵𝗲 𝗞𝘁𝗵 𝗟𝗮𝗿𝗴𝗲𝘀𝘁 𝗘𝗹𝗲𝗺𝗲𝗻𝘁 𝗘𝗳𝗳𝗶𝗰𝗶𝗲𝗻𝘁𝗹𝘆 ✨ Today, I tackled a LeetCode problem that initially seemed simple: finding the kth largest element in an array. Initially, the straightforward solution was to sort the array and pick the kth largest from the end. But sorting takes O(nlogn) time—what if we could do better? After some thought, I considered heaps! With a heap, we can reduce the time complexity to O(nlogk) by maintaining only the k largest elements. But that’s not where the magic ends... 𝗘𝗻𝘁𝗲𝗿 𝗖𝗼𝘂𝗻𝘁𝗶𝗻𝗴 𝗦𝗼𝗿𝘁! 🚀 I implemented counting sort, which gave me an elegant O(n) solution. Here's how it works: 1. 𝗙𝗶𝗻𝗱 𝘁𝗵𝗲 𝗠𝗶𝗻𝗶𝗺𝘂𝗺 𝗮𝗻𝗱 𝗠𝗮𝘅𝗶𝗺𝘂𝗺 𝗩𝗮𝗹𝘂𝗲𝘀: First, I identified the smallest and largest elements in the array to determine the range. 2. 𝗖𝗿𝗲𝗮𝘁𝗲 𝗮 𝗙𝗿𝗲𝗾𝘂𝗲𝗻𝗰𝘆 𝗔𝗿𝗿𝗮𝘆: When creating the frequency array, I considered an important detail: the array can have negative values. So, instead of just creating an array based on the maximum value, I also had to account for the minimum value. This means the array size is max - min + 1. For example, if the array is [-3, -1, 2, 4, -2], the minimum value is -3 and the maximum value is 4. To place the numbers in their correct positions in the frequency array, I use the formula num - minv. This means: • -3 becomes 0 (because -3 - (-3) = 0) • -1 becomes 2 (because -1 - (-3) = 2) • 2 becomes 5 (because 2 - (-3) = 5) • 4 becomes 7, and so on. This way, all negative numbers get valid positions in the array. 3. 𝗧𝗿𝗮𝘃𝗲𝗿𝘀𝗲 𝘁𝗵𝗲 𝗙𝗿𝗲𝗾𝘂𝗲𝗻𝗰𝘆 𝗔𝗿𝗿𝗮𝘆: Starting from the largest value, I decrement k by the count at each index. When k reaches zero or less, I've found the kth largest element. 𝗖𝗼𝗻𝘀𝗶𝗱𝗲𝗿𝗮𝘁𝗶𝗼𝗻𝘀 𝗮𝗻𝗱 𝗗𝗶𝘀𝗮𝗱𝘃𝗮𝗻𝘁𝗮𝗴𝗲𝘀: While counting sort is a powerful technique, it cannot be used everywhere. Here are some disadvantages to keep in mind: • Space Complexity: The frequency array size is max - min + 1, which can lead to high memory usage if the range of numbers is large. • Inefficiency with Sparse Data: In cases where numbers are limited but widely spread apart, the frequency array can waste space. • Limited Applicability: It works primarily for integers within a defined range and may not suit other data types. • Potential for Integer Overflow: When calculating max and min in large arrays, there's a risk of overflow in some languages (though not in Java). • Less Generalized: Unlike other algorithms like Quickselect, counting sort is specifically for integers, limiting its versatility. This approach avoids sorting, making the solution much more efficient. I am excited to keep learning and applying these techniques as I go! 🙌 Here is the link to the problem - https://lnkd.in/g29Dcttm #LeetCode #CodingTips #Algorithms #ProblemSolving #LearningJourney

32

1 Comment

🚀 Young Professionals, Don’t Treat Your First Job Like a JEE Exam! 🚀 I’ve noticed many young people in India aiming only for FANG or other big tech companies as their first job, treating it like a JEE exam. While aiming high is great, it doesn’t have to be the only path. Your early career years (3-6 years) are the perfect time to dive into startups or smaller companies where you can put in the hard work, explore different roles, and truly make an impact. Working in startups can be incredibly rewarding—both in terms of experience and compensation. Many well-funded startups pay competitively, often offering salary packages that rival big tech companies. Plus, they might offer stock options, giving you a chance to own a piece of the company and benefit from its growth. While very early-stage startups might have limited resources, once a startup has some funding, it can pay really well. Trust me, the growth potential is immense—you become far more productive, and develop expertise across multiple domains. When you're young, you have the energy and drive to hustle and create real impact. Startups give you the chance to: 1. Work on What You Love: In a startup, you often have the freedom to work on exciting projects and learn the latest technologies. You get to take ownership, solve real problems, and directly see the impact of your work. 2. Grow Rapidly: Startups are dynamic environments where you can grow quickly if you’re willing to take on challenges. The skills, speed, and experience you gain will be invaluable and help you stand out wherever you go next. 3. Build Your Own Projects: The hands-on experience and exposure you get in startups will make you so comfortable with technology that you can even build your own side projects or SaaS products. You’ll gain the confidence and technical expertise to turn your ideas into reality, something that’s harder to achieve in more specialized roles at big companies. 4. Leave Big Tech for Later: After building a strong foundation and gaining diverse experience in a startup, you can always transition to a big tech company later if you want a more stable, structured role. With a solid skill set, you’ll be in a great position to enjoy a balanced, comfortable life. Unfortunately, there’s a trend where many young aspirants are being misled by platforms selling dreams that promise jobs at big tech companies, much like the JEE coaching industry. Remember, it doesn’t have to be this way! Instead of getting caught in this rat race, focus on gaining strong skillset. So, to all the young talents out there: Don’t just chase big names, big names should chase you. 🚀 Your career is a journey—don’t rush. If any of you—whether freshers or college students—have any doubts or need guidance, feel free to reach out! I’d be happy to answer your questions or provide some direction. 😊 #CareerGrowth #Startups #Opportunities #TechCareers #YoungProfessionals #Internships #GrowthMindset #RemoteWork #LearningExperience

7

#day23of100DaysCodingChallenge #leetcode 242. Valid Anagram Easy Topics Companies Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: false Constraints: 1 <= s.length, t.length <= 5 * 104 s and t consist of lowercase English letters.

20

As placement season begins at IIT, I’ve been flooded with messages from juniors asking for my experience and insights. Today, I want to share my experience—not as a success story, but as a tale of my initial failures and the lessons I learned. 🗓️December 1st—Day 1. Our lecture halls buzzed with anticipation, filled with students in their crisp black and white suits, eyes gleaming with hope but the door to lecture hall open for only those who were shortlisted on day1. Fortunately, I had made it to the shortlist of my dream companies: Google , Microsoft , and The D. E. Shaw Group As day 1 approached the excitement of getting shortlisted turned into anxiety, panic and fear of rejection. The night before, I lay in bed, mentally revising Kruskal’s algorithm instead of sleeping, and, unsurprisingly, I managed only 3 hours of sleep. When the interviews began, I felt the weight of my nerves. Waking up at 5 am and going to the interview at 6 am was definately the hardest thing I have done in my life. In some cases, I simply got unlucky; in others, self-doubt crept in, leading to rejections from all three prestigious firms after 6-7 rounds of strenuous interviews. I was crushed. Thoughts raced through my mind: “What if I had answered that question differently?” “Should have studied instead of attending Rendezvous”. Then unexpectedly NVIDIA had opened its waitlist and I was there, and I did not even felt a glimmer of hope. I was trapped in a loop of regret, even while the interview was going on, I was constantly relooping the past interview questions, delivering my poorest performance ever. I just went to the hostel with heavy heart and teary eyes, talked to my closest friends, realized how much my underconfidence had held me back. I decided to stop dwelling on what went wrong. I took a deep breath, got a solid night’s sleep, and woke up the next morning with a clearer mindset. 🗓️No longer panicking, I told myself: “Even if today doesn’t work out, I’ll find something else—at least off-campus.” With zero expectations, I walked into my next interviews, feeling surprisingly liberated. And then, against all odds, I was selected by both companies I interviewed with that day! What I want to convey is simple: When you let go of past regrets and future anxieties, success often follows. To everyone gearing up for placements this season, remember that setbacks are part of the journey. Embrace them, learn, and rise again. You’ve got this! Feel free to reach out if you want to discuss more about this experience! #IIT #Placements #CareerJourney #Resilience #failure #success

446

7 Comments

🌟 My Amazon SDE Internship Assessment Experience 🌟 I recently participated in Amazon's 6-month SDE Internship assessment, and I'd love to share my experience. The assessment involved two DSA problems to be solved within 70 minutes. While I haven't received an update from Amazon yet, here's how the assessment went: 🔍 Assessment Breakdown: 1️⃣ Problem 1: Execution Order with Dependencies   • Topic: This problem involved analyzing process execution orders and identifying mismatches with the expected order using a Fenwick Tree (Binary Indexed Tree) for efficient tracking and updates.   • Complexity: Medium   • My Solution: I was able to solve this problem by breaking it down into manageable steps and using the Fenwick Tree to handle O(log N) updates and queries. I passed all test cases successfully. 2️⃣ Problem 2: Outlier Detection in Arrays   • Topic: This problem required detecting an outlier within an array based on sums and subset validation.   • Complexity: Medium   • My Solution: I built the core logic and solved most of the problem but struggled with handling some edge cases, which prevented me from passing all test cases. It was a challenging and rewarding problem. 🕒 Time Management & Challenges: • With only 70 minutes to solve both problems, balancing speed and accuracy was key. While I solved the first problem efficiently, the second problem’s edge cases took more time than expected, leaving me with limited time for testing. 💡 Key Learnings: 1️⃣ Problem Decomposition: Breaking down complex problems into smaller, solvable parts helped me tackle the first problem effectively. 2️⃣ Edge Case Handling: Paying attention to edge cases early on would have helped me pass the second problem entirely. 3️⃣ Time Management: Managing my time efficiently was crucial—spending too much time on one problem impacted my ability to test the other. ✨ Final Thoughts: This experience has been incredibly insightful, allowing me to improve my problem-solving skills. While I didn’t pass all test cases for the second problem, I’m proud of the effort I put in. I’m still awaiting an update from Amazon, but regardless of the outcome, this assessment has been a valuable learning opportunity. Thank you to Amazon for providing me with this incredible chance to challenge myself and grow. ✨ For anyone preparing for similar assessments, I recommend: • Master fundamentals and data structures • Focusing on edge cases to ensure robustness. • Practicing time management for maximum efficiency. 💪 Looking Ahead: This experience has motivated me to continue learning and improving. If anyone has faced similar challenges or has tips for coding assessments, I’d love to connect and exchange ideas! #Amazon #SDEInternship #CodingChallenges #DSA #SoftwareDevelopment #FenwickTree #ProblemSolving #LearningJourney

30

Given an array arr integers. Assume sz to be the initial size of the array. Do the following operations exactly sz/2 times. In every kth (1<= k <= sz/2) operation: Right-rotate the array clockwise by 1. Delete the (n– k + 1)th element from begin. Now, Return the first element of the array. Note: Here n keeps on decreasing with every operation. Examples: Input: arr = [1, 2, 3, 4, 5, 6] Output: 3 Explanation: Rotate the array clockwise i.e. after rotation the array arr = [6, 1, 2, 3, 4, 5] and delete the last element that is 5 that will be arr = [6, 1, 2, 3, 4]. Again rotate the array for the second time and deletes the second last element that is 2 that will be A = [4, 6, 1, 3], doing similar operation when we perform 4th operation, 4th last element does not exist. Then we deletes 1st element ie 1 that will be arr = [3, 6]. So, continuing this procedure the last element in arr is 2. So, the output will be 3. Input: arr = [1, 2, 3, 4] Output: 2 Explanation: Rotate the vector clockwise i.e. after rotation the vector arr = [4, 1, 2, 3] and delete the last element that is 3 that will be arr = [4, 1, 2]. After doing all the operations, the output will be 2. Expected Time Complexity: O(n2) Expected Auxiliary Space: O(1) Constraints: 1 <= arr.size() <= 103 1 <= arr[i] <= 106 #geekstreak2024 #deutschebank #gfg #potd #dsa #problemsolving GeeksforGeeks Deutsche Bank

12

What's it really like being an SDE at Uber 👀 Starting from receiving a BRD to analyzing technical barriers and solving problems with cross-team dependencies, I've been constantly learning. Right now, we're improving our system to make it more flexible. This will give riders a better and faster experience when matching with third-party drivers. Whether at Amazon or Uber, it's amazing to see how my work impacts millions of people! If you want to join Uber or another top tech company but struggle with interviews, connect with people already there. At Preplaced, you can find mentors from these companies. They'll guide you through everything, from choosing the right resume to getting the job. Start by booking a free session with a mentor: https://lnkd.in/gd6aqqHj Ask any questions you have, then prepare with mentors who offer plans for improvement, practice interviews, and more ✨. #industry #swe #uber #softwareengineer #sde #promotion #career #placement #careergrowth #company

119

5 Comments

Leetcode problem of the day : Special Array II The problem that we are tackling for today is that to work on a problem where the goal was to determine whether a given subarray is "special" or not. A subarray is considered special if no two consecutive elements have the same parity (i.e., both even or both odd). Approach used: 1. Prefix Array Construction: - Calculate a prefix sum array (prefix) to track consecutive "special" pairs (either both even or both odd). - This allows us to efficiently determine the number of special pairs in any range [left, right]. 2. Query Evaluation: - For each query, compute the difference using the prefix array: specialCount = prefix[right] - (left > 0 ? prefix[left - 1] : 0) - A result of 0 means the subarray meets the condition. Time Complexity : O(N+Q) Space Complexity : O(1) Link : https://lnkd.in/gwfJTJ6H Feel free to connect for more insights on algorithm optimization and problem-solving strategies! 😉

24

Working professionals while transitioning to SDE 1 or SDE 2, know the importance of System Design.💡 And my 2 years at Samsung have made me realize just that. Now, what to expect in the System Design Round? The round begins with the interviewer giving you an abstract problem, for which they expect you to ask clarifying questions. Now, to get the optimal solution: 🔹 Always make sure to be on the same page as the interviewer. 🔹Throughout the process explain your choices and discuss alternatives and their pros and cons. 🔹Discuss and make Trade-offs in your design. Lastly, make sure to have a strong grasp of Data Management. A bonus tip - Regularly practice common questions asked, if you want to understand different aspects of System Design. Follow this and make system design rounds easy to crack. Now, if doing all these things feels like too much for you take the help of industry veterans, at Bosscoder Academy. Check them here - https://bit.ly/4fKfB0K

1,256

54 Comments

An interviewer from a service-based company once told me, "You’re not an ideal fit for our company." And he was right. Landing a job at Amazon as an SDE is a dream come true for many of us, isn’t it? But most of us struggle and among them, only 2 % make it to the interview. But switching from a service based company to a product one comes with countless rejections. And it can shake your confidence. I found myself in a similar situation, being told I wasn’t a good fit for a company. That day, I made a resolution. I worked day and night, trying out multiple resources. But it took me a long time to find the right content on every topic. The content on the internet is oversaturated. The key is to follow a strategy that suits you with a structured curriculum. Then I followed countless YouTube videos for the right strategy for optimizing my LinkedIn. However, it wasted a significant amount of time for me to land my dream job. While I won’t be sharing my strategy here, I would suggest checking out Bosscoder Academy for its valuable content if you dont want to waste your time finding the right content. Check here: https://lnkd.in/gxM_7Cie They can help you with → ✅ Structured programs for DSA, System Design, and Full Stack Development. ✅ Personal mentorship from industry veterans. ✅ Live classes and 24/7 doubt support. ✅ Real-life, relevant projects with Placement Assistance.

519

37 Comments

SDE & SDE-2 at Amazon was no easy feat😕 The biggest challenge? The intense preparation. Everyone I spoke to, from seasoned engineers to interns, all agreed - Amazon and other tech giant's interview bar is high. It's enough to make anyone question their abilities. With this, my initial excitement quickly turned into self-doubt. But through months of preparations with consistency (because without it you can't prepare) I cracked Amazon. The journey was not simple and easy with a full-time job. However, I scheduled a few hours after work for preparation—working on coding challenges and whiteboard sessions daily. I focused on areas that aligned with my target role, like development and system design. Connecting with professionals working for the same role, gave me invaluable insights into the interview process and company culture. At last Every. Single. Second. Was. Worth. It. I know many working professionals face the challenge of finding time to prepare for interviews. Platforms like Tutort Academy specialize in upskilling and providing hands-on experience, making it easier for working professionals like you to prepare for upcoming interviews. Explore more-https://bit.ly/3V9JfDZ Up till now, they have helped 1250+ professionals successfully land a job at their dream companies like Google, Microsoft, Walmart, Amazon, JP Morgan, and more by providing, the right career guidance that includes- --100% Live Interactive sessions --1:1 Personalized Mentorship from MAANG mentors --Mock Interviews, Resume sessions, LinkedIn profile Optimization, and more. So, go out there, conquer those interviews, and achieve your goals! #sdeinterview #techcareer #tutortacademy #amazon

858

13 Comments

Associate role. You should be prepared for any questions/situation. Interview experience for Goldman Sachs. In total there were 6 rounds. Round 1: Hackerrank Test - 2 questions. time limit - 120 mins. Unable to recall exact questions, but it had something to reach from cordinate A to B. similar to https://lnkd.in/gquUwdyv LIS Round 2: Coderpad round Two easy coding questions were asked. Round 3: DSA https://lnkd.in/gN7CpzQM - First I asked some generic corner scenarios. Gave an O(nm) solution using bfs. https://lnkd.in/gBn7FqSG - First I gave O(n*k) solution which is based on finding the 2nd or 3rd largest element, then I gave an O(nlogn) solution, and then came up with the O(nlogk) solution. Round 4 : DSA+DB https://lnkd.in/g7Z-iEjv - This question was actually tricky. First I came up with a greedy approach, which I proved will not work. Then using recursion I found overlapping subproblems, and gave him a dp approach. He said to optimize it. I then implemented a O(n) bfs solution addressing all the bounds. https://lnkd.in/gstt3MDm - I first gave O(n^2) solution. Later, I came up with a O(n) solution using bit and trie. one DB question. Round 5: System Design In depth resume grill. design an API. I walked them through all the concepts which are used. Follow up question, How authorisation and authentication works. I walked them through core concepts and flow. Round 6: Hiring Manager round (30 mins) In depth resume grill. some basics question like why gs and all. some basic behavioral questions. verdict - I eventually called the hr after 2 days regarding feedback. She said I'm selected and it's a long process in gs so a confirmation will come in a week or so. I hope this helps all the champs who are working hard!!

6

Day 20 of 100 Days of Code : Problem 1 : https://lnkd.in/gW7xkJEF Approach : 1.Edge Case: If k is 0, return 0 immediately, as there are no subarrays with product less than 0. 2.Initialize Variables: Initialize count to 0 to store the total number of subarrays, and product to 1 to store the product of the current subarray. 3.Iterate Through Array: Iterate through the array using two pointers, i and j. j points to the current element, and i points to the starting element of the subarray. 4.Multiply Product: Multiply product by the current element nums[j]. 5.While Loop: If product becomes greater than or equal to k, divide product by the element at index i and increment i. This effectively slides the window of the subarray to the right. 6.Add to Count: Add the number of subarrays ending at index j to count. This is calculated as j - i + 1, which represents the number of subarrays that can be formed with the current i and j indices. 7.Return Count: Finally, return the total count of subarrays with product less than k. Code : class Solution {     public int numSubarrayProductLessThanK(int[] nums, int k) {         //EDge Test Case where k is 0 the return 0         if(k == 0)             return 0;         int count = 0;         int product = 1;         for(int i = 0,j=0;j<nums.length;j++) {             product *= nums[j];             while(i<=j && product >= k) {                 product /= nums[i++];             }             count += (j-i+1);         }         return count;     } } Problem 2 : Find the Number of Pairs with Sum Less Than or Equal to K Approach : Explanation: 1.Initialize Variables: Initialize count to 0 to store the total number of pairs. 2.Nested Loops: Use two nested loops to iterate through the array. The outer loop iterates through each element, and the inner loop iterates through the remaining elements. 3.Check Sum: Check if the sum of the current pair of elements is less than or equal to k. If true, increment count. 4.Return Count: Finally, return the total count of pairs with sum less than or equal to k. Example: In the main method, we provide an example array, length, and value of k. We call the sum Pairs function and print the result. Code : public class sumPairs {   public static int sumPairs(int arr[], int n, int k) {     int count = 0; // Initialize count to 0     for (int i = 0; i < n; i++) { // Iterate through the array       for (int j = i + 1; j < n; j++) { // Iterate through the remaining elements         if (arr[i] + arr[j] <= k) { // Check if sum is less than or equal to k           count++; // Increment count if true         }       }     }     return count; // Return the total count   }   public static void main(String[] args) {     int arr[] = {1, 2, 3, 4, 5, 6}; // Example array     int n = arr.length; // Length of the array     int k = 5; // Example value of k     int ans = sumPairs(arr, n, k); // Call the function     System.out.println(ans); // Print the result   } }

3

I stopped learning MongoDB . It's not working and won't. I have been learning MERN stack from Shradha Khapra mam and about to complete the Airbnb clone, suddenly to my surprise MongoDB stopped supporting on my windows. and guess What ? it became a reason to quit the journey. for a change I did not accept it and got into learning React that was doing good on my Laptop. Why MongoDB stopped? The reason is my laptop. I have been using a laptop that is given by government of Tamilnadu Nadu seven years back. But yes the passion for tech I have never gets down for such reasons. ps:Which laptop do you own? #MongoDb #tech #React #learning #srinivastechjourney

14

9 Comments

My first rejection - Google 💔 A lot happened in past two months , people often see the good side on LinkedIn but you never know what is someone going through in real life... I was fortunate enough to get an opportunity to interview for SWE Intern 2025 role at Google ... I was able to solve all problems in both technical rounds but ya some unfortunate events happened and some things didn't went well as I wanted... I was totally prepared. Gave mock interviews, left no topic untouched but yep life has its own plans .. I don't want to demotivate anyone reading this post... Google interviews are not hard .If you've been practicing DSA for so long there is high chance you'll be able to solve the problems during the interview... I'll share my learnings and detailed interview experience in coming posts .. I don't have any regrets as such coz I gave my best and I believe something good is bound to happen in future for sure... Special thanks to Naveen Rawat bhaiya for referring me and guiding me throughout the process... Thanks to Yash Mawalkar, Sushant Bansode , Aniket Hend bhaiya for helping me with process and mock interviews... ps : This experience will indeed help me for further FAANGM interviews... #google #googleinterview #rejection #googleintern #intern #summerintern #interviewrejection #codingcommunity #leetcode #dsa #datastructures #algorithms #competitivecoding #codeforces #codechef

1,990

61 Comments