InterviewBit Problems   Sum Of Fibonacci Numbers : Solved

About the Sum Of Fibonacci Numbers : Solved category (1)
Binary Search || O(logN*logN) Time Complexity || O(logN) Space Complexity (1)
Using Priority_queue C++ (1)
Greedy Approach (How to do it using Graphs?) (1)
Using Stack O(n) complexity (3)
Greedy Method with Cache (1)
How about a recursion? Fibonacci loves recursions, right? (1)
Respectfully, how is this a graph problem? (4)
My C++ Approach using MAP, can you optimize this (1)
Hope u remember tushars birthday bombs (1)
C++ O(1) solution (***constant space because i am using extra vector of 50 size only) (3)
Can any body post graph version of this problem :) (1)
Solution without using Graph (1)
Short, simple and concise C++ (1)
Linear time C++ solution using Binary Search. (Without Graphs) (1)
TITLE: terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc (1)
Lang: C++; Complexity[Time,Space]: [O(log(k))< . <O(k), O(k)+function call stack] (1)
Very easy c++ sol. and optimal (1)
Greedy Solution with Binary Search (1)
C++ Easy Solutions (1)
Simple and easy C++ solution (1)
Fibonacci Sum easy C++ solution (2)
My Easy C++ Solution! (1)
Using O(1) space (1)
Simple C++ Solution (Greedy Approach) (1)
Segmentation fault using DP solution (1)
No graph needed (1)
Easy Solution using priority queue and DP (1)
Proof for greedy approach (2)
Can you explain me why are you using priority queue. When i ma running the same c (1)