Echo's Home

2359. Find Closest Node to Given Two Nodes

Description

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

1474. Delete N Nodes After M Nodes of a Linked List

Description

You are given the head of a linked list and two integers m and n.

2502. Design Memory Allocator

Description

You are given an integer n representing the size of a 0-indexed memory array. All memory units are initially free.

2408. Design SQL

Description

You are given two string arrays, names and columns, both of size n. The i^th table is represented by the name names[i] and contains columns[i] number of columns.

2043. Simple Bank System

Description

You have been tasked with writing a program for a popular bank that will automate all its incoming transactions (transfer, deposit, and withdraw). The bank has n accounts numbered from 1 to n. The initial balance of each account is stored in a 0-indexed integer array balance, with the (i + 1)^th account having an initial balance of balance[i].

2325. Decode the Message

Description

You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows:

281. Zigzag Iterator

Description

Given two vectors of integers v1 and v2, implement an iterator to return their elements alternately.

2604. Minimum Time to Eat All Grains

Description

There are n hens and m grains on a line. You are given the initial positions of the hens and the grains in two integer arrays hens and grains of size n and m respectively.

2488. Count Subarrays With Median K

Description

You are given an array nums of size n consisting of distinct integers from 1 to n and a positive integer k.

DDIA

Chapter 1: Reliable, Scalable, and Maintainable Applications

A data-intensive application is typically built from standard building blocks. They usually need to: