QuickSort Based Practice Problems Last Updated : 15 Nov, 2024 Summarize Suggest changes Share Like Article Like Report Problems based on Partitioning AlgorithmSorting an Array of Two Types.Stable Binary SortingStable Binary Sorting with O(1) SpaceThree Way Partitioning Around a RangeThree Way Partitioning Around a ValueSorting an Array of Three TypesProblems based on Quick SortKth Smallest ElementK Smallest ElementsStable Quick SortSort a Linked List using Quick SortSort a Doubly Linked List using Quick SortIterative Quick Sort Advertise with us Next Article Directi Interview | Set 3 K kartik Follow Similar Reads MAQ Software Interview Experience | Set 5 1st round - 30 min,30 MCQs (IQ test) 2nd round - Coding test(30 min) Q1-> Insertion sort Q2-> Reverse a number using recursion Q3-> Didn't remember 3rd round-1 hour Q1->Some questions from resume Q2->print x to y using recursion. Q3->Check whether a given BT is BST or not? Q4->Code for merge sort of 1 min read MAQ Software Interview Experience | Set 15 ( On-Campus ) Recently MAQ Software visited our campus. A panel of two members arrived. There was a pen and paper round. The round consisted of aptitude questions like Round 1: Time and work Pipes and Cisterns Calendar Dates Common puzzles Speed and Distances There were 30 questions to be solved in 30 mins. Each 2 min read Directi Interview | Set 1 Written Round:1) Given a binary tree, such that each node contains a number. Find the maximum possible sum in going from one leaf node to another.2) Suppose you have some guests arriving at a party. For each guest, you are given the arrival and departure time. When a guest arrives he is given a wine 4 min read Directi Interview | Set 3 Online round: 1. There exist a binary tree with each node containing a character (lower case letters for leaf nodes and upper case letters for non-leaf nodes) and exactly two child, Now given a string find the number of root to leaf paths that contain this string as its subsequence. And the binary t 2 min read Microsoft Interview experience | Set 98 (On Campus for IDC) Round 1 : (1hr 15 min) Online test on CoCubes contains 3 Coding Questions Calculate difficulty of a given sentence. Where difficulty of a word is: Word is hard if it has 4 consecutive consonants or number of consonants are more than number of vowels else word is easy. Difficulty of sentence is defin 3 min read Walmart Labs Interview Experience | Set 2 (On-Campus) 1st round (Written Test) It was an online test of 90 minutes and was conducted on Hackerearth. It consisted of 10 MCQ’s and 3 coding questions. MCQ’s consisted of general aptitude questions, questions related to networking, programming etc and very easy. The coding questions were as follows: 1. http 6 min read Article Tags : Divide and Conquer Sorting DSA Arrays Quick Sort +1 More Practice Tags : ArraysDivide and ConquerSorting Like