Waivio

algorithms

Experts

denmarkguy

PeakD

Algorithms and Echo Chambers

There is an old truism that "birds have a feather flock together." It speaks to the fact that we humans tend to gravitate towar...

just-writes

PeakD

Behaviors

Are Behaviors Learned or Inherited? Algorithms and Behavior Behavior can absolutely be influenced by the environment (or algorithms). Let...

redx.chat

Unchaining the Mind

▶️ Watch on 3Speak Our media landscape — whether it's social media or mainstream news — is filled with narratives. These stories are sha...

cmplxty

PeakD

You've Been Spotted

Hi fellow Hiveians, Today I wanted to talk about a bit of a situation I figured out the other day! You've Been Spotted There are for su...

cmplxty

PeakD

Throw a Wrench

Hi fellow Hiveians, Today I wanted to bring forward a hilarious but effective resolution! Throw a Wrench Every so often I see something...

waivio_james-mitchell

Waivio

How will AI in global trade reshape shipping and logistics networks?

Global trade is the backbone of our economy, and at its heart lies the shipping and logistics industry—a complex web of ports, routes, wa...

sayu907

Trapped in the Feed: The Personality You Didn’t Choose

Social media has surely evolved quite a lot in the past decade. It has also taken a lot of importance as well as the influence that it ha...

cmplxty

PeakD

Experimental Edit Enjoyment

Hi fellow Hiveians, Today Experimental Edit Enjoyment Every now and then I like to push the envelope a little bit in my photos! I don't...

takhar

An Insidious Beast Of Modern Engineering

What's a modern reality that's overlooked, both in its immense benefit and subtle detriment? Is it the constant connectivity that blurs t...

simplestack

PeakD

DSA (Medium) - Graph - Keys and Rooms (Python, Typescript & Go)

There are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0. Your goal is to visit all the rooms. However, ...

simplestack

PeakD

DSA (Medium) - Binary Search Tree - Delete Node in a BST (Python, Typescript & Go)

Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly ...

simplestack

PeakD

DSA (Easy) - Binary Search Tree - Search in a Binary Search Tree (Python, Typescript & Go)

You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and r...

simplestack

PeakD

DSA (Medium) - Binary Tree - Maximum Level Sum of a Binary Tree (Python, Typescript & Go)

Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level x such...

simplestack

PeakD

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&qu...

simplestack

PeakD

DSA (Medium) - Binary Tree - Binary Tree Right Side View (Typescript, Python & Rust)

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered f...

simplestack

PeakD

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 Wikiped...

simplestack

PeakD

DSA (Medium) — Linked List — Maximum Twin Sum of a Linked List (Python, Typescript & Go)

In a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0

simplestack

PeakD

DSA (Medium) — Binary Tree — Count Good Nodes in Binary Tree (Python, Typescript & Rust)

Source: Leetcode.com Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with ...

simplestack

PeakD

DSA (Medium) —Linked List — Odd Even Linked List (Python, Typescript & Go)

Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and retur...

simplestack

PeakD

How To Reverse Words in a String (Python, Typescript and Go)

Write a function that takes a string as input and returns a new string with the words in reverse order. Words are sequences of non-space...

simplestack

PeakD

How To Know If Two Vectors Are Colinear? (Python)

“Collinearity of vectors is the silent language of geometry, where lines speak in unison and points align with purpose.” — Unknown In ...

simplestack

PeakD

Interviewer: Kids With the Greatest Number of Candies (Typescript, Python, Go)

You have n children, each with a certain number of candies. The number of candies each child has is given in the integer array candies, ...

simplestack

PeakD

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 whethe...

simplestack

PeakD

DSA (Medium) — Stack — Removing Stars From a String (Python, Typescript & Go)

You are given a string (s), which contains stars (*). In one operation, you can: Choose a star in (s). Remove the closest non-star char...

simplestack

PeakD

DSA (Easy) — Find Pivot Index

Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers ...

simplestack

PeakD

DSA (Easy) — Unique Number of Occurrences (Python, TS & Go)

Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise. Exampl...

simplestack

PeakD

DSA (Medium) — Stack — Asteroid Collision (Python, Typescript & Go)

We are given an array asteroids of integers representing asteroids in a row. The indices of the asteriod in the array represent their re...

simplestack

PeakD

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 col...

simplestack

PeakD

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 ...

simplestack

PeakD

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 ...