Tag: leetcode

The back-end

Mid-Autumn festival + National Day to a wave of dynamic planning

December 8, 2023

by Bailey McNabb

No Comments

Xiao Kou went on an autumn trip and collected some red and yellow leaves. Using these leaves, he initially arranged a collection of autumn leaves....

Read More

The front end

I. Flip word order (JS implementation)

December 8, 2023

by James Brown

No Comments

(path loop method) Remove the space on both sides of the string, split it based on the space, filter out the space in the middle...

Read More

The back-end

Special Positions ina Binary Matrix (Python) | Python Theme Month

December 8, 2023

by 陳鈺婷

No Comments

Special Positions ina Binary Matrix (Python

Read More

The code of life

Cost [array] [array] [array] [array] [array]

December 8, 2023

by Anya Ratti

No Comments

Cost [array] [array] [array] [array] [array]

Read More

The code of life

Leetcode 1382. Balance a Binary Search Tree (Python)

December 8, 2023

by Jessica Morales

No Comments

Leetcode 1382. Balance a Binary Search Tree (Python)

Read More

The front end

Binary tree traversal (pre-ordered, middle-ordered, back-ordered)

December 8, 2023

by Debra Hill

No Comments

1 The following is the result of sequential traversal of binary tree data structure (left and right root) : 1 2 3 4 5 6...

Read More

The code of life

Offer 31. Stack push and pop sequence

December 8, 2023

by Garrett Marks

No Comments

Enter two sequences of integers. The first sequence represents the push order of the stack. Determine whether the second sequence is the eject order of...

Read More

The back-end

Leetcode – 994. Rotten Oranges [Breadth First Search]

December 7, 2023

by Patricia Meyer

No Comments

In a given grid, each cell can have one of three values: the value 0 represents an empty cell; Value 1 represents fresh oranges; A...

Read More

The back-end

102 Binary tree sequence traversal

December 7, 2023

by Miss Anne Moore

No Comments

BFS = breadth-first BFS = breadth-first BFS See the previous blog for detailed analysis of the template. The only catch is learning basic grammar and...

Read More

The code of life

LeetCode 303. Fields and retrieves – Arrays are immutable

December 7, 2023

by Paula Barton

No Comments

Given an integer array nums, find the sum of the elements in the range from index I to j (I ≤ j), including I and...

Read More

The front end

LeetCode49 – most architectural practice series sequence and | algorithm

December 7, 2023

by Arhaan Chowdhury

No Comments

This is the 23rd day that I participated in the August more text challenge, activity more text challenge preface today comes a processing array algorithm...

Read More

The back-end

Only once the digital | LeetCode brush notes

December 7, 2023

by Renee Shannon

No Comments

This is the 21st day of my participation in the August More text challenge. The activity details: August more text Challenge related articles LeetCode brush...

Read More

The back-end

☆ Clocking algorithm ☆LeetCode 64, minimum path and algorithm analysis

December 7, 2023

by Krystal Middleton

No Comments

Hello everyone, I am a little Magic dragon, Unity3D software engineer, VR, AR, virtual simulation direction, update software development skills from time to time, life...

Read More

The development tools

LeetCode solution (Go, Java, JavaScript, Kotlin, Python, Swift)

December 7, 2023

by William Mendoza

No Comments

MySolutionsforLeetCodeproblemswritteninGo,Java,JavaScript,Kotlin,PythonandSwift.Progress:92/768Solut

Read More

The front end

LeetCode 160: Intersecting linked lists

December 7, 2023

by Mark Banks

No Comments

Find and return the first node where the two lists intersect, headA and headB. If two lists do not intersect, null is returned. The graph...

Read More

The front end

[sword refers to Offer 55 – i. the depth of the binary tree] | brush topic clock in [5]

December 7, 2023

by Harriet Thompson-Hughes

No Comments

Input the root node of a binary tree and find the depth of the tree. The nodes (including root and leaf nodes) that pass from...

Read More

The front end

173. Binary search tree iterator, stack, JavaScript, detailed comments

December 7, 2023

by Miss Chloe Perry

No Comments

173. Binary search tree iterators, https://leetcode-cn.com/problems/binary-search-tree-iterator/

Read More

The front end

LeetCode 21: Merge two ordered lists – recursively

December 7, 2023

by Gerald Watkins

No Comments

This problem is really uncomfortable, because the new mouse bought yesterday is too insensitive, the click feeling is too bad, affecting the train of thought....

Read More

The front end

Offer – integer power of value (JS implementation)

December 7, 2023

by Gina Mann

No Comments

When n is odd and n is even, when n is 0 and n is negative. Case 1: (2, 4) = (2, 2) * (2,...

Read More

The back-end

Leetcode Daily problem series – Print the matrix clockwise

December 7, 2023

by Benjamin Begum-Clark

No Comments

Enter a matrix and print out each number in clockwise order from the outside in. Example 1: Example 2: Limit: Solution 1: Simulate and set...

Read More

The front end

141. Ring linked list | brush question punch

December 7, 2023

by Amira Lad

No Comments

Given a linked list, determine whether there are rings in the list. If there is a node in the list that can be reached again...

Read More

The code of life

13. Convert Roman numerals to whole numbers

December 7, 2023

by 解琬婷

No Comments

Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit Punch card activity. Click here for details. 13. Conversion of...

Read More

The front end

“LeetCode- Compare the minimum occurrence frequency of letters in strings” code optimization record

December 7, 2023

by Christopher Decker

No Comments

If you want to try it out, you can click here: LeetCode title - 1170. When converting a string to an Array, using s.split(") is...

Read More

The front end

LeetCode347. The first K high frequency elements

December 7, 2023

by Aaron Lee

No Comments

If you are given an integer array nums and an integer K, please return the element with the highest frequency K. You can return the...

Read More

The front end

The sum of two numbers

December 7, 2023

by Maia Stone

No Comments

Given an integer array nums and an integer target value target, find the two integers in the array and the target value target and return...

Read More

The back-end

A number of consecutive 1 biggest | punch brush

December 7, 2023

by Bradley Carroll

No Comments

Given a binary array, count the maximum number of consecutive 1s in it. Explanation: The first two digits and the last three digits are consecutive...

Read More

The front end

Finger Offer — path in matrix (JS implementation)

December 7, 2023

by Kaia Cole-Brown

No Comments

DFS + prune first iterates through the array to find the first element that is the same as the last element in the string. Then,...

Read More

The front end

LeetCode: 198

December 7, 2023

by Chelsea Heath

No Comments

You are a professional thief and plan to rob the houses along the street. There is a certain amount of cash hidden in each room,...

Read More

The code of life

Leetcode.83 Removes duplicate elements from sorted linked lists

December 7, 2023

by Arhaan Chowdhury

No Comments

83. Delete duplicate elements in sorted list - LeetCode (leetcode-cn.com) there is a list in ascending order, give you the head node of this list,...

Read More

The back-end

Leetcode 240. Search a 2D Matrix II [Search a 2D array in ascending order from left to right, from top to bottom, to find if a value exists, true if it does, and vice versa

December 7, 2023

by Fiona Atkinson

No Comments

Write an efficient algorithm that searches for a target value in an m x n integer matrix. The matrix

Read More