The Best LeetCode Personal Problem Solving Summary tutorial and blogs for Beginners and Experts at Moment For Technology

Tag: LeetCode Personal Problem Solving Summary

LeetCode-136- A number that appears only once

December 15, 2023

by Tammy Hood

No Comments

Given an array of non-empty integers, each element occurs twice except for one. Find the element that appears only once. Description: Your algorithm should have...

java

LEETCODE -121- The best time to buy or sell stocks

December 15, 2023

by 張雅惠

No Comments

Given an array of prices, the ith element of prices[I] represents the price of a given stock on day I. You can only buy the...

java

Leetcode-125 – Verify palindrome strings

December 15, 2023

by James Brown

No Comments

Given a string, verify that it is a palindrome string. Only consider alphanumeric characters. You can ignore the case of the letters. Note: In this...

java

Leetcode-067 – Binary Sum

December 15, 2023

by Patricia Randolph

No Comments

Description: Give you two binary strings and return their sum (in binary). The input is a non-empty string and contains only the digits 1 and...

java

LeetCode-118- Yang Hui Triangle

December 15, 2023

by Michael Hester

No Comments

NumRows = NumRows = NumRows = NumRows = NumRows = NumRows = NumRows = NumRows = NumRows In the Yang Hui Triangle, each number is...

LeetCode Personal Problem Solving Summary

Question 21: The diameter of the binary tree

December 15, 2023

by 余雅琪

No Comments

Diameter points of a binary tree: what the root node needs to do is to add the height of the left subtree and the right...

java

LeetCode-119- Yang Hui Triangle II

December 15, 2023

by Mr. Oliver Jones

No Comments

Description: Given a non-negative index k, where k ≤ 33, return the KTH row of the Yanghui Triangle. In the Yang Hui Triangle, each number...

java

LeetCode-144- Preorder traversal of a binary tree

December 14, 2023

by Wendy Haynes

No Comments

Given the root node of the binary tree, return the pre-order traversal of its node values. See the LeetCode website for an example. The copyright...

LeetCode Personal Problem Solving Summary

Question 20: The diameter of the binary tree

December 14, 2023

by Tushar Sunder

No Comments

Important: The diameter of a binary tree is the maximum number of nodes formed by the left and right subtrees and the root node minus...

java

Leetcode-083 – Removes duplicate elements in sorted linked list

December 14, 2023

by Vanessa Johnson

No Comments

Description: There is a linked list in ascending order. Given the head node of the linked list, please delete all duplicate elements so that each...

java

The square root of leetcode-069 -x

December 14, 2023

by Gerald Watkins

No Comments

Implement int SQRT (int x). Calculates and returns the square root of x, where x is a nonnegative integer. Since the return type is an...

java

LeetCode – 070 – climbing the stairs

December 14, 2023

by Mrs. Amy Ford

No Comments

Description: Suppose you are climbing the stairs. It takes n steps to get to the top. You can climb 1 or 2 steps at a...

java

Leetcode-058 – The length of the last word

December 14, 2023

by Erin Hammond

No Comments

Description: You are given a string S, which consists of several words separated by Spaces. Returns the length of the last word in the string....

java

Leetcode-112 – Path Sum

December 14, 2023

by Brittany Hampton

No Comments

Given the root node of the binary tree and an integer targetSum representing the targetSum, determine if there is a path from the root node...

java

[Jian refers to の selected] detailed “delete the linked list of repeated nodes” two solutions

December 14, 2023

by Barbara Gonzalez

No Comments

This is "JZ 56 Delete Duplicated Node in Linked List" on Niuke.com, difficulty is "Difficult". Tag: "Offer", "linked list", "single linked list" in a sorted...

java

LeetCode – 066 – plus one

December 14, 2023

by Marion Johnson

No Comments

Given a non-negative integer represented by a non-empty array of integers, add one to the number. The highest digit is stored at the top of...

java

Leetcode-026 – Deletes duplicates in ordered arrays

December 14, 2023

by Andrea Oliver

No Comments

Return the new length of the array after deleting each element only once. Return the new length of the array after deleting the element. Instead...

java

Leetcode-035 – Search for insert location

December 14, 2023

by Jennifer Curtis

No Comments

Given a sorted array and a target value, find the target value in the array and return its index. If the target value does not...

java

LeetCode-111- Minimum depth of a binary tree

December 14, 2023

by Alisha Chaudhari

No Comments

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes on the shortest path from the root node to...

java

LeetCode-104- Maximum depth of a binary tree

December 14, 2023

by Gabriel Washington

No Comments

Given a binary tree, find its maximum depth. The depth of the binary tree is the number of nodes along the longest path from the...

java

Leetcode-101 – Symmetric Binary Trees

December 14, 2023

by 周佳樺

No Comments

Given a binary tree, check if it is mirror symmetric. See the LeetCode website for an example. The copyright belongs to Lankou Network. Commercial reprint...

java