Problems solved using partitioning logic of Quicksort
This post will discuss a few problems that can be easily solved in linear time and constant space by modifying the partitioning logic of the Quicksort algorithm.
Tag: Easy
Generate pascal triangle of the given size
Given a non-negative integer n, print the first n rows of Pascal’s triangle.
Check a string for repeated substrings
Given a string, check if it has a substring that can be used to construct the string by concatenating multiple copies of it.
Find difference between two strings
Given two strings, where the second string is constructed using all characters of the first string except one, find the character that was skipped in the second string.
Reverse a doubly linked list
In this post, we will see how to reverse a doubly linked list using iteration and recursion.
Find the index that divides an array into two non-empty subarrays with equal sum
Given an integer array, find an index that divides it into two non-empty subarrays having an equal sum.
Implement two stacks in a single array
This post will discuss how to implement two stacks in a single array efficiently.
Check if a linked list of strings is palindromic
Given a linked list of strings, check whether the concatenation of all values in the list together forms a palindrome. It is not permissible to construct a string out of the linked list nodes and check that string for palindrome.
Set next pointer to the inorder successor of all nodes in a binary tree
Given a binary tree where each node has one extra pointer next, set it to the inorder successor for all binary tree nodes.
Efficiently print all nodes between two given levels in a binary tree
Given a binary tree, efficiently print all nodes between two given levels in a binary tree. The nodes for any level should be printed from left to right.
Find the path between given vertices in a directed graph
Given a directed graph and two vertices (say source and destination vertex), determine if the destination vertex is reachable from the source vertex or not. If a path exists from the source vertex to the destination vertex, print it.
Find difference between sum of all nodes present at odd and even levels in a binary tree
Given a binary tree, calculate the difference between the sum of all nodes present at odd levels and the sum of all nodes present at even level.