
datastructures Tag Posts Index
Explore on-chain topics from the Hive blockchain.
- →
DSA (Medium) - General - Print A Diamond Shape (Typescript, Python & Rust)
Given the following shape: [LOG]: " A" [LOG]: " B B" [LOG]: " C C" [LOG]: " D D" [LOG]: " E E" [LOG]: "F F"
- →
DSA (Medium) — Binary Tree — Lowest Common Ancestor of a Binary Tree (Python, Typescript & Rust)
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor
- →
The Flowerbed Challenge: Can You Plant Them All? (Python, Typescript, Golang)
Let flowerbed be an integer array representing a flowerbed, where 0 denotes an empty plot and 1 denotes a planted plot. Determine whether it is possible to plant
- →
DSA (Medium) — Equal Row and Column Pairs (Python, TS & Go)
Given a 0-indexed n x n integer matrix grid, return the number of pairs (ri, cj) such that row ri and column cj are equal. A row and column pair is considered equal
- →
Interviewer: Write A Function That Always Picks The Best Move in a Game of Nim (Hard) - Python
Imagine you have a few piles of sticks. Two players take turns picking sticks. On your turn, you must choose one pile and take at least one stick from that pile
- →
DSA (Easy) — Sets — Find the Difference of Two Arrays (Python, Typescript & Go)
Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where: answer[0] is a list of all distinct integers in nums1 which are not present
- →
DSA (Medium) — Linked List — Delete the Middle Node of a Linked List (Python, Typescript & Go)
You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. The middle node of a linked list of size n is the
- →
DSA (Medium) — Determine if Two Strings Are Close (Python, TS & Go)
Two strings are considered close if you can attain one from the other using the following operations: Operation 1: Swap any two existing characters. For example,
- →
DSA (Easy) —Linked List — Reverse Linked List (Python, Typescript & Go)
Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input:
- →
DSA (Easy) — Binary Tree — Maximum Depth of Binary Tree (Python, Typescript & Go)
Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to
- →
DSA (Medium) — Queue — Dota2 Senate
The Dota2 senate consists of senators coming from two parties. Now the Senate wants to decide on a change in the Dota2 game. The voting for this change is a round-based
- →
XOR linked list. #datastructures
- →
Master JavaScript with these 5 Exceptional GitHub Repositories
Master JavaScript with these 5 Exceptional GitHub Repositories Welcome, JavaScript enthusiasts! Whether you're just embarking on your coding journey or you're a
- →
Into the Rabbit Hole of Data Structures
This is my last post about Data Structures, I swear. Besides, there's not much more I could post about this topic since I already went down the rabbit hole with
- →
An even Deeper Dive into Data Structures
Rest Pattern and Rest Parameters The rest pattern looks the same as the spread operator (...) but it does the opposite. The spread operator builds new arrays or
- →
A Deep Dive into Data Structures in JavaScript
Data structures are the basis of JavaScript, without them we couldn't really manipulate everything, and despite variables being the most basic feature, data structures
- →
A Shallow Dive into Data Structures in JavaScript
The Deep Dive will come later guys, don't get ambitious ,first we have to learn about Data Structures before we can jump into the good stuff, the part where we actually
- →
https://ferd.ca/interval-tree-clocks.html Posted via D.Buzz
- →
How to be a Successful Blockchain Developer?
Blockchain, being the revolutionary technology that it is, has attracted lots of attention because of its disruptive potential and also opened up a new field of
- →
Everything is connected - or why I'm focusing on Relational Applications
Everything is connected with everything else one way or another. You don't have to be a fan of conspiracy theories, to be a believer in some specific religion, to
Leave datastructures Tag Posts Index to discover