#100DaysOfCodeChallenge

Diana_Farhat · 2025-03-25T21:25:15.362Z

Day 63 |:mag: Mastering Weak Entity Sets, Cardinalities, Specialization & Generalization in Databases!

Data modeling is the backbone of efficient databases, and understanding key Entity-Relationship (ER) model concepts is crucial. Let’s break down four essential concepts:

Weak Entity Sets
Not all entities are independent! Some lack a primary key and must rely on a strong entity through a relationship set. These are called weak entity sets and must have:
A discriminator (partial key) to differentiate among instances.
A total participation constraint, meaning they must be linked to a strong entity.
A supporting relationship, called an identifying relationship, that connects them to a strong entity.
Example: Consider an Employee-Dependent relationship. A Dependent (child/spouse) doesn’t have a unique identifier but can be identified using Employee_ID + Dependent_Name. Without linking to an Employee, the Dependent entity has no existence in the database.

Cardinalities & Relationship Constraints
Cardinality defines how many instances of an entity can be related to another. Understanding this ensures data integrity and efficient queries.
Types of Cardinality:
One-to-One (1:1): Each entity in A maps to at most one entity in B.
Example: A person has one passport, and each passport belongs to one person.
One-to-Many (1:M): An entity in A maps to multiple entities in B.
Example: A manager supervises multiple employees, but each employee has only one manager.
Many-to-Many (M:N): Each entity in A relates to multiple entities in B, and vice versa.
Example: Students enroll in multiple courses, and each course has multiple students.

Specialization vs. Generalization
As databases grow, organizing data becomes vital. This is where specialization and generalization help refine entity structures.
Specialization (Top-Down Approach):
We start with a generic entity and divide it into sub-entities based on distinguishing characteristics.
Example: A Vehicle entity specializes into Car and Bike . Cars have a fuel type, while bikes may not.
Generalization (Bottom-Up Approach):
Here, we merge multiple similar entities into a higher-level super-entity to avoid redundancy.
Example: A Doctor and a Nurse share common attributes (e.g., Name, Salary), so they generalize into MedicalStaff.
Why Does This Matter?
Weak entity sets prevent orphaned data in relationships.
Cardinalities enforce integrity, ensuring logical data mapping.
Specialization adds precision, while generalization reduces redundancy.

Mastering these concepts leads to better data normalization, query performance, and scalability!

Which of these have you used in your projects? Drop your thoughts in the comments!

100daysofcode lebanon-mug

Picture13690×3046 273 KB

Diana_Farhat · 2025-03-26T22:49:22.987Z

Day 64: Understanding the Relational Model and Ensuring Consistency

Databases are everywhere, powering applications that range from social media platforms to financial systems. But how do we make sure that the data inside them is reliable, consistent, and useful? Today, we’re diving into the relational model, one of the most robust ways to manage structured data. We’ll also explore how to maintain database consistency—a critical aspect that ensures your data remains trustworthy.

Relational Model Basics

The relational model, introduced by E. F. Codd in 1970, revolutionized data storage by structuring data into tables (relations). It offers a logical way to represent data independently from the physical storage. Let’s break down the essential terms in both informal and mathematical contexts:

Informal Term	Mathematical Term	Example
Table	Relation	Student information
Row (record)	Tuple	(123, ‘John’, ‘CS’)
Column	Attribute	Student ID, Name, Major
Data Type	Domain	Integer, String

The relational model is fundamentally about relations (or tables), where each relation consists of tuples (or rows), each described by a set of attributes (or columns). The domain of an attribute defines its possible values, like numbers or strings.

Consistent vs. Inconsistent Databases

Let’s say you manage a database of student records. A consistent database might have a student with ID 123 listed as “John Smith” in both the Enrollment and Grades tables. An inconsistent database could show the same ID linked to two different names across these tables. Such inconsistencies are more than just nuisances—they can undermine trust and break system functionality.

Maintaining Database Consistency

Maintaining consistency is crucial to ensure that data across tables and applications remains accurate and reliable. Here are some key techniques:

1. Normalization

Breaking data into smaller, non-redundant tables reduces the chances of inconsistency. Normalization ensures that one piece of information is stored only once.

2. Constraints

Apply integrity constraints like primary keys, foreign keys, and unique constraints to enforce data consistency. This means that records are uniquely identified and linked properly between tables.

3. ACID Properties

Database transactions should follow ACID (Atomicity, Consistency, Isolation, Durability) principles to ensure that operations either complete successfully or leave the database unchanged. This is especially important when performing multiple updates or batch operations.

4. Data Validation

Validate data both at the application level and database level. Use triggers or check constraints to automatically verify data before insertion or update.

5. Backup and Recovery

Maintaining consistency also involves periodic backups and implementing recovery mechanisms. This helps revert to a previous consistent state in case of system failures.

Common Pitfalls

Circular References: Linking tables in a circular way can result in inconsistencies and difficulties in maintaining data integrity.
Improper Use of NULL: Overuse or misuse of NULL values can lead to ambiguity in data interpretation.
Schema Drift: Unplanned changes to the database schema can introduce inconsistencies.

Key Takeaways

Maintaining a consistent database is not just about technical correctness but also about maintaining data integrity and trustworthiness. By understanding the relational model and implementing consistency practices, you can build reliable and scalable systems.

Got thoughts on relational models? Share your experiences or challenges in the comments below!

100daysofcode lebanon-mug

Diana_Farhat · 2025-03-27T22:31:13.284Z

Day 65 | SQL Basics: Schema, Tables, Primary & Foreign Keys Explained!

In the world of SQL, structuring your data efficiently is the key to building scalable and organized databases. Whether you’re just starting out or brushing up on your skills, understanding schemas, tables, primary keys, and foreign keys is crucial! Let’s dive into the essentials!

Schema

A schema is like a container for your database objects - think of it as an organizational unit! It holds tables, views, and other objects, allowing for better structure and access control.

Imagine you’re managing a company database. You might have a schema named CompanyDB to hold all related tables, such as employees, departments, and projects.

Syntax:

sql

CREATE SCHEMA CompanyDB;

Tables

Tables are where your data lives! They consist of rows and columns, each column having a specific data type (like INTEGER, VARCHAR, or DATE).

For example, in our company database, we might have:

Employee table for personal details

Dependent table for employee dependents

Department table for different departments

Project table for ongoing projects

WorksOn table to track which employee works on which project

Syntax:

sql

CREATE TABLE Employee (

emp_id INT PRIMARY KEY,

first_name VARCHAR(50),

last_name VARCHAR(50),

dept_id INT

);

Primary Key

A primary key uniquely identifies each row in a table. No two rows can have the same primary key, ensuring data integrity.

In the Employee table, the emp_id column is the primary key, making each employee uniquely identifiable.

Syntax:

sql

PRIMARY KEY (emp_id)

Foreign Key

A foreign key creates a link between two tables. It enforces relationships and maintains referential integrity between data. For instance, the WorksOn table needs to link employees to projects.

Syntax:

sql

CREATE TABLE WorksOn (

emp_id INT,

proj_id INT,

hours_worked DECIMAL(5,2),

FOREIGN KEY (emp_id) REFERENCES Employee(emp_id),

FOREIGN KEY (proj_id) REFERENCES Project(proj_id)

);

Example: Database Design

Here’s how the design fits together:

Employee table holds employee data.

Dependent table stores employee-dependent details.

Department table keeps department info.

DepLocation table tracks where departments are located.

Project table holds project details.

WorksOn table records which employees are assigned to which projects.

These tables are linked through primary and foreign keys, creating a robust relational database that minimizes redundancy!

Why It Matters

Efficient database design helps maintain data consistency and integrity. By leveraging schemas and relational keys, you’re building a scalable structure that can grow with your data needs.

Whether you’re a beginner or a pro, mastering these SQL fundamentals will set you up for success. Happy coding!

100daysofcode lebanon-mug

sql2250×1345 166 KB

Diana_Farhat · 2025-03-29T22:52:35.479Z

Day 66 |:rocket: Overcoming Imposter Syndrome as a Junior Software Engineer

Let’s talk about something many of us in tech rarely say out loud: Imposter Syndrome. That nagging feeling that you’re not good enough, that you don’t belong, or worse — that someone’s going to “find out” you’re faking it.

As a junior software engineer, I’ve felt it. You’ve probably felt it.

Why It’s So Common in Tech

Software engineering moves fast. Every day there’s a new framework, a new best practice, or a GitHub repo that makes you question your existence.

We work in environments that often reward output over learning, and it’s easy to feel like you’re falling behind — especially when:

You’re struggling to understand legacy code

You can’t fix a bug after 3 hours of trying

Everyone seems to “get it” except you

Spoiler: They don’t. They’re just googling faster.

Imposter Syndrome ≠ Incompetence

In fact, feeling like an imposter is often a sign of growth. You’re challenging yourself. You’re out of your comfort zone — and that’s where learning happens.

But it can be paralyzing if left unchecked.

What Actually Helps

Talk About It

Open up to teammates, mentors, or LinkedIn folks. You’ll be surprised how many people feel the same.

Join a CS Club or Tech Community

Seriously, don’t go through this journey alone. Whether it’s a university CS club, a local dev group, or an online community — surrounding yourself with others who are learning, building, and sharing is game-changing. You’ll learn faster, feel less isolated, and stay inspired.

Track Your Progress

Keep a “brag doc” — a list of bugs you fixed, features you shipped, or even concepts you understood better. Watch how far you’ve come!

Ask Questions — Fearlessly

Asking doesn’t make you look dumb. It shows you’re engaged and willing to grow.

Stay Curious & Excited

Let your passion lead you. Tinker with side projects, explore new tech, attend hackathons — curiosity is your superpower. The more excited you stay, the faster the fear fades.

Don’t Compare Your Chapter 1 to Someone Else’s Chapter 20

Your senior might seem like a wizard now, but they were once stuck on their first null pointer exception too.

Practice Self-Compassion

Tech is hard. You’re not supposed to know everything. You’re supposed to learn.

Final Thought

If you’re a junior SWE battling self-doubt, just remember:

You’re not an imposter. You’re a beginner. And beginners grow.

Stay curious. Stay excited. Keep learning. You’ve got this.

100daysofcode lebanon-mug

Diana_Farhat · 2025-03-31T22:36:00.898Z

Day 67 | Why Mastering DSA Still Matters in 2025

Whether you’re building scalable systems, optimizing a product, or cracking the next coding interview — Data Structures & Algorithms (DSA) remain foundational to success in tech. Yet many overlook it, dismissing it as “just interview prep” or “academic theory.” That mindset is costing developers long-term growth.
Here’s why DSA still matters — and why I’m starting this new series:
Problem Solving Muscle
At its core, DSA trains your brain to approach challenges methodically. It’s like going to the gym for your logic — improving how you think, not just what you code.
Real-World Optimization
Understanding time and space complexity isn’t just for whiteboard interviews. It translates directly to efficient code in real-life applications:
• A faster search algorithm in an e-commerce backend
• Memory-optimized data handling for edge devices
• Reduced latency in real-time systems
Systems Design Foundation
Before you scale, you simplify. Before you scale, you structure. Knowing when to use a hash map over a tree or why a heap can outperform a queue — that’s DSA in action. It gives you the building blocks that enable high-level design.
Interview-Ready, Yes — But Career-Ready Too
Mastering DSA isn’t just about passing tech interviews. It’s about having confidence when faced with ambiguous problems and being able to engineer clean, efficient, maintainable solutions.

What’s Next?
In the coming weeks, I’ll be diving into practical DSA topics:
Hidden performance traps in common algorithms
Real-world DSA use cases from backend, frontend, and data
Simplifying complex topics like recursion, graphs, and dynamic programming

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-01T19:38:16.859Z

Day 68 | Real-World Use Cases of DSA You’re Already Relying On

If you’ve ever asked yourself “When am I really going to use Data Structures and Algorithms?” — you’re not alone. For many professionals outside of competitive programming or academia, DSA can seem abstract. But the truth is, behind nearly every system we interact with, there’s a carefully crafted blend of DSA at work.

Here are 5 practical, real-world cases where DSA isn’t just useful — it’s essential:

Navigation Apps: Graphs in Action

Whether it’s Google Maps calculating the fastest route or Uber matching you with the nearest driver, graphs and shortest path algorithms (like Dijkstra’s) are the stars here. Roads become nodes and distances become weights. Efficient route planning = happy users.

Autocorrect & Search Suggestions: Tries & Heuristics

Typing “algor…” and getting “algorithm” as a suggestion? That’s not magic — it’s a Trie (prefix tree) behind the scenes. Combined with frequency data and edit distance algorithms (like Levenshtein), it helps your phone guess what you meant — even with typos.

Databases & Indexing: Trees and Hashing

Ever wondered how SQL queries return results in milliseconds? Thank B-trees and hash maps. Indexing structures speed up search and retrieval, especially in large datasets. Without them, your queries would take ages.

Social Media Feeds: Heaps, Queues & Graphs

Your Instagram or LinkedIn feed? Not random. It’s sorted based on relevance, engagement, or recency using priority queues, heaps, and sometimes even graph-based algorithms to suggest content from your extended network.

Cybersecurity & Network Routing: Queues, Trees, Graphs

Firewalls and routing protocols often rely on tries and prefix trees for IP matching. Queues and graphs are essential in packet routing and network traffic optimization, ensuring data gets from point A to point B without chaos.

TL;DR: DSA isn’t just academic — it’s operational. From your morning scroll to your late-night food delivery, algorithms are quietly at work. Mastering them isn’t about passing a coding test — it’s about understanding the systems that run the digital world.

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-03T18:57:32.779Z

Day 69 | Understanding Recursion in DSA (Beginner Friendly)

When you’re just starting your journey into Data Structures and Algorithms (DSA), one of the first powerful tools you’ll encounter is recursion. At first, it might seem confusing — functions calling themselves? But once you understand it, recursion becomes an elegant way to solve many complex problems with concise code.

What is Recursion?

Recursion is a method where the solution to a problem depends on solving smaller instances of the same problem.

In simple terms, a recursive function is one that calls itself.

To prevent infinite loops, every recursive function must have:

Base Case: The condition that stops the recursion.

Recursive Case: The part where the function calls itself with a smaller input.

Example: Factorial

python

def factorial(n):

if n == 0:         # Base case

    return 1

return n * factorial(n - 1)  # Recursive call

Calling factorial(5) will result in:

5 * 4 * 3 * 2 * 1 = 120

How Recursion Works (Call Stack)

Each recursive call is pushed onto the call stack, and the function resumes after each inner call returns. This is why understanding stack memory is important — too many calls can lead to a stack overflow.

Visualization

ruby

CopyEdit

factorial(3)

=> 3 * factorial(2)

    => 2 * factorial(1)

            => 1 * factorial(0)

                    => 1

As the calls resolve, they “unwind” from the stack.

When to Use Recursion

Recursion is ideal when:

A problem can be broken down into similar subproblems.

The problem naturally fits a divide-and-conquer approach.

The problem involves tree/graph traversal, permutations, or backtracking.

But keep in mind: recursion isn’t always efficient. Sometimes an iterative solution is better due to space concerns.

Tips to Master Recursion

Write down the base case before the recursive logic.

Use print statements to trace recursive calls.

Practice dry-running your function on paper.

Learn to convert recursive logic to iterative, and vice versa.

Final Thoughts

Recursion is a pillar of problem-solving in computer science. It helps you think recursively, which is essential for topics like divide and conquer, trees, and backtracking. Start with easy problems and gradually build up to more complex challenges. And most importantly, don’t be afraid of recursion — embrace it!

100daysofcode lebanon-mug

koch_snowflake800×240 7.14 KB

Diana_Farhat · 2025-04-06T19:53:04.692Z

Day 70: Mastering Recursion – From Basics to Brilliance

Recursion can be intimidating at first, but once it clicks, it becomes one of the most elegant and powerful tools in your coding arsenal. Whether you’re prepping for FAANG interviews or sharpening your CS fundamentals, mastering recursion is a must.

I’m sharing a curated list of Top Recursion Problems on LeetCode – sorted from beginner to advanced – that helped me build confidence and intuition. Let’s dive in!

Beginner Level – Build the Foundation

Start here to grasp the core concept: a function calling itself with a smaller input, and a base case to stop recursion.

Factorial of N – Implement the classic definition

LeetCode Recursion Basics

(Not a specific problem, but use this page to practice basics like factorial, power, and sum of array recursively)

Reverse a String

344. Reverse String

Fibonacci Number (Top-down vs. Bottom-up)

509. Fibonacci Number

Intermediate Level – Brute Force to Backtracking

Here’s where recursion gets interesting. You’ll encounter decision trees and multiple recursive calls.

Permutations

46. Permutations

Subsets (Power Set)

78. Subsets

Generate Parentheses – Backtracking meets recursion

22. Generate Parentheses

Letter Combinations of a Phone Number

17. Letter Combinations of a Phone Number

Advanced Level – Recursion with Pruning & State Tracking

Here we combine recursion with optimization tricks (memoization, state flags, etc.)

Word Search

79. Word Search

N-Queens – Classic CS problem

51. N-Queens

Palindrome Partitioning

131. Palindrome Partitioning

Restore IP Addresses

93. Restore IP Addresses

Expression Add Operators – Deep backtracking with arithmetic

282. Expression Add Operators

Bonus: Visual Tools to Learn Recursion

Use a debugger or draw recursion trees on paper.

Try Python Tutor: http://pythontutor.com/

Memoize and compare brute force vs. optimized versions.

Final Thoughts

Recursion isn’t just a topic — it’s a mindset. Tackling it daily rewires your brain to think declaratively. And as always, happy coding!

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-12T07:39:59.728Z

Day 71 of hashtag#100DaysOfCode – Arrays in Java with a Real-World Twist

Today, I will discuss the classic yet powerful data structure: arrays in Java. But instead of just printing numbers, let’s do something a bit more interesting.

Quick Recap: What’s an Array?
An array is a fixed-size, indexed data structure that holds elements of the same type. It’s fast, predictable, and memory-efficient — making it a go-to tool in low-level operations and algorithm-heavy scenarios.

Real-World Use Case: Detecting Duplicate Votes in a Poll
Say we’re building a small voting system for a student council election. Each student can vote once, but what if someone tries to vote twice?
We’ll simulate a system that flags duplicate voter IDs using a simple array approach.

Step 1: Simulate Voter IDs
java
CopyEdit
int voterIds = {102, 205, 102, 310, 412, 205}; // Duplicate IDs: 102 and 205

Step 2: Detect Duplicates Using Nested Loops
java
CopyEdit
for (int i = 0; i < voterIds.length; i++) {
for (int j = i + 1; j < voterIds.length; j++) {
if (voterIds[i] == voterIds[j]) {
System.out.println("Duplicate vote detected from ID: " + voterIds[i]);
}
}
}
Output:
csharp
CopyEdit
Duplicate vote detected from ID: 102
Duplicate vote detected from ID: 205
This is a brute-force approach (O(n²) time), but it’s a great demonstration of how arrays can power logic in real-world-like systems — even before you move into fancy data structures.

Why Arrays Still Matter
Despite being “basic,” arrays are the foundation for:
Efficient memory handling
Fixed-size buffers
Algorithm challenges (sorting, searching, etc.)
Under-the-hood operations in Java collections like ArrayList

Diana_Farhat · 2025-04-12T07:49:41.627Z

Day 72: Mastering the Two Pointer Technique in Arrays: A Must-Know DSA Pattern

If you’ve just moved past recursion in your DSA journey, it’s time to unlock one of the most elegant and efficient techniques used in array and string problems: the Two Pointer Technique.

It’s simple in concept, yet incredibly powerful when applied right. Let’s break it down with a classic problem that’s often asked in interviews.

The Problem: Two Sum in a Sorted Array

Given a sorted array of integers nums and a target integer target, return the 1-based indices of the two numbers that add up to the target.

You can assume exactly one solution exists.

Brute Force (O(n²))

A straightforward approach is to use a nested loop and check every pair. It works, but it’s inefficient—especially when input size grows. Interviewers usually look for more optimized thinking.

Optimized with Two Pointers (O(n))

Here’s where the two pointer technique shines. Since the array is sorted, we use two indices:

left starting at the beginning

right starting at the end

At each step:

If nums[left] + nums[right] == target → return the pair

If the sum is too small → move left rightward

If the sum is too big → move right leftward

python

CopyEdit

def twoSum(nums, target):

left, right = 0, len(nums) - 1

while left < right:

    curr_sum = nums[left] + nums[right]

    if curr_sum == target:

        return [left + 1, right + 1]

    elif curr_sum < target:

        left += 1

    else:

        right -= 1

Why this works: We’re leveraging the sorted nature of the array to discard irrelevant combinations in constant time. No extra space needed. Clean and efficient.

Where Else Can You Use Two Pointers?

Reversing an array in place

Checking for palindromes

Removing duplicates from a sorted array

Merging two sorted arrays

Trapping rain water (advanced)

When to Reach for This Technique

The data is sorted

You need to find pairs, windows, or symmetrical properties

You want to optimize space and time complexity

Final Thoughts

Two pointers teach you to reason from both ends—a skill that’s algorithmic and deeply strategic. It’s a go-to tool for coding interviews and competitive programming alike.

If you’ve already mastered recursion, two pointers is your next must-conquer concept. It’s intuitive, versatile, and essential in real-world code.

Next step? Try applying this to problems like “Container With Most Water” or “3Sum”. You’ll quickly see just how far this pattern can take you.

Let me know what your favorite two-pointer problem is—or if you’ve seen an interview question where this approach saved the day!

#DSA #CodingInterviews #Arrays #TwoPointers #TechBlog python #ProgrammingTips

Diana_Farhat · 2025-04-13T20:09:26.578Z

Day 73: The Sliding Window Technique — Why It’s a Must-Know for Every LeetCoder

Let’s say you’re given this simple problem:

“Find the maximum sum of any 3 consecutive numbers in an array.”

You have this array:

js

nums = [1, 2, 3, 4, 5, 6]

The brute-force way?

Check all groups of 3:

1+2+3 = 6

2+3+4 = 9

3+4+5 = 12

4+5+6 = 15

Answer: 15

But time complexity = O(n * k) if k is the window size.

Now imagine your array has 1 million numbers and you need the sum of every 1000 consecutive numbers — suddenly, brute force isn’t so cute.

Enter the Sliding Window Technique.

How It Works

You build a “window” of size k (in this case, 3), calculate the sum once, and then just “slide” the window one step at a time:

Initial sum: 1 + 2 + 3 = 6

Slide window right:

Remove 1 (leftmost)

Add 4 (next in array)

→ New sum: 6 - 1 + 4 = 9

Repeat:

Remove 2, add 5 → 9 - 2 + 5 = 12

Remove 3, add 6 → 12 - 3 + 6 = 15

Same result, but in O(n) time.

This is what Sliding Window does:

It avoids repetition by reusing previous calculations and only adjusting what changed — making it a go-to for efficient algorithms.

Where You’ll Use It on LeetCode

The Sliding Window technique shines in problems involving:

Subarrays or substrings

Consecutive or fixed-size elements

Dynamic tracking (length, sum, uniqueness)

Examples:

Longest Substring Without Repeating Characters

Maximum Sum Subarray of Size K

Minimum Size Subarray Sum

Permutation in String

Contains Duplicate II

Visualize It Like This:

Imagine dragging a box across your array or string.

At every move, you only care about the element that enters and the one that exits.

The rest of the window stays intact — so your calculations are fast, clean, and focused.

When to Reach for Sliding Window:

The question mentions “subarray” or “substring”

You’re given a length or range constraint

You need to find “maximum/minimum/longest/shortest” something

Brute force is too slow, and you want to cut it to O(n)

From Two Pointers to Sliding Window

If you’ve mastered the Two Pointer approach, Sliding Window is your next step.

They’re cousins — both involve scanning with two markers — but Sliding Window is like a smarter version that carries memory with it.

You don’t restart; you slide.

Diana_Farhat · 2025-04-14T12:49:02.784Z

From Naive Loops to O(1) Brilliance: The Power of Prefix Sums &

Difference Arrays

When I first started solving array problems, I always reached for loops. Want to find the sum of a subarray? Loop. Want to update a range of elements? Loop again.

But then I discovered something that changed everything — prefix sums and difference arrays. These techniques are all about one thing: Do a little work up front to save a lot of time later.

The Problem

Given an array, you’re asked repeatedly:

“What’s the sum of elements between index L and R?”

The naive approach:

js

CopyEdit

let sum = 0;

for (let i = L; i <= R; i++) sum += arr[i];

But that’s O(n) per query — not scalable.

Enter: Prefix Sums

One pass builds a prefix array:

js

CopyEdit

prefix[0] = arr[0];

for (let i = 1; i < arr.length; i++) {

prefix[i] = prefix[i - 1] + arr[i];

}

Now range sum is O(1):

js

CopyEdit

sum = prefix[R] - (L > 0 ? prefix[L - 1] : 0);

Range Updates with Difference Arrays

Need to add +10 to every number from index 2 to 5?

Instead of looping:

js

CopyEdit

diff[2] += 10;

diff[6] -= 10;

Apply a prefix sum to diff at the end to get the final array.

This is how we update ranges in O(1) time.

Real-Life Applications

Used in:

Range-based scoring in games

Bulk financial transactions

Efficient spreadsheet operations

Why It Matters

Prefix sums and diff arrays teach you to solve smarter, not harder.

They’re not just coding tricks — they’re a mindset:

Minimize repetition

Maximize efficiency

Think in preprocess → query cycles

Curious to Try?

Next time you’re about to loop through a subarray — pause.

There might be a better way waiting for you.

Let’s write code that thinks ahead.

#DSA #Arrays #CodingTips #BigO #LearningByDoing

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-15T20:15:45.610Z

Day 75: Mastering HashMaps for Problem Solving in DSA

If you’re diving into coding interviews or just want to level up your DSA skills, HashMaps (aka Hash Tables or Dictionaries) are a tool you need in your toolkit. They’re fast, flexible, and surprisingly fun to use once you get the hang of them.

Why HashMaps Matter

HashMaps let you store key-value pairs and access them in O(1) time. That’s a game-changer when you’re trying to solve problems quickly and efficiently.

Think of them as smart lockers—you instantly know where the key is without checking every locker.

Common Use Cases

Counting elements

→ E.g. {‘a’: 2, ‘b’: 1}

For problems like “First Unique Character”

Tracking indices

→ For “Two Sum”, store value → index

Avoiding repeated work

→ Use it in memoization during recursion

Example Problem: Two Sum (Classic)

Problem: Given an array and a target, return the indices of two numbers that add up to the target.

js

CopyEdit

const twoSum = (nums, target) => {

const map = {};

for (let i = 0; i < nums.length; i++) {

const diff = target - nums[i];

if (map[diff] !== undefined) {

  return [map[diff], i];

}

map[nums[i]] = i;

}

};

Uses a HashMap to check for the complement in O(1)

Pro Tip

Always ask yourself:

“Can I reduce the time complexity if I use a map to track values?”

Bonus Challenge to Try

Find the length of the longest substring without repeating characters.

Hint: You’ll need a HashMap AND a sliding window

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-16T15:13:32.732Z

Day 76: Set vs Map – When and Why to Use Each in JavaScript

When solving DSA problems or building real-world apps, choosing between a Set and a Map can feel trivial—but it’s not. These two data structures serve different purposes, and knowing when to use which can make your code cleaner and faster.

Map: The Lookup King
Stores key-value pairs

Keys can be any data type

Keeps insertion order

Access time: O(1)

Use a Map when:

You need to associate values with keys

You need quick lookups based on a key

You want to track counts, indices, or flags

js
Copy
Edit
const map = new Map();
map.set(‘apple’, 2);
map.get(‘apple’); // 2
Set: The Uniqueness Guardian
Stores only values

Each value must be unique

Also keeps insertion order

Access time: O(1)

Use a Set when:

You just need to store unique items

You want to check existence fast

You’re cleaning duplicates or tracking seen elements

js
Copy
Edit
const set = new Set([1, 2, 2, 3]);
console.log(set); // Set {1, 2, 3}
Real DSA Examples
Use a Set in Longest Substring Without Repeating Characters

Use a Map in Two Sum, Group Anagrams, Top K Frequent Elements

Quick Summary:

Use Case Set Map
Unique values only Yes No
Key-value pairs No Yes
Fast lookup Yes Yes
Track frequency/index Yes

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-17T10:28:37.448Z

Day 77: Memoization Magic – Speeding Up Recursion with Maps

Ever write a recursive function that works… but takes forever to run on big inputs? You’re not alone. That’s where memoization comes in. It’s like giving your function a short-term memory—so it doesn’t redo work it already did.

What is Memoization?
Memoization is a technique to cache the results of expensive function calls and return the cached result when the same inputs occur again.
You save time by not recalculating the same subproblem over and over.

Classic Example: Fibonacci (Without Memoization)
js
CopyEdit
function fib(n) {
if (n <= 1) return n;
return fib(n - 1) + fib(n - 2);
}
This has exponential time complexity: O(2ⁿ)

With Memoization Using Map
js
CopyEdit
function fib(n, memo = new Map()) {
if (memo.has(n)) return memo.get(n);
if (n <= 1) return n;
const result = fib(n - 1, memo) + fib(n - 2, memo);
memo.set(n, result);
return result;
}

Time complexity now is O(n)
The Map acts as a fast-access memory

When to Use It
Recursive solutions with overlapping subproblems
Dynamic Programming (especially top-down)

Problems like: Climbing Stairs, Coin Change, Edit Distance
TL;DR
Memoization = Smart caching
Map = Your function’s memory card
Next time recursion’s dragging you down, wrap it with a Map and feel the speed.

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-18T10:32:35.980Z

Day 78: Top-Down vs Bottom-Up DP – When to Pick What?
You’ve probably seen both styles of Dynamic Programming—top-down (with memoization) and bottom-up (with tabulation). But when should you use which? Let’s break it down.

Top-Down (Memoization)
Recursive + memoization (usually with a Map or array)
Solves only the necessary subproblems
Easier to write, more intuitive
js
CopyEdit
function climbStairs(n, memo = {}) {
if (n <= 2) return n;
if (memo[n]) return memo[n];
return memo[n] = climbStairs(n - 1, memo) + climbStairs(n - 2, memo);
}
Great for:
Problems with sparse subproblem usage
Quick implementation and clarity

Bottom-Up (Tabulation)
Iterative approach using a table/array
Solves all subproblems in order
Typically more space/time efficient
js
CopyEdit
function climbStairs(n) {
const dp = [1, 1];
for (let i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
Great for:
Performance-critical code
When full control over iteration is needed

Final Tip
Start with top-down when exploring a problem
Refactor to bottom-up if you hit time/space issues

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-20T13:33:16.673Z

Day 80: Clean API Practices – Because Your Backend Deserves Respect
Whether you’re building an internal tool or the next unicorn startup, your API is the bridge between your backend and the real world. And like any bridge—it better be clean, reliable, and consistent.
Let’s talk about a few simple but powerful practices to keep your APIs and your teammates (and future self) sane.

1. Use Proper HTTP Methods

ActionMethodGet dataGETCreate dataPOSTUpdate dataPUT / PATCHDelete dataDELETE
Don’t POST to delete something. Don’t GET to change a password. Respect the verbs.

2. Structure Your Routes Like a Pro
/api/users/123
/api/getUserById?userId=123
Follow RESTful patterns. Use nouns for resources, not verbs.

3. Consistent Response Format
Stick to a format like:
json
CopyEdit
{
“success”: true,
“data”: {…},
“message”: “User created successfully”
}
Don’t leave your frontend dev guessing. Consistency = clarity.

4. Handle Errors Gracefully
Return clear errors, like:
json
CopyEdit
{
“success”: false,
“message”: “Email already exists”
}
Also: don’t return 200 for failed actions. Use the right status codes (e.g., 400, 404, 500).

5. Validate Incoming Data
Before saving to DB, make sure inputs are legit. Use tools like Joi, Zod, or custom logic.
TL;DR
Follow REST
Be consistent
Return helpful errors
Validate everything

100daysofcode lebanon-mug

Diana_Farhat · 2025-04-21T19:58:21.192Z

Day 79: Taking a Break from DSA – Let’s Talk About Pagination and Clean Code

Today, let’s step away from recursion and grids and zoom in on something every dev should care about: Pagination. It’s not flashy, but it’s essential for clean, scalable, and user-friendly apps.
What is Pagination?
Pagination is the practice of breaking large datasets into smaller chunks (or “pages”) when returning data from a server. Think of it like serving content in manageable slices instead of overwhelming users (or your browser) with a massive dump.
Why It Matters
Performance:
Fetching 10 results is way faster than loading 10,000.
User Experience:
No one wants to scroll for eternity. Pages feel natural and keep interfaces snappy.
Scalability:
APIs that paginate are easier to maintain and prevent crashes under heavy traffic.
Example: Node.js + MongoDB
js
CopyEdit
const { page = 1, limit = 10 } = req.query;

const results = await Item.find()
.skip((page - 1) * limit)
.limit(limit);
That’s it! You’re telling Mongo:
“Skip the first (page - 1) * limit entries, and give me limit results.”
Pro Tip
Always return metadata with paginated results:
js
CopyEdit
{
results: […],
currentPage: 2,
totalPages: 5,
totalItems: 47
}
It’s clean, helpful, and frontend devs will love you for it.
Activate to view larger image,

Diana_Farhat · 2025-04-23T20:02:01.934Z

Day 81: Heaps & Priority Queues

Today I dove into Heaps, one of the most efficient data structures for priority-based tasks. A heap is a complete binary tree that satisfies the heap property — either max-heap or min-heap.

What is a Heap?

Min-Heap: The value of each node is less than or equal to the values of its children.

Max-Heap: The value of each node is greater than or equal to the values of its children.

Stored typically as an array for space efficiency and ease of access to parent/child nodes.

Applications of Heaps

Priority Queues

Dijkstra’s Algorithm

Median in a Data Stream

Top K Frequent Elements

Heap Sort

Java Implementation Using PriorityQueue (Min-Heap by default)

java

import java.util.*;

public class HeapExample {

public static void main(String[] args) {

    // Min-Heap

    PriorityQueue<Integer> minHeap = new PriorityQueue<>();

    minHeap.add(5);

    minHeap.add(1);

    minHeap.add(10);

    minHeap.add(3);



    while (!minHeap.isEmpty()) {

        System.out.print(minHeap.poll() + " ");

    }



    // Output: 1 3 5 10

}

}

Custom Max-Heap Using Comparator

java

PriorityQueue maxHeap = new PriorityQueue<>(Collections.reverseOrder());

maxHeap.add(5);

maxHeap.add(1);

maxHeap.add(10);

maxHeap.add(3);

while (!maxHeap.isEmpty()) {

System.out.print(maxHeap.poll() + " ");

}

// Output: 10 5 3 1

Key Takeaways

PriorityQueue in Java uses a binary heap under the hood.

For max-heap behavior, use a custom comparator or Collections.reverseOrder().

Time complexities:

Insertion: O(log n)

Deletion (poll): O(log n)

Peek (top element): O(1)

100daysofcode lebanon-mug

system · 2025-07-12T22:55:24.105Z

This topic was automatically closed after 180 days. New replies are no longer allowed.