Skip to content

Tag Archives: matrix-exponentiation

Given an integer N and two arrays F[] and C[] of size K that represent the first K terms and coefficient of first K terms… Read More
Given an integer N, the task is to find the N-th Fibonacci numbers.Examples:  Input: N = 3 Output: 2 Explanation: F(1) = 1, F(2) = 1 F(3) = F(1)… Read More
Given a Binary Tree, the task is to print all the Exponential Levels in the given Binary Tree.  An Exponential Level is a level whose… Read More
Given a Markov chain G, we have the find the probability of reaching the state F at time t = T if we start from… Read More
We are given a recursive function that describes Nth terms in the form of other terms. In this article, we have taken specific examples.  Now… Read More
This is one of the most used techniques in competitive programming. Let us first consider below simple question. What is the minimum time complexity to… Read More
The Fibonacci numbers are the numbers in the following integer sequence.0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …….. In… Read More