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
    • GfG 160: Daily DSA
    • Problem of the Day
    • Practice Coding Problems
    • GfG SDE Sheet
  • HTML Cheat Sheet
  • CSS Cheat Sheet
  • JS Cheat Sheet
  • Bootstrap Cheat Sheet
  • jQuery Cheat Sheet
  • Angular Cheat Sheet
  • SDE Sheet
  • Facebook SDE Sheet
  • Amazon SDE Sheet
  • Apple SDE Sheet
  • Netflix SDE Sheet
  • Google SDE Sheet
  • Wipro SDE Sheet
  • Infosys SDE Sheet
  • TCS SDE Sheet
  • Cognizant SDE Sheet
  • HCL SDE Sheet
  • Mass Recruiters Sheet
  • Product-Based Coding Sheet
  • Company-Wise Practice Sheet
  • Love Babbar Sheet
Open In App
Next Article:
DSA Tutorial - Learn Data Structures and Algorithms
Next article icon

SDE SHEET - A Complete Guide for SDE Preparation

Last Updated : 28 May, 2025
Comments
Improve
Suggest changes
Like Article
Like
Report

Here is a curated list of the most popular questions among important topics, such as Programming Languages, Data Structure and Algorithms (DSA), CS Subjects, Aptitude, etc, asked in the Software Development Engineer Interviews.  

  • This sheet contains a wide range of coding questions from different Data Structures and Algorithms.
  • It covers all the segments round-wise like MCQs, DSA (Coding Questions), CS Subjects, Puzzles, System Design, Projects.
  • It is helpful for both Students and Experienced.

Try our free course GfG 160 where we have 160 most asked problems along with well written editorials and video explanations. The course also has 90 bonus problems.

Data Structures and Algorithms (250)

Below are the list of top problems topic wise:

Arrays (21)

Find Missing and Repeating element

Easy

Stock Buy and Sell – Max one Transaction Allowed

Easy

Remove Duplicates in a Sorted Array

Easy

Convert Array into Zig-Zag fashion

Easy

Find third largest element

Easy

Check Pair Sum in a Sorted and Rotated Array

Medium

Sort an array of 0s, 1s, and 2s

Medium

Rotate Array K times

Medium

Find Majority Element

Medium

Maximum Subarray Sum – Kadane’s Algorithm

Medium

Stock Buy and Sell – Multiple Transaction Allowed

Medium

Next Permutation

Medium

Maximum Product Subarray

Medium

Maximize i*arr[i] among all Rotations of Array

Medium

Rearrange Array in Max Min Form

Medium

Find Smallest Missing Positive Number

Medium

Minimum Jumps to Reach End

Medium

Trapping Rain Water

Hard

Maximum Circular Subarray Sum

Hard

Closest Palindrome Number

Hard

Stock Buy and Sell – Max 2 Transactions Allowed

Hard

Sorting (13)

Important Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Cycle Sort, Counting Sort, Bucket Sort, Heap Sort, Radix Sort

Maximum Meetings in One Room

Easy

Chocolate Distribution Problem

Easy

Find a Pair with the given difference

Easy

Form the Largest Number

Medium

Merge Two Sorted Arrays Without Extra Space

Medium

Count Inversions of an Array

Medium

Meeting Rooms - II

Medium

Merge Overlapping Intervals

Medium

Minimum Swaps to Sort

Medium

Minimize the Maximum Difference between the Heights

Medium

Find k largest elements in an array (Quick Sort Method)

Medium

3 Sum – Triplet Sum in Array

Medium

4 Sum - All Quadruples

Medium

Strings (14)

First Repeated Character

Easy

Reverse Words

Easy

Roman Number to Integer

Easy

Check Anagram

Easy

Remove Duplicates

Easy

Longest Substring Without Repeating Characters

Medium

Rabin-Karp Algorithm

Medium

Z algorithm

Medium

Longest Palindromic Substring

Medium

Look-and-Say Sequence

Medium

Number to English Words

Medium

KMP Algorithm

Hard

Minimum Characters to Add at Front for Palindrome

Hard

Smallest Window Containing All Characters of Another String

Hard

Hashing (15)

At least K Occurences

Easy

Common Elements in Two Arrays

Easy

Longest Subarray with 0 Sum

Medium

Count Distinct Elements In Every Window of Size K

Medium

4 Sum – Count Quadruplets with Given Sum

Medium

Check If Array Pair Sums Divisible by k

Medium

Longest Consecutive Subsequence

Medium

Count Subarrays having Sum K

Medium

Longest Subarray With Sum K

Medium

Longest Subarray With Sum Divisible By K

Medium

Sort according to an Array

Medium

Group Anagrams Together

Medium

Count Maximum Points on Same Line

Hard

LFU cache

Hard

Minimum Window Substring

Hard

Binary Search (10)

Binary Search Algorithm

Easy

N-th root of a number

Easy

Single Element in a Sorted Array

Medium

Search in a Sorted and Rotated Array

Medium

Sum of Middle Elements of two Sorted Arrays

Medium

First and Last Occurrence

Medium

Median of two Sorted Arrays

Hard

Median in a Row-wise sorted Matrix

Hard

Allocate Minimum Pages

Hard

Aggressive Cows

Hard

Matrix (6)

Find the row with maximum number of 1s

Easy

Rotate an Image 90 Degree Clockwise

Medium

Spirally traversing a matrix

Medium

Search in a Sorted Matrix

Medium

Set Matrix Rows and Columns to Zeroes

Medium

Max rectangle in Binary Matrix

Hard

Recursion and Backtracking (13)

Find all Unique Subsets

Medium

Generate Sums of all Subsets

Medium

Tower of Hanoi

Medium

Generate all Unique Permutations

Medium

Rat in a Maze

Medium

Combination Sum (Repeated Selection)

Medium

Combination Sum II (Single Selection)

Medium

Generate all Palindromic Partitions

Medium

Generate Valid IP Addresses

Medium

Word Search

Medium

N-Queen Problem

Hard

Solve Sudoku

Hard

Word Break

Hard

Stack (10)

Validate Parentheses

Easy

Implement two Stacks in an Array

Medium

The Stock Span Problem

Medium

Next Greater Element

Medium

Get Min from Stack

Medium

Evaluation of Postfix Expression

Medium

Longest Valid Parentheses Substring

Medium

Largest Rectangular Area in a Histogram

Hard

Maximum of Minimum for Every Window Size

Hard

Implement K Stacks in an Array

Hard

Queue (3)

Moving Average from Data Stream

Easy

Design Circular Queue

Medium

Stream First Non-repeating

Medium

Deque (3)

Maximum of all subarrays of size K

Medium

Longest Subarray with Absolute Difference Less than or Equal to K

Medium

Shortest Subarray with Sum at Least K

Hard

Stack + Queue (2)

Stack using Queues

Easy

Queue using Stacks

Easy

Heap (10)

Connect Ropes with Minimum Cost

Easy

Implement Binary Heap

Medium

Rearrange String to Avoid Adjacent Duplicates

Medium

Kth Largest Element

Medium

Merge k Sorted Arrays

Medium

Top K Frequent Elements

Medium

Merge K Sorted Linked Lists

Medium

Kth Smallest Element in Matrix

Medium

Sort a K Sorted Array

Medium

Find Median in Stream

Hard

Bit Manipulation (12)

Important Bit operations: Set, Clear and Toggle a Bit, Strip Last Set Bit, Count Set Bits

K-th Bit is Set or Not

Easy

Swap 2 Numbers using XOR

Easy

Check if a Number is a Power of 2

Easy

Rightmost Set Bit

Easy

Rightmost Different Bit

Easy

Toggle Bits in Given Range

Easy

Single in Couples

Easy

Division without *, /, or %

Medium

Count Set Bits from 1 to N

Medium

Generate Subsets using Bit Manipulation

Medium

Find Two Numbers with Odd Occurrences

Medium

Maximum Subset XOR

Hard

Linked List (16)

Find Middle of the Linked List

Easy

Reverse a Linked List

Easy

Kth from End of Linked List

Easy

Pairwise Swap Elements of Linked List

Easy

Sort a linked list of 0s, 1s and 2s

Medium

Rotate a Linked List K times

Medium

Intersection in Y Shaped Lists

Medium

Detect Loop in Linked List

Medium

Remove loop in Linked List

Medium

Flattening a Linked List

Medium

Merge two Sorted Linked Lists

Medium

Add Two Numbers Represented as Linked List

Medium

Palindrome Linked List

Medium

Linked List Group Reverse

Hard

Clone a Linked List with Next and Random Pointer

Hard

LRU Cache

Hard

Binary Tree (19)

Important Traversal: Inorder, Preorder, Postorder, Level Order

Level Order Traversal in Spiral Form

Easy

Height of Binary Tree

Easy

Balanced Tree Check

Easy

Check Symmetric Tree

Easy

Check Identical Trees

Easy

Left View of Binary Tree

Easy

Top View of Binary Tree

Medium

Bottom View of Binary Tree

Medium

Diagonal Tree Traversal

Medium

Vertical Tree Traversal

Medium

LCA in Binary Tree

Medium

Tree Boundary Traversal

Medium

Diameter of a Binary Tree

Medium

Connect Nodes of Levels

Medium

Serialize and Deserialize a Binary Tree

Medium

Construct Tree from Inorder & Preorder

Medium

Maximum Path Sum between 2 Nodes

Medium

Max Path Sum between 2 Leaf Nodes

Hard

Convert Binary Tree to Doubly Linked List

Hard

Binary Search Tree (12)

Check for BST

Easy

LCA in BST

Easy

Sorted Array to BST

Easy

Kth Largest Element in BST

Easy

Ceil in BST

Medium

Largest BST

Medium

Merge two BST 's

Medium

Preorder to BST

Medium

Predecessor and Successor in BST

Medium

Binary Search Tree Iterator

Medium

Delete a Node from BST

Medium

Balance a Binary Search Tree

Medium

Greedy (9)

Minimize the Sum of Product

Easy

Largest Number Possible

Easy

Minimum Number of Coins

Easy

Assign Cookies

Easy

Gas Station

Medium

Activity Selection

Medium

Fractional Knapsack

Medium

Job Sequencing

Medium

Huffman Encoding

Hard

Dynamic Programming (21)

Ways to Reach the Nth Stair

Medium

House Robber II

Medium

Coin Change (Minimum Coins)

Medium

Coin Change (Count Ways)

Medium

Longest Common Substring

Medium

Longest Increasing Subsequence

Medium

Longest Common Subsequence

Medium

0 - 1 Knapsack Problem

Medium

Partition Equal Subset Sum

Medium

Minimum Insertions to Form Palindrome

Medium

Maximize The Cut Segments

Medium

Maximum Path Sum in Matrix

Medium

Rod Cutting

Medium

Egg Dropping Puzzle

Medium

Word Break

Medium

Optimal Strategy For A Game

Medium

Wildcard Pattern Matching

Medium

Edit Distance

Medium

Matrix Chain Multiplication

Hard

Palindromic Partitioning

Hard

Boolean Parenthesization

Hard

Graph (32)

DFS of Graph

Easy

BFS of Graph

Easy

Detect Cycle in Undirected Graph

Medium

Detect Cycle in a Directed Graph

Medium

Detect a Negative Cycle

Medium

Topological Sorting

Medium

Shortest Path in Directed Acyclic Graph

Medium

Kahn’s Algorithm

Medium

Dijkstra Algorithm

Medium

Bellman-Ford Algorithm

Medium

Floyd Warshall Algorithm

Medium

Prim’s Algorithm

Medium

Kruskal’s Algorithm

Medium

Euler Path and Circuit

Medium

Hamiltonian Path and Circuit

Medium

Kosaraju’s Algorithm

Hard

Tarjan’s Algorithm

Hard

Bridges in Graph

Hard

Articulation Points in Graph

Hard

Disjoint Set (Union Find Algorithm)

Hard



Mother Vertex

Medium

Rotten Oranges

Medium

Flood fill Algorithm

Medium

Replace O's with X's

Medium

Steps by Knight

Medium

Bipartite Graph

Medium

Number of Islands

Medium

Clone an Undirected Graph

Medium

M-Coloring Problem

Medium

Alien Dictionary

Hard

Circle of Strings

Hard

Minimum Cost Path

Hard

Trie (6)

Insert, Search and Delete in Trie

Medium

Longest Common Prefix of Strings

Medium

Prefix Suffix String

Medium

Word Break (Trie)

Hard

Phone Directory

Hard

Maximum XOR Subarray

Hard


GFG SDE Sheet

Computer Science Subjects

1. Operating System

An operating system acts as an intermediary between the user of a computer and computer hardware. The purpose of an operating system is to provide an environment in which a user can execute programs conveniently and efficiently. Below links contains complete Operating System Study Material:

  • Commonly Asked Operating Systems Interview Questions
  • Last Minute Notes (LMNs) | Operating Systems
  • Complete Tutorial on Operating System

2. DBMS

Database is a collection of inter-related data which helps in efficient retrieval, insertion and deletion of data from database and organizes the data in the form of tables, Links, schemas, reports etc. Below Links contains complete DBMS study Material:

  • Commonly Asked DBMS Interview Questions
  • Commonly Asked DBMS Interview Questions | Set-2
  • Last Minute Notes (LMNs) | DBMS
  • Complete Tutorial on DBMS

3. SQL

SQL stands for Structured Query Language. It is a language used to interact with the database, i.e to create a database, to create a table in the database, to retrieve data or update a table in the database. Below Links contains complete SQL study Material:

  • SQL Interview Questions
  • SQL Interview Questions | Set-2
  • SQL Interview Questions | Set-3
  • Complete Tutorial on SQL

4. Computer Networks

A computer network is a system that connects numerous independent computers in order to share information (data) and resources. The integration of computers and other different devices allows users to communicate more easily. Below Links contains complete Computer Networks study Material:

  • Commonly Asked Computer Networks Interview Questions
  • Last Minute Notes (LMNs) | Computer Networks
  • Complete Tutorial on Computer Networks

Puzzles

Puzzles are one of the ways to check your problem-solving skills. These are tricky questions that let you think logically.

Try to solve the 20 most popular puzzles asked in Interviews

Projects

Thoroughly revise all the work you have done till now in your projects. The grilling about projects can sometimes be very deep. Also, choose your words before you speak. Mention only those topics where you think you are fine to be grilled upon.

If you haven't made a project then take an idea from GfG Projects and start working on these.

System Design

System Design is the process of designing the architecture, components, and interfaces for a system so that it meets the end-user requirements. System Design for tech interviews is something that can’t be ignored especially for experienced people Almost every IT giant whether it be Facebook, Amazon, Google, or any other ask various questions based on System Design concepts such as scalability, load-balancing, caching, etc. in the interview.

Please refer System Design tutorial that will help you to learn and master System Design concepts in the most efficient way from basics to advanced level.

Bonus SDE Sheets

You can prepare for several types of interviews here. For instance, if you want to prepare for a Google interview, we have an SDE sheet specifically designed for that purpose. Here we attached the links to the top 5 product based and top 5 Service based preparation SDE Sheets.

Product Based Company SDE Sheets

Service Based Company SDE Sheets

Facebook(Meta) SDE Sheet

Wipro SDE Sheet

Amazon SDE Sheet

Infosys SDE Sheet

Apple SDE Sheet

TCS SDE Sheet

Netflix SDE Sheet

Cognizant SDE Sheet

Google SDE Sheet

HCL SDE Sheet



Next Article
DSA Tutorial - Learn Data Structures and Algorithms
author
kartik
Improve
Article Tags :
  • DSA
  • Software Development
  • GFG Sheets
  • SDE Sheet

Similar Reads

  • SDE SHEET - A Complete Guide for SDE Preparation
    Here is a curated list of the most popular questions among important topics, such as Programming Languages, Data Structure and Algorithms (DSA), CS Subjects, Aptitude, etc, asked in the Software Development Engineer Interviews. This sheet contains a wide range of coding questions from different Data
    8 min read
  • DSA Tutorial - Learn Data Structures and Algorithms
    DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
    7 min read
  • Top 50 Array Coding Problems for Interviews
    Array is one of the most widely used data structure and is frequently asked in coding interviews to the problem solving skills. The following list of 50 array coding problems covers a range of difficulty levels, from easy to hard, to help candidates prepare for interviews.Easy ProblemsSecond Largest
    2 min read
  • Top 50 Problems on Matrix/Grid Data Structure asked in SDE Interviews
    A Matrix/Grid is a two-dimensional array that consists of rows and columns. It is an arrangement of elements in horizontal or vertical lines of entries. Here is the list of the top 50 frequently asked interview questions on Matrix/Grid in the SDE Interviews. Problems in this Article are divided into
    2 min read
  • Top 50 String Coding Problems for Interviews
    String-related problems often assess a candidate's understanding of concepts like pattern matching, manipulation, and efficient algorithm design. Here is the collection of the Top 50 list of frequently asked interview questions on Strings. Problems in this Article are divided into three Levels so th
    2 min read
  • Top 50 Problems on Stack Data Structure asked in SDE Interviews
    A Stack is a linear data structure in which the insertion of a new element and removal of an existing element takes place at the same end, represented as the top of the stack. To learn about Stack Data Structure in detail, please refer to the Tutorial on Stack Data Structure.Easy ProblemsParenthesis
    2 min read
  • Top 50 Problems on Queue Data Structure asked in SDE Interviews
    A Queue is defined as a linear data structure that is open at both ends and the operations are performed in First In First Out (FIFO) order. We define a queue to be a list in which all additions to the list are made at one end, and all deletions from the list are made at the other end. The element w
    3 min read
  • Top 50 Problems on Recursion Algorithm
    Recursion is one of the most essential algorithms that uses the concept of code reusability and repeated usage of the same piece of code. In this post, we have curated an extensive list of interview questions asked around the Recursion Algorithm. The point that makes Recursion one of the most used a
    2 min read
  • Top 20 Backtracking Algorithm Interview Questions
    Backtracking is a powerful algorithmic technique used to solve problems by exploring all possible solutions in a systematic and recursive manner. It is particularly useful for problems that require searching through a vast solution space, such as combinatorial problems, constraint satisfaction probl
    1 min read
  • Top Sorting Interview Questions and Problems
    Here is the collection of the Top 50 list of frequently asked interview questions on Sorting. Problems in this article are divided into three Levels so that readers can practice according to the difficulty level step by step. Easy Problems Duplicates within k distanceMaximum Perimeter TriangleMaximi
    5 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.

'); // $('.spinner-loading-overlay').show(); let script = document.createElement('script'); script.src = 'https://assets.geeksforgeeks.org/v2/editor-prod/static/js/bundle.min.js'; script.defer = true document.head.appendChild(script); script.onload = function() { suggestionModalEditor() //to add editor in suggestion modal if(loginData && loginData.premiumConsent){ personalNoteEditor() //to load editor in personal note } } script.onerror = function() { if($('.editorError').length){ $('.editorError').remove(); } var messageDiv = $('
').text('Editor not loaded due to some issues'); $('#suggestion-section-textarea').append(messageDiv); $('.suggest-bottom-btn').hide(); $('.suggestion-section').hide(); editorLoaded = false; } }); //suggestion modal editor function suggestionModalEditor(){ // editor params const params = { data: undefined, plugins: ["BOLD", "ITALIC", "UNDERLINE", "PREBLOCK"], } // loading editor try { suggestEditorInstance = new GFGEditorWrapper("suggestion-section-textarea", params, { appNode: true }) suggestEditorInstance._createEditor("") $('.spinner-loading-overlay:eq(0)').remove(); editorLoaded = true; } catch (error) { $('.spinner-loading-overlay:eq(0)').remove(); editorLoaded = false; } } //personal note editor function personalNoteEditor(){ // editor params const params = { data: undefined, plugins: ["UNDO", "REDO", "BOLD", "ITALIC", "NUMBERED_LIST", "BULLET_LIST", "TEXTALIGNMENTDROPDOWN"], placeholderText: "Description to be......", } // loading editor try { let notesEditorInstance = new GFGEditorWrapper("pn-editor", params, { appNode: true }) notesEditorInstance._createEditor(loginData&&loginData.user_personal_note?loginData.user_personal_note:"") $('.spinner-loading-overlay:eq(0)').remove(); editorLoaded = true; } catch (error) { $('.spinner-loading-overlay:eq(0)').remove(); editorLoaded = false; } } var lockedCasesHtml = `You can suggest the changes for now and it will be under 'My Suggestions' Tab on Write.

You will be notified via email once the article is available for improvement. Thank you for your valuable feedback!`; var badgesRequiredHtml = `It seems that you do not meet the eligibility criteria to create improvements for this article, as only users who have earned specific badges are permitted to do so.

However, you can still create improvements through the Pick for Improvement section.`; jQuery('.improve-header-sec-child').on('click', function(){ jQuery('.improve-modal--overlay').hide(); $('.improve-modal--suggestion').hide(); jQuery('#suggestion-modal-alert').hide(); }); $('.suggest-change_wrapper, .locked-status--impove-modal .improve-bottom-btn').on('click',function(){ // when suggest changes option is clicked $('.ContentEditable__root').text(""); $('.suggest-bottom-btn').html("Suggest changes"); $('.thank-you-message').css("display","none"); $('.improve-modal--improvement').hide(); $('.improve-modal--suggestion').show(); $('#suggestion-section-textarea').show(); jQuery('#suggestion-modal-alert').hide(); if(suggestEditorInstance !== null){ suggestEditorInstance.setEditorValue(""); } $('.suggestion-section').css('display', 'block'); jQuery('.suggest-bottom-btn').css("display","block"); }); $('.create-improvement_wrapper').on('click',function(){ // when create improvement option clicked then improvement reason will be shown if(loginData && loginData.isLoggedIn) { $('body').append('
'); $('.spinner-loading-overlay').show(); jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id }), success:function(result) { $('.spinner-loading-overlay:eq(0)').remove(); $('.improve-modal--overlay').hide(); $('.unlocked-status--improve-modal-content').css("display","none"); $('.create-improvement-redirection-to-write').attr('href',writeUrl + 'improve-post/' + `${result.id}` + '/', '_blank'); $('.create-improvement-redirection-to-write')[0].click(); }, error:function(e) { showErrorMessage(e.responseJSON,e.status) }, }); } else { if(loginData && !loginData.isLoggedIn) { $('.improve-modal--overlay').hide(); if ($('.header-main__wrapper').find('.header-main__signup.login-modal-btn').length) { $('.header-main__wrapper').find('.header-main__signup.login-modal-btn').click(); } return; } } }); $('.left-arrow-icon_wrapper').on('click',function(){ if($('.improve-modal--suggestion').is(":visible")) $('.improve-modal--suggestion').hide(); else{ } $('.improve-modal--improvement').show(); }); const showErrorMessage = (result,statusCode) => { if(!result) return; $('.spinner-loading-overlay:eq(0)').remove(); if(statusCode == 403) { $('.improve-modal--improve-content.error-message').html(result.message); jQuery('.improve-modal--overlay').show(); jQuery('.improve-modal--improvement').show(); $('.locked-status--impove-modal').css("display","block"); $('.unlocked-status--improve-modal-content').css("display","none"); $('.improve-modal--improvement').attr("status","locked"); return; } } function suggestionCall() { var editorValue = suggestEditorInstance.getValue(); var suggest_val = $(".ContentEditable__root").find("[data-lexical-text='true']").map(function() { return $(this).text().trim(); }).get().join(' '); suggest_val = suggest_val.replace(/\s+/g, ' ').trim(); var array_String= suggest_val.split(" ") //array of words var gCaptchaToken = $("#g-recaptcha-response-suggestion-form").val(); var error_msg = false; if(suggest_val != "" && array_String.length >=4){ if(editorValue.length { jQuery('.ContentEditable__root').focus(); jQuery('#suggestion-modal-alert').hide(); }, 3000); } } document.querySelector('.suggest-bottom-btn').addEventListener('click', function(){ jQuery('body').append('
'); jQuery('.spinner-loading-overlay').show(); if(loginData && loginData.isLoggedIn) { suggestionCall(); return; } // script for grecaptcha loaded in loginmodal.html and call function to set the token setGoogleRecaptcha(); }); $('.improvement-bottom-btn.create-improvement-btn').click(function() { //create improvement button is clicked $('body').append('
'); $('.spinner-loading-overlay').show(); // send this option via create-improvement-post api jQuery.ajax({ url: writeApiUrl + 'create-improvement-post/?v=1', type: "POST", contentType: 'application/json; charset=utf-8', dataType: 'json', xhrFields: { withCredentials: true }, data: JSON.stringify({ gfg_id: post_id }), success:function(result) { $('.spinner-loading-overlay:eq(0)').remove(); $('.improve-modal--overlay').hide(); $('.create-improvement-redirection-to-write').attr('href',writeUrl + 'improve-post/' + `${result.id}` + '/', '_blank'); $('.create-improvement-redirection-to-write')[0].click(); }, error:function(e) { showErrorMessage(e.responseJSON,e.status); }, }); });
"For an ad-free experience and exclusive features, subscribe to our Premium Plan!"
Continue without supporting
`; $('body').append(adBlockerModal); $('body').addClass('body-for-ad-blocker'); const modal = document.getElementById("adBlockerModal"); modal.style.display = "block"; } function handleAdBlockerClick(type){ if(type == 'disabled'){ window.location.reload(); } else if(type == 'info'){ document.getElementById("ad-blocker-div").style.display = "none"; document.getElementById("ad-blocker-info-div").style.display = "flex"; handleAdBlockerIconClick(0); } } var lastSelected= null; //Mapping of name and video URL with the index. const adBlockerVideoMap = [ ['Ad Block Plus','https://media.geeksforgeeks.org/auth-dashboard-uploads/abp-blocker-min.mp4'], ['Ad Block','https://media.geeksforgeeks.org/auth-dashboard-uploads/Ad-block-min.mp4'], ['uBlock Origin','https://media.geeksforgeeks.org/auth-dashboard-uploads/ub-blocke-min.mp4'], ['uBlock','https://media.geeksforgeeks.org/auth-dashboard-uploads/U-blocker-min.mp4'], ] function handleAdBlockerIconClick(currSelected){ const videocontainer = document.getElementById('ad-blocker-info-div-gif'); const videosource = document.getElementById('ad-blocker-info-div-gif-src'); if(lastSelected != null){ document.getElementById("ad-blocker-info-div-icons-"+lastSelected).style.backgroundColor = "white"; document.getElementById("ad-blocker-info-div-icons-"+lastSelected).style.borderColor = "#D6D6D6"; } document.getElementById("ad-blocker-info-div-icons-"+currSelected).style.backgroundColor = "#D9D9D9"; document.getElementById("ad-blocker-info-div-icons-"+currSelected).style.borderColor = "#848484"; document.getElementById('ad-blocker-info-div-name-span').innerHTML = adBlockerVideoMap[currSelected][0] videocontainer.pause(); videosource.setAttribute('src', adBlockerVideoMap[currSelected][1]); videocontainer.load(); videocontainer.play(); lastSelected = currSelected; }

What kind of Experience do you want to share?

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