Shivam Shrivastava

All the DSA resources I used to crack Google (2025) - 📺 𝗬𝗼𝘂𝗧𝘂𝗯𝗲 𝗖𝗵𝗮𝗻𝗻𝗲𝗹𝘀 1. Striver A2Z DSA Playlist https://lnkd.in/gJXB9cnY Covers everything from basics to advanced DSA with pseudocode clarity. Builds real problem-solving intuition. 2. Vivek Gupta’s Dynamic Programming Workshop https://lnkd.in/g62GukQS Laser-focused on advanced DP patterns and transitions. Great for mastering optimization-heavy problems. 3. Aditya Verma’s DP Playlist https://lnkd.in/gaF9JE92 Breaks down how recursion evolves into DP. Best suited for those starting their DP journey. 📚 𝗪𝗲𝗯𝘀𝗶𝘁𝗲𝘀 𝗳𝗼𝗿 𝗿𝗲𝗮𝗱𝗶𝗻𝗴 𝗮𝗯𝗼𝘂𝘁 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 1. CP-Algorithms https://cp-algorithms.com Encyclopedia of high-level algorithms - from suffix arrays to heavy-light decomposition. Perfect for deep dives. 2. USACO Guide https://usaco.guide A curated roadmap with problem sets, concepts, and video explanations. Helps you rise from beginner to elite. 🏆 𝗣𝗿𝗮𝗰𝘁𝗶𝗰𝗲 𝗣𝗹𝗮𝘁𝗳𝗼𝗿𝗺𝘀 1. LeetCode https://leetcode.com Most popular interview platform. Weekly contests emulate the exact pace and pressure of real FAANG rounds. 2. AtCoder Educational DP Contest https://lnkd.in/g4WYiA4p 26 hand-crafted problems to learn DP the right way - with clean, editorial-backed insights. 3. CSES Problem Set https://cses.fi/problemset Graph algorithms. Trees. 100+ well-thought-out problems to master core concepts. 4. Codeforces https://codeforces.com Legendary contests that challenge your mathematical and logical reasoning under tight time pressure. There’s no secret formula. Just the right resources, ruthless consistency, and clear fundamentals. Save this.

If you're preparing for FAANG in 2025 - this list has everything you need. I’ve compiled all the DSA resources and problem sets I’ve shared over the last few months into one clean list. Save this. Revisit it. Work through it one topic at a time. Interview Experience: https://lnkd.in/g9wSaUUT Core Resources: https://lnkd.in/g-jDdkBx DSA by Topic: Arrays  https://lnkd.in/gNWYdVsR Linked List https://lnkd.in/g_KKrUru Bit Manipulation https://lnkd.in/gTjTPaRD Maths https://lnkd.in/ggHZDJs9 Heaps https://lnkd.in/g_xMQXfK Trees https://lnkd.in/gnenrKNR Graphs https://lnkd.in/gamHUjrU Dynamic Programming https://lnkd.in/g3uzYEvw Strings https://lnkd.in/g99u8azT Backtracking https://lnkd.in/gyz484KW? Tries https://lnkd.in/g2nvdYde A few tips if you’re just starting out:  • Pick one topic, stick to it, solve enough problems to build pattern recognition  • Focus on clear thinking, not just passing test cases  • Make your own notes - you’ll thank yourself later  • Don’t rush. Aim for mastery, not completion No shortcuts. No overplanning. Just one link at a time, one question at a time - and progress stacks up.

Sharing all 𝗧𝗿𝗲𝗲𝘀 and 𝗚𝗿𝗮𝗽𝗵𝘀 problems which will be super helpful for FAANG prep. 𝗧𝗿𝗲𝗲𝘀 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟭: 𝗗𝗶𝘀𝘁𝗮𝗻𝗰𝗲 𝗕𝗲𝘁𝘄𝗲𝗲𝗻 𝗡𝗼𝗱𝗲𝘀 CSES: https://lnkd.in/ghaCk3ks (Distance Queries) LeetCode: https://lnkd.in/gDyerDvx CSES: https://lnkd.in/gb5-Yxct (Tree Diameter) LeetCode: https://lnkd.in/g4scg5j3 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟮: 𝗦𝘂𝗺 𝗼𝗳 𝗗𝗶𝘀𝘁𝗮𝗻𝗰𝗲𝘀 CSES: https://lnkd.in/gnU885B7 (Tree Distances II) LeetCode: https://lnkd.in/gKWrRjjD CSES: https://lnkd.in/gDTpGbiu (Tree Distances I) 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟯: 𝗦𝘂𝗯𝘁𝗿𝗲𝗲 𝗤𝘂𝗲𝗿𝗶𝗲𝘀 CSES: https://lnkd.in/gzeCNJRB (Subtree Queries) CSES: https://lnkd.in/gjM9A3_k (Company Queries II) 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟰: 𝗕𝗶𝗻𝗮𝗿𝘆 𝗟𝗶𝗳𝘁𝗶𝗻𝗴 (𝗟𝗖𝗔 𝗢𝗽𝘁𝗶𝗺𝗶𝘇𝗮𝘁𝗶𝗼𝗻) CSES: https://lnkd.in/g9iz--Qm (Company Queries I) LeetCode: https://lnkd.in/g868zcqj 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟱: 𝗧𝗿𝗲𝗲 𝗗𝗣 CSES: https://lnkd.in/gY2bfrJU (Tree Matching) CSES: https://lnkd.in/gqY_jfUg (Subordinates) LeetCode: https://lnkd.in/gSRcj_Jx 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟲: 𝗥𝗲𝗿𝗼𝗼𝘁𝗶𝗻𝗴 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 CSES: https://lnkd.in/gDTpGbiu (Tree Distances I) CSES: https://lnkd.in/gnU885B7 (Tree Distances II) 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟳: 𝗣𝗮𝘁𝗵 𝗤𝘂𝗲𝗿𝗶𝗲𝘀 CSES: https://lnkd.in/g32ABsn2 (Path Queries) LeetCode: https://lnkd.in/gr-4FZQY 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟴: 𝗧𝗿𝗲𝗲 𝗖𝗼𝗻𝘀𝘁𝗿𝘂𝗰𝘁𝗶𝗼𝗻 LeetCode: https://lnkd.in/gqNjMTxk 𝗚𝗿𝗮𝗽𝗵𝘀 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟭 - 𝗗𝗙𝗦/𝗕𝗙𝗦 𝗧𝗿𝗮𝘃𝗲𝗿𝘀𝗮𝗹 problem1 - https://lnkd.in/g65JMZr7 problem2 - https://lnkd.in/gH8-iTtG problem3 - https://lnkd.in/g_mCnnXn 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟮 - 𝗦𝗵𝗼𝗿𝘁𝗲𝘀𝘁 𝗣𝗮𝘁𝗵 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 problem1 - https://lnkd.in/g9YdvpX9 problem2 - https://lnkd.in/g7SPYf7u problem3 - https://lnkd.in/g5MguTKa problem4 - https://lnkd.in/gAGxXhkf problem5 - https://lnkd.in/gVf-2TmP 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟯 - 𝗧𝗼𝗽𝗼𝗹𝗼𝗴𝗶𝗰𝗮𝗹 𝗦𝗼𝗿𝘁 problem1 - https://lnkd.in/gvKYD2Mg problem2 - https://lnkd.in/gSTQK4tH problem3 - https://lnkd.in/gsN97T7H 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟰 - 𝗖𝘆𝗰𝗹𝗲 𝗗𝗲𝘁𝗲𝗰𝘁𝗶𝗼𝗻 problem1 - https://lnkd.in/g6SCp73p problem2 - https://lnkd.in/gHRZvqfn problem3 - https://lnkd.in/gVf9N56q 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟱 - 𝗖𝗼𝗻𝗻𝗲𝗰𝘁𝗲𝗱 𝗖𝗼𝗺𝗽𝗼𝗻𝗲𝗻𝘁𝘀 problem1 - https://lnkd.in/giYhGt49 problem2 - https://lnkd.in/gquzCwJU problem3 - https://lnkd.in/g_FbSw_V 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟲 - 𝗠𝗶𝗻𝗶𝗺𝘂𝗺 𝗦𝗽𝗮𝗻𝗻𝗶𝗻𝗴 𝗧𝗿𝗲𝗲 problem1 - https://lnkd.in/gww4pifF problem2 - https://lnkd.in/gVf9N56q 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟳 - 𝗨𝗻𝗶𝗼𝗻 𝗙𝗶𝗻𝗱 problem1 - https://lnkd.in/gSNKn8GE problem2 - https://lnkd.in/g65JMZr7 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟴 - 𝗚𝗿𝗶𝗱-𝗕𝗮𝘀𝗲𝗱 𝗚𝗿𝗮𝗽𝗵 𝗣𝗿𝗼𝗯𝗹𝗲𝗺𝘀 problem1 - https://lnkd.in/g65JMZr7 problem2 - https://lnkd.in/gxsgb_qi problem3 - https://lnkd.in/gUxWY2hV 𝗣𝗮𝘁𝘁𝗲𝗿𝗻 𝟵 - 𝗚𝗿𝗮𝗽𝗵 𝗖𝗼𝗹𝗼𝗿𝗶𝗻𝗴 problem1 - https://lnkd.in/gquzCwJU problem2 - https://lnkd.in/gpNZf7U9