Courses
Tutorials
Interview Prep
DSA Tutorial
Interview Questions
Quizzes
Must Do
Advanced DSA
System Design
Aptitude
Puzzles
Interview Corner
DSA Python
QuickSort Based Practice Problems
Last Updated :
23 Jul, 2025
Problems based on
Partitioning Algorithm
Sorting an Array of Two Types.
Stable Binary Sorting
Stable Binary Sorting with O(1) Space
Three Way Partitioning Around a Range
Three Way Partitioning Around a Value
Sorting an Array of Three Types
Problems based on
Quick Sort
Kth Smallest Element
K Smallest Elements
Stable Quick Sort
Sort a Linked List using Quick Sort
Sort a Doubly Linked List using Quick Sort
Iterative Quick Sort
Comment
Article Tags:
Article Tags:
Divide and Conquer
Sorting
DSA
Arrays
Quick Sort
+1 More
Explore
DSA Fundamentals
Logic Building Problems
2 min read
Analysis of Algorithms
1 min read
Data Structures
Array
3 min read
String
2 min read
Hashing
2 min read
Linked List
3 min read
Stack
2 min read
Queue
2 min read
Tree
2 min read
Graph
3 min read
Algorithms
Searching Algorithms
2 min read
Sorting Algorithms
3 min read
Introduction to Recursion
15 min read
Greedy Algorithms
3 min read
Graph Algorithms
3 min read
Dynamic Programming
2 min read
Bitwise Algorithms
4 min read
Advanced
Segment Tree
2 min read
Binary Indexed Tree
12 min read
Trie Data Structure
15+ min read
Square Root (Sqrt) Decomposition Algorithm
15+ min read
Interview Preparation
Interview Corner
2 min read
GFG 160
2 min read
Coding Practice
1 min read
POTD
2 min read
Courses
Data Structures and Algorithms Course
2 min read
DSA and System Design Course
2 min read
