Giters

sahilbansal17 / Competitive_Coding

This repository contains some useful codes, techniques, algorithms and problem solutions helpful in Competitive Coding.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

n-th Fibonacci number in O(log n), diameter of a tree & IDDFS

KruZZy opened this issue · comments

commented

Hello! I would like to work on the following:

  • computing the n-th Fibonacci number in O(log n)
  • diameter of a tree
  • iterative deepening depth first search (IDDFS)

Had some problems and couldn't contribute for a time, but I want to continue contributing.

commented

Sure @KruZZy Sounds great.

commented

Added all of the above.