PinnedJuliet GeorgeReact Query — Build a Book Search App with React QueryIn most web applications, the client communicates with the server using the browser’s fetch API or libraries such as Axios. In React…Aug 28, 2023Aug 28, 2023
Juliet GeorgeDynamic Programming: The Knapsack ProblemWelcome to the 3rd part of my dynamic programming series. I will use dynamic programming and memoization to solve the Knapsack Problem.Apr 17Apr 17
Juliet GeorgeSorting Algorithms: Bubble Sort, Merge Sort, and Quick sortThis tutorial is designed for those familiar with Python and basic coding concepts, including time complexity. It provides a clear and…Mar 14Mar 14
Juliet GeorgeDynamic Programming: The Rod Cutting ProblemWelcome to the first blog in my dynamic programming series. In this tutorial, I will solve the Rod Cutting Problem with dynamic programming…Feb 26Feb 26
Juliet GeorgeThe Root of the Binary Search Tree.A Binary Search Tree(BST) is a data structure in which each node can have a maximum of two children. In a BST, for each node, n, the child…May 6, 2020May 6, 2020
