Raghu Ram Karra

Have you solved 500+ LeetCode Questions, but are still, struggling with getting shortlisted in your Dream Companies and Packages? I am Abhishek, SDE 2 at Ciena Corporation, ex Paytm, and with Newton School, I am looking to coach 5 SDEs struggling to upgrade their current SDE jobs! This upgrade journey of 2 months will include: 1. Assured Interview Round 1s in your dream companies/packages 2. Company-Specific Preparations Before Each Round 3. Personalised Guide for Resume Building 4. Mock Interviews and Feedback 5. System Design Interview Preparation 6. DSA Practice Questions Pool If you think you can be among these 5, fill out this GForm https://lnkd.in/gvqtYtmv. See you on the other side

58

12 Comments

Amazon SDE-1 Interview Experience and Preparation Strategy One of my juniors recently secured an Amazon SDE-1 role in Hyderabad, India. I’m proud to share his experience to help others aiming for similar roles. Background - Work Experience: 6 months. - Total Rounds: 5 (1 Online Coding + 4 Face-to-Face Interviews). Interview Details 1st Round (Online Coding on HackerEarth) The online round had two questions: 1. A problem based on DFS/BFS – solved successfully. 2. A string-based question – attempted but couldn’t solve completely. 2nd Round (Face-to-Face) The problem: - Given an array representing the level order traversal of a full binary tree, construct the tree. - The traversal rules: - Odd levels: Visit left child first, then right. - Even levels: Visit right child first, then left. The interviewer focused on logic and coding clarity. 3rd Round (Face-to-Face) The session began with a 10-minute discussion about his current work experience. Then came the coding challenge: 1. Top K Frequent Elements https://lnkd.in/gfCa3S54 - Discussed handling large datasets (e.g., when data doesn’t fit in memory). - Proposed breaking the file into smaller parts using multi-hashmaps + heaps. - Wrote pseudo-code and implemented the heapify function. 4th Round (Face-to-Face) The questions: 1. Longest Consecutive Sequence https://lnkd.in/gMWgaJhS 2. Kth Largest Element in a BST https://lnkd.in/gAhYe8Pu The interviewer required full code for both questions. 5th Round (Face-to-Face) This round included behavioral and technical questions: 1. Behavioral: - “Tell me about a time when your manager told you not to do something.” - Another behavioral question (couldn’t recall specifics). 2. Technical: - A problem involving plants and binary trees: - Plants drop seeds (left and right), forming a full binary tree. - Nodes could be plants or empty spaces (NULL). - Calculate the length of the pipe needed to water all plants at a level. The discussion emphasized efficient tree storage for large levels (e.g., n = 1000). The proposed solution involved a serialized tree format for compact storage. ‼️ Follow here for FREE preparation resources - https://lnkd.in/gDe22_Tj Preparation Strategy 1. Start Topic-wise: - Use Leetcode to filter and practice problems by topic. - Solve a mix of easy, medium, and hard problems. 2. Focus on Top Interview Questions: - Solve the Top Interview Questions List on Leetcode - Sort by difficulty and practice consistently. 3. Practice Popular Problems: - Work through the Top 100 Liked Questions 4. Strengthen Weak Areas: - Identify and practice challenging topics (e.g., Dynamic Programming, Graphs) alongside the above steps. 5. Understand, Don’t Memorize: - Focus on understanding the logic behind each solution instead of rote learning. Follow Akanksha Buchke

520

49 Comments

Layoffs in past have proved that An average engineer in a high priority team is more valuable than a top engineer in a low priority team. Most of the layoffs are not relevant to performance but have a direct correlation with the projects team is working on. It is equally important to pick the right team along with the company. #softwareengineering #layoffs #programming

1,069

24 Comments

Pov: Android Developer Working for 2hrs 1-hr Gradle Build time... (especially in release build+R8) 30 mins - Thinking & Fixing bugs 10mins - Creating Boilerplate classes (must in clean architecture eg: a use case for just calling repository) 10mins - Taking break 10mins - Actually Coding Ps: Gradle build times are very long when particularly working with compose and release build with minifyenabled (R8) #buildtimes #android #kotlin #android_studio

222

24 Comments

India Rank 1, Global Rank 90 in #Atcoder #Beginner #352 Instead of stream, I will write my solution ideas here. I ended up solving ABCDE and G. I could not debuging WA on 2 tests for F. Here is what I did for all the problems. A: If X < Y, then we will take inbound train, start at station X and end at station Y, so station Z must be between X and Y. X<=Z<=Y must hold. If X >= Y, then we will take outbound train, start at station Y and end at station X, so station Z must be between X and Y. Y<=Z<=X must hold. B: We are given that S is subsequence of T, we should print all the index using which we can form S. Also, notice that indirectly guarantees that there will be a unique set of indexes. We can use greedy to find set of thoses indexses. This is exactly same problem B of previous codeforces round (namely round 943) C: Head of Pn is at height sum(Ai) + B_{pn} - A_{pn} So, we will have to find maximum value of B_{pn}-A_{pn), and print sum(Ai)+mx D: We can use sliding window technique here. For each i, we will maintain set of index where [i,i+k-1] exists. Then check difference of minimum and maximum value in the set. When we want to find new set for j=i+1, we erase position of p[i] and add p[j+k] E: Eaach clique gives us K*(K-1)/2 edges, and most of them are redundant, so we should ignore them. For each clique we will add K-1 edges in our graph, Ai,1 -> Ai,j with weight Ci for each 2<=j<=K_i. If graph is disconnected we should print -1, otherwise we can using any MST finding algorithm to MST of this graph. G - Lets first try a bruteforce idea. Let p_j be the probability that we have select j socks and all of them are unqiue? Then answer is 1+sum(p_j) 1<=j<=n Let tot = sim(Ai), ie total no of socks. To find p_j, let the socks we have after j selects is set c1,c2,...,cj If ck is selected at kth sock 1<=k<=j, then its probability is A_{ck}/(tot-k+1), denominator is no of socks remaining after selecting first k-1 socks. Now notice that value of numerator and denominator is same for this set irrespective of the order of selection. Numerator is prod(A_{ck)} and denominator is prod(tot-k+1) 1<k<=j So we can fix the set, find prod of all values of A_i in selected set, and then arrange them using j! ways. Let F(x) = prod(1+Ai*x) = fj*x^j Then this fj is sum of all possible value of numerators. p_j = fj*j!/(required denominator) We can use divide and conquer with NTT to find F. Its similar to build function for segment tree. Following is the pseudo code build(l,r){ if(l==r) return {1+al} mid=(l+r)/2 return convolution(build(l,mid),build(mid+1,r)) } F - I passed 60/62 tests for this problem. I could not debug corner testcase. I will write my idea in comments because I have exhaused char limit for a linkedin post.

605

23 Comments

Uber is hiring for Software Engineer - II If you're interested, please reach out via LinkedIn message with the following details for a referral: 📩 Message Title: Name | Years of Experience | Current Organisation | FE/BE Example: Arpit Singh | 3.5 | Uber | BE 📝 Include in the message description: 1️⃣ Updated Resume 2️⃣ Email Address 3️⃣ Contact Number 4️⃣ A short write-up (in the third person) explaining why you’re a great fit. 5️⃣ Relevant Job Links (Max 2). 💼 Please follow the guidelines mentioned above otherwise it gets very difficult to filter out. 💤 Drop a message and take a small nap like Jacky Shroff in Uber shuttle —in the meantime, I’ll refer soon!

188

8 Comments

🎯 1 Cr+ LPA vs. Company Culture: What Should Drive Your Decision?? Getting multiple offers as a SDE is a great feeling—one that many dream of. But with that comes a tough decision: Which offer should you accept? It might be tempting to jump at the highest salary, especially if it's a 1 Cr+ LPA offer. But before you make a decision based solely on the paycheck, consider these crucial factors: 1. 🛠️ Growth Opportunities: Does the company offer a clear path for career advancement? Look for roles that provide mentorship, learning, and challenges that will push you to grow both technically and professionally. 2. 🤝 Company Culture: A toxic work environment can make even the highest-paying job unbearable. Consider the company’s values, work-life balance, and how they treat their employees. A supportive culture that aligns with your personal values is invaluable. 3. 💼 Work-Life Balance: All the money in the world won’t matter if you’re burning out. Companies that respect your time and provide flexibility can make a huge difference in your quality of life. 4. 🔍 Team & Leadership: The people you work with can make or break your experience. Research the team’s dynamics, leadership style, and how they approach problem-solving. Surrounding yourself with smart, supportive colleagues can accelerate your growth. 5. 🚀 Technology & Projects: Are you excited about the tech stack and projects you’ll be working on? The opportunity to work on innovative projects with cutting-edge technologies can be more fulfilling than a hefty paycheck. 6. 🌍 Company Vision & Impact: Does the company’s mission resonate with you? Working for a company whose vision you believe in can lead to more meaningful and satisfying work. 7. 📊 Stability & Growth: While startups can offer lucrative packages, they also come with risks. Consider the company's financial health and long-term stability to ensure your career is on a secure path. 8. 👥 Connections & Network: While it's great to work with friends, ensure that you’re joining the company for the right reasons. Your professional network and the new connections you’ll make are equally important. 9. 💡 The Bottom Line: Choose the company that aligns with your long-term goals, offers growth opportunities, and makes you feel excited about your future there. A well-rounded decision will serve you better than just chasing the highest paycheck. What do you consider when choosing between multiple offers? Share your thoughts! 💬

15

18 Comments

Hi Amazon team, U guys sucks... a simple subscription model releases with P0 and P1 issues... u guys coded enough so that anyone get easily pissed off from renewing prime video account.. Is subscription team built by Interns ? try out: prerequisite : Accounts prime membership has expired ( purchased last year) steps to reproduce: 1. sleect a movie which are offered through Prime ( over Firestick) 2. click Watch now.. and a a nice QR code for purchasing membership will appear but thats a "Catch me if you can " game .. where u will see the different tier of memberships.. and thats all My 2 cents ========= 1. When I m coming to purchase membership from Prime Video flow.. why u r showing me ur shitty Prime cloth wala subscription? What was the idea behind this brilliant design , sorry I didnt get that.. I m a general user re... seating with my family to spend some light moment and u have perfectly designed and coded to ruinthat out. 2. If the design was as per Leadership / Buisness ask to keep the MVP rooled out at earliest then take my Salute to great those leaders.. may God bless you , and sometime pls think beyond your business tagets and Test it well atleast P0s.

1

After 4 years in industry and multiple interviews, things that helped me crack Adobe Goldman Sachs Meesho and many others (ascending order of priority): 1) Lot of DS grinding, and yes even memorising solns to some of the problems. 2) Confidence , that you can gain only after multiple rejections and attemps. 3) Timings, when I was in job shifting mode, market was in high demand. Yes, the most important factor was easy interview opportunities , no shame in admitting it. Had I started my career today, I would be doing a lot of tussle to even get an interview call. If you are someone who is starting/ just about to enter the industry, its totally okhy if you are getting less number of interview calls, just be calm and know no industry is forver down, apna time bhi aayega! Keep the grind on. #freshers #software

240

4 Comments

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

Flipkart is hiring (2024 grads) 𝐑𝐨𝐥𝐞𝐬: SDE 1, UI-1 and Data Engineer 1 𝐄𝐥𝐢𝐠𝐢𝐛𝐢𝐥𝐢𝐭𝐲: 2024 engg graduates (CSE, IT, ECE & EE streams only) 𝐂𝐓𝐂: 32.57 LPA (18 lakhs base, 10% variable, ESOPs worth 5 Lakh, Joining Bonus- 3 lakh and Retention bonus: 3 lakh + retirals & other benefits) 𝐀𝐩𝐩𝐥𝐲: https://lnkd.in/ddTgFPam 𝗪𝗵𝗮𝘁𝘀𝗔𝗽𝗽, 𝟭:𝟭 𝘂𝗽𝗱𝗮𝘁𝗲: 1) You will not missed out any job & internship updates. 2) You will get update only for your batch which are relevant to you. 3) it's 1:1 so we are also considering your privacy. 𝗛𝗼𝘄 𝘁𝗼 𝗷𝗼𝗶𝗻: (𝟮 𝗺𝗮𝗻𝗱𝗮𝘁𝗼𝗿𝘆 𝘀𝘁𝗲𝗽𝘀) 1) React and comment on the post 2) Fill this form: https://Inkd.in/dQMqkbtz Done, now you will receive all the updates on your WhatsApp!! Also connect with me if you wish Aman Chowdhury 🇮🇳

143

8 Comments

🚨 Not all SDE levels are the same across companies! 🚨 An SDE-2 at one company might not have the same responsibilities as an SDE-2 at another. 🧐 💡 Job titles can be misleading. For example, an SDE-2 at Amazon 🏢 often has more experience than an SWE-2 (SDE-2) at Google 🌐. 👉 So, don’t get too caught up in the job titles. Look beyond the label! #SoftwareEngineering #TechCareers #JobTitles #AmazonSDE #GoogleSWE #SDE2 #SoftwareDeveloper #CareerGrowth #TechIndustry #ExperienceMatters #JobMarket #TechInsights

13

Few people join as a SDE-1 and within a span of ~7 years, they promote to a very senior level(L6 equivalent to Staff Role) in a company whereas same achievement is hard to realize when you're switching companies. So, what makes these employees so special? A few points: - They joined these companies as SDE-1 - Implemented projects end to end - very pro-active in all things: reviews/discussions/coding. - highly biased for taking actions (critical skillset for growth) - were lucky enough to some extent in getting good projects - were hard working enough to find optimizations & propose as new projects in the product - filled with lots of motivation & drive: showing true ownership at the deepest level one could possibly imagine Staying in a company helps you build context over the years, which the lateral hires within few months might or might not be able to grasp. This post is just a reminder: Switching would probably make money but staying in a company with a little bit of luck can do wonders(both money & role). PS: I did 2 switches in my career and I can relate with this post.

551

12 Comments

I have received 1000+ requests for a referral combining #topmate priority DMs and #LinkedIn DMs. Here are some common mistakes which people did 🤐 reason you will never get a response. 1 . Most of the folks have sent me just “𝐇𝐢” or “𝐇𝐢, 𝐇𝐨𝐰 𝐚𝐫𝐞 𝐲𝐨𝐮” or "Please refer me", I will not be able to respond to every message. 2. Did not mention your, 𝐝𝐞𝐬𝐢𝐠𝐧𝐚𝐭𝐢𝐨𝐧, 𝐜𝐨𝐦𝐩𝐚𝐧𝐲 𝐧𝐚𝐦𝐞 and 𝐲𝐞𝐚𝐫𝐬 𝐨𝐟 𝐞𝐱𝐩𝐞𝐫𝐢𝐞𝐧𝐜𝐞, 𝐭𝐞𝐜𝐡 𝐬𝐭𝐚𝐜𝐤 and 𝐬𝐤𝐢𝐥𝐥𝐬, 𝐜𝐨𝐥𝐥𝐞𝐠𝐞, 𝐬𝐞𝐦𝐞𝐬𝐭𝐞𝐫 and 𝐛𝐫𝐚𝐧𝐜𝐡. 4. Did not include a 𝐣𝐨𝐛 𝐢𝐝 or 𝐣𝐨𝐛 𝐥𝐢𝐧𝐤. please feel free to go to the career page and search for an appropriate job for you, if I have to tell you, your suitable job role then it means you have not done enough research. 5. some of you asked me for referrals without 𝐫𝐞𝐬𝐮𝐦𝐞. 6. in some cases email or phone was not present. Please share this with your connections, so that they don't repeat these mistakes 💻 . FYI -> I will be referring most of you by eod.. #servicenow #hiring #softwareengineer #entrylevel #freshers #opening #referral #advice #connections #opportunity #job #hiring #openings

19

1 Comment

Participated in Leetcode weekly contest 407. All tricky questions this time. Found 2nd question particularly interesting to observe!! Ideas/Approaches: 1. Number of Bit Changes to Make Two Integers Equal - if AND of two numbers isn't equal to target, Then not feasible to get target. - XOR of two numbers provide the bits where operation is needed. Returning the count of them. 2. Vowels Game in a String - Alice always wins except when there isn't any vowel in string. 3. Maximum Number of Operations to Move Ones to the End - Iterate for each bit from left to right, use variable counter to count 1's and use variable prev to store previous bit. - If found bit is 1 - If prev is 0, Add counter to res. - Increase counter - Update prev with current bit 4. Minimum Operations to Make Array Equal to Target - Find the delta array as delta[i] = target[i] - nums[i] - Kadane's algorithm variation works fine on delta array - Iterate over delta and init variable prev=0 to store previous delta - if new delta, delta[i] is of same sign as prev or prev is 0, Add positive value change, abs(delta[i] - prev) to ans. - If new delta, delta[i] is of opposite sign to prev, Add delta[i]'s absolute value to ans. - Update prev = delta[i] Please share your ideas in comments 😊 #algorithms #dsa #leetcode #problemsolving

46

Binod: Vasanth Bhat why you're late to the interview by 5 minutes? Vasanth: Sorry Binod, I had an internet connectivity issue due to which I couldn't join on time. Binod: Don't give me reasons as a candidate you need to join an interview 5 minutes early. (speaking rudely) and he started an interview and asked tough questions and unfortunately I did not clear the interview. I wonder why some interviewers are so strict ? It is not integration right ? why can't the interview be a healthy discussion? tell me about strict interviewers you got in your interview? follow me and I will help you to find your dream job: Vasanth Bhat #interview #mindset #question #difficult

41

3 Comments

How to crack CAT? (4/4) Part 4: Quantitative aptitude QA is generally a make (for engineers and maths bg.) or break (for non-maths bg.) section. Many people call it quants and forget that "aptitude" part. It is not your typical "maths", there is no step marking, you need to analyse the situation as if in a real life scenario and find the solution by whatever means possible. Do's ✅: i.) Know your formulas but more importantly, learn tricks around certain frequently asked problems. Make a formula book. ii.) Do at least 2 topics out of algebra, arithmetic and geometry thoroughly, and learn at least the basics of the number system and modern maths. iii.) Give special emphasis on pyqs as many concepts repeat in quants. iv.) Understand the problem and imagine the scenario in your mind before trying to solve it. v.) Practice mental maths and try to solve as many calculations in mind as possible. vi.) Learn tricks from Vedic maths, squares (up to 30) , cubes (up to 15), roots (frequently used ones), tables, etc. vii.) Learn to use the options as sometimes only 1 or 2 of them is/are logically coherent with the problem. Don'ts ❌: i.) Do not get too attached to the formulas. Sometimes all you need is common sense and logic to solve a problem. ii.) Do not over depend on the on-screen calculator. That cursor consumes quite some time. iii.) Do not leave a question because of its size. Read it and then decide whether you want to attempt it or not. iv.) Do not get stuck on any question until you have seen all the questions in the section. v.) Do not cross-verify the answer repeatedly. That time can be used in other questions. Attempt strategy 📜: Carry the momentum from the previous section. Start thinking fast as you enter this section. Use the rounds technique. In the first round, try solving every question within 1 min. Mark the questions for the second round. Then in the second round, take around 3 min. Then if any time remains, pick from the rest of the questions and solve them. This strategy is hard to follow, practice it in mocks, and do not deviate. QA takes all your breath as it is generally the last section and there are still questions to do until the very last second. As you complete this section, take a long sigh and pat on your back. #CAT #MBA #QA

69

2 Comments