We all have a playlist of songs that we keep listening and sometimes after listening them many times we lose interest or forget about the songs.

But if we listen different versions of our favorites we will not lose interest and we will find something new in each version.

Some of them are obvious like the original song and the singer versions.

Lets see the different versions:

Extras:

I will keep updating the list.

I recommend to search for different version of the song.

YouTube or Spotify will be a great space to start.

Do let me know in the comments which ones you liked…


Thanks Everyone for my first thousand Views.🎉

Narration of the Story

Now We all are in a time when we have time for ourselves and we want to use it effectively.

As we know this is one of the best things we can do for ourselves.

We “Spend⏳” our time on tasks. Note here that we Spend it so let us consider it as “Money💵” or “A valuable Thing💎”. The Second Thing We use is our Energy.

Lets Start:

Consider that as the day starts you have had a good sleep🛌.

You get a fixed amount of energy and time(86400…


Fibonacci sequence was introduced in our syllabus in 10th or 9th.So we have calculated them but why we need to calculate them ?

There are many uses of Fibonacci numbers but let us see some important ones:


Longest Common Subsequence type problems have two sequences (set of characters or strings) are given ,We have to find the longest possible subsequence which is common in both the sequences.

A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous.So we can skip some character in the sequence inorder to make the common subsequence.

-Path crossing in comparing is not allowed as they are in relative order.

  • Example how we should compare.


Knapsack Problem is also known as rucksack problem.It is a optimization problem. In Knapsack problem Value and Weight is given to collect most amount value with given weight limit that can be collected.

We can have two categories of Knapsack problem:

[1] 0/1 Knapsack problem:

Here items are not divisible.

[2] Fractional Knapsack problem:

Here items are divisible so we can collect parts of item also.

Here we will solve each of the knapsack problem by greedy method meaning taking decisions without thinking of the consequences.

We can solve this problem by mainly three ways:

  1. By sorting the given values:

Marvin Raval

Pursuing BTech in CSE.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store