Paridhi Bhagwat

Don’t always expect questions to be only on DSA, LLD or HLD in your Interviews ❌ . There are so many good companies that ask domain-specific questions as well. Here is how you can prepare for these questions: ✅ Always read the Job Description carefully as it’ll give you the high-level expectations of topics/questions that can be asked. ✅ Prepare the Tech Stack/Domain-specific Important Interview Questions beforehand, so that you don’t lose that opportunity. ✅ Make sure to highlight the projects and talk about the impact, challenges and complexity you have worked on in that domain. Next time you’ve your interview scheduled do check for it and practice all topics like DSA, LLD and core domain tech 💯 Now, I know it is extremely difficult to list out and practice all these tech topics. And sometimes, even after practicing all concepts, we miss out on some and face rejections 😢 If you’re going through this, connect with SDEs from Top Product Companies who can help you turn around these rejections. 📌 You can connect with them here instantly for FREE - https://lnkd.in/gvqQSmMW These SDEs will help you avoid all failures by fully preparing you for the interview by providing personalized training, sharing resources, conducting mock interviews and arranging referrals 🚀 #tech #interview #collab #preplacedcollab

719

39 Comments

Amazon is hiring Software Engineers. Sharing the list of most asked DSA questions in Amazon Check out the list of 20 questions you must solve before your DSA interview 1. Two Sum (Easy) 2. Merge Two Sorted Lists (Easy) 3. Best Time to Buy and Sell Stock (Easy) 4. Flood Fill (Easy) 5. Number of Islands (Medium) 6. Rotting Oranges (Medium) 7. LRU Cache (Medium) 8. Copy List with Random Pointer (Medium) 9. Word Break (Medium) 10. Group Anagrams (Medium) 11. Merge Intervals (Medium) 12. 3 Sum (Medium) 13. Longest Palindromic Substring (Medium) 14. All Nodes Distance K in Binary Tree (Medium) 15. Shortest Path in Binary Matrix (Medium) 16. Merge k Sorted Lists (Hard) 17. Trapping Rain Water (Hard) 18. Frog Jump (Hard) 19. Sliding Window Maximum (Hard) 20. Word Search II (Hard) Apply here :- 1+ years - https://lnkd.in/gsshGQiu https://lnkd.in/gKk-SzwK 3+ years - https://lnkd.in/gCmKR4kw https://lnkd.in/gYuYfdwM 5+ years - https://lnkd.in/gx-Z4mE9 6+ years - https://lnkd.in/gBwuWPS8 Hope this helps. Do let me know in the comments if you need a similar list for system design interview questions. You can follow Akanksha Buchke to stay updated with the latest hirings, referrals, DSA and system design content. #amazoninterviewquestions #amazon #faang #interviewexperience #hiring #jobs #akankshabuchke #connections

447

34 Comments

WhatsApp/Telegram-like architecture is a common question in SDE 2 or SDE 3 interviews. These question often seems simple, but many candidates struggle to approach them correctly. Here's a structured approach to tackle these questions: ⬇️ Start with clarifying the required features if it's just a text app, or it needs media sharing, group chats, etc Then, Define constraints and use cases: How many users will the app support? What actions will they need to perform? Now, Draw a basic architecture diagram, define key components (Client, Server, Database), choose the database (SQL/NoSQL), and design the schema (Users, Messages). Follow up by Setting up APIs for actions like sending/receiving messages, updating statuses, etc. → And Think about handling users and data with strategies like load balancing, database sharding, and caching. If you’re a working professional looking to ace system design interviews, practice common questions to cover different aspects of system design. And if you need guidance then Bosscoder Academy can help Check their complete program here: https://bit.ly/4fOVleM They can help you with: ✅ Structured curriculum to DSA, System Design, and Full stack development. ✅ Personal Mentorship from industry experts. ✅ Live Classes & 24/7 Doubt Support. ✅ Real-life, relevant projects with Placement Assistance.

566

14 Comments

LeetCode questions list commonly asked in MAANG-level and other good product companies. 🚀 1. Arrays - Two Sum/3 Sum - Kadane’s algorithm (Maximum Subarray Sum) - Trapping Rain Water 2. Strings - Group Anagrams - Valid Parentheses 3. Sorting & Searching - Rotate an array/find Kth element in a rotated sorted array - Kth Largest Element in an Array - Merge Intervals 4. Linked Lists - Cycle detection - Reverse a Linked List by k places - Merge Two Sorted Lists 5. Trees - Mirror image of Binary Search Tree - ZigZag/Spiral traversal - Maximum Depth of Binary Tree - Lowest Common Ancestor of BST 6. Dynamic Programming - Coin Change - Climbing Stairs - Longest Increasing Subsequence - Stock Buy & Sell 7. Graphs - Number of Islands - Clone Graph - Course Schedule 8. Recursion & Backtracking - Subsets - Permutations Hope this list will be helpful for a quick revision. 💯 #dsa #algorithms #datastructures #sde #techjobs #faang #roadmap #connections #hirings #jobs #tech #coding #programming #problemsolving #help

12

🔸Here's Todays Leetcode Problem of the day : [ 🔥DAY 232 ] 🔸Name : Count Triplets That Can Form Two Arrays of Equal XOR 🔸Description : Given an array of integers arr. We want to select three indices i, j and k where (0 <= i < j <= k < arr.length). Let's define a and b as follows: a = arr[i] ^ arr[i + 1] ^ ... ^ arr[j - 1] b = arr[j] ^ arr[j + 1] ^ ... ^ arr[k] Note that ^ denotes the bitwise-xor operation. Return the number of triplets (i, j and k) Where a == b.   Example 1: Input: arr = [2,3,1,6,7] Output: 4 Explanation: The triplets are (0,1,2), (0,2,2), (2,3,4) and (2,4,4) Example 2: Input: arr = [1,1,1,1,1] Output: 10   Constraints: 1 <= arr.length <= 300 1 <= arr[i] <= 108 🔸Link: https://lnkd.in/dEv76Puu

14

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

241

4 Comments

From “I think I will get rejected” To securing a PPO at Goldman Sachs Here's what truly made the difference. ⬇ When I was shortlisted for the interview, I did more than just brush up on a few concepts. ✅ Concise introduction: I prepared a brief, impactful self-introduction. ✅ Timed problem-solving: I practised solving 2 medium-level coding questions daily within an hour. ✅ Mock interviews: I did many mock interviews with friends and seniors to build confidence. I was nervous but thanks to the support of my friends and seniors, and a proper strategy I landed the internship. Now, you too can get a winning interview preparation strategy and 1:1 guidance by connecting with senior engineers on Preplaced All you have to do is book a free session with them here: https://lnkd.in/gu3GUe2c They have helped multiple people land internships and full-time roles at top companies like Google, Amazon, Goldman Sachs, Uber, Salesforce and more. You can also be one of them. 🚀 All the best! #goldmansachs #internship #collab #preplacedcollab #interviewpreparation #successstory

1,521

16 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

🚀 LeetCode Daily Problem Explanation for June 7th! 🚀 -- These are my accepted solutions, I would appreciate any optimisations in the comments !! -- 📚 Problem Statement: Given a dictionary of root words and a sentence, replace all derivatives in the sentence with their root words. If a word can be replaced by multiple roots, use the shortest root. 💡 Example 1: Input: dictionary = ["cat","bat","rat"], sentence = "the cattle was rattled by the battery" Output: "the cat was rat by the bat" Example 2: Input: dictionary = ["a","b","c"], sentence = "aadsfasf absbs bbab cadsfafs" Output: "a a b c" 🛠 Solution Approach: Store Roots in a Set: Convert the list of roots into a set for O(1) average-time complexity when checking prefixes. Process Each Word: Split the sentence into words and find the shortest prefix for each word in the set. Replace with Root: If a root is found, replace the word; otherwise, keep the original word. Reconstruct the Sentence: Join the processed words back into a sentence. 🔧 Complexity: Time Complexity: O(N) where N is the total number of characters in the sentence. Space Complexity: O(M) where M is the total number of characters in the dictionary. #LeetCode #Coding #Programming #CPP #ProblemSolving #Algorithm #DataStructures #CodeNewbie #100DaysOfCode #interviews #DSA #sde

7

4 Comments

Interview Experience Visa for Senior Software Engineer Round 1: Hackerank 4 questions - 1 easy, 2 medium, 1 hard scored about 80% and got to next round Round 2: DSA Round Leetcode Medium question. The problem was quite conceptual and focused less on any specific data structure. Back and forth conversation with 2 interviewers and eventually coding it. Round 3: Java Concepts and HLD This round was with a team lead and was focused on Java. Detailed discussions on data structures in Java and their internal working. Thread safe alternatives of specific data structures etc. HLD was on a generic app with basic features. Focus was on discussing architectural tradeoffs and choices made based on requirements. A very fun conversation with alot of brainstorming. Round 4: Hiring Manager Round started with previous experience and contributions made. My previous organisation gave me alot of ownership and that reflected well in my interviews. Some fun tactical questions trying to guage if i understand the concept behind them and the design patterns that could be used. After a week i got the offer. Interviewers were really knowledgeable and architecture was an important part of all conversations. Hope this helps #visa #interviewexperience

114

🚀 LeetCode Daily Problem Explanation for June 8th! 🚀 -- These are my accepted solutions, I would appreciate any optimisations in the comments !! -- 🔍 Problem: Given an integer array nums and an integer k, return true if nums has a good subarray or false otherwise. A good subarray is a subarray where: Its length is at least two, and The sum of the elements of the subarray is a multiple of k. An integer x is a multiple of k if there exists an integer n such that x = n * k. 0 is always a multiple of k. Example: Input: nums = [23, 2, 4, 6, 7], k = 6 Output: true Explanation: [2, 4] is a continuous subarray of size 2 whose elements sum up to 6. 🔮 Intuition: To solve this problem, we need to find a subarray with a length of at least 2 whose sum is a multiple of k. The main challenge is efficiently finding such subarrays without having to check all possible subarrays, which would be too slow for large arrays. The key insight is to use the modulo operation and a hash map to keep track of the running sum modulo k. If the same modulo result reappears, it means that the elements between the two occurrences of this modulo sum up to a multiple of k. 🛠️ Approach: Initialize a hash map (index_map) to store the first occurrence of each modulo result, with the initial entry {0: -1}to handle cases where the subarray starts from the beginning. Iterate through the array while maintaining a running sum. For each element in the array, update the running sum and compute the current sum modulo k. Check if this modulo result has been seen before: If yes, and the subarray length (difference between current index and stored index) is at least 2, return true. If no, store the current index in the hash map. If no valid subarray is found after iterating through the array, return false. 📈 Complexity: Time complexity: O(n) O(n), where n is the length of the array. We traverse the array once. Space complexity: O(min(n,k)) O(min(n,k)), as the hash map stores at most k different remainders or n if all remainders are unique. -- Follow Kashyap Kale for daily code explanations -- #LeetCode #Coding #Programming #CPP #ProblemSolving #Algorithm #DataStructures #CodeNewbie#100DaysOfCode #interviews #DSA #sde

5

Hi connection, Today I Solved too hard question 502. IPO Problem in LeetCode uSing Swift.... ✴Intution:- Here we are going to be using a greedy approach where we prioritize projects based on their profits while considering the capital constraints. ✴Approach Initial Check: If the initial capital is sufficient to undertake any project (i.e., it is greater than or equal to the maximum capital requirement), simply sort the projects by profit in descending order and select the top k projects. This can be achieved by sorting the profits array and summing the top k elements. ✴Greedy Selection with Capital Constraints: Create an array of tuples combining the capital and profits arrays. Initialize the current capital to the given initial capital. Iterate up to k times to select projects. In each iteration, find the project with the highest profit that can be afforded with the current capital. If a project is found, add its profit to the current capital and mark the project as used by setting its capital requirement to a very high value. If no affordable project is found, break out of the loop early. ✴Complexity Time complexity: The time complexity of the approach is dominated by the need to find the most profitable affordable project in each of the kk k iterations. If we assume there are nn n projects: Sorting the profits array initially (if the initial capital is sufficient) takes O(nlog⁡n) In the general case, each iteration requires scanning through the projects, leading to a time complexity of O(k⋅n)O(k \cdot n) O(k⋅n). Thus, the overall time complexity is O(nlog⁡n+k⋅n). Space complexity: The space complexity is O(n)O(n) O(n) due to the storage of the projects array, which combines the capital and profits arrays. credit: approach in leet code solution feed 🙌 Happy coding 🙌

20

ChatGPT can do what companies like Amazon and Walmart used to pay 60-70k to interns today. We are no longer in the COVID era, and the reality of placements is very different today. Here is the reality of DSA and Development in 2024 no influencer will talk about or tell you today: 1/ DSA vs Development: Stop Fighting, Do Both     - FAANG-type companies still test DSA, so make sure to prepare well.      - Startups care more about hands-on development skills. - They want you to contribute from the start; no one wants to train you from scratch.     - Balance both DSA and dev based on the job you aim for.  2/Remote Jobs   - Remote jobs are mostly for mid to senior-level engineers, not freshers.     - Freshers should work in an office first to build teamwork and communication skills.     - Remote jobs might look cool, but the reality is: that very few get them.  3/ Huge Salary Gap: 3 LPA vs 90 LPA     - Some engineers earn just 3-4 LPA, while others make 90 LPA with the same exp level.    - Layoffs have pushed some engineers to accept jobs with lower pay just to stay afloat.     - Don’t expect a 30-50% raise every time; it’s not always realistic.  4/ Startups Pay Big, But There’s a Catch     - Startups have to pay more to attract talent, but they come with risks like sudden shutdowns.     - If you’re leaving a comfy job for a startup, they’ll need to offer big bucks and equity to make it worth the risk.  5/ ChatGPT is Changing the Game     - Many tasks interns used to do can now be handled by tools like ChatGPT.     - Internships are now more about scouting future talent than doing critical work.  6/ Don’t Fall for Job Scams     - Research companies before joining. Some startups run on shaky promises and don’t pay on time.     - Avoid flashy “job guarantee” courses. They often have hidden conditions like “complete 90% of tasks” or you’re out.  7/ FAANG is Losing its Shine     - The FAANG dream isn’t what it used to be—more people prefer startups for the flexibility and better work-life balance.     - Getting into FAANG is super competitive, and not everyone will make it. It’s okay to start smaller.  8/ Balance Your Priorities     - Don’t spend all your time on DSA or dev—you need both.     - Tier-3 students especially need solid dev skills since big companies might not come to campus.  9/ Failure is Part of the Game     - It’s normal to mess up. Just learn fast and bounce back.     - Success isn’t guaranteed for anyone, no matter how much prep you do. Sometimes it’s just luck and timing.  Also, don’t blindly follow anyone. No one has all the answers; no one’s your savior.  Take advice, but adapt it to your situation what works for one person may not work for you.  – P.S: If you found value in this post, follow me for more. 

232

9 Comments

Some cool interviewers have very un relastic expectaions in Machine coding and LLD round of interview. In 1 to 1.5 hours me :- 👉 Enko poora system banake do, 👉 Running code bhi chiye, 👉 Code scalabale bhi ho, 👉 Fully functional bhi ho, 👉 Design Patterns bhi use hua ho usme, 👉 Bonus implementation bhi chiye And so on.... Jo System enhone years laga diya banane me vo inko 1 ghante me chaiye I am sure agar en interviewers ka bhi bethake enka interview liya jaye toh ye bhi same hi bolenge. PS: He is trying to handle his Terrible Interviewer #AsheeshTalks #SoftwareEngineer #SDE2 #Interview #design #unrealistic

238

21 Comments

Does grinding through 1000 LeetCode questions make sense? I have seen countless LeetCode profiles and resumes with 500+ questions solved but a rating of merely 1400-1500. Concepts do matter, but solving questions just for the sake of solving is a big NO. Unfortunately, for cracking interviews in tech roles, DSA is still the primary path. Does the recruitment process need a change here, or do we need to grasp DSA concepts in the shortest [time + path] possible ? #Leetcode #DSA #Recruitment #Streaks

70

10 Comments

You can learn Low Level System Design for FREE. Here’s how- ✅ Start with understanding what all you need to study for LLD. This step is optional and is for those who are absolute beginners. Here’s LLD Roadmap - https://lnkd.in/ggxTSBUa ✅ Learn basics of LLD, Understand UML Class Diagram and relationships between classes in detail - https://lnkd.in/g2ZYqeJN ✅ Learn Design Patterns - start with understanding what are design patterns, why are they important and then understand the common and important patterns. Here’s the playlist- https://lnkd.in/gTfR9qMf Now, you are ready to approach LLD of some common systems- ✅ Uber/ Ola LLD with explanation and code - https://lnkd.in/gDKz3UhK ✅ Swiggy/ Zomato LLD with explanation and code - https://lnkd.in/g4H7x3dj ✅ Zerodha LLD with explanation and code - https://lnkd.in/gXgAfY59 Save it and make sure you upskill and work on yourself. LLD will not only help you ace interviews but it will also make you a better software engineer. LLD is now expected from freshers as well. You just can’t not know this! 🤷🏻‍♀️💪🏼✌🏻 All the very best! Please share your progress as well 😇 #freeresources #lowleveldesign #softwaredevelopers

154

8 Comments

Good hold on Low Level Design is crucial for cracking Amazon SDE 2 interview. Below two resources were really beneficial for me. 1. LLD playlist of Concept & Coding YT channel by Shrayansh Jain. 2. LLD playlist of Udit Agarwal YT channel Both these guys have thoroughly covered various LLD questions and provided excellent explanations of SOLID principles and design patterns. Kudos to them for creating such outstanding content. 🔥 If you are looking for 1:1 or personalized mentorship to help you crack such interviews, you can book a free trial session with me for long-term mentorship on preplaced. If you prefer short term mentorship, book few sessions on topmate. Find my preplaced and topmate profile links in the comment. #Preplaced #Mentorship #LTM #Interviewprep #topmate

79

3 Comments

Let’s get real for a second—Solving DSA on Leetcode and actually designing a scalable system? Bhai, there’s a world of difference. Leetcode Warriors be like: "Bro, I just solved a 6-star DP problem, I’m the papa of all tech!" Meanwhile in the real world, we have engineers breaking their backs designing systems that handle millions of requests per second, keeping databases from blowing up, and actually delivering something usable. DSA is important, sure. It sharpens your problem-solving skills. But stop living in the illusion that grinding Leetcode alone will make you a superstar engineer. The real flex? Building systems that don’t crumble when a million users hit your servers. I see people flexing their 100-day Leetcode streak like they’ve cracked the Da Vinci code, but ask them to design a system that scales beyond their laptop’s localhost and they go blank. Bro, can you design for scalability, handle failures, or ensure distributed transactions don't break? DSA devs: "I can optimize this algorithm to O(n log n)" System architects: "That's cute, but can your system handle 10k concurrent users without falling apart?" And let’s not forget the people who think DSA = real-world problem-solving. Beta, aapko pata hai ki sorting algorithms kaunsa use karna hai, but system ka kaam kabhi kiya hai? DSA is your gym workout; System Design is the real field. Flexing your gym biceps doesn’t mean you’ll win the match. Let me make it clear—DSA is fundamental; it's your base. Without that foundation, system design falls apart. But please, stop acting like you’re a coding god because you cracked a tricky backtracking question on Leetcode. When the code hits production, no one cares about your Leetcode ranking, they care if the system you designed works under real load. Here’s the difference: DSA helps you solve isolated puzzles in a clean sandbox. System design is about solving complex, real-world messes, with scalability, reliability, and real users in mind. Solve the damn problems, build the damn systems, and know your limits. And to those out there who are actually designing solutions that work, the real MVPs—we see you. Keep crushing it with those system architectures that don’t break, the code that handles 100x scaling, and the designs that actually work when sh*t hits the fan. #NotJustLeetcodeBro #RealEngineeringStartsHere #ScalabilityOverFlexing #SolveDesignScale #RespectBothSides #DSAisTheStartNotTheEnd"

18