I was thinking for some days about this problem if i can solve in O(n). I still think there must be better than O(n²) algorithm, couldn’t come up with one. Then i decided to start solve in O(n²). I used expand around concept to find all palindrome strings centered at…

I had come across this question in an interview some years back and recently in Leetcode. I recently got interested in solving problems but this time I thought to do it differently. I think there is an efficient technique to reach any node from a given target with any constraint. To solve this problem we should track node parents and the path from the root to target, Go to each parent and find all Node distance ( (k -distance) from target ).

100,000! in less than 5 minutes using 8GB RAM machine. At IIT KGP, our professor Biswas who taught C-class has told us that one of our seniors wrote a factorial program and it can print up 100 and more than that and it consists of some big number lines. Our Professor Pawan Kumar sir, who is so humble, who always…

Our simple question is to find nth Fibonacci number and time complexity for the proposed algorithm. Take the formula and write recursion formula and execute code. public static int expExpFibonacci(int n) { if(n==1 || n == 2) return 1; return expExpFibonacci(n-1)+ expExpFibonacci(n-2); } Above code time complexity is O(2^n). which…

As i am trying to put what makes a person to sit in backbench and of-course there are always exceptions. Not so hygienic. Avoiding questions. Killing boredom. Mandatory session. Some really doesn’t want to be disturbed. Can leave at any time (if room has back door). Some really wants to see big picture. Who feel as an outsider — I will keep editing this if i come across anything new —