## [typescript] linked list algorithm question type and method summary

Linked list questions have been brushed about 20 times, and some rules have been summarized and shared with youProblem solving ideasThe main ideas are recursion and iteration, which also includes some skilled operations, such as fast and slow pointers. These summarized problem-solving ideas should not be a problem to deal with most linked list ...

Posted on Mon, 06 Dec 2021 21:57:02 -0500 by oskare100

## Java description LeetCode, 135. Candy distribution

Hello everyone, I'm hehaige and focus on the back end. If I can, I want to be a code designer instead of an ordinary coder to witness the growth of hehaige. Your comments and praise are my biggest driving force. If you have any mistakes, please don't hesitate to comment. Thank you very much. Let's support the original! If there is a clerical er ...

Posted on Sun, 05 Dec 2021 14:30:42 -0500 by megaalf

## [algorithm] [speed pointer] intersection of circular linked list -- Explanation of two classic topics of force deduction [super detailed nanny level tutorial]

[algorithm] [speed pointer] intersection of circular linked list - explanation of two classic topics of force deduction [super detailed nanny level tutorial] It's not easy to like first and then look good. It's all done with great care. I hope to get support. Your praise and support is a very important motivation for me. Don't forget to pay att ...

Posted on Sun, 05 Dec 2021 07:48:49 -0500 by rakhi

## LeetCode.682 baseball game stack (simple)

You are now the recorder of a baseball game with a special game system. This game consists of several rounds. The scores in the past few rounds may affect the scores in the next few rounds. At the beginning of the game, the record was blank. You will get a string list of recorded operations ops, where ops[i] is the ith operation you need to re ...

Posted on Sat, 04 Dec 2021 22:25:02 -0500 by qartis

## Interview questions of dynamic programming of leetcode

1. Maximum sum of continuous subarrays Enter an integer array array with length n. one or consecutive integers in the array form a sub array. Find the maximum value of the sum of all subarrays. Data range: 1 <= n <= 10^51<=n<=105 -100 <= a[i] <= 100−100<=a[i]<=100 Requirement: the time complexity is   O (n), spa ...

Posted on Sat, 04 Dec 2021 19:47:51 -0500 by Chief

## leetcode -- hash table column

Prerequisite knowledge Theoretical basis of hash table C + + version Topic overview 242. Valid acronyms 349. Intersection of two arrays 202. Happy number 1. Sum of two numbers 454. Adding four numbers II 383. Ransom letter 15. Sum of three 18. Sum of four numbers Detailed explanation of the topic 242. Valid acronyms Overall thinking ...

Posted on Sat, 04 Dec 2021 19:12:16 -0500 by Alffallen

## leetcode lecture on algorithm interview in Dachang 19. Array

leetcode lecture on algorithm interview in Dachang 19. Array Video Explanation (efficient learning): Click to learn catalog: 1. Introduction 2. Time and space complexity 3. Dynamic planning 4. Greed 5. Binary search 6. Depth first & breadth first 7. Double pointer 8. Sliding window 9. Bit operation 10. Recursion & divide and conquer 11 ...

Posted on Fri, 03 Dec 2021 23:50:00 -0500 by kaitan

## leetcode essence of algorithm interview in Dachang 17. Stack

leetcode essence of algorithm interview in Dachang 17. Stack Video Explanation (efficient learning): Click to learn catalog: 1. Introduction 2. Time and space complexity 3. Dynamic planning 4. Greed 5. Binary search 6. Depth first & breadth first 7. Double pointer 8. Sliding window 9. Bit operation 10. Recursion & divide and conquer 11 ...

Posted on Fri, 03 Dec 2021 01:45:17 -0500 by dub

## Longest substring without duplicate characters

1. Brute force method class Solution { public int lengthOfLongestSubstring(String s) { if(s==null){ throw new NullPointerException(); } if(s.isEmpty()){ return 0; } if(s.length()==1){ return 1; } String sbTemp; String sbMax = s.substring( ...

Posted on Thu, 02 Dec 2021 23:41:12 -0500 by Sako

## leetcode lecture on algorithm interview in Dachang 14. Sorting algorithm

leetcode lecture on algorithm interview in Dachang 14. Sorting algorithmVideo Explanation (efficient learning): Click to learncatalog:1. Introduction2. Time and space complexity3. Dynamic planning4. Greed5. Binary search6. Depth first & breadth first7. Double pointer8. Sliding window9. Bit operation10. Recursion & divide and conquer11 P ...

Posted on Wed, 01 Dec 2021 23:55:58 -0500 by PunjabHaker