𝗥𝗮𝘃𝗶 𝗧𝗲𝗷𝗮

BTech ’24 | SDE Aspirant
MERN • Java • DSA
Learning in public, grinding DSA in private 🚀

[𝗥𝗮𝘃𝗶 𝗧𝗲𝗷𝗮 @Raviittejaa]

My 2025 Wrapped:

>Completed ~40% of DSA.
>Failed 5 interviews (incl. a 9.5 LPA final round).
>Confused about roles, chose SDE for product-based goals.
>Procrastination, lost consistency, loneliness, and strained friendships.
>Restarted from scratch—stronger and clearer. 💪

[𝗥𝗮𝘃𝗶 𝗧𝗲𝗷𝗮 @Raviittejaa]

@Tarun_burden Googly, Ranavikrama

[AdityaVarma @AdityaVarma45_]

She was literally born to sing this song. 📈🔥

[Isha singh @isha_singh06]

20 LeetCode patterns you should know

1.Two Pointers
2.Sliding Window
3.Dynamic Programming
4.Prefix Sum
5.Depth-First Search (DFS)
6.Breadth-First Search (BFS)
7.Binary Search
8.Backtracking
9.Monotonic Stack
10.Matrix Traversal
11. Fast & Slow Pointers
12. Top ‘K’ Elements (Heap)
13.Overlapping Intervals
14.Binary Tree Traversal
15.Union Find (Disjoint Set)
16.Greedy Algorithms
17.Linked List In-place Reversal
18.Modified Binary Search
19.Bit Manipulation
20.Trie (Prefix Tree)

Bookmark or repost it future use

[Nikhil @imNiKkiiY]

Cracking Amazon SDE-1 is not as complicated as people make it sound.
I talked to multiple people who've been through it.
Here's exactly what you need to know 🔽
─────────────────────
Amazon SDE-1 mainly focuses on just 2 things:
1️⃣ DSA
2️⃣ Leadership Principles
That's it.
Yes Leadership Principles are real and they MATTER.
Don't ignore them thinking it's just HR fluff.
Amazon takes their culture seriously. Very seriously.
─────────────────────
What about your resume?
They might ask about it but usually surface level.
Unless your project directly connects to the role.
So don't spend months perfecting your resume.
Spend that time on DSA instead.
─────────────────────
Here's the truth about DSA prep for Amazon
It's actually manageable.
You don't need to grind 1000 problems.
You don't need to solve every Hard on LeetCode.
Just do 300 – 400 questions.
Pick ANY solid DSA sheet.
That is more than enough.
─────────────────────
Now the real alpha
After chatting with multiple friends about their Amazon interview experiences,
some patterns started showing up clearly.
These are the topics that keep appearing again and again 👇
─────────────────────
📌 Dynamic Programming (DP) problems that pop up often:
• Longest Common Subsequence
• 0/1 Knapsack
• Coin Change
• Longest Increasing Subsequence
• Edit Distance
• Partition Equal Subset Sum
• Word Break
• House Robber I & II
• Matrix Chain Multiplication
• Unique Paths
─────────────────────
📌 Graph problems that pop up often:
• Number of Islands
• Clone Graph
• Course Schedule I & II (Topological Sort)
• Word Ladder
• Dijkstra's Algorithm
• Detect Cycle in Directed & Undirected Graph
• Flood Fill
• Rotten Oranges
• Bipartite Graph Check
• Minimum Spanning Tree (Prim's / Kruskal's)
─────────────────────
Quick action plan if you're targeting Amazon:
✅ Pick Striver's DSA sheet or NeetCode 150
✅ Focus heavily on DP + Graphs
✅ Read all 16 Amazon Leadership Principles
✅ Prepare 2-3 STAR stories for each principle
✅ Do mock interviews with friends
─────────────────────
Amazon is not impossible.
It just rewards people who prepare smart not just hard.
Know what they ask.
Practice what matters.
Show up confident.
That's the formula. 🚀
─────────────────────
Found this helpful?
♻️ Repost so your CSE friends preparing for placements see this
🔖 Save this you'll need it later
👇 Drop your dream company below I'll share prep tips for that too!
Follow @imNiKkiiY for honest placement prep content 💻
#Amazon #SDE1 #Placements #DSA #LeetCode #GraphProblems #DynamicProgramming #CSE

[Firoz @FirozCodes]

Show me a better DP playlist than this.
I will wait...

[𝗥𝗮𝘃𝗶 𝗧𝗲𝗷𝗮 @Raviittejaa]

@girlsMum1 Name ?

[చరిత్ @softwarecooliee]

: how many times did you watch this?
: yes!!

[Akshay Kumar @Aakshayy12]

6 month roadmap for placement:

Month 1-2: Master DSA (Graphs/DP) in Python/C++
Month 3: Deep dive into JavaScript & React
Month 4: Build a full-stack MERN project
Month 5: System Design + OS/DBMS basics
Month 6: Mock interviews & Resume optimization

Consistency > Intensity.

[SURYA BHAI🦁🏹 @Penu_toofann]

Orey entra ee high asala😭😭🥵🥵🥵🥵🥵

Exact ga Babu entry start ayina dhaggara nunchi aa high.., aa arupulu...🥵🥵🥵🔥🔥

I bet akkada unna prathi okkadu "Naa Hero" ane kutha balupu tho chusuntadu😭😭🔥🔥🔥

#MaheshBabu #Varanasi #GlobeTrotter

[Asmit @coolcoder56]

Hackwithinfy coding problems provided by infosys

[Asmit @coolcoder56]

Rippling SDE Intern OA
and they pay close to 70 ctc for sde 1 💰

[Jahir Sheikh @jahirsheikh8]

Best YouTube Channels To Crack Tech Interviews (2026)

1. DSA – NeetCode
2. LeetCode Patterns – Abdul Bari
3. System Design – Gaurav Sen
4. Mock Interviews – Pramp
5. FAANG Prep – Tech Dummies
6. Coding Rounds – Nick White
7. Behavioral – Jeff H Sipe
8. Problem Solving – Back To Back SWE
9. Deep DSA – Errichto
10. Interview Strategy – Exponent
11. Resume + Career – Self Made Millennial
12. Real Interview Qs – Clément Mihailescu
13. Advanced DSA – William Lin
14. CS Basics – MIT OpenCourseWare

[Surendar @Surendar__05]

DSA Roadmap:

1. Basics
→ Time & Space Complexity
→ Math Basics (GCD, LCM, Prime, Modular Arithmetic)
→ Bit Manipulation (Basics)
→ Bit Masking & XOR Tricks

2. Arrays & Strings
→ Arrays
→ Strings
→ Two Pointers
→ Sliding Window
→ Prefix Sum
→ Kadane’s Algorithm
→ 2D Arrays (Matrix problems)
→ Moore’s Voting Algorithm
→ Dutch National Flag Algorithm

3. Searching & Sorting
→ Basic Sorting
→ Binary Search
→ Binary Search on Answer
→ Merge Sort
→ Quick Sort
→ Heap Sort
→ Lower Bound / Upper Bound
→ Custom Comparator Sorting

4. Recursion & Backtracking
→ Recursion Basics
→ Subsets / Subsequences
→ Permutations
→ Backtracking (N-Queens, Sudoku)
→ Combination Sum Problems
→ Palindrome Partitioning

5. Hashing
→ Hash Maps
→ Frequency Counting
→ Prefix Hashing
→ Subarray / Substring Problems
→ Set vs Map usage patterns ⭐
→ Hashing for Pair Sum / 2Sum variations ⭐

6. Linked List
→ Singly Linked List
→ Doubly Linked List
→ Fast & Slow Pointer
→ Cycle Detection
→ Reverse / Merge Linked List
→ LRU Cache (Design Problem)

7. Stack & Queue
→ Stack
→ Queue
→ Deque
→ Monotonic Stack
→ Next Greater Element
→ Expression Evaluation
→ Min Stack
→ Queue using Stack / Stack using Queue (Design)

8. Greedy
→ Activity Selection
→ Interval Problems
→ Job Scheduling
→ Greedy with Sorting
→ Gas Station Problem
→ Huffman Coding (basic idea)

9. Binary Trees

→ Tree Traversals
→ Height / Depth
→ Diameter
→ Lowest Common Ancestor
→ Tree Views
→ Serialization & Deserialization
→ Maximum Path Sum / Path-based Problems

10. Binary Search Trees

→ BST Basics
→ Insert / Delete
→ Floor / Ceil
→ Validate BST
→ BST Problems
→ Kth Smallest / Largest in BST

11. Heaps
→ Min Heap / Max Heap
→ Priority Queue
→ Kth Largest / Smallest
→ Merge K Sorted Lists
→ Top K Elements Problems
→ Median in Data Stream ⭐

12. Graphs
→ Graph Representation
→ BFS / DFS
→ Cycle Detection
→ Topological Sort
→ Shortest Path Algorithms
→ Minimum Spanning Tree
→ Disjoint Set (Union Find)
→ Dijkstra’s Algorithm (using PQ)
→ Bellman-Ford Algorithm
→ Floyd Warshall Algorithm

13. Dynamic Programming
→ 1D DP
→ 2D DP
→ DP on Subsequences
→ DP on Strings
→ DP on Trees
→ Space Optimization
→ DP Patterns (Knapsack, LIS, LCS)
→ Memoization vs Tabulation
→ State Transition Thinking

Bookmark or repost it for future use🙌

[𝗥𝗮𝘃𝗶 𝗧𝗲𝗷𝗮 @Raviittejaa]

@Surendar__05 The most perfectly structured breakdown of every topic I’ve ever seen 👏

[Suryansh Tiwari @Suryanshti777]

Most developers never crack high-paying jobs...

Not because they can’t code —
but because they FAIL system design.

That’s the real filter.

So I’m giving away 2 powerful resources:

• System Design for Beginners
• System Design Interview Prep

Learn how real scalable systems are built.
The same concepts used at top tech companies.

This is the skill that separates ₹5L devs from ₹50L+ engineers.

Free for a limited time.

How to get it:

1. Follow me (so I can DM you)
2. Like + RT
3. Comment “COURSE”

Ill DM

Bookmark this if you’re serious about leveling up.

[𝗥𝗮𝘃𝗶 𝗧𝗲𝗷𝗮 @Raviittejaa]

@Suryanshti777 Course

[Asmit @coolcoder56]

Sliding Window looks simple... until you're in the interview.
It's one of the favourite topics of tech interviewers.

Why? Because it tests your ability to:
→ Identify the right pattern quickly
→ Know when to shrink the window
→ Understand where to update your answer

The confusion is real:
• Shrink while VALID or INVALID?
• Update INSIDE or AFTER the loop?
• Monotonic Increasing or Decreasing?

Let me simplify all 6 Patterns for you:

Pattern 1: Fixed Size Window
↳ Size K is given in the problem
↳ Build first window, then slide: +new, −old
↳ LC 239, 643, 1456

Pattern 2: Variable MAX (Longest)
↳ Find maximum length subarray
↳ Shrink while INVALID
↳ Update answer AFTER while loop
↳ LC 3, 424, 1004

Pattern 3: Variable MIN (Shortest)
↳ Find minimum length subarray
↳ Shrink while VALID
↳ Update answer INSIDE while loop
↳ LC 76, 209, 862

Pattern 4: HashMap (Anagram)
↳ Permutation / Anagram matching
↳ Track need & window maps
↳ valid++ when window[c] == need[c]
↳ LC 567, 438, 76

Pattern 5: Exactly K Trick
↳ exactly(K) = atMost(K) − atMost(K−1)
↳ Count subarrays: right − left + 1
↳ LC 992, 1248, 930

Pattern 6: Monotonic Deque / Stack
↳ Need MAX in window → Decreasing deque
↳ Need MIN in window → Increasing deque
↳ Always store indices, not values
↳ LC 239, 84, 42, 739

Quick Pattern Recognition:

"Window size K" → Fixed

"Find longest" → Variable MAX

"Find shortest" → Variable MIN

"Anagram / Permutation" → HashMap

"Exactly K distinct" → Subtraction Trick

"Max/Min in window" → Monotonic Deque

[Surendar @Surendar__05]

The only SQL concepts you really need to know:

• CRUD → SELECT, INSERT, UPDATE, DELETE
• Keys → PRIMARY KEY, FOREIGN KEY
• Constraints → NOT NULL, UNIQUE, CHECK, DEFAULT
• Joins → INNER JOIN, LEFT JOIN, RIGHT JOIN
• Aggregation → COUNT, SUM, AVG, MIN, MAX
• Grouping → GROUP BY, HAVING
• Filtering → WHERE, BETWEEN, IN, LIKE
• Sorting → ORDER BY
• Subqueries → SELECT (SELECT …)
• Indexes → CREATE INDEX
• Views → CREATE VIEW
• Transactions → BEGIN, COMMIT, ROLLBACK
• Pagination → LIMIT, OFFSET
• Optimization → EXPLAIN

[Mindset Fuel @themindsetfuel]

@knowiiiedge He died of cancer. ✅
•die of → illness / internal cause
•die from → external cause (injury, accident, etc.)
•die with → having a disease but not necessarily caused by it
•die by → method (e.g., by suicide)