DSA CHEAT SHEET - Save This!
Data Structures Asked in Every Tech Interview!

====================================

DSA is tested at Amazon, Google, Microsoft,
Flipkart, Adobe, Uber, Swiggy — ALL of them!
Master these before your placement rounds!

====================================
ARRAYS - Most Basic, Most Asked!

Two Sum -> HashMap O(n)
Find max/min -> linear scan O(n)
Reverse array -> two pointers O(n)
Find duplicates -> HashSet O(n)
Rotate by k -> reverse technique O(n)
Subarray sum -> sliding window O(n)
Merge sorted arrays -> two pointer O(n+m)

====================================
STRINGS

Palindrome check -> two pointers O(n)
Anagram check -> sort or HashMap O(n)
Longest substring no repeat -> sliding window
String reversal -> s[::-1] in Python
Count char frequency -> HashMap O(n)

====================================
LINKED LIST - Very Frequently Asked!

Reverse linked list -> 3 pointer trick O(n)
Detect cycle -> Floyd's slow/fast O(n)
Find middle -> slow/fast pointers O(n)
Merge 2 sorted lists -> compare & link O(n)
Remove Nth from end -> two pass O(n)

====================================
STACK & QUEUE

Stack (LIFO) - use for:
-> Valid parentheses {[()]}
-> Next Greater Element
-> Undo/Redo operations

Queue (FIFO) - use for:
-> BFS (level order tree traversal)
-> Sliding window maximum

====================================
TREES - 30% of Interview Questions!

Inorder: Left Root Right
Preorder: Root Left Right
Postorder: Left Right Root
Level Order: BFS using Queue

Height of tree -> recursion O(n)
Check BST valid -> inorder sorted check
Lowest Common Ancestor -> recursive O(n)
Path sum root to leaf -> DFS O(n)

====================================
GRAPHS

BFS -> Queue, shortest path unweighted
DFS -> Stack/Recursion, path finding
Detect cycle undirected -> Union Find
Detect cycle directed -> DFS + visited
Topological Sort -> Kahn's algo (BFS)

====================================
DYNAMIC PROGRAMMING

Fibonacci -> memoization O(n)
0/1 Knapsack -> 2D DP O(n*W)
Longest Common Subsequence -> 2D DP
Coin Change -> bottom-up DP O(n*amount)
Climb Stairs -> DP same as Fibonacci

====================================
TIME COMPLEXITY QUICK REFERENCE:

O(1) Constant | Array index
O(logn) Log | Binary search
O(n) Linear | Single loop
O(nlogn) Linearithmic | Merge sort
O(n2) Quadratic | Nested loops
O(2n) Exponential | Recursion tree

====================================
TOP DSA PRACTICE PLATFORMS:
LeetCode -> leetcode.com (must!)
GeeksForGeeks -> geeksforgeeks.org
HackerRank -> hackerrank.com
Codeforces -> codeforces.com

====================================
Save this - revise before every interview!
Get FREE projects with DSA implementations:
https://t.me/Projectwithsourcecodes

Share with your placement batch!

#DSACheatSheet #DSA #DataStructures #Algorithms
#LeetCode #CodingInterview #Placements #FAANG
#BTech2026 #MCA2026 #BCA2026 #CompetitiveCoding
#Java #Python #TechInterview #DynamicProgramming
#ProjectWithSourceCodes #StudentsOfIndia

GIT CHEAT SHEET - Save This!
Commands Every Developer Must Know!

====================================

Git is asked in EVERY tech interview!
TCS, Wipro, Infosys, startups, product cos
ALL expect you to know Git. Master these!

====================================
FIRST TIME SETUP

git config --global user.name 'Your Name'
git config --global user.email 'you@email.com'
-> Run once after installing Git

====================================
STARTING A PROJECT

git init
-> Start tracking a new project folder

git clone <url>
-> Download a repo from GitHub to your PC

====================================
DAILY COMMANDS (Use Every Day!)

git status
-> See which files changed or are new

git add .
-> Stage ALL changed files for commit

git add filename.py
-> Stage one specific file only

git commit -m 'Your message here'
-> Save your staged changes permanently

git push origin main
-> Upload your commits to GitHub

git pull origin main
-> Download latest changes from GitHub

====================================
BRANCHING - Important for Team Work!

git branch
-> List all branches in your repo

git branch feature-login
-> Create a new branch called feature-login

git checkout feature-login
-> Switch to that branch

git checkout -b feature-login
-> Create AND switch in ONE command!

git merge feature-login
-> Merge branch into your current branch

git branch -d feature-login
-> Delete branch after merging

====================================
UNDO MISTAKES - Life Savers!

git restore filename.py
-> Undo unsaved changes in a file

git reset HEAD~1
-> Undo last commit but keep the changes

git revert <commit-id>
-> Safely undo a commit already pushed

git stash
-> Temporarily hide your current changes

git stash pop
-> Bring back your stashed changes

====================================
VIEWING HISTORY

git log
-> Full commit history with details

git log --oneline
-> Short commit history (one line each)

git diff
-> See exactly what changed line by line

git blame filename.py
-> See who changed which line and when

====================================
TOP 5 GIT INTERVIEW QUESTIONS:

1. What is the difference between git merge
and git rebase?
2. What is a pull request and how does it work?
3. How do you resolve a merge conflict?
4. What is git stash and when do you use it?
5. Difference between git reset and git revert?

====================================
Save this post - revise before every interview!
Get FREE projects with Git setup included:
https://t.me/Projectwithsourcecodes

Share with your placement batch!

#GitCheatSheet #Git #GitHub #VersionControl
#GitCommands #DevTools #GitBranching
#BTech2026 #MCA2026 #BCA2026 #PlacementPrep
#CodingInterview #TechInterview #OpenSource
#ProjectWithSourceCodes #StudentsOfIndia

5 GITHUB REPOS TO CRACK CODING INTERVIEWS!
DSA - System Design - Get the Job

Placement season is coming. These free
GitHub repos have everything you need to
prepare and land your dream job. Links below!

#CodingInterview #DSA #Placement #GitHub
#BTech2026 #MCA2026 #BCA2026
#ProjectWithSourceCodes #StudentsOfIndia

5 GITHUB REPOS TO CRACK CODING INTERVIEWS
Free - Star & Start Preparing Today!

====================================

1. Coding Interview University (jwasham) - 355K stars
A complete CS study plan to become a software engineer
Best for: full roadmap from zero to interview-ready
https://github.com/jwasham/coding-interview-university

2. System Design Primer (donnemartin) - 356K stars
Learn to design large-scale systems + Anki flashcards
Best for: system design rounds (Amazon, Google, etc.)
https://github.com/donnemartin/system-design-primer

3. Tech Interview Handbook (yangshun) - 140K stars
Curated, to-the-point interview prep for busy engineers
Best for: quick, high-yield revision
https://github.com/yangshun/tech-interview-handbook

4. The Algorithms - Python (TheAlgorithms) - 222K stars
Every important algorithm implemented in Python
Best for: DSA practice & understanding code
https://github.com/TheAlgorithms/Python

5. Interviews (kdn251) - 65K stars
Everything you need to know to get the job
Best for: data structures, algorithms & DP patterns
https://github.com/kdn251/interviews

====================================
SMART PREP PLAN:

Pick ONE roadmap and follow it daily
Solve 2-3 problems every single day
Revise system design before product-company rounds
Push your solutions to GitHub = shows consistency!

====================================
Want ready-made projects with source code for your resume?
https://t.me/Projectwithsourcecodes

Share with your placement batch!

#CodingInterview #DSA #SystemDesign #Placement
#Algorithms #Python #LeetCode #GitHub #OpenSource
#BTech2026 #MCA2026 #BCA2026 #FinalYearProject
#ProjectWithSourceCodes #StudentsOfIndia

-1 → Perfect negative correlation

💡 Correlation does not necessarily mean causation.

---

2️⃣4️⃣ What is an Outlier?

👉 An outlier is a data point that is unusually far from the other observations in a dataset.

Example:

10, 12, 11, 13, 12, 150

Here, 150 may be an outlier.

Common methods to detect outliers:

🔹 IQR Method
🔹 Z-Score
🔹 Box Plot

---

2️⃣5️⃣ What is Data Scaling?

👉 Data scaling transforms numerical features into a comparable range so that algorithms that are sensitive to feature magnitude can work effectively.

Two common techniques:

🔹 Standardization
Transforms values based on mean and standard deviation.

🔹 Normalization
Often scales values to a specified range, such as 0 to 1.

💡 Scaling is especially important for algorithms based on distance or gradient optimization.

---

💬 Save this for your next Data Science interview prep!

🔥 Should Part 3 cover Statistics, Probability, Pandas, NumPy & Data Analysis Questions? 👇

#DataScience #AI #MachineLearning #DataAnalysis #Python #Pandas #NumPy #Statistics #InterviewQuestions #CodingInterview

🤖 AI & Data Science Interview Questions with Answers (Part 4)

4️⃣1️⃣ What is Supervised Learning?

👉 Supervised Learning is a Machine Learning approach where a model learns from labeled data, meaning the input data has a known output.

Examples:
• Email Spam Detection 📧
• House Price Prediction 🏠
• Disease Classification 🏥

📌 Input + Known Output → Training → Prediction

---

4️⃣2️⃣ What is Unsupervised Learning?

👉 Unsupervised Learning works with unlabeled data. The model tries to discover hidden patterns, structures, or groups within the data.

Common applications:

🔹 Customer Segmentation
🔹 Clustering
🔹 Anomaly Detection
🔹 Dimensionality Reduction

Example: Grouping customers based on their purchasing behavior.

---

4️⃣3️⃣ What is Reinforcement Learning?

👉 Reinforcement Learning is a Machine Learning approach where an agent learns by interacting with an environment and receiving rewards or penalties.

Key components:

🤖 Agent
🌍 Environment
🎯 Action
🏆 Reward
📊 State

Example: Training an AI agent to play a game by rewarding successful actions.

---

4️⃣4️⃣ What is Classification in Machine Learning?

👉 Classification is a supervised learning task where the model predicts a category or class.

Examples:

📧 Spam / Not Spam
💳 Fraud / Not Fraud
🐱 Cat / Dog
❤️ Positive / Negative Sentiment

Common algorithms include:

🔹 Logistic Regression
🔹 Decision Tree
🔹 Random Forest
🔹 Support Vector Machine
🔹 Neural Networks

---

4️⃣5️⃣ What is Regression in Machine Learning?

👉 Regression is a supervised learning task used to predict a continuous numerical value.

Examples:

🏠 House Price Prediction
📈 Sales Forecasting
🌡️ Temperature Prediction
💰 Salary Prediction

Common algorithms include:

🔹 Linear Regression
🔹 Decision Tree Regression
🔹 Random Forest Regression
🔹 Gradient Boosting

💡 Classification → Categories
💡 Regression → Numerical Values

---

💬 Save this for your next AI & Data Science interview prep!

🔥 Part 5 will cover 5 important questions on Overfitting, Underfitting, Train-Test Split, Cross-Validation & Model Evaluation.

#AI #ArtificialIntelligence #DataScience #MachineLearning #Python #ML #AIInterview #DataScienceInterview #InterviewQuestions #CodingInterview

🤖 AI & Data Science Interview Questions with Answers (Part 5)

4️⃣6️⃣ What is Overfitting in Machine Learning?

👉 Overfitting occurs when a model learns the training data too closely, including noise and random patterns, resulting in poor performance on unseen data.

📌 Training Accuracy → High
📌 Testing Accuracy → Low

Common solutions:
🔹 Use more training data
🔹 Regularization
🔹 Feature selection
🔹 Cross-validation
🔹 Reduce model complexity

---

4️⃣7️⃣ What is Underfitting?

👉 Underfitting occurs when a model is too simple to learn the important patterns in the data.

📌 Training Accuracy → Low
📌 Testing Accuracy → Low

Possible solutions:

🔹 Use a more complex model
🔹 Add useful features
🔹 Reduce excessive regularization
🔹 Train for longer when appropriate

💡 Overfitting = Model learns too much
💡 Underfitting = Model learns too little

---

4️⃣8️⃣ What is Train-Test Split?

👉 Train-Test Split divides a dataset into separate portions for training and evaluating a machine learning model.

Example:

from sklearn.model_selection import train_test_split

X_train, X_test, y_train, y_test = train_test_split(
    X, y, test_size=0.2, random_state=42
)

📌 80% → Training Data
📌 20% → Testing Data

💡 The test set should be kept separate from model training.

---

4️⃣9️⃣ What is Cross-Validation?

👉 Cross-validation is a technique used to evaluate a model by training and validating it on multiple different splits of the data.

A common method is K-Fold Cross-Validation.

Example:

Dataset
   ↓
Fold 1 → Validation
Fold 2 → Validation
Fold 3 → Validation
Fold 4 → Validation
Fold 5 → Validation

💡 It provides a more reliable estimate of model performance than relying on a single split.

---

5️⃣0️⃣ What is Model Evaluation?

👉 Model evaluation measures how well a machine learning model performs on data that was not used for training.

Common metrics include:

🔹 Accuracy → Overall correct predictions
🔹 Precision → Correct positive predictions among predicted positives
🔹 Recall → Correct positive predictions among actual positives
🔹 F1-Score → Balance between precision and recall
🔹 MAE / MSE / RMSE → Common regression metrics

📌 Choose the evaluation metric based on the problem and business objective, not just accuracy.

---

💬 Save this for your next AI & Data Science interview prep!

🔥 Part 6 will cover 5 important questions on Confusion Matrix, Precision, Recall, F1-Score & ROC-AUC.

#AI #ArtificialIntelligence #DataScience #MachineLearning #Python #ML #AIInterview #DataScienceInterview #InterviewQuestions #CodingInterview

📊 Data Analysis Interview Questions with Answers (Part 1)

1️⃣ What is Data Analysis?

👉 Data Analysis is the process of collecting, cleaning, transforming, and examining data to discover useful insights and support better decision-making.

📌 Raw Data → Cleaning → Analysis → Insights → Decision

Examples:
• Sales Analysis 📈
• Customer Analysis 👥
• Financial Analysis 💰
• Website Traffic Analysis 🌐

---

2️⃣ What are the Main Steps in Data Analysis?

👉 A typical data analysis workflow includes:

🔹 Data Collection
🔹 Data Cleaning
🔹 Data Exploration
🔹 Data Transformation
🔹 Data Visualization
🔹 Statistical Analysis
🔹 Insight Generation
🔹 Reporting

💡 The exact workflow can vary depending on the project and type of data.

---

3️⃣ What is Data Cleaning?

👉 Data Cleaning is the process of identifying and correcting inaccurate, incomplete, duplicate, or inconsistent data.

Common tasks include:

🔹 Handling missing values
🔹 Removing duplicates
🔹 Correcting data types
🔹 Handling outliers
🔹 Standardizing values

Example:

import pandas as pd

df = pd.read_csv("sales.csv")

df = df.drop_duplicates()
df["Sales"] = df["Sales"].fillna(0)

💡 Clean data is essential for reliable analysis.

---

4️⃣ What is Exploratory Data Analysis (EDA)?

👉 EDA is the process of understanding a dataset by examining its structure, distributions, relationships, and unusual patterns before deeper analysis.

Common EDA techniques:

📊 Summary Statistics
📈 Distribution Analysis
🔗 Correlation Analysis
📦 Outlier Detection
📉 Data Visualization

Example:

print(df.head())
print(df.info())
print(df.describe())

---

5️⃣ What is Data Visualization?

👉 Data Visualization is the process of representing data using charts and graphs so that trends, patterns, and comparisons are easier to understand.

Common visualizations:

📊 Bar Chart → Compare categories
📈 Line Chart → Show trends over time
🥧 Pie Chart → Show proportions
📦 Box Plot → Analyze distribution and outliers
🔵 Scatter Plot → Show relationships between variables

Popular Python libraries:

🔹 Matplotlib
🔹 Seaborn
🔹 Plotly

---

💬 Save this for your Data Analysis interview preparation!

🔥 Part 2 will cover 5 important questions on Mean, Median, Mode, Variance & Standard Deviation.

#DataAnalysis #DataAnalyst #Python #Pandas #SQL #DataScience #EDA #DataVisualization #InterviewQuestions #CodingInterview

🤖 Machine Learning Interview Questions with Answers (Part 1)

1️⃣ What is Machine Learning?

👉 Machine Learning (ML) is a branch of AI that enables computers to learn patterns from data and make predictions or decisions without being explicitly programmed for every case.

Examples:
• Spam Detection 📧
• Recommendation Systems 🎯
• Fraud Detection 💳
• House Price Prediction 🏠

📌 Data → Learning Algorithm → Model → Prediction

---

2️⃣ What are the Main Types of Machine Learning?

👉 Machine Learning is commonly divided into three major types:

🔹 Supervised Learning → Learns from labeled data
🔹 Unsupervised Learning → Finds patterns in unlabeled data
🔹 Reinforcement Learning → Learns through rewards and penalties

💡 The choice depends on the type of problem and available data.

---

3️⃣ What is Supervised Learning?

👉 Supervised Learning trains a model using input data along with known target outputs.

It is mainly used for:

🔹 Classification → Predict categories
🔹 Regression → Predict numerical values

Example:

from sklearn.linear_model import LinearRegression

model = LinearRegression()
model.fit(X_train, y_train)

prediction = model.predict(X_test)

---

4️⃣ What is Unsupervised Learning?

👉 Unsupervised Learning works with data that does not have labeled target values. The algorithm attempts to discover useful structure or patterns.

Common techniques:

🔹 Clustering
🔹 Dimensionality Reduction
🔹 Anomaly Detection

Example:

from sklearn.cluster import KMeans

model = KMeans(n_clusters=3, random_state=42)
model.fit(X)

labels = model.labels_

💡 No target labels → Discover hidden patterns

---

5️⃣ What is Reinforcement Learning?

👉 Reinforcement Learning is a learning approach where an agent interacts with an environment and learns which actions are useful through rewards or penalties.

Key components:

🤖 Agent
🌍 Environment
📍 State
🎯 Action
🏆 Reward

Example:

A game-playing AI receives a reward for making successful moves and learns a strategy over time.

---

💬 Save this for your next Machine Learning interview!

🔥 Part 2 will cover 5 important questions on Linear Regression, Logistic Regression, Decision Trees, Random Forest & KNN.

#MachineLearning #ML #AI #ArtificialIntelligence #Python #DataScience #MLInterview #InterviewQuestions #CodingInterview #Programming

🚀 Advanced Coding Interview Questions with Answers (Part 1)

1️⃣ Find the Longest Substring Without Repeating Characters

👉 Given a string, find the length of the longest substring containing no duplicate characters.

def longest_unique_substring(s):
    seen = set()
    left = 0
    max_length = 0

    for right in range(len(s)):
        while s[right] in seen:
            seen.remove(s[left])
            left += 1

        seen.add(s[right])
        max_length = max(max_length, right - left + 1)

    return max_length

print(longest_unique_substring("abcabcbb"))

📌 Output:

3

⏱ Time Complexity: O(n)
💾 Space Complexity: O(n)

---

2️⃣ Find the Kth Largest Element in an Array

👉 Find the Kth largest element without completely sorting the array.

import heapq

def kth_largest(nums, k):
    heap = nums[:k]
    heapq.heapify(heap)

    for num in nums[k:]:
        if num > heap[0]:
            heapq.heapreplace(heap, num)

    return heap[0]

print(kth_largest([3, 2, 1, 5, 6, 4], 2))

📌 Output:

5

⏱ Time Complexity: O(n log k)
💾 Space Complexity: O(k)

---

3️⃣ Detect a Cycle in a Linked List

👉 Determine whether a linked list contains a cycle using Floyd's Cycle Detection Algorithm.

def has_cycle(head):
    slow = head
    fast = head

    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next

        if slow == fast:
            return True

    return False

💡 The slow pointer moves one step while the fast pointer moves two steps.

⏱ Time Complexity: O(n)
💾 Space Complexity: O(1)

---

4️⃣ Find the Maximum Subarray Sum

👉 Find the contiguous subarray with the largest sum using Kadane's Algorithm.

def max_subarray_sum(nums):
    current = nums[0]
    maximum = nums[0]

    for num in nums[1:]:
        current = max(num, current + num)
        maximum = max(maximum, current)

    return maximum

print(max_subarray_sum([-2, 1, -3, 4, -1, 2, 1, -5, 4]))

📌 Output:

6

⏱ Time Complexity: O(n)
💾 Space Complexity: O(1)

---

5️⃣ Merge Overlapping Intervals

👉 Given a collection of intervals, merge all overlapping intervals.

def merge_intervals(intervals):
    intervals.sort(key=lambda x: x[0])
    merged = []

    for start, end in intervals:
        if not merged or start > merged[-1][1]:
            merged.append([start, end])
        else:
            merged[-1][1] = max(merged[-1][1], end)

    return merged

print(merge_intervals([[1, 3], [2, 6], [8, 10], [9, 12]]))

📌 Output:

[[1, 6], [8, 12]]

⏱ Time Complexity: O(n log n)
💾 Space Complexity: O(n)

---

💬 Save this for your advanced coding interview preparation!

🔥 Part 2 will cover 5 harder problems on Binary Search, Dynamic Programming, Graphs, Backtracking & Sliding Window.

#Coding #CodingInterview #Python #DSA #AdvancedCoding #Algorithms #DynamicProgramming #Graphs #Programming #TechInterview