Write a function to find the length of the

longest common subsequencebetween two sequences.E.g. Given the strings “serendipitous” and “precipitation”, the longest common subsequence is “reipito” and its length is 7.

** Recursive approach** →

- Create two counters
`idx1`

and`idx2`

starting at 0. …

"Sorting" essentially refers to "sorting in ascending order", unless specified otherwise.

Sorting algorithms are capable of doing multiple and extraordinary things, imagine how much time it would take for a human to sort a list of thousands of names to make a phonebook, or a list of thousands of recipes…

Wondering how to do that?! Well, then continue reading… :)

As it is well known that *Python Dictionaries *are a data structure which are used to store key-value pairs; where “keys” are used to store and retrieve the stored “values”. …

A linked list is a *data structure* used for storing a sequence of elements. It’s data with some structure (the sequence).

`class `**LinkedList**():

def **__init__**(self):

self.head = None

def…

It’s called a “tree” because it vaguely resembles an inverted tree trunk with branches.

- The word “binary” indicates that each “node” in the tree can have at most 2 children (left or right).
- Nodes can have 0, 1 or 2 children. …

Follow me on my #100DaysOfCode journey on Twitter → https://twitter.com/AditiDeodhar09