Courses
Tutorials
Practice

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Experiences16.6K+ articles

C++4.3K+ articles

C++ Programs2.4K+ articles

Sorting1.8K+ articles

Searching1.7K+ articles

Linked List1.2K+ articles

Oracle347+ articles

BubbleSort23+ articles

CPP-DSA

199+ posts

Boyer-Moore Algorithm for Pattern Searching in C++

Last Updated: 05 August 2024

The Boyer-Moore algorithm is an efficient string searching algorithm that is used to find occurrences of a pattern within a text. This algorithm preprocesses the pattern a...read more

article_image

Kahn’s Algorithm in C++

Last Updated: 01 August 2024

In this post, we will see the implementation of Kahn’s Algorithm in C++.What is Kahn’s Algorithm?Kahn’s Algorithm is a classic algorithm used for topological sorting of a ...read more

article_image

Tarjan’s Algorithm in C++

Last Updated: 02 August 2024

In this post, we will see the implementation of Tarjan’s Algorithm in C++ language.What is Tarjan’s Algorithm?Tarjan’s Algorithm is a well-known algorithm used for finding...read more

article_image

Kosaraju’s Algorithm in C++

Last Updated: 01 August 2024

In this post, we will see the implementation of Kosaraju’s Algorithm in C++.What is Kosaraju’s Algorithm?Kosaraju’s Algorithm is a classic algorithm used for finding stron...read more

article_image

Johnson Algorithm in C++

Last Updated: 07 August 2024

Johnson’s Algorithm is an algorithm used to find the shortest paths between all pairs of vertices in a weighted graph. It is especially useful for sparse graphs and can ha...read more

article_image

Floyd-Warshall Algorithm in C++

Last Updated: 05 August 2024

The Floyd-Warshall algorithm is a dynamic programming technique used to find the shortest paths between all pairs of vertices in a weighted graph. This algorithm is partic...read more

article_image

Knight’s Tour Problem in C++

Last Updated: 05 August 2024

Knight’s Tour problem is a classic puzzle in which the goal is to move a knight on a chessboard such that the knight visits every square exactly once. The knight moves in ...read more

Convex Hull Algorithm in C++

Last Updated: 20 August 2024

The Convex Hull problem is fundamental problem in computational geometry. In this, we need to find the smallest convex polygon, known as the convex hull, that can include ...read more

article_image

Uber's Online Test Experience

Last Updated: 09 October 2024

Online test problems excite some people and make others very nervous. A fascinating challenge popped up in the Uber online test: Participants had to find the shortest path...read more

Interview Experiences

Prim's Algorithm in C++

Last Updated: 30 September 2024

Prim's Algorithm is a greedy algorithm that is used to find the Minimum Spanning Tree (MST) for a weighted, undirected graph. MST is a subset of the graph's edges that con...read more

article_image

Shortest Path Algorithm in C++

Last Updated: 26 September 2024

The shortest path algorithms are used to find the most efficient route fromsource nodetodestination nodeof a graph in optimal time and space complexities. In this article,...read more

Counting Set Bits in C++

Last Updated: 23 September 2024

Counting set bits means determining how many bits in a binary representation of a number are set to 1.ExampleInput: n = 103 (01100111)Output: 5Explanation: The bina...read more

Rod Cutting Problem in C++

Last Updated: 23 September 2024

The Rod Cutting Problem is a classic dynamic programming problem where a rod of length N and a list of prices for smaller pieces of rod is given, and the task is to determ...read more

Knuth-Morris-Pratt in C++

Last Updated: 24 September 2024

The Knuth-Morris-Pratt (KMP) is an efficient string-matching algorithm developed by Donald Knuth, Vaughan Pratt, and James H. Morris in 1977. It is used for finding a spec...read more

C++ Program to Implement Suffix Array

Last Updated: 30 September 2024

A suffix array is a data structure which can be used to store all possible suffixes of a given string in the sorted order. It stores the starting indices of the suffixes i...read more

...