Find minimum product among all combinations of triplets in an array
Given an integer array, find the minimum product among all combinations of triplets in the array.
Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven an integer array, find the minimum product among all combinations of triplets in the array.
Given m sorted lists, each containing n elements, print them efficiently in sorted order.
Heapsort is an in-place, comparison-based sorting algorithm and can be thought of as an improved selection sort as it divides the input into a sorted and an unsorted region.
Given a set of tasks with deadlines and total profit earned on completing a task, find maximum profit earned by executing the tasks within the specified deadlines. Assume that a task takes one unit of time to execute, and it can’t execute beyond its deadline. Also, only a single task will be executed at a time.
Given a set of activities, along with the starting and finishing time of each activity, find the maximum number of activities performed by a single person assuming that a person can only work on a single activity at a time.
Given an undirected, connected and weighted graph, construct a minimum spanning tree out of it using Kruskal’s Algorithm.
All algorithms can be classified into in-place and out-of-place algorithms based on the amount of extra space used by them. In this quick article, we’ll explore the difference between the two.
This post will discuss how to sort a vector of integers in C++ in ascending order.
A Comparator is a comparison function, which provides an ordering for collections of objects that don’t have a natural ordering. This post will discuss how to sort a list of objects using Comparator in Java.
This post will discuss how to sort a list of objects using the Comparable in Java.