asharammeena's blog

By asharammeena, history, 5 days ago, In English,

Hello guys,

There are various methods to solve Fibonacci sequence problems. But I was not able to find any place where all methods to find Fibonacci were discussed with both proper mathematical explanation and implementation. Therefore, I have written an article for Fibonacci Sequence on my blog which covers all mathematical concepts and implementations and is suitable for beginners.

Topics covered are:-

  1. Brute Force approach ( O(2^n) )
  2. Dynamic Programming approach ( O(n) )
  3. Matrix exponential approach ( O(logn) )
  4. Golden number ratio (well explained) ( O(logn) )
  5. Analysis of growth of Fibonacci Sequence

Here is the link : Fibonacci Sequence

I hope you find this article insightful

Thank you and happy coding

Read more »

 
 
 
 
  • Vote: I like it
  • +9
  • Vote: I do not like it

By asharammeena, history, 3 weeks ago, In English,

Hello guys,

Currently I am writing about Bit Masking on my blog. Today I have published first part of this series.

I have covered following topics in first part :-

  • Introduction to Bit Manipulation

  • Applications of Bit Manipulation

  • Basic Introduction to Bit Masking

  • Solving subset sum problem

Here is the link to first part :- Introduction to Bit Masking

Edit :- I have published second part of Bit Masking + dynamic programming tutorials. I have solved a problem using
Bit Masking and DP and also showed how it makes implementation easier.

Here is the link to second part :- Bit Masking + Dp Part 1

Thank you and Happy Coding!

Read more »

 
 
 
 
  • Vote: I like it
  • +10
  • Vote: I do not like it

By asharammeena, history, 3 weeks ago, In English,

Hello guys,

I started dynamic programming tutorials on my blog almost 1.5 months ago and you all gave a great response. That's why I have decided to make video tutorials in addition to written tutorials to make dynamic programming more easy.

Here is my first video. I have used Longest Common subsequence problem as the reference.

Introduction to Dynamic Programming

I have published Part 2 of my dynamic programming tutorials. I have discussed Solution of Longest Increasing Subsequence using Dynamic Programming.

Here is the link: Longest Increasing Subsequence

Edit :- I have published Part 3 of my dynamic programming tutorials. I have discussed Solution of Longest Palindromic Subsequence using Dynamic Programming.

Here is the link: Longest Palindromic Subsequence

Thank you And Happy Coding!!!

Read more »

 
 
 
 
  • Vote: I like it
  • +13
  • Vote: I do not like it

By asharammeena, history, 2 months ago, In English,

Hello guys, Part 3 of my dynamic programming tutorials is out. In this part, I have discussed dp and fibonacci solution of the problem of binary numbers without consecutive 1’s in great detail. You can find it here: Dynamic programming part 3 You should also read part 2 to understand part 3: Dynamic programming part 2

Thank you and happy coding!!

Read more »

 
 
 
 
  • Vote: I like it
  • +10
  • Vote: I do not like it

By asharammeena, history, 2 months ago, In English,

Hello guys,

Your response to 1st part was really great. Thank you all very much for your support. I have written the second part of the tutorials. So, please give it a read and if you like it, then, please share it with others in coding community. Here is link to latest part : Dynamic programming Part-2 Link to first part : Dynamic programming Part-1

Thank you and Happy coding

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

By asharammeena, 2 months ago, In English,

Hello guys,

I have started my personal programming blog and I will be writing about dynamic programming in next few posts. So, please read them and correct me if I am wrong somewhere. Also, please share the blog if you like the articles.

Part 1 — Longest common subsequnce : Dynamic programming tutorials Part 1.

Part 2 — Longest increasing subsequence: Dynamic programming tutorials Part-2

Part 3 — Binary number without consecutive 1's: Dynamic programming tutorials part 3

Part 4 — Maximum size sub matrix with all 1's: Dynamic programming tutorials part 4

Part 5 — Ways to cover a distance: Dynamic programming tutorials part 5

Part 6 — Longest Palindromic subsequenec: Dynamic programming tutorials part-6

Part 7 — Minimum edit distance (Levinshtein distance): Dynamic programming tutorials part-7

Part 8 — Weighted Job Scheduling: Dynamic programming tutorials part-8

Part 9 — Palindromic Partitioning: Dynamic programming tutorials part-9

Part 10 — Boolean Parenthesization : Dynamic programming tutorials part-10

Part 11 — Matrix chain multiplication : Dynamic programming tutorials part-11

Part 12 — Egg dropping : Dynamic programming tutorials part-12

Part 13 — Non crossing lines on a circle: Dynamic programming tutorials part-13

Part 14 — Word break: Dynamic programming tutorials part-14

Part 15 — Box Stacking: Dynamic programming tutorials part-15

Part 16 — Longest Increasing Path: Dynamic Programming tutorials part-16

Part 17 — Minimum cost polygon triangulation: Dynamic Programming tutorials part-17

Part 18 — Travelling Salesman: Dynamic Programming tutorials part-18

Part 19 — Maximum plus sum in a Matrix: Dynamic Programming Tutorials part-19

Part 20 — Number of Palindromic Paths in a Matrix: Dynamic Programming Tutorials part-20

Part 21 — K-Palindromes: Dynamic Programming Tutorials Part-21

Part 22 — Wild Card Matching: Dynamic Programming Tutorials Part-22

Part 23 — Equal Sum Partition: Dynamic Programming Tutorials Part-23

Edit :- Part 24 of my dynamic programming tutorials is out. I have discussed Longest Arithmetic Progression this time.

PART 24 — Longest Arithmetic Progression: Dynamic Programming Tutorials Part-24

Thank you And happy coding!!!

Read more »

 
 
 
 
  • Vote: I like it
  • +64
  • Vote: I do not like it