Skip to content
geeksforgeeks
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Tutorials
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
  • Practice
    • Build your AI Agent
    • GfG 160
    • Problem of the Day
    • Practice Coding Problems
    • GfG SDE Sheet
  • Contests
    • Accenture Hackathon (Ending Soon!)
    • GfG Weekly [Rated Contest]
    • Job-A-Thon Hiring Challenge
    • All Contests and Events
  • Data Science
  • Data Science Projects
  • Data Analysis
  • Data Visualization
  • Machine Learning
  • ML Projects
  • Deep Learning
  • NLP
  • Computer Vision
  • Artificial Intelligence
Open In App
Next Article:
Top 15 Machine Learning Algorithms Every Data Scientist Should Know in 2025
Next article icon

Machine Learning Algorithms

Last Updated : 21 Apr, 2025
Comments
Improve
Suggest changes
Like Article
Like
Report

Machine learning algorithms are essentially sets of instructions that allow computers to learn from data, make predictions, and improve their performance over time without being explicitly programmed. Machine learning algorithms are broadly categorized into three types:

  • Supervised Learning: Algorithms learn from labeled data, where the input-output relationship is known.
  • Unsupervised Learning: Algorithms work with unlabeled data to identify patterns or groupings.
  • Reinforcement Learning: Algorithms learn by interacting with an environment and receiving feedback in the form of rewards or penalties.

Machine-Learning-Algorithms1-(1)

Supervised Learning Algorithms

Supervised learning algos are trained on datasets where each example is paired with a target or response variable, known as the label. The goal is to learn a mapping function from input data to the corresponding output labels, enabling the model to make accurate predictions on unseen data. Supervised learning problems are generally categorized into two main types: Classification and Regression. Most widely used supervised learning algorithms are:

1. Linear Regression

Linear regression is used to predict a continuous value by finding the best-fit straight line between input (independent variable) and output (dependent variable)

  • Minimizes the difference between actual values and predicted values using a method called "least squares" to to best fit the data.
  • Predicting a person’s weight based on their height or predicting house prices based on size.

2. Logistic Regression

Logistic regression predicts probabilities and assigns data points to binary classes (e.g., spam or not spam).

  • It uses a logistic function (S-shaped curve) to model the relationship between input features and class probabilities.
  • Used for classification tasks (binary or multi-class).
  • Outputs probabilities to classify data into categories.
  • Example : Predicting whether a customer will buy a product online (yes/no) or diagnosing if a person has a disease (sick/not sick).

Note : Despite its name, logistic regression is used for classification tasks, not regression.

3. Decision Trees

A decision tree splits data into branches based on feature values, creating a tree-like structure.

  • Each decision node represents a feature; leaf nodes provide the final prediction.
  • The process continues until a final prediction is made at the leaf nodes
  • Works for both classification and regression tasks.

For more decision tree algorithms, you can explore:

  • Iterative Dichotomiser 3 (ID3) Algorithms
  • C5. Algorithms
  • Classification and Regression Trees Algorithms

4. Support Vector Machines (SVM)

SVMs find the best boundary (called a hyperplane) that separates data points into different classes.

  • Uses support vectors (critical data points) to define the hyperplane.
  • Can handle linear and non-linear problems using kernel functions.
  • focuses on maximizing the margin between classes, making it robust for high-dimensional data or complex patterns.

5. k-Nearest Neighbors (k-NN)

KNN is a simple algorithm that predicts the output for a new data point based on the similarity (distance) to its nearest neighbors in the training dataset, used for both classification and regression tasks.

  • Calculates distance between point with existing data points in training dataset using a distance metric (e.g., Euclidean, Manhattan, Minkowski)
  • identifies k nearest neighbors to new data point based on the calculated distances.
    • For classification, algorithm assigns class label that is most common among its k nearest neighbors.
    • For regression, the algorithm predicts the value as the average of the values of its k nearest neighbors.

6. Naive Bayes

Based on Bayes' theorem and assumes all features are independent of each other (hence "naive")

  • Calculates probabilities for each class and assigns the most likely class to a data point.
  • Assumption of feature independence might not hold in all cases ( rarely true in real-world data )
  • Works well for high-dimensional data.
  • Commonly used in text classification tasks like spam filtering : Naive Bayes

7. Random Forest

Random forest is an ensemble method that combines multiple decision trees.

  • Uses random sampling and feature selection for diversity among trees.
  • Final prediction is based on majority voting (classification) or averaging (regression).
  • Advantages : reduces overfitting compared to individual decision trees.
  • Handles large datasets with higher dimensionality.

For in-depth understanding : What is Ensemble Learning? - Two types of ensemble methods in ML

7. Gradient Boosting (e.g., XGBoost, LightGBM, CatBoost)

These algorithms build models sequentially, meaning each new model corrects errors made by previous ones. Combines weak learners (like decision trees) to create a strong predictive model. Effective for both regression and classification tasks. : Gradient Boosting in ML

  • XGBoost (Extreme Gradient Boosting) : Advanced version of Gradient Boosting that includes regularization to prevent overfitting. Faster than traditional Gradient Boosting, for large datasets.
  • LightGBM (Light Gradient Boosting Machine): Uses a histogram-based approach for faster computation and supports categorical features natively.
  • CatBoost: Designed specifically for categorical data, with built-in encoding techniques. Uses symmetric trees for faster training and better generalization.

For more ensemble learning and gradient boosting approaches, explore:

  • AdaBoost
  • Stacking - ensemble learning

8. Neural Networks ( Including Multilayer Perceptron)

Neural Networks, including Multilayer Perceptrons (MLPs), are considered part of supervised machine learning algorithms as they require labeled data to train and learn the relationship between input and desired output; network learns to minimize the error using backpropagation algorithm to adjust weights during training.

  • Multilayer Perceptron (MLP): Neural network with multiple layers of nodes.
  • Used for both classification and regression ( Examples: image classification, spam detection, and predicting numerical values like stock prices or house prices)

For in-depth understanding : Supervised multi-layer perceptron model - What is perceptron?

Unsupervised Learning Algorithms

Unsupervised learning algos works with unlabeled data to discover hidden patterns or structures without predefined outputs. These are again divided into three main categories based on their purpose: Clustering, Association Rule Mining, and Dimensionality Reduction. First we'll see algorithms for Clustering, then dimensionality reduction and at last association.

1. Clustering

Clustering algorithms group data points into clusters based on their similarities or differences. The goal is to identify natural groupings in the data. Clustering algorithms are divided into multiple types based on the methods they use to group data. These types include Centroid-based methods, Distribution-based methods, Connectivity-based methods, and Density-based methods. For resources and in-depth understanding, go through the links below.

  • Centroid-based Methods: Represent clusters using central points, such as centroids or medoids.
    • K-Means clustering: Divides data into k clusters by iteratively assigning points to nearest centers, assuming spherical clusters.
    • K-Means++ clustering
    • K-Mode clustering
    • Fuzzy C-Means (FCM) Clustering
  • Distribution-based Methods
    • Gaussian mixture models (GMMs) : Models clusters as overlapping Gaussian distributions, assigning probabilities for data points' cluster membership.
    • Expectation-Maximization Algorithms
    • Dirichlet process mixture models (DPMMs)
  • Connectivity based methods
    • Hierarchical clustering : Builds a tree-like structure (dendrogram) by merging or splitting clusters, no predefined number.
      • Agglomerative Clustering
      • Divisive clustering
    • Affinity propagation
  • Density Based methods
    • DBSCAN (Density-Based Spatial Clustering of Applications with Noise) : Forms clusters based on density, allowing arbitrary shapes and detecting outliers, with distance and point parameters.
    • OPTICS (Ordering Points To Identify the Clustering Structure)

2. Dimensionality Reduction

Dimensionality reduction is used to simplify datasets by reducing the number of features while retaining the most important information.

  • Principal Component Analysis (PCA): Transforms data into a new set of orthogonal features (principal components) that capture the maximum variance.
  • t-distributed Stochastic Neighbor Embedding (t-SNE): Reduces dimensions for visualizing high-dimensional data, preserving local relationships.
  • Non-negative Matrix Factorization (NMF) : Factorizes data into non-negative components, useful for sparse data like text or images.
  • Independent Component Analysis (ICA)
  • Isomap : Preserves geodesic distances to capture non-linear structures in data.
  • Locally Linear Embedding (LLE) : Preserves local relationships by reconstructing data points from their neighbors.
  • Latent Semantic Analysis (LSA) : Reduces the dimensionality of text data, revealing hidden patterns.
  • Autoencoders : Neural networks that compress and reconstruct data, useful for feature learning and anomaly detection.

3. Association Rule

Find patterns (called association rules) between items in large datasets, typically in market basket analysis (e.g., finding that people who buy bread often buy butter). It identifies patterns based solely on the frequency of item occurrences and co-occurrences in the dataset.

  • Apriori algorithm : Finds frequent itemsets by iterating through data and pruning non-frequent item combinations.
  • FP-Growth (Frequent Pattern-Growth) : Efficiently mines frequent itemsets using a compressed FP-tree structure without candidate generation.
  • ECLAT (Equivalence Class Clustering and bottom-up Lattice Traversal) : Uses vertical data format for faster frequent pattern discovery through efficient intersection of itemsets.

Reinforcement Learning Algorithms

Reinforcement learning involves training agents to make a sequence of decisions by rewarding them for good actions and penalizing them for bad ones. Broadly categorized into Model-Based and Model-Free methods, these approaches differ in how they interact with the environment.

1. Model-Based Methods

These methods use a model of the environment to predict outcomes and help the agent plan actions by simulating potential results.

  • Markov decision processes (MDPs)
  • Bellman equation
  • Value iteration algorithm
  • Monte Carlo Tree Search

2. Model-Free Methods

These methods do not build or rely on an explicit model of the environment. Instead, the agent learns directly from experience by interacting with the environment and adjusting its actions based on feedback. Model-Free methods can be further divided into Value-Based and Policy-Based methods:

  • Value-Based Methods: Focus on learning the value of different states or actions, where the agent estimates the expected return from each action and selects the one with the highest value.
    • Q-Learning
    • SARSA
    • Monte Carlo Methods
  • Policy-based Methods: Directly learn a policy (a mapping from states to actions) without estimating values where the agent continuously adjusts its policy to maximize rewards.
    • REINFORCE Algorithm
    • Actor-Critic Algorithm
    • Asynchronous Advantage Actor-Critic (A3C)

Discover the Top 15 Machine Learning Algorithms for Interview Preparation.


Next Article
Top 15 Machine Learning Algorithms Every Data Scientist Should Know in 2025
author
kartik
Improve
Article Tags :
  • Machine Learning
  • AI-ML-DS
  • AI-ML-DS With Python
  • ML Algorithms
Practice Tags :
  • Machine Learning

Similar Reads

  • Machine Learning Algorithms
    Machine learning algorithms are essentially sets of instructions that allow computers to learn from data, make predictions, and improve their performance over time without being explicitly programmed. Machine learning algorithms are broadly categorized into three types: Supervised Learning: Algorith
    8 min read
  • Top 15 Machine Learning Algorithms Every Data Scientist Should Know in 2025
    Machine Learning (ML) Algorithms are the backbone of everything from Netflix recommendations to fraud detection in financial institutions. These algorithms form the core of intelligent systems, empowering organizations to analyze patterns, predict outcomes, and automate decision-making processes. Wi
    15 min read
  • Linear Model Regression

    • Ordinary Least Squares (OLS) using statsmodels
      Ordinary Least Squares (OLS) is a widely used statistical method for estimating the parameters of a linear regression model. It minimizes the sum of squared residuals between observed and predicted values. In this article we will learn how to implement Ordinary Least Squares (OLS) regression using P
      3 min read

    • Linear Regression (Python Implementation)
      Linear regression is a statistical method that is used to predict a continuous dependent variable i.e target variable based on one or more independent variables. This technique assumes a linear relationship between the dependent and independent variables which means the dependent variable changes pr
      14 min read

    • ML | Multiple Linear Regression using Python
      Linear regression is a fundamental statistical method widely used for predictive analysis. It models the relationship between a dependent variable and a single independent variable by fitting a linear equation to the data. Multiple Linear Regression is an extension of this concept that allows us to
      4 min read

    • Polynomial Regression ( From Scratch using Python )
      Prerequisites Linear RegressionGradient DescentIntroductionLinear Regression finds the correlation between the dependent variable ( or target variable ) and independent variables ( or features ). In short, it is a linear model to fit the data linearly. But it fails to fit and catch the pattern in no
      5 min read

    • Bayesian Linear Regression
      Linear regression is based on the assumption that the underlying data is normally distributed and that all relevant predictor variables have a linear relationship with the outcome. But In the real world, this is not always possible, it will follows these assumptions, Bayesian regression could be the
      11 min read

    • How to Perform Quantile Regression in Python
      In this article, we are going to see how to perform quantile regression in Python. Linear regression is defined as the statistical method that constructs a relationship between a dependent variable and an independent variable as per the given set of variables. While performing linear regression we a
      4 min read

    • Isotonic Regression in Scikit Learn
      Isotonic regression is a regression technique in which the predictor variable is monotonically related to the target variable. This means that as the value of the predictor variable increases, the value of the target variable either increases or decreases in a consistent, non-oscillating manner. Mat
      6 min read

    • Stepwise Regression in Python
      Stepwise regression is a method of fitting a regression model by iteratively adding or removing variables. It is used to build a model that is accurate and parsimonious, meaning that it has the smallest number of variables that can explain the data. There are two main types of stepwise regression: F
      6 min read

    • Least Angle Regression (LARS)
      Regression is a supervised machine learning task that can predict continuous values (real numbers), as compared to classification, that can predict categorical or discrete values. Before we begin, if you are a beginner, I highly recommend this article. Least Angle Regression (LARS) is an algorithm u
      3 min read

    Linear Model Classification

    • Logistic Regression in Machine Learning
      In our previous discussion, we explored the fundamentals of machine learning and walked through a hands-on implementation of Linear Regression. Now, let's take a step forward and dive into one of the first and most widely used classification algorithms — Logistic Regression What is Logistic Regressi
      13 min read

    • Understanding Activation Functions in Depth
      In artificial neural networks, the activation function of a neuron determines its output for a given input. This output serves as the input for subsequent neurons in the network, continuing the process until the network solves the original problem. Consider a binary classification problem, where the
      6 min read

    Regularization

    • Implementation of Lasso Regression From Scratch using Python
      Lasso Regression (Least Absolute Shrinkage and Selection Operator) is a linear regression technique that combines prediction with feature selection. It does this by adding a penalty term to the cost function shrinking less relevant feature's coefficients to zero. This makes it effective for high-dim
      7 min read

    • Implementation of Ridge Regression from Scratch using Python
      Prerequisites: Linear Regression Gradient Descent Introduction: Ridge Regression ( or L2 Regularization ) is a variation of Linear Regression. In Linear Regression, it minimizes the Residual Sum of Squares ( or RSS or cost function ) to fit the training examples perfectly as possible. The cost funct
      4 min read

    • Implementation of Elastic Net Regression From Scratch
      Prerequisites: Linear RegressionGradient DescentLasso & Ridge RegressionIntroduction: Elastic-Net Regression is a modification of Linear Regression which shares the same hypothetical function for prediction. The cost function of Linear Regression is represented by J. [Tex]\frac{1}{m} \sum_{i=1}^
      5 min read

    K-Nearest Neighbors (KNN)

    • Implementation of Elastic Net Regression From Scratch
      Prerequisites: Linear RegressionGradient DescentLasso & Ridge RegressionIntroduction: Elastic-Net Regression is a modification of Linear Regression which shares the same hypothetical function for prediction. The cost function of Linear Regression is represented by J. [Tex]\frac{1}{m} \sum_{i=1}^
      5 min read

    • Brute Force Approach and its pros and cons
      In this article, we will discuss the Brute Force Algorithm and what are its pros and cons. What is the Brute Force Algorithm?A brute force algorithm is a simple, comprehensive search strategy that systematically explores every option until a problem's answer is discovered. It's a generic approach to
      3 min read

    • Implementation of KNN classifier using Scikit - learn - Python
      K-Nearest Neighbors is a most simple but fundamental classifier algorithm in Machine Learning. It is under the supervised learning category and used with great intensity for pattern recognition, data mining and analysis of intrusion. It is widely disposable in real-life scenarios since it is non-par
      3 min read

    • Regression using k-Nearest Neighbors in R Programming
      Machine learning is a subset of Artificial Intelligence that provides a machine with the ability to learn automatically without being explicitly programmed. The machine in such cases improves from the experience without human intervention and adjusts actions accordingly. It is primarily of 3 types:
      5 min read

    Support Vector Machines

    • Support Vector Machine (SVM) Algorithm
      Support Vector Machine (SVM) is a supervised machine learning algorithm used for classification and regression tasks. While it can handle regression problems, SVM is particularly well-suited for classification tasks. SVM aims to find the optimal hyperplane in an N-dimensional space to separate data
      10 min read

    • Classifying data using Support Vector Machines(SVMs) in Python
      Introduction to SVMs: In machine learning, support vector machines (SVMs, also support vector networks) are supervised learning models with associated learning algorithms that analyze data used for classification and regression analysis. A Support Vector Machine (SVM) is a discriminative classifier
      4 min read

    • Support Vector Regression (SVR) using Linear and Non-Linear Kernels in Scikit Learn
      Support vector regression (SVR) is a type of support vector machine (SVM) that is used for regression tasks. It tries to find a function that best predicts the continuous output value for a given input value. SVR can use both linear and non-linear kernels. A linear kernel is a simple dot product bet
      5 min read

    • Major Kernel Functions in Support Vector Machine (SVM)
      In previous article we have discussed about SVM(Support Vector Machine) in Machine Learning. Now we are going to learn  in detail about SVM Kernel and Different Kernel Functions and its examples. Types of SVM Kernel FunctionsSVM algorithm use the mathematical function defined by the kernel. Kernel F
      4 min read

  • ML | Stochastic Gradient Descent (SGD)
    Stochastic Gradient Descent (SGD) is an optimization algorithm in machine learning, particularly when dealing with large datasets. It is a variant of the traditional gradient descent algorithm but offers several advantages in terms of efficiency and scalability, making it the go-to method for many d
    8 min read
  • Decision Tree

    • Major Kernel Functions in Support Vector Machine (SVM)
      In previous article we have discussed about SVM(Support Vector Machine) in Machine Learning. Now we are going to learn  in detail about SVM Kernel and Different Kernel Functions and its examples. Types of SVM Kernel FunctionsSVM algorithm use the mathematical function defined by the kernel. Kernel F
      4 min read

    • CART (Classification And Regression Tree) in Machine Learning
      CART( Classification And Regression Trees) is a variation of the decision tree algorithm. It can handle both classification and regression tasks. Scikit-Learn uses the Classification And Regression Tree (CART) algorithm to train Decision Trees (also called “growing” trees). CART was first produced b
      11 min read

    • Decision Tree Classifiers in R Programming
      Classification is the task in which objects of several categories are categorized into their respective classes using the properties of classes. A classification model is typically used to, Predict the class label for a new unlabeled data objectProvide a descriptive model explaining what features ch
      4 min read

    • Decision Tree Regression using sklearn - Python
      Decision Tree Regression is a method used to predict continuous values like prices or scores by using a tree-like structure. It works by splitting the data into smaller parts based on simple rules taken from the input features. These splits help reduce errors in prediction. At the end of each branch
      3 min read

    Ensemble Learning

    • Ensemble Methods in Python
      Ensemble means a group of elements viewed as a whole rather than individually. An Ensemble method creates multiple models and combines them to solve it. Ensemble methods help to improve the robustness/generalizability of the model. In this article, we will discuss some methods with their implementat
      11 min read

    • Random Forest Regression in Python
      A random forest is an ensemble learning method that combines the predictions from multiple decision trees to produce a more accurate and stable prediction. It is a type of supervised learning algorithm that can be used for both classification and regression tasks. In regression task we can use Rando
      9 min read

    • ML | Extra Tree Classifier for Feature Selection
      Prerequisites: Decision Tree Classifier Extremely Randomized Trees Classifier(Extra Trees Classifier) is a type of ensemble learning technique which aggregates the results of multiple de-correlated decision trees collected in a "forest" to output it's classification result. In concept, it is very si
      6 min read

    • Implementing the AdaBoost Algorithm From Scratch
      AdaBoost means Adaptive Boosting and it is a is a powerful ensemble learning technique that combines multiple weak classifiers to create a strong classifier. It works by sequentially adding classifiers to correct the errors made by previous models giving more weight to the misclassified data points.
      3 min read

    • XGBoost
      Traditional machine learning models like decision trees and random forests are easy to interpret but often struggle with accuracy on complex datasets. XGBoost, short for eXtreme Gradient Boosting, is an advanced machine learning algorithm designed for efficiency, speed, and high performance. What is
      9 min read

    • CatBoost in Machine Learning
      When working with machine learning, we often deal with datasets that include categorical data. We use techniques like One-Hot Encoding or Label Encoding to convert these categorical features into numerical values. However One-Hot Encoding can lead to sparse matrix and cause overfitting. This is wher
      7 min read

    • LightGBM (Light Gradient Boosting Machine)
      LightGBM is an open-source high-performance framework developed by Microsoft. It is an ensemble learning framework that uses gradient boosting method which constructs a strong learner by sequentially adding weak learners in a gradient descent manner. It's designed for efficiency, scalability and hig
      7 min read

    • Stacking in Machine Learning
      Machine learning uses ensemble methods to combine multiple models and improve overall performance. These methods uses the strengths of various models to create a more robust solution. Some of the most popular ensemble techniques include Bagging and Boosting. Bagging trains multiple similar models an
      2 min read

geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences