Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. All these operations of SpecialStack must be O(1).&nbsp;To implement SpecialStack, you should only use standard Stack data structure and no other data structure like arrays, list,Example:&nbsp;Consider the following SpecialStack
16 &nbsp;--&gt; TOP
15
29
19
18

When getMin() is called it should 
return 15, which is the minimum 
element in the current stack. 

If we do pop two times on stack, 
the stack becomes
29 &nbsp;--&gt; TOP
19
18

When getMin() is called, it should 
return 18 which is the minimum in 
the current stack.Design and Implement Special Stack Data Structure : <a href="https://www.geeksforgeeks.org/design-and-implement-special-stack-data-structure/">https://www.geeksforgeeks.org/design-and-implement-special-stack-data-structure/</a>

Design and Implement Special Stack Data Structure

Embark on a journey through array manipulation and modular arithmetic with this insightful guide from GeeksforGeeks on checking if an array can be divided into pairs whose sum is divisible by k. In this illuminating article, you'll explore essential concepts and algorithms for efficiently determining whether it's possible to partition an array into pairs such that the sum of each pair is evenly divisible by a given integer k. This skill is critical for various applications such as data analysis, optimization, and algorithmic problem-solving.Discover the principles behind modular arithmetic and array traversal methods as you delve into algorithms for checking pair divisibility. Whether you're a coding enthusiast or a seasoned developer, mastering the art of efficiently verifying array partitioning is essential for optimizing computational resources and solving real-world problems.Prepare to elevate your problem-solving skills and algorithmic proficiency as you explore detailed explanations and practical examples for checking pair divisibility. Unlock the full potential of array manipulation and modular arithmetic in your projects by delving into the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/check-if-an-array-can-be-divided-into-pairs-whose-sum-is-divisible-by-k/">https://www.geeksforgeeks.org/check-if-an-array-can-be-divided-into-pairs-whose-sum-is-divisible-by-k/</a>

Array Pair Sum Divisibility Problem | DSA Problem

Welcome to our comprehensive tutorial on mastering the C++ Standard Template Library (STL)! Whether you're a novice programmer or an experienced developer looking to deepen your understanding of C++, this tutorial is designed to help you harness the power of STL effectively.In this tutorial, we'll delve into the core components of the C++ STL, exploring its wide array of data structures, algorithms, and utilities. From containers like vectors, lists, and maps to algorithms for sorting, searching, and manipulating data, we'll cover everything you need to know to leverage STL in your C++ projects.Join us as we unravel the mysteries of STL, providing clear explanations, practical examples, and insightful tips to enhance your programming skills. Whether you're working on competitive programming challenges, software development projects, or simply honing your coding abilities, mastering STL will undoubtedly accelerate your journey.Ready to embark on a journey of discovery through the world of C++ STL? Watch the tutorial now and unlock the full potential of this powerful library! For further exploration and detailed insights, don't forget to peruse the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/the-c-standard-template-library-stl/">https://www.geeksforgeeks.org/the-c-standard-template-library-stl/</a>&nbsp;Don't miss out on the opportunity to elevate your C++ programming skills and explore the vast capabilities of the Standard Template Library. Like, share, and subscribe for more tutorials and insights into mastering C++ and STL. Let's embark on this enlightening journey together. Happy coding!

C++ STL Course | Demo Video

The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as lists, stacks, arrays, etc. It is a library of container classes, algorithms, and iterators. It is a generalized library and so, its components are parameterized. Working knowledge of template classes is a prerequisite for working with STL.STL has 4 components:Algorithms Containers Functions Iterators A Sample Video for C++ STL &nbsp;: <a href="https://www.geeksforgeeks.org/the-c-standard-template-library-stl/">https://www.geeksforgeeks.org/the-c-standard-template-library-stl/</a>

A Sample Video for C++ STL

Given that integers are being read from a data stream. Find the median of all the elements read so far starting from the first integer till the last integer. This is also called the Median of Running Integers. The data stream can be any source of data, for example, a file, an array of integers, input stream etc. Median can be defined as the element in the data set which separates the higher half of the data sample from the lower half. In other words, we can get the median element as, when the input size is odd, we take the middle element of sorted data. If the input size is even, we pick an average of middle two elements in the sorted stream. Median of Stream of Running Integers using STL : <a href="https://www.geeksforgeeks.org/median-of-stream-of-running-integers-using-stl/">https://www.geeksforgeeks.org/median-of-stream-of-running-integers-using-stl/</a>

Median of Stream of Running Integers using STL

In this video we will see how to write a function that returns true if a given array can be divided into pairs such that the sum of every pair is divisible by a given number k.Examples: Input: arr[] = {9, 7, 5, 3},&nbsp; k = 6&nbsp; Output: True&nbsp; We can divide the array into (9, 3) and&nbsp; (7, 5). Sum of both of these pairs&nbsp; is a multiple of 6.Check out the video to see how we implement this!! Practice Problem:<a href=" https://practice.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem3257/1"> https://practice.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem3257/1</a> Article: <a href="https://www.geeksforgeeks.org/check-if-an-array-can-be-divided-into-pairs-whose-sum-is-divisible-by-k/">https://www.geeksforgeeks.org/check-if-an-array-can-be-divided-into-pairs-whose-sum-is-divisible-by-k/</a> SDE Sheet: <a href="https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/">https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/</a>

Array Pair Sum Divisibility Problem | SDE Sheet | Hashing

Given an array of n words. Some words are repeated twice, we need to count such words.Examples:Input : s[] = {"hate", "love", "peace", "love",&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; "peace", "hate", "love", "peace",&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; "love", "peace"}; Output : 1 There is only one word "hate" that appears twice&nbsp;Count words that appear exactly two times in an array of words: <a href="https://www.geeksforgeeks.org/count-words-appear-exactly-two-times-array-words/">https://www.geeksforgeeks.org/count-words-appear-exactly-two-times-array-words/</a>

Count words that appear exactly two times in an array of words

Given an array of distinct positive integers, the task is to find the maximum product of increasing subsequence of size 3, i.e., we need to find arr[i]*arr[j]*arr[k] such that arr[i] &lt; arr[j] &lt; arr[k] and i &lt; j &lt; k &lt; n&nbsp; Examples:Input: arr[] = {10, 11, 9, 5, 6, 1, 20} Output: 2200 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Explaination: Increasing sub-sequences of size three are {10, 11, 20} =&gt; product 10*11*20 = 2200 {5, &nbsp;6, 20} =&gt; product 5*6*20 = 600 Maximum product : 2200&nbsp;Find the Increasing subsequence of length three with maximum product: <a href="https://www.geeksforgeeks.org/maximum-product-increasing-subsequence-size-3/">https://www.geeksforgeeks.org/maximum-product-increasing-subsequence-size-3/</a>

Find the Increasing subsequence of length three with maximum product

Given an array, the task is to shuffle the whole array and print it. Example&nbsp; &nbsp;Input &nbsp;(1, 2, 3, 4, 5, 6, 7} Output &nbsp;{3, 1, 6, 7, 2, 4, 5}Input &nbsp;(1, 2, 3} Output &nbsp;{3, 1, 2}Shuffle a given array : <a href="https://www.geeksforgeeks.org/shuffle-an-array-using-stl-in-c/">https://www.geeksforgeeks.org/shuffle-an-array-using-stl-in-c/</a>

Shuffle a given array

We are given n triangles along with length of their three sides as a,b,c. Now we need to count number of unique triangles out of these n given triangles. Two triangles are different from one another if they have at least one of the sides different.Since we are asked to find number of “unique” triangles, we can use either set or unordered_set. In this post, set based approach is discussed. How to store three sides as an element in the container? We use STL pair to store all the three sides together asCount number of unique Triangles using STL: &nbsp;<a href="https://www.geeksforgeeks.org/count-number-of-unique-triangles-using-stl/">https://www.geeksforgeeks.org/count-number-of-unique-triangles-using-stl/</a>

Count number of unique Triangles using STL

Pair is used to combine together two values that may be different in type. Pair provides a way to store two heterogeneous objects as a single unit. It is basically used if we want to store tuples. The pair container is a simple container defined in &nbsp;header consisting of two data elements or objects.The first element is referenced as ‘first’ and the second element as ‘second’ and the order is fixed (first, second).Pair can be assigned, copied, and compared. The array of objects allocated in a map or hash_map is of type ‘pair’ by default in which all the ‘first’ elements are unique keys associated with their ‘second’ value objects.To access the elements, we use variable name followed by dot operator followed by the keyword first or second.Syntax:pair (data_type1, data_type2) Pair_namePair in C++ STL:<a href="https://www.geeksforgeeks.org/pair-in-cpp-stl/">https://www.geeksforgeeks.org/pair-in-cpp-stl/</a>

Pair in C++ STL