dsa

hashtag
33.70

Experts

Show more authors

cryptoguy

53.49

EU warns Shein with fines for misleading practices like fake discounts, price ...

... manipulation, and greenwashing! Belgium, France, and others are cracking down for better consumer protection. ⚠️🛑 #Shein #EU #Consume...

simplestack

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
PeakD

F*ck Leetcode! Why Roy’s Story Matters

Today, let’s dive into something that’s been buzzing around the tech world: the case of Roy and why it’s a wake-up call for our industry...

simplestack

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

0.31
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

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

simplestack

0.31
PeakD

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

simplestack

0.31
PeakD

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

simplestack

0.31
PeakD

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

simplestack

0.31
PeakD

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

simplestack

0.31
PeakD

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

simplestack

0.31
PeakD

DSA (Easy) — Find the Highest Altitude (TS, Python, Go & Rust)

Let’s say you have a line of candy pieces, and each piece has a certain number of calories: Candy Line: [2, 5, 1, 8, 3] (These numbers r...

waivio_nazarii-undefine

0.00
Waivio

Game

I play on both my laptop and phone, so having a casino that works well on all devices is important. Casino 13 is optimized for mobile gam...