Problem

Problem Source: 2926. Maximum Balanced Subsequence Sum

This article is an analysis of the solution to the last problem in LeetCode Weekly Contest 370, which I failed to solve. The solution refers to the article by endlesscheng。

Overview

LeetCode Weekly Contest 370

This article is a summary of the weekly contest. I do not plan to discuss each problem in detail; for some problems, I will only provide a rough outline. The point of this article is self-reflection and improvement.

Achieved AC in the first three problems within 23 minutes, resulting in a ranking around 300 - more like a typing contest emphasizing speed rather than a coding contest. Brief description of problem-solving:

• Problem 1: Easy problem but got stuck for 5 minutes 😒;
• Problem 2: Similar to the first one in terms of background, also easy problem, but solved faster 😋;
• Problem 3: A real medium-level problem that required a bit more thought, solved in 15 minutes, not bad 😋;
• Problem 4: Couldn't solve. If the data range is small, it's a simple DP problem, but couldn't find an optimization 😒;

Problem

Source: 2127. Maximum Employees to Be Invited to a Meeting (Daily Problem)

A company is organizing a meeting and has a list of n employees, waiting to be invited. They have arranged for a large circular table, capable of seating any number of employees.

The employees are numbered from 0 to n - 1. Each employee has a favorite person and they will attend the meeting only if they can sit next to their favorite person at the table. The favorite person of an employee is not themselves.

Given a 0-indexed integer array favorite, where favorite[i] denotes the favorite person of the ith employee, return the maximum number of employees that can be invited to the meeting.

Example 1

Input: favorite = [2,2,1,2] Output: 3

Overview

LeetCode Weekly Contest 369

This article is a summary of the contest. I don't plan to discuss each problem in detail, but will provide general ideas. The point of this article is self-reflection and improvement.

After reviewing the contest, it is not so difficult. Here is a brief description of my performance on each problem:

• Problem 1: Simple simulation problem, an easy one.
• Problem 2: Not difficult, but requires consideration of multiple cases. Unfortunately, I didn't think thoroughly, resulting in 3 WA 😒.
• Problem 3: a Medium-level DP problem. Initially struggled to come up with a solution, wasted time on the unsolved problem 4, but eventually solved it quickly 😋.
• Problem 4: Despite being a hard-level problem and not solved during the contest, the code only exceeded time limits. After the contest, I figured out an optimization method by myself. Note that the messy logic during coding led to 2 WA 😒.

Problem

Problem Source： 1424. Diagonal Traverse II

Problem Description：

Given a 2D integer array nums, return all elements of nums in diagonal order as shown in the below images.

Example 1:

1 2	Input: nums = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,4,2,7,5,3,8,6,9]

Introduction

Azure Pipelines is a component of Azure DevOps (a SaaS platform) and serves as an automated CI/CD pipeline. Similar technologies include GitHub Actions and Jenkins.

As users, we only need to define various tasks in YAML, trigger the pipeline, and Azure Pipelines automatically executes these tasks for us.

So, how are tasks executed? Is there a limit to parallel tasks? How can we design YAML more efficiently to make a pipeline run faster? This article will analyze the architecture of Azure Pipelines from the perspective of task scheduling, providing answers to these questions along the way.

Problem

Problem Source：59. Spiral Matrix II

Problem Description：

Given a positive integer n, generate an n x n matrix filled with elements from 1 to n^2 in spiral order.

Example 1:

1 2	Input: n = 3 Output: [[1,2,3],[8,9,4],[7,6,5]]

Problem

Problem Source: NowCoder Online Test

Given an array $nums$ indexing from $0$ and a non-negative integer $k$.

In one operation, you can perform the following:

• Choose an index $i$ not chosen before, where $i$ is in the range $[0, nums.length - 1]$.
• Replace $nums[i]$ with any integer in the range $[nums[i] - k, nums[i] + k]$ (inclusive).

After applying any times of operations, return the maximum possible score of the array $nums$.

The array's score is defined as the "maximum number of repeated elements in the array".

Note that you can only apply the operation once for each index.