All about RMQ LCA
-
Updated
Feb 23, 2018 - C++
All about RMQ LCA
A DFS algorithm implementation to find the minimum time to conquer all nodes from root. It takes 1 minute time from one node to its child and the node can conquer its child one at a time. Find the minimum time.
This repository contains solutions of various classical problems on SPOJ.
Competitive Programming templates that I used during the past few years.
C++ implementation of some of the most well-known graph algorithms in the simplest way. Mostly in non-OOP style because the algorithms itself and its performance were the main points.
Data structure and algorithms is a branch of computer science that deals with creating machine-efficient and optimized computer programs. The term Data Structure refers to the storage and organization of data, and Algorithm refers to the step by step procedure to solve a problem. By combining "data structure" and "algorithm", we optimize the codes
Problems seen and solved on the https://codeforces.com/ website
Add a description, image, and links to the lca topic page so that developers can more easily learn about it.
To associate your repository with the lca topic, visit your repo's landing page and select "manage topics."