Hrishikesh D·22 hours agoAlgorithm for Google Search Engine : PageRank AlgorithmData Structures and Algorithms | Web Mining Algorithm PageRank Algorithm Good day, readers! I’ve started learning Data Structures and Algorithms and will be using this medium to keep up with what I’ve learned and researched on the subject. …Algorithms11 min read
Narmada Muralirkrishnan·1 day agoCode Everyday | Leetcode Problem39. Combination Sum — Today I tried to solve a leetcode problem Combination Sum from Striver’s SDE Sheet. Link to SDE sheet : https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/ Link to LeetCode problem : https://leetcode.com/problems/combination-sum/ Problem Statement: Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen…Code2 min read
jesse kovash·1 day agoData Structures: Priority QueueIn the last post, we discussed creating a max binary heap. Today we will make a priority queue which is essentially a min binary heap. In a regular queue, we operate by using FIFO (first in first out). An example of this is people waiting in line to check out…Priority Queue3 min read
Ayaz Vural·2 days agoWorking towards a FAANG positionOr I guess MAANG? — I started this week off with good news from a very good friend who I consider to be like a mentor. A job offer from Google as a Software Engineer. Our conversation was definitely a source of inspiration and I want to try following in his footsteps and become what…Tech3 min read
jesse kovash·1 day agoData Structures: Binary HeapA heap is a specific type of tree. The general structure of a binary heap is similar to our binary tree, but a few new rules apply. We will discuss max-heaps, min-heaps, and priority queues. A max binary heap (first photo) is a tree where the parent node is always…Binary Heap4 min read
Matthew Clark·2 days agoSelection SortSelection sort is a sorting algorithm that passes through the unsorted part of an array to find the lowest or smallest element and puts it at the beginning. The selection sort algorithm has two subarrays. One is the sorted subarray or the part that is known to be in order…Computer Science3 min read
SHAZEB SAYYED·3 days agoDivide And Conquer Versus Dynamic ProgrammingThe divide-and-conquer technique breaks down a problem into two or more subproblems, solving the easier problems first and then using the solutions to solve the harder problem. This strategy is used in many areas of mathematics and computer science, as well as in many practical problems. The article contains a…Divide And Conquer5 min read
jesse kovash·3 days agoData Structures: Binary tree traversal, Depth-First SearchOn the last post we talked about performing breadth-first searches with the help of a queue. Now we are moving onto depth-first searches. We have a few options when performing a depth-first search: in-order, pre-order, and post-order. The code for all 3 of these options is nearly the same and…Data Structure Algorithm3 min read
jesse kovash·3 days agoData Structures: Binary TreeAnytime one of us interacts with a webpage we are relying on a binary tree. The DOM is one of the better known examples of a use case for binary trees. Trees are made up of a root, parent nodes, child nodes, and leaves. Each node has a value, and…Data Structures4 min read
jesse kovash·3 days agoData Structures: Binary tree traversal, Breadth-First SearchIn the previous post, we utilized a ‘contains’ method on our binary tree class. What if we would like to know all of the nodes contained in our tree? We need to create a new method for this. However, what order would we like the values to be in? …Data Structures2 min read
