Cláudia

Image: AMCThe last six to eight minutes of the latest episode of Interview With the Vampire—“A Vile Hunger for Your Hammering Heart”—are brutal. After wandering the United States for about seven years, Claudia returns to the townhouse on Rue Royal where Louis and Lestat live. She announces that she’s leaving for Europe and she wants Louis to come with her. In a fit of rage, Lestat attacks her, and Louis jumps to defend her. What follows is a horrific scene where two immortal, impossibly powerful vampires punch, hit, and…

Image: AMCBefore we get started, a warning. This episode is incredibly brutal for a few reasons, and I want to give y’all a heads up about what we’re going to be diving into today. Episode Five of Interview With The Vampire, titled “A Vile Hunger For Your Hammering Heart,”deals with rape, implied suicidal ideation, explicit domestic abuse, and includes an extended scene of extreme domestic violence.Already the fandom across social media is divided about this. For now, just be warned that there was a lot going on in the…

Image: AMCThe fourth episode of Interview With the Vampire belongs to Bailey Bass. Her Claudia is unlike anything we’ve seen. She’s not the five-year-old of the book, nor the 10-year old of the film. She’s 14, just far enough into puberty to know that something is changing, but not far enough along to know what to do about it. Claudia is an immortal girl, always a child, never a woman, a maniac character who is both developed and un-developed, a hunk of clay that never gets fired. I love this version of Claudia, I truly…

Image: AMCThere might come a time when I am not amazed by the dexterity of the writing on Interview With the Vampire, but the third episode does not disappoint. “Is My Very Nature That of a Devil” opens in Jackson Square, with Lestat and Louis reading together on a bench. Lestat reads from a newspaper column, describing a sanitized history of the square to a New Orleans native who likely has heard all of this before. “Say anything about how they used to take runaway slaves, cut their heads off, and pike ‘em on the iron…

Explanation of dynamic programming with example solutions to discrete knapsack and longest common subsequence problems in PythonImage by Mohamed Hassan from PixabayDynamic programming is useful for solving problems that have overlapping subproblems and an optimal substructure. In the previous article on greedy algorithms, we talked about how a greedy choice or choosing the best next choice at each decision point may sometimes yield a locally optimal choice. In these cases, we can use dynamic programming to overcome this…

Explanation of tree traversal algorithms with examples in PythonImage by Clker-Free-Vector-Images from PixabayTrees are represented by a set of nodes connected by edges. They are considered a hierarchical and non-linear data structure, because data in a tree is stored on multiple levels. Trees have the following properties:Root node: every tree has one node designated as the root node, which is the node at the top of the tree and is the node that does not have any parent nodes.Parent node: a parent node is the node…

Explanation of greedy algorithms with solutions to the fractional knapsack and coin change problems implemented in PythonImage by Clker-Free-Vector-Images from PixabayA greedy algorithm is often a practical way to finding a decent and elegant, though not always optimal, solution for optimization problems. It works by making a sequence of choices and always choosing the best next choice at each decision point. One such category of problems is the activity-selection problem, where we attempt to schedule a resource among…

Understand searching with examples of linear and binary search in PythonImage by Clker-Free-Vector-Images from PixabaySearch algorithms are useful for retrieving one or more elements stored in a data structure. Some examples of problems where a search algorithm is applicable include retrieving a specific record in a database or searching for a keyword in an article.Search algorithms are generally classified into two types:Sequential Search: Sequential search algorithms can be performed on sorted or unsorted data…

Explanation of 3 types of sorting algorithms and their implementation in PythonImage by 200 Degrees from PixabayIn the previous article, I walked through recursion and we will build on this foundation with sorting algorithms in this article. Sorting algorithms are used to rearrange elements in an array so that each element is more than or equal to its predecessor. There are many different types of sorting algorithms and I will walk through the three most common ones that are worth familiarizing yourself with: selection…

Understand when and how to use recursive solutions with examples in PythonThis is the first article in a series on explaining algorithms with examples in Python. This is intended for aspiring Data Scientists and Software Engineers or those wishing to brush up on algorithms in preparation for coding interviews.Image by Gerd Altmann from PixabayRecursion is a fundamental concept in programming when learning about data structures and algorithms. In this article, I will explain what recursion is, when to use it and walk…