Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedInsertion sort is a stable, in-place sorting algorithm that builds the final sorted array one item at a time. It is not the very best in terms of performance but more efficient traditionally than most other simple O(n^2) algorithms such as selection sort or bubble sort.
Sieve of Eratosthenes is an efficient algorithm that can be used in most coding competitions involving prime numbers in the range of a given number n.
Given an array of n-1 distinct integers in the range of 1 to n, find the missing number in it in linear time.
Write a program to calculate the nth Fibonacci number where n is a given positive number. Fibonacci’s sequence is characterized by the fact that every number after the first two is the sum of the two preceding ones.
This article will provide C++ implementation of a queue data structure using templates in C++. This article will make the class code generic by using C++ templates to support all data types.
In this article, we will discuss the C++ implementation of the stack data structure using classes and make code generic for all data types by using C++ templates.
Write code to evaluate a given postfix expression efficiently. For example, 82/ will evaluate to 4 (8/2), 138×+ will evaluate to 25 (1+8×3) and 545×+5/ will evaluate to 5 ((5+4×5)/5).
Given a string containing opening and closing braces, check if it represents a balanced expression or not.
Given an array representing a max-heap, in-place convert it into the min-heap in linear time.
Write a program to determine if a given string is palindrome or not. A palindromic string is a string that remains the same with its characters reversed.
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 a set of vertices V in a weighted graph where its edge weights w(u, v) can be negative, find the shortest path weights d(s, v) from every source s for all vertices v present in the graph. If the graph contains a negative-weight cycle, report it.