Coding With Yash

Placement Series | Day 4

Today, we have covered another important DSA pattern.

Some of the most common interview questions based on this pattern are:

• Two Sum II
• Valid Palindrome
• Remove Duplicates from Sorted Array
• Container With Most Water
• Squares of a Sorted Array
• 3Sum

Remember, cracking coding interviews isn’t about memorizing hundreds of solutions.

Let me know in the comments if you know another question that uses the Two Pointers pattern.

Save this reel for revision.

Follow for more such DSA concepts.

Placement Series | Day 3

Today, we have covered the Hashing pattern, one of the most important patterns for coding interviews.

Whenever you see questions involving:
✅ Duplicates
✅ Frequencies
✅ Pairs
✅ Fast lookups

Your first thought should be:

“Can I solve this using a HashMap or a HashSet?”

Save this reel because you’ll keep coming back to this pattern during your interview preparation.

Tomorrow, we’ll cover another DSA pattern that appears in many coding interview questions.

Follow for more such DSA concepts.

Placement Series | Day 2

Yesterday, we talked about how to start your interview preparation from scratch.

Today, let’s talk about something even more important: How do you actually approach a DSA question?

One mistake I see almost every beginner make is jumping straight into coding or watching the solution after a few minutes.

Instead, follow this approach:

✅ Understand the problem completely.

✅ Think of the brute-force solution first.

✅ Look for patterns instead of memorizing solutions.

✅ Only then, write the optimized solution.

Here’s a simple trick to identify patterns:

Finding pairs in an array? Think HashMap or Two Pointers (Two Sum)

Longest/Shortest Subarray or Substring? Think Sliding Window (Longest Substring Without Repeating Characters)

Sorted array? Think Binary Search (Search Insert Position)

Repeated calculations? Think Prefix Sum or Dynamic Programming (Climbing Stairs)

Tree or Graph? Think DFS/BFS (Maximum Depth of Binary Tree)

Top K elements? Think Heap (Top K Frequent Elements)

Remember, interviews aren’t about memorizing hundreds of solutions. They’re about recognizing patterns and knowing when to apply them.

📌 Save this post so you can revisit these patterns whenever you’re solving DSA.

👇 Which DSA pattern do you find the most difficult? Let me know in the comments.

Tomorrow, we’ll dive into the first DSA pattern that every beginner should master.

{ DSA, Data Structures and Algorithms, Coding Interview, Software Engineer, SDE1, Placement Preparation, Campus Placements, Software Developer, Coding with Yash}

Day 39 of DSA & Logic Building series in 90 days.

Today, I started learning about the Tree Data Structure.

And today in this I covered

1) What is a tree and how it works?

2) Some key properties and terms like what is a root, parent, leaf, height, levels, etc.

3) Types of binary trees

4) How to insert a node into a tree and display it nicely.

That’s it for today! Hit the follow button and let’s keep learning together!

Day 7 of my React learning series, and today I worked on:

✅ Optimizing the code for better performance

✅ Finalizing all functionalities and fixing minor bugs

This project helped in understanding the concepts of

1) Props & Components for reusability

2) Hooks (useState, useEffect) to manage state & effects

3) Fetching data from APIs efficiently

4) Using Tailwind CSS for styling

If you want to add more custom functionalities to this website, or use it for practice, let me know in the comments, I’ll send the code to you.

And there are still many advanced React concepts left to explore, and I’ll cover them in future projects.

So that’s a wrap for this series!

Share this with your friends who are learning React, and I’ll see you soon in the next project.

Till then, keep learning…!!

Day 30 of DSA & logic building series in 90 days.

Today, I started by revising some concepts of String and StringBuilder, then moved on to solve two LeetCode questions.

The first one was to find the length of the last word in a string, which I solved using the trim() and lastIndexOf() methods.

The second was reversing the prefix of a word, which I tackled with the subSequence() method.

If you’re also learning DSA, hit the follow button, and let’s keep learning together!

{dsa, data structures, data structures and algorithms, placement preparation, interview preparation, java, java programming, leetcode questions, problem solving}

Day 41 of learning MERN Stack from scratch.

So yesterday I onboarded a client for a website development project for which I had to create a real estate website on WordPress.

And for this project today I completed the content work and finalized the layout of the home page.

After this, I looked for some practice projects for JS on google which I will be doing from now onwards, and will be providing you the source code as well.

Make sure to follow the account.

And that’s it for today.

Day 20 of DSA & logic building series in 90 days.

I finally got back to my DSA studies today! And I revised the following topics:

1) Types of programming languages
2) Java Architecture
3) How a Java program compiles
4) Memory management (stack and heap memory)
5) Flow of programs
6) Methods & Functions
7) Loops (for while and do-while)
8) Concepts of menu-driven programs

I also practiced some questions related to these topics.

If you want the set of questions to practice and master these fundamental topics then comment “Program” I will send it to you to your DMs.

That’s it for today!

{java programs, dsa in java, data structures and algorithms, dsa problems, placement preparation, product based companies, java programming}

Day 11 of learning MERN Stack from scratch.

Today, I covered multiple intreseting topics like type conversion and coercion in which I learned how we can convert one type of value to another.

And then I also got to know about truthy and falsy values in javascript.

Finally I ended up my day with creating notes.

If you want to learn from these notes then comment Day 11, I will send it straight to your DMs.

That’s it for today.