SYMBOL INDEX (5343 symbols across 1641 files) FILE: ctl/command.go function execute (line 15) | func execute() { function init (line 22) | func init() { FILE: ctl/config.go constant configTOML (line 11) | configTOML = "config.toml" type config (line 14) | type config struct method String (line 21) | func (c config) String() string { function getConfig (line 25) | func getConfig() *config { FILE: ctl/error.go constant ExitSuccess (line 10) | ExitSuccess = iota constant ExitError (line 12) | ExitError constant ExitBadArgs (line 14) | ExitBadArgs function ExitWithError (line 18) | func ExitWithError(code int, err error) { FILE: ctl/label.go function getChapterFourFileOrder (line 78) | func getChapterFourFileOrder() ([]string, []int) { function newLabelCommand (line 86) | func newLabelCommand() *cobra.Command { function newAddPreNext (line 99) | func newAddPreNext() *cobra.Command { function newDeletePreNext (line 112) | func newDeletePreNext() *cobra.Command { function addPreNext (line 125) | func addPreNext() { function addPreNextLabel (line 138) | func addPreNextLabel(order, preOrder []string, chapterFourIds []int, pre... function eofAdd (line 202) | func eofAdd(filePath string, labelString string) ([]byte, error) { function delPreNext (line 225) | func delPreNext() { function delPreNextLabel (line 237) | func delPreNextLabel(order []string, chapterFourIds []int, chapter strin... function needAdd (line 269) | func needAdd(filePath string) (bool, error) { function eofDel (line 295) | func eofDel(filePath string) ([]byte, error) { function removeLine (line 337) | func removeLine(path string, lineNumber int) { FILE: ctl/main.go function main (line 3) | func main() { FILE: ctl/models/lcproblems.go type LeetCodeProblemAll (line 9) | type LeetCodeProblemAll struct function ConvertUserInfoModel (line 26) | func ConvertUserInfoModel(lpa LeetCodeProblemAll) UserInfo { type StatStatusPairs (line 41) | type StatStatusPairs struct function ConvertMdModelFromSsp (line 52) | func ConvertMdModelFromSsp(problems []StatStatusPairs) []Mdrow { function ConvertMdModelFromIds (line 68) | func ConvertMdModelFromIds(problemsMap map[int]StatStatusPairs, ids []in... type Stat (line 84) | type Stat struct type Difficulty (line 95) | type Difficulty struct FILE: ctl/models/mdrow.go type Mdrow (line 9) | type Mdrow struct method tableLine (line 56) | func (m Mdrow) tableLine() string { function GenerateMdRows (line 20) | func GenerateMdRows(solutionIds []int, mdrows []Mdrow) { type SortByQuestionID (line 61) | type SortByQuestionID method Len (line 63) | func (a SortByQuestionID) Len() int { return len(a) } method Swap (line 64) | func (a SortByQuestionID) Swap(i, j int) { a[i], a[j] = a[j], a[i] } method Less (line 65) | func (a SortByQuestionID) Less(i, j int) bool { type Mdrows (line 70) | type Mdrows struct method table (line 76) | func (mds Mdrows) table() string { method AvailableTable (line 88) | func (mds Mdrows) AvailableTable() string { FILE: ctl/models/tagproblem.go type Graphql (line 13) | type Graphql struct type GraphQLResp (line 22) | type GraphQLResp struct type TopicTag (line 30) | type TopicTag struct type Question (line 40) | type Question struct method generateTagStatus (line 62) | func (q Question) generateTagStatus() (TagStatus, error) { type TopicTags (line 55) | type TopicTags struct type TagStatus (line 73) | type TagStatus struct function ConvertMdModelFromQuestions (line 82) | func ConvertMdModelFromQuestions(questions []Question) []Mdrow { type TagList (line 102) | type TagList struct method tableLine (line 114) | func (t TagList) tableLine() string { function standardizedTitle (line 118) | func standardizedTitle(orig string, frontendQuestionID int32) string { function GenerateTagMdRows (line 154) | func GenerateTagMdRows(solutionIds []int, metaMap map[int]TagList, mdrow... type TagLists (line 179) | type TagLists struct method table (line 185) | func (tls TagLists) table() string { method AvailableTagTable (line 197) | func (tls TagLists) AvailableTagTable() string { type FavoritesLists (line 202) | type FavoritesLists struct type Gproblem (line 224) | type Gproblem struct type Gstat (line 265) | type Gstat struct type GcodeSnippet (line 279) | type GcodeSnippet struct FILE: ctl/models/user.go type UserInfo (line 8) | type UserInfo struct method table (line 28) | func (ui UserInfo) table() string { method PersonalData (line 42) | func (ui UserInfo) PersonalData() string { FILE: ctl/pdf.go function newPDFCommand (line 43) | func newPDFCommand() *cobra.Command { function generatePDF (line 56) | func generatePDF() { function loadChapter (line 97) | func loadChapter(order []string, path, chapter string) ([]byte, error) { function prepare (line 128) | func prepare(path string) { function clean (line 171) | func clean(filePath string) ([]byte, error) { function removeHeader (line 213) | func removeHeader(path, newPath string, lineNumber int) { FILE: ctl/rangking.go function getRanking (line 10) | func getRanking() int { FILE: ctl/refresh.go function newRefresh (line 7) | func newRefresh() *cobra.Command { function refresh (line 20) | func refresh() { FILE: ctl/render.go function newBuildCommand (line 28) | func newBuildCommand() *cobra.Command { function newBuildREADME (line 42) | func newBuildREADME() *cobra.Command { function newBuildChapterTwo (line 55) | func newBuildChapterTwo() *cobra.Command { function newBuildMenu (line 68) | func newBuildMenu() *cobra.Command { function buildREADME (line 81) | func buildREADME() { function renderReadme (line 122) | func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdr... function buildChapterTwo (line 168) | func buildChapterTwo(internal bool) { function loadMetaData (line 209) | func loadMetaData(filePath string) (map[int]m.TagList, error) { function renderChapterTwo (line 239) | func renderChapterTwo(filePath string, tls m.TagLists) ([]byte, error) { function buildBookMenu (line 267) | func buildBookMenu() { function copyLackFile (line 280) | func copyLackFile() { function generateMenu (line 311) | func generateMenu() string { function menuLine (line 321) | func menuLine(order []string, chapter string) string { function renderBookMenu (line 341) | func renderBookMenu(filePath string) ([]byte, error) { FILE: ctl/request.go constant AllProblemURL (line 14) | AllProblemURL = "https://leetcode.com/api/problems/all/" constant QraphqlURL (line 16) | QraphqlURL = "https://leetcode.com/graphql" constant LoginPageURL (line 18) | LoginPageURL = "https://leetcode.com/accounts/login/" constant AlgorithmsURL (line 20) | AlgorithmsURL = "https://leetcode.com/api/problems/Algorithms/" constant ArrayProblemURL (line 23) | ArrayProblemURL = "https://leetcode.com/tag/array/" function newReq (line 28) | func newReq() *request.Request { function signin (line 35) | func signin() *request.Request { function getRaw (line 49) | func getRaw(URL string) []byte { function getProblemAllList (line 69) | func getProblemAllList() []byte { type Variables (line 74) | type Variables struct function getQraphql (line 78) | func getQraphql(payload string) []byte { function getTopicTag (line 98) | func getTopicTag(variable string) string { function getTagProblemList (line 108) | func getTagProblemList(tag string) []byte { FILE: ctl/statistic.go function statisticalData (line 10) | func statisticalData(problemsMap map[int]m.StatStatusPairs, solutionIds ... FILE: ctl/template_render.go function makeReadmeFile (line 14) | func makeReadmeFile(mdrows m.Mdrows) { function readTMPL (line 27) | func readTMPL(path string) string { FILE: ctl/util/util.go function LoadSolutionsDir (line 16) | func LoadSolutionsDir() ([]int, []string, int) { function loadFile (line 22) | func loadFile(path string) ([]int, []string, int) { function GetAllFile (line 48) | func GetAllFile(pathname string, fileList *[]string) ([]string, error) { function LoadChapterFourDir (line 63) | func LoadChapterFourDir() ([]string, []int) { function WriteFile (line 92) | func WriteFile(fileName string, content []byte) { function LoadFile (line 107) | func LoadFile(filePath string) ([]byte, error) { function DestoryDir (line 128) | func DestoryDir(path string) { function CopyFile (line 149) | func CopyFile(dstName, srcName string) (written int64, err error) { function BinarySearch (line 164) | func BinarySearch(nums []int, target int) int { function GetChpaterFourFileNum (line 180) | func GetChpaterFourFileNum(num int) string { FILE: leetcode/0001.Two-Sum/1. Two Sum.go function twoSum (line 3) | func twoSum(nums []int, target int) []int { FILE: leetcode/0001.Two-Sum/1. Two Sum_test.go type question1 (line 8) | type question1 struct type para1 (line 15) | type para1 struct type ans1 (line 22) | type ans1 struct function Test_Problem1 (line 26) | func Test_Problem1(t *testing.T) { FILE: leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go function addTwoNumbers (line 18) | func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { FILE: leetcode/0002.Add-Two-Numbers/2. Add Two Numbers_test.go type question2 (line 10) | type question2 struct type para2 (line 17) | type para2 struct type ans2 (line 24) | type ans2 struct function Test_Problem2 (line 28) | func Test_Problem2(t *testing.T) { FILE: leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go function lengthOfLongestSubstring (line 4) | func lengthOfLongestSubstring(s string) int { function lengthOfLongestSubstring1 (line 30) | func lengthOfLongestSubstring1(s string) int { function lengthOfLongestSubstring2 (line 52) | func lengthOfLongestSubstring2(s string) int { function max (line 66) | func max(a int, b int) int { FILE: leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters_test.go type question3 (line 8) | type question3 struct type para3 (line 15) | type para3 struct type ans3 (line 21) | type ans3 struct function Test_Problem3 (line 25) | func Test_Problem3(t *testing.T) { FILE: leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays.go function findMedianSortedArrays (line 3) | func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { function max (line 45) | func max(a int, b int) int { function min (line 52) | func min(a int, b int) int { FILE: leetcode/0004.Median-of-Two-Sorted-Arrays/4. Median of Two Sorted Arrays_test.go type question4 (line 8) | type question4 struct type para4 (line 15) | type para4 struct type ans4 (line 22) | type ans4 struct function Test_Problem4 (line 26) | func Test_Problem4(t *testing.T) { FILE: leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring.go function longestPalindrome (line 4) | func longestPalindrome(s string) string { function min (line 46) | func min(x, y int) int { function longestPalindrome1 (line 54) | func longestPalindrome1(s string) string { function longestPalindrome2 (line 80) | func longestPalindrome2(s string) string { function maxPalindrome (line 89) | func maxPalindrome(s string, i, j int, res string) string { function longestPalindrome3 (line 103) | func longestPalindrome3(s string) string { FILE: leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go type question5 (line 8) | type question5 struct type para5 (line 15) | type para5 struct type ans5 (line 21) | type ans5 struct function Test_Problem5 (line 25) | func Test_Problem5(t *testing.T) { FILE: leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion.go function convert (line 3) | func convert(s string, numRows int) string { FILE: leetcode/0006.ZigZag-Conversion/6. ZigZag Conversion_test.go type question6 (line 8) | type question6 struct type para6 (line 15) | type para6 struct type ans6 (line 22) | type ans6 struct function Test_Problem6 (line 26) | func Test_Problem6(t *testing.T) { FILE: leetcode/0007.Reverse-Integer/7. Reverse Integer.go function reverse7 (line 3) | func reverse7(x int) int { FILE: leetcode/0007.Reverse-Integer/7. Reverse Integer_test.go type question7 (line 8) | type question7 struct type para7 (line 15) | type para7 struct type ans7 (line 21) | type ans7 struct function Test_Problem7 (line 25) | func Test_Problem7(t *testing.T) { FILE: leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go function myAtoi (line 3) | func myAtoi(s string) int { FILE: leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go type question8 (line 8) | type question8 struct type para8 (line 15) | type para8 struct type ans8 (line 21) | type ans8 struct function Test_Problem8 (line 25) | func Test_Problem8(t *testing.T) { FILE: leetcode/0009.Palindrome-Number/9. Palindrome Number.go function isPalindrome (line 6) | func isPalindrome(x int) bool { function isPalindrome1 (line 31) | func isPalindrome1(x int) bool { FILE: leetcode/0009.Palindrome-Number/9. Palindrome Number_test.go type question9 (line 8) | type question9 struct type para9 (line 15) | type para9 struct type ans9 (line 21) | type ans9 struct function Test_Problem9 (line 25) | func Test_Problem9(t *testing.T) { FILE: leetcode/0011.Container-With-Most-Water/11. Container With Most Water.go function maxArea (line 3) | func maxArea(height []int) int { FILE: leetcode/0011.Container-With-Most-Water/11. Container With Most Water_test.go type question11 (line 8) | type question11 struct type para11 (line 15) | type para11 struct type ans11 (line 21) | type ans11 struct function Test_Problem11 (line 25) | func Test_Problem11(t *testing.T) { FILE: leetcode/0012.Integer-to-Roman/12. Integer to Roman.go function intToRoman (line 3) | func intToRoman(num int) string { FILE: leetcode/0012.Integer-to-Roman/12. Integer to Roman_test.go type question12 (line 8) | type question12 struct type para12 (line 15) | type para12 struct type ans12 (line 21) | type ans12 struct function Test_Problem12 (line 25) | func Test_Problem12(t *testing.T) { FILE: leetcode/0013.Roman-to-Integer/13. Roman to Integer.go function romanToInt (line 13) | func romanToInt(s string) int { FILE: leetcode/0013.Roman-to-Integer/13. Roman to Integer_test.go type question13 (line 8) | type question13 struct type para13 (line 15) | type para13 struct type ans13 (line 21) | type ans13 struct function Test_Problem13 (line 25) | func Test_Problem13(t *testing.T) { FILE: leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go function longestCommonPrefix (line 3) | func longestCommonPrefix(strs []string) string { FILE: leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go type question14 (line 8) | type question14 struct type para14 (line 14) | type para14 struct type ans14 (line 19) | type ans14 struct function Test_Problem14 (line 23) | func Test_Problem14(t *testing.T) { FILE: leetcode/0015.3Sum/15. 3Sum.go function threeSum (line 8) | func threeSum(nums []int) [][]int { function threeSum1 (line 41) | func threeSum1(nums []int) [][]int { FILE: leetcode/0015.3Sum/15. 3Sum_test.go type question15 (line 8) | type question15 struct type para15 (line 15) | type para15 struct type ans15 (line 21) | type ans15 struct function Test_Problem15 (line 25) | func Test_Problem15(t *testing.T) { FILE: leetcode/0016.3Sum-Closest/16. 3Sum Closest.go function threeSumClosest (line 9) | func threeSumClosest(nums []int, target int) int { function threeSumClosest1 (line 36) | func threeSumClosest1(nums []int, target int) int { function abs (line 51) | func abs(a int) int { FILE: leetcode/0016.3Sum-Closest/16. 3Sum Closest_test.go type question16 (line 8) | type question16 struct type para16 (line 15) | type para16 struct type ans16 (line 22) | type ans16 struct function Test_Problem16 (line 26) | func Test_Problem16(t *testing.T) { FILE: leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number.go function letterCombinations (line 21) | func letterCombinations(digits string) []string { function findCombination (line 30) | func findCombination(digits *string, index int, s string) { function letterCombinations_ (line 44) | func letterCombinations_(digits string) []string { function letterCombinationsBT (line 83) | func letterCombinationsBT(digits string) []string { function letterFunc (line 92) | func letterFunc(res string, digits string) { FILE: leetcode/0017.Letter-Combinations-of-a-Phone-Number/17. Letter Combinations of a Phone Number_test.go type question17 (line 8) | type question17 struct type para17 (line 15) | type para17 struct type ans17 (line 21) | type ans17 struct function Test_Problem17 (line 25) | func Test_Problem17(t *testing.T) { FILE: leetcode/0018.4Sum/18. 4Sum.go function fourSum (line 6) | func fourSum(nums []int, target int) (quadruplets [][]int) { function fourSum1 (line 36) | func fourSum1(nums []int, target int) [][]int { function kSum (line 43) | func kSum(nums []int, left, right int, target int, k int, cur []int, res... function twoSum (line 63) | func twoSum(nums []int, left, right int, target int, cur []int, res *[][... function fourSum2 (line 90) | func fourSum2(nums []int, target int) [][]int { FILE: leetcode/0018.4Sum/18. 4Sum_test.go type question18 (line 8) | type question18 struct type para18 (line 15) | type para18 struct type ans18 (line 22) | type ans18 struct function Test_Problem18 (line 26) | func Test_Problem18(t *testing.T) { FILE: leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go function removeNthFromEnd (line 19) | func removeNthFromEnd(head *ListNode, n int) *ListNode { function removeNthFromEnd1 (line 35) | func removeNthFromEnd1(head *ListNode, n int) *ListNode { FILE: leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go type question19 (line 10) | type question19 struct type para19 (line 17) | type para19 struct type ans19 (line 24) | type ans19 struct function Test_Problem19 (line 28) | func Test_Problem19(t *testing.T) { FILE: leetcode/0020.Valid-Parentheses/20. Valid Parentheses.go function isValid (line 3) | func isValid(s string) bool { FILE: leetcode/0020.Valid-Parentheses/20. Valid Parentheses_test.go type question20 (line 8) | type question20 struct type para20 (line 15) | type para20 struct type ans20 (line 21) | type ans20 struct function Test_Problem20 (line 25) | func Test_Problem20(t *testing.T) { FILE: leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go function mergeTwoLists (line 17) | func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode { FILE: leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go type question21 (line 10) | type question21 struct type para21 (line 17) | type para21 struct type ans21 (line 24) | type ans21 struct function Test_Problem21 (line 28) | func Test_Problem21(t *testing.T) { FILE: leetcode/0022.Generate-Parentheses/22. Generate Parentheses.go function generateParenthesis (line 3) | func generateParenthesis(n int) []string { function findGenerateParenthesis (line 12) | func findGenerateParenthesis(lindex, rindex int, str string, res *[]stri... FILE: leetcode/0022.Generate-Parentheses/22. Generate Parentheses_test.go type question22 (line 8) | type question22 struct type para22 (line 15) | type para22 struct type ans22 (line 21) | type ans22 struct function Test_Problem22 (line 25) | func Test_Problem22(t *testing.T) { FILE: leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go function mergeKLists (line 17) | func mergeKLists(lists []*ListNode) *ListNode { function mergeTwoLists1 (line 31) | func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode { FILE: leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go type question23 (line 10) | type question23 struct type para23 (line 17) | type para23 struct type ans23 (line 23) | type ans23 struct function Test_Problem23 (line 27) | func Test_Problem23(t *testing.T) { FILE: leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go function swapPairs (line 18) | func swapPairs(head *ListNode) *ListNode { FILE: leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go type question24 (line 10) | type question24 struct type para24 (line 17) | type para24 struct type ans24 (line 23) | type ans24 struct function Test_Problem24 (line 27) | func Test_Problem24(t *testing.T) { FILE: leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go function reverseKGroup (line 17) | func reverseKGroup(head *ListNode, k int) *ListNode { function reverse (line 30) | func reverse(first *ListNode, last *ListNode) *ListNode { FILE: leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go type question25 (line 10) | type question25 struct type para25 (line 17) | type para25 struct type ans25 (line 24) | type ans25 struct function Test_Problem25 (line 28) | func Test_Problem25(t *testing.T) { FILE: leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array.go function removeDuplicates (line 4) | func removeDuplicates(nums []int) int { function removeDuplicates1 (line 23) | func removeDuplicates1(nums []int) int { function removeElement1 (line 42) | func removeElement1(nums []int, start, val int) int { FILE: leetcode/0026.Remove-Duplicates-from-Sorted-Array/26. Remove Duplicates from Sorted Array_test.go type question26 (line 8) | type question26 struct type para26 (line 15) | type para26 struct type ans26 (line 21) | type ans26 struct function Test_Problem26 (line 25) | func Test_Problem26(t *testing.T) { FILE: leetcode/0027.Remove-Element/27. Remove Element.go function removeElement (line 3) | func removeElement(nums []int, val int) int { FILE: leetcode/0027.Remove-Element/27. Remove Element_test.go type question27 (line 8) | type question27 struct type para27 (line 15) | type para27 struct type ans27 (line 22) | type ans27 struct function Test_Problem27 (line 26) | func Test_Problem27(t *testing.T) { FILE: leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String.go function strStr (line 6) | func strStr(haystack string, needle string) int { function strStr1 (line 23) | func strStr1(haystack string, needle string) int { FILE: leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/28. Find the Index of the First Occurrence in a String_test.go type question28 (line 8) | type question28 struct type para28 (line 15) | type para28 struct type ans28 (line 22) | type ans28 struct function Test_Problem28 (line 26) | func Test_Problem28(t *testing.T) { FILE: leetcode/0029.Divide-Two-Integers/29. Divide Two Integers.go function divide (line 8) | func divide(dividend int, divisor int) int { function binarySearchQuotient (line 54) | func binarySearchQuotient(low, high, val, dividend int) int { function divide1 (line 72) | func divide1(divided int, divisor int) int { function abs (line 95) | func abs(a int) int { FILE: leetcode/0029.Divide-Two-Integers/29. Divide Two Integers_test.go type question29 (line 8) | type question29 struct type para29 (line 15) | type para29 struct type ans29 (line 22) | type ans29 struct function Test_Problem29 (line 26) | func Test_Problem29(t *testing.T) { FILE: leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words.go function findSubstring (line 3) | func findSubstring(s string, words []string) []int { function checkWords (line 32) | func checkWords(s map[string]int) bool { function copyMap (line 43) | func copyMap(s map[string]int) map[string]int { FILE: leetcode/0030.Substring-with-Concatenation-of-All-Words/30. Substring with Concatenation of All Words_test.go type question30 (line 8) | type question30 struct type para30 (line 15) | type para30 struct type ans30 (line 22) | type ans30 struct function Test_Problem30 (line 26) | func Test_Problem30(t *testing.T) { FILE: leetcode/0031.Next-Permutation/31. Next Permutation.go function nextPermutation (line 4) | func nextPermutation(nums []int) { function reverse (line 22) | func reverse(nums *[]int, i, j int) { function swap (line 30) | func swap(nums *[]int, i, j int) { function nextPermutation1 (line 36) | func nextPermutation1(nums []int) { function checkPermutationPossibility (line 61) | func checkPermutationPossibility(nums []int) (idx int) { FILE: leetcode/0031.Next-Permutation/31. Next Permutation_test.go type question31 (line 8) | type question31 struct type para31 (line 15) | type para31 struct type ans31 (line 21) | type ans31 struct function Test_Problem31 (line 25) | func Test_Problem31(t *testing.T) { FILE: leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses.go function longestValidParentheses (line 4) | func longestValidParentheses(s string) int { function max (line 22) | func max(a, b int) int { function longestValidParentheses1 (line 30) | func longestValidParentheses1(s string) int { FILE: leetcode/0032.Longest-Valid-Parentheses/32. Longest Valid Parentheses_test.go type question32 (line 8) | type question32 struct type para32 (line 15) | type para32 struct type ans32 (line 21) | type ans32 struct function Test_Problem32 (line 25) | func Test_Problem32(t *testing.T) { FILE: leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array.go function search33 (line 3) | func search33(nums []int, target int) int { FILE: leetcode/0033.Search-in-Rotated-Sorted-Array/33. Search in Rotated Sorted Array_test.go type question33 (line 8) | type question33 struct type para33 (line 15) | type para33 struct type ans33 (line 22) | type ans33 struct function Test_Problem33 (line 26) | func Test_Problem33(t *testing.T) { FILE: leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array.go function searchRange (line 3) | func searchRange(nums []int, target int) []int { function searchFirstEqualElement (line 9) | func searchFirstEqualElement(nums []int, target int) int { function searchLastEqualElement (line 28) | func searchLastEqualElement(nums []int, target int) int { function searchFirstGreaterElement (line 47) | func searchFirstGreaterElement(nums []int, target int) int { function searchLastLessElement (line 64) | func searchLastLessElement(nums []int, target int) int { FILE: leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/34. Find First and Last Position of Element in Sorted Array_test.go type question34 (line 8) | type question34 struct type para34 (line 15) | type para34 struct type ans34 (line 22) | type ans34 struct function Test_Problem34 (line 26) | func Test_Problem34(t *testing.T) { FILE: leetcode/0035.Search-Insert-Position/35. Search Insert Position.go function searchInsert (line 3) | func searchInsert(nums []int, target int) int { FILE: leetcode/0035.Search-Insert-Position/35. Search Insert Position_test.go type question35 (line 8) | type question35 struct type para35 (line 15) | type para35 struct type ans35 (line 22) | type ans35 struct function Test_Problem35 (line 26) | func Test_Problem35(t *testing.T) { FILE: leetcode/0036.Valid-Sudoku/36. Valid Sudoku.go function isValidSudoku (line 6) | func isValidSudoku(board [][]byte) bool { function isValidSudoku1 (line 63) | func isValidSudoku1(board [][]byte) bool { FILE: leetcode/0036.Valid-Sudoku/36. Valid Sudoku_test.go type question36 (line 8) | type question36 struct type para36 (line 15) | type para36 struct type ans36 (line 21) | type ans36 struct function Test_Problem36 (line 25) | func Test_Problem36(t *testing.T) { FILE: leetcode/0037.Sudoku-Solver/37. Sudoku Solver.go type position (line 3) | type position struct function solveSudoku (line 8) | func solveSudoku(board [][]byte) { function putSudoku (line 20) | func putSudoku(board *[][]byte, pos []position, index int, succ *bool) { function checkSudoku (line 40) | func checkSudoku(board *[][]byte, pos position, val int) bool { FILE: leetcode/0037.Sudoku-Solver/37. Sudoku Solver_test.go type question37 (line 8) | type question37 struct type para37 (line 15) | type para37 struct type ans37 (line 21) | type ans37 struct function Test_Problem37 (line 25) | func Test_Problem37(t *testing.T) { FILE: leetcode/0039.Combination-Sum/39. Combination Sum.go function combinationSum (line 5) | func combinationSum(candidates []int, target int) [][]int { function findcombinationSum (line 15) | func findcombinationSum(nums []int, target, index int, c []int, res *[][... FILE: leetcode/0039.Combination-Sum/39. Combination Sum_test.go type question39 (line 8) | type question39 struct type para39 (line 15) | type para39 struct type ans39 (line 22) | type ans39 struct function Test_Problem39 (line 26) | func Test_Problem39(t *testing.T) { FILE: leetcode/0040.Combination-Sum-II/40. Combination Sum II.go function combinationSum2 (line 7) | func combinationSum2(candidates []int, target int) [][]int { function findcombinationSum2 (line 17) | func findcombinationSum2(nums []int, target, index int, c []int, res *[]... FILE: leetcode/0040.Combination-Sum-II/40. Combination Sum II_test.go type question40 (line 8) | type question40 struct type para40 (line 15) | type para40 struct type ans40 (line 22) | type ans40 struct function Test_Problem40 (line 26) | func Test_Problem40(t *testing.T) { FILE: leetcode/0041.First-Missing-Positive/41. First Missing Positive.go function firstMissingPositive (line 3) | func firstMissingPositive(nums []int) int { FILE: leetcode/0041.First-Missing-Positive/41. First Missing Positive_test.go type question41 (line 8) | type question41 struct type para41 (line 15) | type para41 struct type ans41 (line 21) | type ans41 struct function Test_Problem41 (line 25) | func Test_Problem41(t *testing.T) { FILE: leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water.go function trap (line 3) | func trap(height []int) int { FILE: leetcode/0042.Trapping-Rain-Water/42. Trapping Rain Water_test.go type question42 (line 8) | type question42 struct type para42 (line 15) | type para42 struct type ans42 (line 21) | type ans42 struct function Test_Problem42 (line 25) | func Test_Problem42(t *testing.T) { FILE: leetcode/0043.Multiply-Strings/43. Multiply Strings.go function multiply (line 3) | func multiply(num1 string, num2 string) string { FILE: leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go type question43 (line 8) | type question43 struct type para43 (line 15) | type para43 struct type ans43 (line 22) | type ans43 struct function Test_Problem43 (line 26) | func Test_Problem43(t *testing.T) { FILE: leetcode/0045.Jump-Game-II/45. Jump Game II.go function jump (line 3) | func jump(nums []int) int { FILE: leetcode/0045.Jump-Game-II/45. Jump Game II_test.go type question45 (line 8) | type question45 struct type para45 (line 15) | type para45 struct type ans45 (line 21) | type ans45 struct function Test_Problem45 (line 25) | func Test_Problem45(t *testing.T) { FILE: leetcode/0046.Permutations/46. Permutations.go function permute (line 3) | func permute(nums []int) [][]int { function generatePermutation (line 12) | func generatePermutation(nums []int, index int, p []int, res *[][]int, u... FILE: leetcode/0046.Permutations/46. Permutations_test.go type question46 (line 8) | type question46 struct type para46 (line 15) | type para46 struct type ans46 (line 21) | type ans46 struct function Test_Problem46 (line 25) | func Test_Problem46(t *testing.T) { FILE: leetcode/0047.Permutations-II/47. Permutations II.go function permuteUnique (line 5) | func permuteUnique(nums []int) [][]int { function generatePermutation47 (line 15) | func generatePermutation47(nums []int, index int, p []int, res *[][]int,... FILE: leetcode/0047.Permutations-II/47. Permutations II_test.go type question47 (line 8) | type question47 struct type para47 (line 15) | type para47 struct type ans47 (line 21) | type ans47 struct function Test_Problem47 (line 25) | func Test_Problem47(t *testing.T) { FILE: leetcode/0048.Rotate-Image/48. Rotate Image.go function rotate (line 4) | func rotate(matrix [][]int) { function rotate1 (line 21) | func rotate1(matrix [][]int) { function swap (line 47) | func swap(nums [][]int, i, j int) { function reverse (line 52) | func reverse(nums []int) []int { FILE: leetcode/0048.Rotate-Image/48. Rotate Image_test.go type question48 (line 8) | type question48 struct type para48 (line 15) | type para48 struct type ans48 (line 21) | type ans48 struct function Test_Problem48 (line 25) | func Test_Problem48(t *testing.T) { FILE: leetcode/0049.Group-Anagrams/49. Group Anagrams.go type sortRunes (line 5) | type sortRunes method Less (line 7) | func (s sortRunes) Less(i, j int) bool { method Swap (line 11) | func (s sortRunes) Swap(i, j int) { method Len (line 15) | func (s sortRunes) Len() int { function groupAnagrams (line 19) | func groupAnagrams(strs []string) [][]string { FILE: leetcode/0049.Group-Anagrams/49. Group Anagrams_test.go type question49 (line 8) | type question49 struct type para49 (line 15) | type para49 struct type ans49 (line 21) | type ans49 struct function Test_Problem49 (line 25) | func Test_Problem49(t *testing.T) { FILE: leetcode/0050.Powx-n/50. Pow(x, n).go function myPow (line 4) | func myPow(x float64, n int) float64 { FILE: leetcode/0050.Powx-n/50. Pow(x, n)_test.go type question50 (line 8) | type question50 struct type para50 (line 15) | type para50 struct type ans50 (line 22) | type ans50 struct function Test_Problem50 (line 26) | func Test_Problem50(t *testing.T) { FILE: leetcode/0051.N-Queens/51. N-Queens.go function solveNQueens (line 4) | func solveNQueens(n int) [][]string { function putQueen (line 11) | func putQueen(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *[]... function generateBoard (line 33) | func generateBoard(n int, row *[]int) []string { function solveNQueens2 (line 51) | func solveNQueens2(n int) (res [][]string) { FILE: leetcode/0051.N-Queens/51. N-Queens_test.go type question51 (line 8) | type question51 struct type para51 (line 15) | type para51 struct type ans51 (line 21) | type ans51 struct function Test_Problem51 (line 25) | func Test_Problem51(t *testing.T) { FILE: leetcode/0052.N-Queens-II/52. N-Queens II.go function totalNQueens (line 4) | func totalNQueens(n int) int { function totalNQueens1 (line 10) | func totalNQueens1(n int) int { function putQueen52 (line 17) | func putQueen52(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *... FILE: leetcode/0052.N-Queens-II/52. N-Queens II_test.go type question52 (line 8) | type question52 struct type para52 (line 15) | type para52 struct type ans52 (line 21) | type ans52 struct function Test_Problem52 (line 25) | func Test_Problem52(t *testing.T) { FILE: leetcode/0053.Maximum-Subarray/53. Maximum Subarray.go function maxSubArray (line 4) | func maxSubArray(nums []int) int { function maxSubArray1 (line 25) | func maxSubArray1(nums []int) int { function max (line 43) | func max(a int, b int) int { FILE: leetcode/0053.Maximum-Subarray/53. Maximum Subarray_test.go type question53 (line 8) | type question53 struct type para53 (line 15) | type para53 struct type ans53 (line 21) | type ans53 struct function Test_Problem53 (line 25) | func Test_Problem53(t *testing.T) { FILE: leetcode/0054.Spiral-Matrix/54. Spiral Matrix.go function spiralOrder (line 4) | func spiralOrder(matrix [][]int) []int { function spiralOrder2 (line 72) | func spiralOrder2(matrix [][]int) []int { FILE: leetcode/0054.Spiral-Matrix/54. Spiral Matrix_test.go type question54 (line 8) | type question54 struct type para54 (line 15) | type para54 struct type ans54 (line 21) | type ans54 struct function Test_Problem54 (line 25) | func Test_Problem54(t *testing.T) { FILE: leetcode/0055.Jump-Game/55. Jump Game.go function canJump (line 3) | func canJump(nums []int) bool { function max (line 21) | func max(a int, b int) int { FILE: leetcode/0055.Jump-Game/55. Jump Game_test.go type question55 (line 8) | type question55 struct type para55 (line 15) | type para55 struct type ans55 (line 21) | type ans55 struct function Test_Problem55 (line 25) | func Test_Problem55(t *testing.T) { FILE: leetcode/0056.Merge-Intervals/56. Merge Intervals.go function merge56 (line 18) | func merge56(intervals []Interval) []Interval { function max (line 37) | func max(a int, b int) int { function min (line 44) | func min(a int, b int) int { function partitionSort (line 51) | func partitionSort(a []Interval, lo, hi int) int { function quickSort (line 63) | func quickSort(a []Interval, lo, hi int) { FILE: leetcode/0056.Merge-Intervals/56. Merge Intervals_test.go type question56 (line 8) | type question56 struct type para56 (line 15) | type para56 struct type ans56 (line 21) | type ans56 struct function Test_Problem56 (line 25) | func Test_Problem56(t *testing.T) { FILE: leetcode/0057.Insert-Interval/57. Insert Interval.go function insert (line 18) | func insert(intervals []Interval, newInterval Interval) []Interval { function max (line 43) | func max(a int, b int) int { function min (line 50) | func min(a int, b int) int { FILE: leetcode/0057.Insert-Interval/57. Insert Interval_test.go type question57 (line 8) | type question57 struct type para57 (line 15) | type para57 struct type ans57 (line 22) | type ans57 struct function Test_Problem57 (line 26) | func Test_Problem57(t *testing.T) { FILE: leetcode/0058.Length-of-Last-Word/58.Length of Last Word.go function lengthOfLastWord (line 3) | func lengthOfLastWord(s string) int { FILE: leetcode/0058.Length-of-Last-Word/58.Length of Last Word_test.go type question58 (line 8) | type question58 struct type para58 (line 14) | type para58 struct type ans58 (line 19) | type ans58 struct function Test_Problem58 (line 23) | func Test_Problem58(t *testing.T) { FILE: leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II.go function generateMatrix (line 3) | func generateMatrix(n int) [][]int { FILE: leetcode/0059.Spiral-Matrix-II/59. Spiral Matrix II_test.go type question59 (line 8) | type question59 struct type para59 (line 15) | type para59 struct type ans59 (line 21) | type ans59 struct function Test_Problem59 (line 25) | func Test_Problem59(t *testing.T) { FILE: leetcode/0060.Permutation-Sequence/60. Permutation Sequence.go function getPermutation (line 8) | func getPermutation(n int, k int) string { function findPermutation (line 17) | func findPermutation(n, index int, k *int, p []int, res *string, used *[... FILE: leetcode/0060.Permutation-Sequence/60. Permutation Sequence_test.go type question60 (line 8) | type question60 struct type para60 (line 15) | type para60 struct type ans60 (line 22) | type ans60 struct function Test_Problem60 (line 26) | func Test_Problem60(t *testing.T) { FILE: leetcode/0061.Rotate-List/61. Rotate List.go function rotateRight (line 17) | func rotateRight(head *ListNode, k int) *ListNode { FILE: leetcode/0061.Rotate-List/61. Rotate List_test.go type question61 (line 10) | type question61 struct type para61 (line 17) | type para61 struct type ans61 (line 24) | type ans61 struct function Test_Problem61 (line 28) | func Test_Problem61(t *testing.T) { FILE: leetcode/0062.Unique-Paths/62. Unique Paths.go function uniquePaths (line 3) | func uniquePaths(m int, n int) int { FILE: leetcode/0062.Unique-Paths/62. Unique Paths_test.go type question62 (line 8) | type question62 struct type para62 (line 15) | type para62 struct type ans62 (line 22) | type ans62 struct function Test_Problem62 (line 26) | func Test_Problem62(t *testing.T) { FILE: leetcode/0063.Unique-Paths-II/63. Unique Paths II.go function uniquePathsWithObstacles (line 3) | func uniquePathsWithObstacles(obstacleGrid [][]int) int { FILE: leetcode/0063.Unique-Paths-II/63. Unique Paths II_test.go type question63 (line 8) | type question63 struct type para63 (line 15) | type para63 struct type ans63 (line 21) | type ans63 struct function Test_Problem63 (line 25) | func Test_Problem63(t *testing.T) { FILE: leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum.go function minPathSum (line 4) | func minPathSum(grid [][]int) int { function minPathSum1 (line 22) | func minPathSum1(grid [][]int) int { function min (line 59) | func min(a int, b int) int { FILE: leetcode/0064.Minimum-Path-Sum/64. Minimum Path Sum_test.go type question64 (line 8) | type question64 struct type para64 (line 15) | type para64 struct type ans64 (line 21) | type ans64 struct function Test_Problem64 (line 25) | func Test_Problem64(t *testing.T) { FILE: leetcode/0065.Valid-Number/65. Valid Number.go function isNumber (line 3) | func isNumber(s string) bool { FILE: leetcode/0065.Valid-Number/65. Valid Number_test.go function Test_Problem65 (line 8) | func Test_Problem65(t *testing.T) { FILE: leetcode/0066.Plus-One/66. Plus One.go function plusOne (line 3) | func plusOne(digits []int) []int { FILE: leetcode/0066.Plus-One/66. Plus One_test.go type question66 (line 8) | type question66 struct type para66 (line 15) | type para66 struct type ans66 (line 21) | type ans66 struct function Test_Problem66 (line 25) | func Test_Problem66(t *testing.T) { FILE: leetcode/0067.Add-Binary/67. Add Binary.go function addBinary (line 8) | func addBinary(a string, b string) string { FILE: leetcode/0067.Add-Binary/67. Add Binary_test.go type question67 (line 8) | type question67 struct type para67 (line 15) | type para67 struct type ans67 (line 22) | type ans67 struct function Test_Problem67 (line 26) | func Test_Problem67(t *testing.T) { FILE: leetcode/0069.Sqrtx/69. Sqrt(x).go function mySqrt (line 4) | func mySqrt(x int) int { function mySqrt1 (line 18) | func mySqrt1(x int) int { FILE: leetcode/0069.Sqrtx/69. Sqrt(x)_test.go type question69 (line 8) | type question69 struct type para69 (line 15) | type para69 struct type ans69 (line 21) | type ans69 struct function Test_Problem69 (line 25) | func Test_Problem69(t *testing.T) { FILE: leetcode/0070.Climbing-Stairs/70. Climbing Stairs.go function climbStairs (line 3) | func climbStairs(n int) int { FILE: leetcode/0070.Climbing-Stairs/70. Climbing Stairs_test.go type question70 (line 8) | type question70 struct type para70 (line 15) | type para70 struct type ans70 (line 21) | type ans70 struct function Test_Problem70 (line 25) | func Test_Problem70(t *testing.T) { FILE: leetcode/0071.Simplify-Path/71. Simplify Path.go function simplifyPath (line 9) | func simplifyPath(path string) string { function simplifyPath1 (line 32) | func simplifyPath1(path string) string { FILE: leetcode/0071.Simplify-Path/71. Simplify Path_test.go type question71 (line 8) | type question71 struct type para71 (line 15) | type para71 struct type ans71 (line 21) | type ans71 struct function Test_Problem71 (line 25) | func Test_Problem71(t *testing.T) { FILE: leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go function setZeroes (line 3) | func setZeroes(matrix [][]int) { FILE: leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go type question73 (line 8) | type question73 struct type para73 (line 15) | type para73 struct type ans73 (line 21) | type ans73 struct function Test_Problem73 (line 24) | func Test_Problem73(t *testing.T) { FILE: leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix.go function searchMatrix (line 3) | func searchMatrix(matrix [][]int, target int) bool { FILE: leetcode/0074.Search-a-2D-Matrix/74. Search a 2D Matrix_test.go type question74 (line 8) | type question74 struct type para74 (line 15) | type para74 struct type ans74 (line 22) | type ans74 struct function Test_Problem74 (line 26) | func Test_Problem74(t *testing.T) { FILE: leetcode/0075.Sort-Colors/75. Sort Colors.go function sortColors (line 3) | func sortColors(nums []int) { FILE: leetcode/0075.Sort-Colors/75. Sort Colors_test.go type question75 (line 8) | type question75 struct type para75 (line 15) | type para75 struct type ans75 (line 21) | type ans75 struct function Test_Problem75 (line 25) | func Test_Problem75(t *testing.T) { FILE: leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring.go function minWindow (line 3) | func minWindow(s string, t string) string { FILE: leetcode/0076.Minimum-Window-Substring/76. Minimum Window Substring_test.go type question76 (line 8) | type question76 struct type para76 (line 15) | type para76 struct type ans76 (line 22) | type ans76 struct function Test_Problem76 (line 26) | func Test_Problem76(t *testing.T) { FILE: leetcode/0077.Combinations/77. Combinations.go function combine (line 3) | func combine(n int, k int) [][]int { function generateCombinations (line 12) | func generateCombinations(n, k, start int, c []int, res *[][]int) { FILE: leetcode/0077.Combinations/77. Combinations_test.go type question77 (line 8) | type question77 struct type para77 (line 15) | type para77 struct type ans77 (line 22) | type ans77 struct function Test_Problem77 (line 26) | func Test_Problem77(t *testing.T) { FILE: leetcode/0078.Subsets/78. Subsets.go function subsets (line 6) | func subsets(nums []int) [][]int { function generateSubsets (line 14) | func generateSubsets(nums []int, k, start int, c []int, res *[][]int) { function subsets1 (line 31) | func subsets1(nums []int) [][]int { function subsets2 (line 46) | func subsets2(nums []int) [][]int { FILE: leetcode/0078.Subsets/78. Subsets_test.go type question78 (line 8) | type question78 struct type para78 (line 15) | type para78 struct type ans78 (line 21) | type ans78 struct function Test_Problem78 (line 25) | func Test_Problem78(t *testing.T) { FILE: leetcode/0079.Word-Search/79. Word Search.go function exist (line 10) | func exist(board [][]byte, word string) bool { function isInBoard (line 25) | func isInBoard(board [][]byte, x, y int) bool { function searchWord (line 29) | func searchWord(board [][]byte, visited [][]bool, word string, index, x,... FILE: leetcode/0079.Word-Search/79. Word Search_test.go type question79 (line 8) | type question79 struct type para79 (line 15) | type para79 struct type ans79 (line 22) | type ans79 struct function Test_Problem79 (line 26) | func Test_Problem79(t *testing.T) { FILE: leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II.go function removeDuplicates (line 3) | func removeDuplicates(nums []int) int { FILE: leetcode/0080.Remove-Duplicates-from-Sorted-Array-II/80. Remove Duplicates from Sorted Array II_test.go type question80 (line 8) | type question80 struct type para80 (line 15) | type para80 struct type ans80 (line 21) | type ans80 struct function Test_Problem80 (line 25) | func Test_Problem80(t *testing.T) { FILE: leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II.go function search (line 3) | func search(nums []int, target int) bool { FILE: leetcode/0081.Search-in-Rotated-Sorted-Array-II/81. Search in Rotated Sorted Array II_test.go type question81 (line 8) | type question81 struct type para81 (line 15) | type para81 struct type ans81 (line 22) | type ans81 struct function Test_Problem81 (line 26) | func Test_Problem81(t *testing.T) { FILE: leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go function deleteDuplicates1 (line 17) | func deleteDuplicates1(head *ListNode) *ListNode { function deleteDuplicates2 (line 63) | func deleteDuplicates2(head *ListNode) *ListNode { function deleteDuplicates (line 77) | func deleteDuplicates(head *ListNode) *ListNode { function deleteDuplicates3 (line 96) | func deleteDuplicates3(head *ListNode) *ListNode { function deleteDuplicates4 (line 119) | func deleteDuplicates4(head *ListNode) *ListNode { FILE: leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go type question82 (line 10) | type question82 struct type para82 (line 17) | type para82 struct type ans82 (line 23) | type ans82 struct function Test_Problem82 (line 27) | func Test_Problem82(t *testing.T) { FILE: leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go function deleteDuplicates (line 18) | func deleteDuplicates(head *ListNode) *ListNode { FILE: leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go type question83 (line 10) | type question83 struct type para83 (line 17) | type para83 struct type ans83 (line 23) | type ans83 struct function Test_Problem83 (line 27) | func Test_Problem83(t *testing.T) { FILE: leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go function largestRectangleArea (line 3) | func largestRectangleArea(heights []int) int { function max (line 27) | func max(a int, b int) int { FILE: leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go type question84 (line 8) | type question84 struct type para84 (line 15) | type para84 struct type ans84 (line 21) | type ans84 struct function Test_Problem84 (line 25) | func Test_Problem84(t *testing.T) { FILE: leetcode/0086.Partition-List/86. Partition List.go function partition (line 19) | func partition(head *ListNode, x int) *ListNode { type DoublyListNode (line 41) | type DoublyListNode struct function partition1 (line 48) | func partition1(head *ListNode, x int) *ListNode { function genDoublyListNode (line 92) | func genDoublyListNode(head *ListNode) *DoublyListNode { function genListNode (line 105) | func genListNode(head *DoublyListNode) *ListNode { FILE: leetcode/0086.Partition-List/86. Partition List_test.go type question86 (line 10) | type question86 struct type para86 (line 17) | type para86 struct type ans86 (line 24) | type ans86 struct function Test_Problem86 (line 28) | func Test_Problem86(t *testing.T) { FILE: leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array.go function merge (line 3) | func merge(nums1 []int, m int, nums2 []int, n int) { FILE: leetcode/0088.Merge-Sorted-Array/88. Merge Sorted Array_test.go type question88 (line 8) | type question88 struct type para88 (line 15) | type para88 struct type ans88 (line 24) | type ans88 struct function Test_Problem88 (line 28) | func Test_Problem88(t *testing.T) { FILE: leetcode/0089.Gray-Code/89. Gray Code.go function grayCode (line 4) | func grayCode(n int) []int { function generateGrayCode (line 14) | func generateGrayCode(n, step int, num *[]int, res *[]int) { function convertBinary (line 39) | func convertBinary(num []int) int { function flipGrayCode (line 48) | func flipGrayCode(num int) int { function grayCode1 (line 56) | func grayCode1(n int) []int { FILE: leetcode/0089.Gray-Code/89. Gray Code_test.go type question89 (line 8) | type question89 struct type para89 (line 15) | type para89 struct type ans89 (line 21) | type ans89 struct function Test_Problem89 (line 25) | func Test_Problem89(t *testing.T) { FILE: leetcode/0090.Subsets-II/90. Subsets II.go function subsetsWithDup (line 8) | func subsetsWithDup(nums []int) [][]int { function generateSubsetsWithDup (line 17) | func generateSubsetsWithDup(nums []int, k, start int, c []int, res *[][]... FILE: leetcode/0090.Subsets-II/90. Subsets II_test.go type question90 (line 8) | type question90 struct type para90 (line 15) | type para90 struct type ans90 (line 21) | type ans90 struct function Test_Problem90 (line 25) | func Test_Problem90(t *testing.T) { FILE: leetcode/0091.Decode-Ways/91. Decode Ways.go function numDecodings (line 3) | func numDecodings(s string) int { FILE: leetcode/0091.Decode-Ways/91. Decode Ways_test.go type question91 (line 8) | type question91 struct type para91 (line 15) | type para91 struct type ans91 (line 21) | type ans91 struct function Test_Problem91 (line 25) | func Test_Problem91(t *testing.T) { FILE: leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go function reverseBetween (line 18) | func reverseBetween(head *ListNode, m int, n int) *ListNode { FILE: leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go type question92 (line 10) | type question92 struct type para92 (line 17) | type para92 struct type ans92 (line 24) | type ans92 struct function Test_Problem92 (line 28) | func Test_Problem92(t *testing.T) { FILE: leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses.go function restoreIPAddresses (line 7) | func restoreIPAddresses(s string) []string { function dfs (line 16) | func dfs(s string, index int, ip []int, res *[]string) { function getString (line 43) | func getString(ip []int) string { FILE: leetcode/0093.Restore-IP-Addresses/93. Restore IP Addresses_test.go type question93 (line 8) | type question93 struct type para93 (line 15) | type para93 struct type ans93 (line 21) | type ans93 struct function Test_Problem93 (line 25) | func Test_Problem93(t *testing.T) { FILE: leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go function inorderTraversal (line 19) | func inorderTraversal(root *TreeNode) []int { function inorder (line 25) | func inorder(root *TreeNode, output *[]int) { FILE: leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go type question94 (line 10) | type question94 struct type para94 (line 17) | type para94 struct type ans94 (line 23) | type ans94 struct function Test_Problem94 (line 27) | func Test_Problem94(t *testing.T) { FILE: leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go function generateTrees (line 19) | func generateTrees(n int) []*TreeNode { function generateBSTree (line 26) | func generateBSTree(start, end int) []*TreeNode { FILE: leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go type question95 (line 10) | type question95 struct type para95 (line 17) | type para95 struct type ans95 (line 23) | type ans95 struct function Test_Problem95 (line 27) | func Test_Problem95(t *testing.T) { FILE: leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees.go function numTrees (line 3) | func numTrees(n int) int { FILE: leetcode/0096.Unique-Binary-Search-Trees/96. Unique Binary Search Trees_test.go type question96 (line 8) | type question96 struct type para96 (line 15) | type para96 struct type ans96 (line 21) | type ans96 struct function Test_Problem96 (line 25) | func Test_Problem96(t *testing.T) { FILE: leetcode/0097.Interleaving-String/97. Interleaving String.go function isInterleave (line 3) | func isInterleave(s1 string, s2 string, s3 string) bool { function dfs (line 11) | func dfs(s1, s2, s3 string, p1, p2 int, visited map[int]bool) bool { FILE: leetcode/0097.Interleaving-String/97. Interleaving String_test.go type question97 (line 8) | type question97 struct type para97 (line 15) | type para97 struct type ans97 (line 23) | type ans97 struct function Test_Problem97 (line 27) | func Test_Problem97(t *testing.T) { FILE: leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go function isValidBST (line 22) | func isValidBST(root *TreeNode) bool { function isValidbst (line 25) | func isValidbst(root *TreeNode, min, max float64) bool { function isValidBST1 (line 34) | func isValidBST1(root *TreeNode) bool { function inOrder (line 45) | func inOrder(root *TreeNode, arr *[]int) { FILE: leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go type question98 (line 10) | type question98 struct type para98 (line 17) | type para98 struct type ans98 (line 23) | type ans98 struct function Test_Problem98 (line 27) | func Test_Problem98(t *testing.T) { FILE: leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go function recoverTree (line 19) | func recoverTree(root *TreeNode) { function inOrderTraverse (line 28) | func inOrderTraverse(root, prev, target1, target2 *TreeNode) (*TreeNode,... FILE: leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go type question99 (line 10) | type question99 struct type para99 (line 17) | type para99 struct type ans99 (line 23) | type ans99 struct function Test_Problem99 (line 27) | func Test_Problem99(t *testing.T) { FILE: leetcode/0100.Same-Tree/100. Same Tree.go function isSameTree (line 19) | func isSameTree(p *TreeNode, q *TreeNode) bool { FILE: leetcode/0100.Same-Tree/100. Same Tree_test.go type question100 (line 10) | type question100 struct type para100 (line 17) | type para100 struct type ans100 (line 24) | type ans100 struct function Test_Problem100 (line 28) | func Test_Problem100(t *testing.T) { FILE: leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go function isSymmetric (line 20) | func isSymmetric(root *TreeNode) bool { function isMirror (line 27) | func isMirror(left *TreeNode, right *TreeNode) bool { function isSymmetric1 (line 38) | func isSymmetric1(root *TreeNode) bool { function isSameTree (line 45) | func isSameTree(p *TreeNode, q *TreeNode) bool { function invertTree (line 58) | func invertTree(root *TreeNode) *TreeNode { FILE: leetcode/0101.Symmetric-Tree/101. Symmetric Tree_test.go type question101 (line 10) | type question101 struct type para101 (line 17) | type para101 struct type ans101 (line 23) | type ans101 struct function Test_Problem101 (line 27) | func Test_Problem101(t *testing.T) { FILE: leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go function levelOrder (line 20) | func levelOrder(root *TreeNode) [][]int { function levelOrder1 (line 45) | func levelOrder1(root *TreeNode) [][]int { FILE: leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go type question102 (line 10) | type question102 struct type para102 (line 17) | type para102 struct type ans102 (line 23) | type ans102 struct function Test_Problem102 (line 27) | func Test_Problem102(t *testing.T) { FILE: leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go function zigzagLevelOrder (line 20) | func zigzagLevelOrder(root *TreeNode) [][]int { function zigzagLevelOrder0 (line 63) | func zigzagLevelOrder0(root *TreeNode) [][]int { function search (line 69) | func search(root *TreeNode, depth int, res *[][]int) { function zigzagLevelOrder1 (line 86) | func zigzagLevelOrder1(root *TreeNode) [][]int { FILE: leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go type question103 (line 10) | type question103 struct type para103 (line 17) | type para103 struct type ans103 (line 23) | type ans103 struct function Test_Problem103 (line 27) | func Test_Problem103(t *testing.T) { FILE: leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go function maxDepth (line 19) | func maxDepth(root *TreeNode) int { function max (line 26) | func max(a int, b int) int { FILE: leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go type question104 (line 10) | type question104 struct type para104 (line 17) | type para104 struct type ans104 (line 23) | type ans104 struct function Test_Problem104 (line 27) | func Test_Problem104(t *testing.T) { FILE: leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go function buildTree (line 20) | func buildTree(preorder []int, inorder []int) *TreeNode { function buildTree1 (line 35) | func buildTree1(preorder []int, inorder []int) *TreeNode { function buildPreIn2TreeDFS (line 43) | func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int... FILE: leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go type question105 (line 10) | type question105 struct type para105 (line 17) | type para105 struct type ans105 (line 24) | type ans105 struct function Test_Problem105 (line 28) | func Test_Problem105(t *testing.T) { FILE: leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go function buildTree (line 20) | func buildTree(inorder []int, postorder []int) *TreeNode { function buildTree1 (line 37) | func buildTree1(inorder []int, postorder []int) *TreeNode { function buildInPos2TreeDFS (line 45) | func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart ... FILE: leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go type question106 (line 10) | type question106 struct type para106 (line 17) | type para106 struct type ans106 (line 24) | type ans106 struct function Test_Problem106 (line 28) | func Test_Problem106(t *testing.T) { FILE: leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go function levelOrderBottom (line 19) | func levelOrderBottom(root *TreeNode) [][]int { function levelOrder (line 28) | func levelOrder(root *TreeNode) [][]int { FILE: leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go type question107 (line 10) | type question107 struct type para107 (line 17) | type para107 struct type ans107 (line 23) | type ans107 struct function Test_Problem107 (line 27) | func Test_Problem107(t *testing.T) { FILE: leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go function sortedArrayToBST (line 19) | func sortedArrayToBST(nums []int) *TreeNode { FILE: leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go type question108 (line 10) | type question108 struct type para108 (line 17) | type para108 struct type ans108 (line 23) | type ans108 struct function Test_Problem108 (line 27) | func Test_Problem108(t *testing.T) { FILE: leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go function sortedListToBST (line 30) | func sortedListToBST(head *ListNode) *TreeNode { function middleNodeAndPreNode (line 50) | func middleNodeAndPreNode(head *ListNode) (middle *ListNode, pre *ListNo... FILE: leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go type question109 (line 10) | type question109 struct type para109 (line 17) | type para109 struct type ans109 (line 23) | type ans109 struct function Test_Problem109 (line 27) | func Test_Problem109(t *testing.T) { FILE: leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go function isBalanced (line 19) | func isBalanced(root *TreeNode) bool { function depth (line 28) | func depth(root *TreeNode) int { function abs (line 35) | func abs(a int) int { function max (line 42) | func max(a int, b int) int { FILE: leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go type question110 (line 10) | type question110 struct type para110 (line 17) | type para110 struct type ans110 (line 23) | type ans110 struct function Test_Problem110 (line 27) | func Test_Problem110(t *testing.T) { FILE: leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go function minDepth (line 19) | func minDepth(root *TreeNode) int { function min (line 32) | func min(a int, b int) int { FILE: leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go type question111 (line 10) | type question111 struct type para111 (line 17) | type para111 struct type ans111 (line 23) | type ans111 struct function Test_Problem111 (line 27) | func Test_Problem111(t *testing.T) { FILE: leetcode/0112.Path-Sum/112. Path Sum.go function hasPathSum (line 19) | func hasPathSum(root *TreeNode, sum int) bool { FILE: leetcode/0112.Path-Sum/112. Path Sum_test.go type question112 (line 10) | type question112 struct type para112 (line 17) | type para112 struct type ans112 (line 24) | type ans112 struct function Test_Problem112 (line 28) | func Test_Problem112(t *testing.T) { FILE: leetcode/0113.Path-Sum-II/113. Path Sum II.go function pathSum (line 20) | func pathSum(root *TreeNode, sum int) [][]int { function findPath (line 26) | func findPath(n *TreeNode, sum int, slice [][]int, stack []int) [][]int { function pathSum1 (line 42) | func pathSum1(root *TreeNode, sum int) [][]int { FILE: leetcode/0113.Path-Sum-II/113. Path Sum II_test.go type question113 (line 10) | type question113 struct type para113 (line 17) | type para113 struct type ans113 (line 24) | type ans113 struct function Test_Problem113 (line 28) | func Test_Problem113(t *testing.T) { FILE: leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go function flatten (line 20) | func flatten(root *TreeNode) { function preorder (line 29) | func preorder(root *TreeNode) (ans []*TreeNode) { function flatten1 (line 39) | func flatten1(root *TreeNode) { function flatten2 (line 55) | func flatten2(root *TreeNode) { FILE: leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go type question114 (line 10) | type question114 struct type para114 (line 17) | type para114 struct type ans114 (line 23) | type ans114 struct function Test_Problem114 (line 27) | func Test_Problem114(t *testing.T) { FILE: leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences.go function numDistinct (line 4) | func numDistinct(s string, t string) int { function numDistinct1 (line 25) | func numDistinct1(s, t string) int { FILE: leetcode/0115.Distinct-Subsequences/115. Distinct Subsequences_test.go type question115 (line 8) | type question115 struct type para115 (line 15) | type para115 struct type ans115 (line 22) | type ans115 struct function Test_Problem115 (line 26) | func Test_Problem115(t *testing.T) { FILE: leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node.go type Node (line 3) | type Node struct function connect (line 11) | func connect(root *Node) *Node { function connect2 (line 36) | func connect2(root *Node) *Node { function connectTwoNode (line 44) | func connectTwoNode(node1, node2 *Node) { FILE: leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node/116.Populating Next Right Pointers in Each Node_test.go type question116 (line 8) | type question116 struct type para116 (line 15) | type para116 struct type ans116 (line 21) | type ans116 struct function newQuestionNode (line 25) | func newQuestionNode() *Node { function newResultNode (line 58) | func newResultNode() *Node { function Test_Problem116 (line 100) | func Test_Problem116(t *testing.T) { FILE: leetcode/0118.Pascals-Triangle/118. Pascals Triangle.go function generate (line 3) | func generate(numRows int) [][]int { FILE: leetcode/0118.Pascals-Triangle/118. Pascals Triangle_test.go type question118 (line 8) | type question118 struct type para118 (line 15) | type para118 struct type ans118 (line 21) | type ans118 struct function Test_Problem118 (line 25) | func Test_Problem118(t *testing.T) { FILE: leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II.go function getRow (line 3) | func getRow(rowIndex int) []int { FILE: leetcode/0119.Pascals-Triangle-II/119. Pascals Triangle II_test.go type question119 (line 8) | type question119 struct type para119 (line 15) | type para119 struct type ans119 (line 21) | type ans119 struct function Test_Problem119 (line 25) | func Test_Problem119(t *testing.T) { FILE: leetcode/0120.Triangle/120. Triangle.go function minimumTotal (line 8) | func minimumTotal(triangle [][]int) int { function min (line 20) | func min(a int, b int) int { function minimumTotal1 (line 28) | func minimumTotal1(triangle [][]int) int { FILE: leetcode/0120.Triangle/120. Triangle_test.go type question120 (line 8) | type question120 struct type para120 (line 15) | type para120 struct type ans120 (line 21) | type ans120 struct function Test_Problem120 (line 25) | func Test_Problem120(t *testing.T) { FILE: leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock.go function maxProfit (line 4) | func maxProfit(prices []int) int { function maxProfit1 (line 21) | func maxProfit1(prices []int) int { function max (line 44) | func max(a int, b int) int { FILE: leetcode/0121.Best-Time-to-Buy-and-Sell-Stock/121. Best Time to Buy and Sell Stock_test.go type question121 (line 8) | type question121 struct type para121 (line 15) | type para121 struct type ans121 (line 21) | type ans121 struct function Test_Problem121 (line 25) | func Test_Problem121(t *testing.T) { FILE: leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II.go function maxProfit122 (line 3) | func maxProfit122(prices []int) int { FILE: leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II/122. Best Time to Buy and Sell Stock II_test.go type question122 (line 8) | type question122 struct type para122 (line 15) | type para122 struct type ans122 (line 21) | type ans122 struct function Test_Problem122 (line 25) | func Test_Problem122(t *testing.T) { FILE: leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go function maxPathSum (line 21) | func maxPathSum(root *TreeNode) int { function getPathSum (line 30) | func getPathSum(root *TreeNode, maxSum *int) int { function max (line 42) | func max(a int, b int) int { FILE: leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go type question124 (line 10) | type question124 struct type para124 (line 17) | type para124 struct type ans124 (line 23) | type ans124 struct function Test_Problem124 (line 27) | func Test_Problem124(t *testing.T) { FILE: leetcode/0125.Valid-Palindrome/125. Valid Palindrome.go function isPalindrome (line 7) | func isPalindrome(s string) bool { function isChar (line 27) | func isChar(c byte) bool { FILE: leetcode/0125.Valid-Palindrome/125. Valid Palindrome_test.go function Test_Problem125 (line 8) | func Test_Problem125(t *testing.T) { FILE: leetcode/0126.Word-Ladder-II/126. Word Ladder II.go function findLadders (line 3) | func findLadders(beginWord string, endWord string, wordList []string) []... FILE: leetcode/0126.Word-Ladder-II/126. Word Ladder II_test.go type question126 (line 8) | type question126 struct type para126 (line 15) | type para126 struct type ans126 (line 23) | type ans126 struct function Test_Problem126 (line 27) | func Test_Problem126(t *testing.T) { FILE: leetcode/0127.Word-Ladder/127. Word Ladder.go function ladderLength (line 3) | func ladderLength(beginWord string, endWord string, wordList []string) i... function getWordMap (line 26) | func getWordMap(wordList []string, beginWord string) map[string]int { function getCandidates (line 38) | func getCandidates(word string) []string { FILE: leetcode/0127.Word-Ladder/127. Word Ladder_test.go type question127 (line 8) | type question127 struct type para127 (line 15) | type para127 struct type ans127 (line 23) | type ans127 struct function Test_Problem127 (line 27) | func Test_Problem127(t *testing.T) { FILE: leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go function longestConsecutive (line 8) | func longestConsecutive(nums []int) int { function max (line 39) | func max(a int, b int) int { function longestConsecutive1 (line 47) | func longestConsecutive1(nums []int) int { function longestConsecutive2 (line 81) | func longestConsecutive2(nums []int) int { FILE: leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence_test.go type question128 (line 8) | type question128 struct type para128 (line 15) | type para128 struct type ans128 (line 21) | type ans128 struct function Test_Problem128 (line 25) | func Test_Problem128(t *testing.T) { FILE: leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go function sumNumbers (line 19) | func sumNumbers(root *TreeNode) int { function dfs (line 25) | func dfs(root *TreeNode, sum int, res *int) { FILE: leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go type question129 (line 10) | type question129 struct type para129 (line 17) | type para129 struct type ans129 (line 23) | type ans129 struct function Test_Problem129 (line 27) | func Test_Problem129(t *testing.T) { FILE: leetcode/0130.Surrounded-Regions/130. Surrounded Regions.go function solve (line 15) | func solve(board [][]byte) { function solve1 (line 54) | func solve1(board [][]byte) { function dfs130 (line 76) | func dfs130(i, j int, board [][]byte) { FILE: leetcode/0130.Surrounded-Regions/130. Surrounded Regions_test.go type question130 (line 8) | type question130 struct type para130 (line 15) | type para130 struct type ans130 (line 21) | type ans130 struct function Test_Problem130 (line 25) | func Test_Problem130(t *testing.T) { FILE: leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning.go function partition131 (line 4) | func partition131(s string) [][]string { function findPalindrome (line 13) | func findPalindrome(str string, index int, s string, isPal bool, pal []s... function isPalindrome131 (line 42) | func isPalindrome131(s string) bool { function partition131_1 (line 53) | func partition131_1(s string) [][]string { function dfs131 (line 64) | func dfs131(s string, idx int, cur []string, result *[][]string) { function isPal (line 79) | func isPal(str string, s, e int) bool { FILE: leetcode/0131.Palindrome-Partitioning/131. Palindrome Partitioning_test.go type question131 (line 8) | type question131 struct type para131 (line 15) | type para131 struct type ans131 (line 21) | type ans131 struct function Test_Problem131 (line 25) | func Test_Problem131(t *testing.T) { FILE: leetcode/0134.Gas-Station/Gas.go function canCompleteCircuit (line 3) | func canCompleteCircuit(gas []int, cost []int) int { FILE: leetcode/0134.Gas-Station/Gas_test.go type question134 (line 8) | type question134 struct type para134 (line 15) | type para134 struct type ans134 (line 22) | type ans134 struct function Test_Problem134 (line 26) | func Test_Problem134(t *testing.T) { FILE: leetcode/0135.Candy/135. Candy.go function candy (line 3) | func candy(ratings []int) int { FILE: leetcode/0135.Candy/135. Candy_test.go type question135 (line 8) | type question135 struct type para135 (line 15) | type para135 struct type ans135 (line 21) | type ans135 struct function Test_Problem135 (line 25) | func Test_Problem135(t *testing.T) { FILE: leetcode/0136.Single-Number/136. Single Number.go function singleNumber (line 3) | func singleNumber(nums []int) int { FILE: leetcode/0136.Single-Number/136. Single Number_test.go type question136 (line 8) | type question136 struct type para136 (line 15) | type para136 struct type ans136 (line 21) | type ans136 struct function Test_Problem136 (line 25) | func Test_Problem136(t *testing.T) { FILE: leetcode/0137.Single-Number-II/137. Single Number II.go function singleNumberII (line 3) | func singleNumberII(nums []int) int { function singleNumberIIIII (line 16) | func singleNumberIIIII(nums []int) int { function singleNumberIIIII1 (line 27) | func singleNumberIIIII1(nums []int) int { FILE: leetcode/0137.Single-Number-II/137. Single Number II_test.go type question137 (line 8) | type question137 struct type para137 (line 15) | type para137 struct type ans137 (line 21) | type ans137 struct function Test_Problem137 (line 25) | func Test_Problem137(t *testing.T) { FILE: leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer.go type Node (line 4) | type Node struct function copyRandomList (line 10) | func copyRandomList(head *Node) *Node { function splitLinkedList (line 18) | func splitLinkedList(head *Node) *Node { function copyNodeToLinkedList (line 27) | func copyNodeToLinkedList(head *Node) *Node { FILE: leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer_test.go type question138 (line 10) | type question138 struct type para138 (line 17) | type para138 struct type ans138 (line 23) | type ans138 struct function Test_Problem138 (line 27) | func Test_Problem138(t *testing.T) { function ints2Node (line 61) | func ints2Node(one [][]int) *Node { function node2Ints (line 84) | func node2Ints(head *Node) (res [][]int) { FILE: leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go function hasCycle (line 18) | func hasCycle(head *ListNode) bool { FILE: leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go type question141 (line 10) | type question141 struct type para141 (line 17) | type para141 struct type ans141 (line 23) | type ans141 struct function Test_Problem141 (line 27) | func Test_Problem141(t *testing.T) { FILE: leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go function detectCycle (line 17) | func detectCycle(head *ListNode) *ListNode { function hasCycle142 (line 33) | func hasCycle142(head *ListNode) (bool, *ListNode) { FILE: leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II_test.go function Test_Problem142 (line 5) | func Test_Problem142(t *testing.T) { FILE: leetcode/0143.Reorder-List/143. Reorder List.go function reorderList (line 19) | func reorderList(head *ListNode) *ListNode { function reorderList1 (line 56) | func reorderList1(head *ListNode) *ListNode { function listToArray (line 78) | func listToArray(head *ListNode) []int { FILE: leetcode/0143.Reorder-List/143. Reorder List_test.go type question143 (line 10) | type question143 struct type para143 (line 17) | type para143 struct type ans143 (line 23) | type ans143 struct function Test_Problem143 (line 27) | func Test_Problem143(t *testing.T) { FILE: leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go function preorderTraversal (line 20) | func preorderTraversal(root *TreeNode) []int { function preorderTraversal1 (line 37) | func preorderTraversal1(root *TreeNode) []int { function preorder (line 43) | func preorder(root *TreeNode, output *[]int) { function preorderTraversal2 (line 52) | func preorderTraversal2(root *TreeNode) []int { FILE: leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go type question144 (line 10) | type question144 struct type para144 (line 17) | type para144 struct type ans144 (line 23) | type ans144 struct function Test_Problem144 (line 27) | func Test_Problem144(t *testing.T) { FILE: leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go function postorderTraversal (line 19) | func postorderTraversal(root *TreeNode) []int { function postorder (line 25) | func postorder(root *TreeNode, output *[]int) { FILE: leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go type question145 (line 10) | type question145 struct type para145 (line 17) | type para145 struct type ans145 (line 23) | type ans145 struct function Test_Problem145 (line 27) | func Test_Problem145(t *testing.T) { FILE: leetcode/0146.LRU-Cache/146. LRU Cache.go type LRUCache (line 3) | type LRUCache struct method Get (line 18) | func (this *LRUCache) Get(key int) int { method Put (line 27) | func (this *LRUCache) Put(key int, value int) { method Add (line 44) | func (this *LRUCache) Add(node *Node) { method Remove (line 57) | func (this *LRUCache) Remove(node *Node) { type Node (line 9) | type Node struct function Constructor (line 14) | func Constructor(capacity int) LRUCache { FILE: leetcode/0146.LRU-Cache/146. LRU Cache_test.go function Test_Problem146 (line 8) | func Test_Problem146(t *testing.T) { function MList2Ints (line 31) | func MList2Ints(lru *LRUCache) [][]int { FILE: leetcode/0147.Insertion-Sort-List/147. Insertion Sort List.go function insertionSortList (line 17) | func insertionSortList(head *ListNode) *ListNode { FILE: leetcode/0147.Insertion-Sort-List/147. Insertion Sort List_test.go type question147 (line 10) | type question147 struct type para147 (line 17) | type para147 struct type ans147 (line 23) | type ans147 struct function Test_Problem147 (line 27) | func Test_Problem147(t *testing.T) { FILE: leetcode/0148.Sort-List/148. Sort List.go function sortList (line 17) | func sortList(head *ListNode) *ListNode { function middleNode (line 38) | func middleNode(head *ListNode) *ListNode { function mergeTwoLists (line 51) | func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode { FILE: leetcode/0148.Sort-List/148. Sort List_test.go type question148 (line 10) | type question148 struct type para148 (line 17) | type para148 struct type ans148 (line 23) | type ans148 struct function Test_Problem148 (line 27) | func Test_Problem148(t *testing.T) { FILE: leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation.go function evalRPN (line 7) | func evalRPN(tokens []string) int { FILE: leetcode/0150.Evaluate-Reverse-Polish-Notation/150. Evaluate Reverse Polish Notation_test.go type question150 (line 8) | type question150 struct type para150 (line 15) | type para150 struct type ans150 (line 21) | type ans150 struct function Test_Problem150 (line 25) | func Test_Problem150(t *testing.T) { FILE: leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String.go function reverseWords151 (line 5) | func reverseWords151(s string) string { function reverse151 (line 11) | func reverse151(m *[]string, i int, j int) { FILE: leetcode/0151.Reverse-Words-in-a-String/151. Reverse Words in a String_test.go type question151 (line 8) | type question151 struct type para151 (line 15) | type para151 struct type ans151 (line 21) | type ans151 struct function Test_Problem151 (line 25) | func Test_Problem151(t *testing.T) { FILE: leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray.go function maxProduct (line 3) | func maxProduct(nums []int) int { function max (line 16) | func max(a int, b int) int { function min (line 23) | func min(a int, b int) int { FILE: leetcode/0152.Maximum-Product-Subarray/152. Maximum Product Subarray_test.go type question152 (line 8) | type question152 struct type para152 (line 15) | type para152 struct type ans152 (line 21) | type ans152 struct function Test_Problem152 (line 25) | func Test_Problem152(t *testing.T) { FILE: leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array.go function findMin (line 4) | func findMin(nums []int) int { function findMin1 (line 21) | func findMin1(nums []int) int { function findMin2 (line 57) | func findMin2(nums []int) int { FILE: leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/153. Find Minimum in Rotated Sorted Array_test.go type question153 (line 8) | type question153 struct type para153 (line 15) | type para153 struct type ans153 (line 21) | type ans153 struct function Test_Problem153 (line 25) | func Test_Problem153(t *testing.T) { FILE: leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II.go function findMin154 (line 3) | func findMin154(nums []int) int { FILE: leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/154. Find Minimum in Rotated Sorted Array II_test.go type question154 (line 8) | type question154 struct type para154 (line 15) | type para154 struct type ans154 (line 21) | type ans154 struct function Test_Problem154 (line 25) | func Test_Problem154(t *testing.T) { FILE: leetcode/0155.Min-Stack/155. Min Stack.go type MinStack (line 4) | type MinStack struct method Push (line 17) | func (this *MinStack) Push(x int) { method Pop (line 32) | func (this *MinStack) Pop() { method Top (line 38) | func (this *MinStack) Top() int { method GetMin (line 42) | func (this *MinStack) GetMin() int { function Constructor155 (line 12) | func Constructor155() MinStack { FILE: leetcode/0155.Min-Stack/155. Min Stack_test.go function Test_Problem155 (line 8) | func Test_Problem155(t *testing.T) { FILE: leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go function getIntersectionNode (line 19) | func getIntersectionNode(headA, headB *ListNode) *ListNode { FILE: leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go type question160 (line 10) | type question160 struct type para160 (line 17) | type para160 struct type ans160 (line 24) | type ans160 struct function Test_Problem160 (line 28) | func Test_Problem160(t *testing.T) { FILE: leetcode/0162.Find-Peak-Element/162. Find Peak Element.go function findPeakElement (line 4) | func findPeakElement(nums []int) int { function findPeakElement1 (line 31) | func findPeakElement1(nums []int) int { FILE: leetcode/0162.Find-Peak-Element/162. Find Peak Element_test.go type question162 (line 8) | type question162 struct type para162 (line 15) | type para162 struct type ans162 (line 21) | type ans162 struct function Test_Problem162 (line 25) | func Test_Problem162(t *testing.T) { FILE: leetcode/0164.Maximum-Gap/164. Maximum Gap.go function maximumGap (line 4) | func maximumGap(nums []int) int { function partition164 (line 18) | func partition164(a []int, lo, hi int) int { function quickSort164 (line 30) | func quickSort164(a []int, lo, hi int) { function maximumGap1 (line 40) | func maximumGap1(nums []int) int { function max (line 78) | func max(a int, b int) int { FILE: leetcode/0164.Maximum-Gap/164. Maximum Gap_test.go type question164 (line 8) | type question164 struct type para164 (line 15) | type para164 struct type ans164 (line 21) | type ans164 struct function Test_Problem164 (line 25) | func Test_Problem164(t *testing.T) { FILE: leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go function twoSum167 (line 4) | func twoSum167(numbers []int, target int) []int { function twoSum167_1 (line 20) | func twoSum167_1(numbers []int, target int) []int { FILE: leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go type question167 (line 8) | type question167 struct type para167 (line 15) | type para167 struct type ans167 (line 22) | type ans167 struct function Test_Problem167 (line 26) | func Test_Problem167(t *testing.T) { FILE: leetcode/0168.Excel-Sheet-Column-Title/168. Excel Sheet Column Title.go function convertToTitle (line 3) | func convertToTitle(n int) string { FILE: leetcode/0168.Excel-Sheet-Column-Title/168. Excel Sheet Column Title_test.go type question168 (line 8) | type question168 struct type para168 (line 15) | type para168 struct type ans168 (line 21) | type ans168 struct function Test_Problem168 (line 25) | func Test_Problem168(t *testing.T) { FILE: leetcode/0169.Majority-Element/169. Majority Element.go function majorityElement (line 4) | func majorityElement(nums []int) int { function majorityElement1 (line 21) | func majorityElement1(nums []int) int { FILE: leetcode/0169.Majority-Element/169. Majority Element_test.go type question169 (line 8) | type question169 struct type para169 (line 15) | type para169 struct type ans169 (line 21) | type ans169 struct function Test_Problem169 (line 25) | func Test_Problem169(t *testing.T) { FILE: leetcode/0171.Excel-Sheet-Column-Number/171. Excel Sheet Column Number.go function titleToNumber (line 3) | func titleToNumber(s string) int { FILE: leetcode/0171.Excel-Sheet-Column-Number/171. Excel Sheet Column Number_test.go type question171 (line 8) | type question171 struct type para171 (line 15) | type para171 struct type ans171 (line 21) | type ans171 struct function Test_Problem171 (line 25) | func Test_Problem171(t *testing.T) { FILE: leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes.go function trailingZeroes (line 3) | func trailingZeroes(n int) int { FILE: leetcode/0172.Factorial-Trailing-Zeroes/172. Factorial Trailing Zeroes_test.go type question172 (line 8) | type question172 struct type para172 (line 15) | type para172 struct type ans172 (line 21) | type ans172 struct function Test_Problem172 (line 25) | func Test_Problem172(t *testing.T) { FILE: leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go type BSTIterator (line 22) | type BSTIterator struct method Next (line 47) | func (this *BSTIterator) Next() int { method HasNext (line 53) | func (this *BSTIterator) HasNext() bool { function Constructor173 (line 28) | func Constructor173(root *TreeNode) BSTIterator { function postorder (line 38) | func postorder(root *TreeNode, output *[]int) { type PriorityQueueOfInt (line 63) | type PriorityQueueOfInt method Len (line 65) | func (pq PriorityQueueOfInt) Len() int { method Less (line 69) | func (pq PriorityQueueOfInt) Less(i, j int) bool { method Swap (line 73) | func (pq PriorityQueueOfInt) Swap(i, j int) { method Push (line 77) | func (pq *PriorityQueueOfInt) Push(x interface{}) { method Pop (line 82) | func (pq *PriorityQueueOfInt) Pop() interface{} { FILE: leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go function Test_Problem173 (line 10) | func Test_Problem173(t *testing.T) { FILE: leetcode/0174.Dungeon-Game/174. Dungeon Game.go function calculateMinimumHP (line 6) | func calculateMinimumHP(dungeon [][]int) int { function max (line 30) | func max(a int, b int) int { function min (line 37) | func min(a int, b int) int { function calculateMinimumHP1 (line 45) | func calculateMinimumHP1(dungeon [][]int) int { function canCross (line 58) | func canCross(dungeon [][]int, start int) bool { FILE: leetcode/0174.Dungeon-Game/174. Dungeon Game_test.go type question174 (line 8) | type question174 struct type para174 (line 15) | type para174 struct type ans174 (line 21) | type ans174 struct function Test_Problem174 (line 25) | func Test_Problem174(t *testing.T) { FILE: leetcode/0179.Largest-Number/179. Largest Number.go function largestNumber (line 7) | func largestNumber(nums []int) string { function toStringArray (line 23) | func toStringArray(nums []int) []string { function partitionString (line 30) | func partitionString(a []string, lo, hi int) int { function quickSortString (line 44) | func quickSortString(a []string, lo, hi int) { FILE: leetcode/0179.Largest-Number/179. Largest Number_test.go type question179 (line 8) | type question179 struct type para179 (line 15) | type para179 struct type ans179 (line 21) | type ans179 struct function Test_Problem179 (line 25) | func Test_Problem179(t *testing.T) { FILE: leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences.go function findRepeatedDnaSequences (line 4) | func findRepeatedDnaSequences(s string) []string { function findRepeatedDnaSequences1 (line 26) | func findRepeatedDnaSequences1(s string) []string { FILE: leetcode/0187.Repeated-DNA-Sequences/187. Repeated DNA Sequences_test.go type question187 (line 8) | type question187 struct type para187 (line 15) | type para187 struct type ans187 (line 21) | type ans187 struct function Test_Problem187 (line 25) | func Test_Problem187(t *testing.T) { FILE: leetcode/0189.Rotate-Array/189. Rotate Array.go function rotate (line 4) | func rotate(nums []int, k int) { function reverse (line 11) | func reverse(a []int) { function rotate1 (line 18) | func rotate1(nums []int, k int) { FILE: leetcode/0189.Rotate-Array/189. Rotate Array_test.go type question189 (line 8) | type question189 struct type para189 (line 15) | type para189 struct type ans189 (line 22) | type ans189 struct function Test_Problem189 (line 26) | func Test_Problem189(t *testing.T) { FILE: leetcode/0190.Reverse-Bits/190. Reverse Bits.go function reverseBits (line 3) | func reverseBits(num uint32) uint32 { FILE: leetcode/0190.Reverse-Bits/190. Reverse Bits_test.go type question190 (line 9) | type question190 struct type para190 (line 16) | type para190 struct type ans190 (line 22) | type ans190 struct function Test_Problem190 (line 26) | func Test_Problem190(t *testing.T) { FILE: leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits.go function hammingWeight (line 6) | func hammingWeight(num uint32) int { function hammingWeight1 (line 11) | func hammingWeight1(num uint32) int { FILE: leetcode/0191.Number-of-1-Bits/191. Number of 1 Bits_test.go type question191 (line 9) | type question191 struct type para191 (line 16) | type para191 struct type ans191 (line 22) | type ans191 struct function Test_Problem191 (line 26) | func Test_Problem191(t *testing.T) { FILE: leetcode/0198.House-Robber/198. House Robber.go function rob198 (line 4) | func rob198(nums []int) int { function max (line 21) | func max(a int, b int) int { function rob198_1 (line 29) | func rob198_1(nums []int) int { function rob (line 44) | func rob(nums []int) int { FILE: leetcode/0198.House-Robber/198. House Robber_test.go type question198 (line 8) | type question198 struct type para198 (line 15) | type para198 struct type ans198 (line 21) | type ans198 struct function Test_Problem198 (line 25) | func Test_Problem198(t *testing.T) { FILE: leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go function rightSideView (line 19) | func rightSideView(root *TreeNode) []int { FILE: leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go type question199 (line 10) | type question199 struct type para199 (line 17) | type para199 struct type ans199 (line 23) | type ans199 struct function Test_Problem199 (line 27) | func Test_Problem199(t *testing.T) { FILE: leetcode/0200.Number-of-Islands/200. Number of Islands.go function numIslands (line 10) | func numIslands(grid [][]byte) int { function searchIslands (line 34) | func searchIslands(grid [][]byte, visited *[][]bool, x, y int) { function isInBoard (line 45) | func isInBoard(board [][]byte, x, y int) bool { FILE: leetcode/0200.Number-of-Islands/200. Number of Islands_test.go type question200 (line 8) | type question200 struct type para200 (line 15) | type para200 struct type ans200 (line 21) | type ans200 struct function Test_Problem200 (line 25) | func Test_Problem200(t *testing.T) { FILE: leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range.go function rangeBitwiseAnd1 (line 4) | func rangeBitwiseAnd1(m int, n int) int { function rangeBitwiseAnd (line 18) | func rangeBitwiseAnd(m int, n int) int { FILE: leetcode/0201.Bitwise-AND-of-Numbers-Range/201. Bitwise AND of Numbers Range_test.go type question201 (line 8) | type question201 struct type para201 (line 15) | type para201 struct type ans201 (line 22) | type ans201 struct function Test_Problem201 (line 26) | func Test_Problem201(t *testing.T) { FILE: leetcode/0202.Happy-Number/202. Happy Number.go function isHappy (line 3) | func isHappy(n int) bool { function getSquareOfDigits (line 17) | func getSquareOfDigits(n int) int { FILE: leetcode/0202.Happy-Number/202. Happy Number_test.go type question202 (line 8) | type question202 struct type para202 (line 15) | type para202 struct type ans202 (line 21) | type ans202 struct function Test_Problem202 (line 25) | func Test_Problem202(t *testing.T) { FILE: leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go function removeElements (line 17) | func removeElements(head *ListNode, val int) *ListNode { FILE: leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go type question203 (line 10) | type question203 struct type para203 (line 17) | type para203 struct type ans203 (line 24) | type ans203 struct function Test_Problem203 (line 28) | func Test_Problem203(t *testing.T) { FILE: leetcode/0204.Count-Primes/204. Count Primes.go function countPrimes (line 3) | func countPrimes(n int) int { FILE: leetcode/0204.Count-Primes/204. Count Primes_test.go type question204 (line 8) | type question204 struct type para204 (line 15) | type para204 struct type ans204 (line 21) | type ans204 struct function Test_Problem204 (line 25) | func Test_Problem204(t *testing.T) { FILE: leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings.go function isIsomorphic (line 3) | func isIsomorphic(s string, t string) bool { FILE: leetcode/0205.Isomorphic-Strings/205. Isomorphic Strings_test.go type question205 (line 8) | type question205 struct type para205 (line 15) | type para205 struct type ans205 (line 22) | type ans205 struct function Test_Problem205 (line 26) | func Test_Problem205(t *testing.T) { FILE: leetcode/0206.Reverse-Linked-List/206. Reverse Linked List.go function reverseList (line 18) | func reverseList(head *ListNode) *ListNode { FILE: leetcode/0206.Reverse-Linked-List/206. Reverse Linked List_test.go type question206 (line 10) | type question206 struct type para206 (line 17) | type para206 struct type ans206 (line 23) | type ans206 struct function Test_Problem206 (line 27) | func Test_Problem206(t *testing.T) { FILE: leetcode/0207.Course-Schedule/207. Course Schedule.go function canFinish (line 4) | func canFinish(n int, pre [][]int) bool { FILE: leetcode/0207.Course-Schedule/207. Course Schedule_test.go type question207 (line 8) | type question207 struct type para207 (line 15) | type para207 struct type ans207 (line 22) | type ans207 struct function Test_Problem207 (line 26) | func Test_Problem207(t *testing.T) { FILE: leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree).go type Trie (line 3) | type Trie struct method Insert (line 14) | func (this *Trie) Insert(word string) { method Search (line 29) | func (this *Trie) Search(word string) bool { method StartsWith (line 42) | func (this *Trie) StartsWith(prefix string) bool { function Constructor208 (line 9) | func Constructor208() Trie { FILE: leetcode/0208.Implement-Trie-Prefix-Tree/208. Implement Trie (Prefix Tree)_test.go function Test_Problem208 (line 8) | func Test_Problem208(t *testing.T) { FILE: leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go function minSubArrayLen (line 3) | func minSubArrayLen(target int, nums []int) int { function min (line 19) | func min(a int, b int) int { FILE: leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum_test.go type question209 (line 8) | type question209 struct type para209 (line 15) | type para209 struct type ans209 (line 22) | type ans209 struct function Test_Problem209 (line 26) | func Test_Problem209(t *testing.T) { FILE: leetcode/0210.Course-Schedule-II/210. Course Schedule II.go function findOrder (line 3) | func findOrder(numCourses int, prerequisites [][]int) []int { FILE: leetcode/0210.Course-Schedule-II/210. Course Schedule II_test.go type question210 (line 8) | type question210 struct type para210 (line 15) | type para210 struct type ans210 (line 22) | type ans210 struct function Test_Problem210 (line 26) | func Test_Problem210(t *testing.T) { FILE: leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure.go type WordDictionary (line 3) | type WordDictionary struct method AddWord (line 14) | func (this *WordDictionary) AddWord(word string) { method Search (line 29) | func (this *WordDictionary) Search(word string) bool { function Constructor211 (line 9) | func Constructor211() WordDictionary { FILE: leetcode/0211.Design-Add-and-Search-Words-Data-Structure/211. Design Add and Search Words Data Structure_test.go function Test_Problem211 (line 8) | func Test_Problem211(t *testing.T) { FILE: leetcode/0212.Word-Search-II/212. Word Search II.go function findWords (line 3) | func findWords(board [][]byte, words []string) []string { function exist (line 21) | func exist(board [][]byte, word string) bool { function isInBoard (line 36) | func isInBoard(board [][]byte, x, y int) bool { function searchWord (line 40) | func searchWord(board [][]byte, visited [][]bool, word string, index, x,... FILE: leetcode/0212.Word-Search-II/212. Word Search II_test.go type question212 (line 8) | type question212 struct type para212 (line 15) | type para212 struct type ans212 (line 22) | type ans212 struct function Test_Problem212 (line 26) | func Test_Problem212(t *testing.T) { FILE: leetcode/0213.House-Robber-II/213. House Robber II.go function rob213 (line 3) | func rob213(nums []int) int { function rob213_1 (line 18) | func rob213_1(nums []int, start, end int) int { function max (line 29) | func max(a int, b int) int { FILE: leetcode/0213.House-Robber-II/213. House Robber II_test.go type question213 (line 8) | type question213 struct type para213 (line 15) | type para213 struct type ans213 (line 21) | type ans213 struct function Test_Problem213 (line 25) | func Test_Problem213(t *testing.T) { FILE: leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array.go function findKthLargest1 (line 9) | func findKthLargest1(nums []int, k int) int { function findKthLargest (line 16) | func findKthLargest(nums []int, k int) int { function selectSmallest (line 21) | func selectSmallest(nums []int, l, r, i int) int { function partition (line 37) | func partition(nums []int, l, r int) int { function getLeastNumbers (line 54) | func getLeastNumbers(arr []int, k int) []int { function selectSmallest1 (line 59) | func selectSmallest1(nums []int, l, r, i int) []int { FILE: leetcode/0215.Kth-Largest-Element-in-an-Array/215. Kth Largest Element in an Array_test.go type question215 (line 8) | type question215 struct type para215 (line 15) | type para215 struct type ans215 (line 22) | type ans215 struct function Test_Problem215 (line 26) | func Test_Problem215(t *testing.T) { FILE: leetcode/0216.Combination-Sum-III/216. Combination Sum III.go function combinationSum3 (line 3) | func combinationSum3(k int, n int) [][]int { function findcombinationSum3 (line 12) | func findcombinationSum3(k, target, index int, c []int, res *[][]int) { FILE: leetcode/0216.Combination-Sum-III/216. Combination Sum III_test.go type question216 (line 8) | type question216 struct type para216 (line 15) | type para216 struct type ans216 (line 22) | type ans216 struct function Test_Problem216 (line 26) | func Test_Problem216(t *testing.T) { FILE: leetcode/0217.Contains-Duplicate/217. Contains Duplicate.go function containsDuplicate (line 3) | func containsDuplicate(nums []int) bool { FILE: leetcode/0217.Contains-Duplicate/217. Contains Duplicate_test.go type question217 (line 8) | type question217 struct type para217 (line 15) | type para217 struct type ans217 (line 21) | type ans217 struct function Test_Problem217 (line 25) | func Test_Problem217(t *testing.T) { FILE: leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go constant LEFTSIDE (line 10) | LEFTSIDE = 1 constant RIGHTSIDE (line 11) | RIGHTSIDE = 2 type Point (line 13) | type Point struct function getSkyline (line 19) | func getSkyline(buildings [][]int) [][]int { type BinaryIndexedTree (line 58) | type BinaryIndexedTree struct method Init (line 64) | func (bit *BinaryIndexedTree) Init(capacity int) { method Add (line 69) | func (bit *BinaryIndexedTree) Add(index int, val int) { method Query (line 76) | func (bit *BinaryIndexedTree) Query(index int) int { function getSkyline1 (line 85) | func getSkyline1(buildings [][]int) [][]int { function discretization218 (line 108) | func discretization218(positions [][]int) (map[int]int, []int) { function max (line 125) | func max(a int, b int) int { function getSkyline2 (line 133) | func getSkyline2(buildings [][]int) [][]int { type E (line 194) | type E struct function NewE (line 202) | func NewE(n, x, h, t int) E { type IndexMaxPQ (line 212) | type IndexMaxPQ struct method Enque (line 233) | func (q *IndexMaxPQ) Enque(key, val int) { method Front (line 242) | func (q *IndexMaxPQ) Front() int { method Remove (line 250) | func (q *IndexMaxPQ) Remove(key int) { method sink (line 258) | func (q *IndexMaxPQ) sink(n int) { method swim (line 272) | func (q *IndexMaxPQ) swim(n int) { method exch (line 283) | func (q *IndexMaxPQ) exch(i, j int) { method less (line 289) | func (q *IndexMaxPQ) less(i, j int) bool { function NewIndexMaxPQ (line 220) | func NewIndexMaxPQ(n int) IndexMaxPQ { FILE: leetcode/0218.The-Skyline-Problem/218. The Skyline Problem_test.go type question218 (line 8) | type question218 struct type para218 (line 15) | type para218 struct type ans218 (line 21) | type ans218 struct function Test_Problem218 (line 25) | func Test_Problem218(t *testing.T) { FILE: leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II.go function containsNearbyDuplicate (line 3) | func containsNearbyDuplicate(nums []int, k int) bool { FILE: leetcode/0219.Contains-Duplicate-II/219. Contains Duplicate II_test.go type question219 (line 8) | type question219 struct type para219 (line 15) | type para219 struct type ans219 (line 22) | type ans219 struct function Test_Problem219 (line 26) | func Test_Problem219(t *testing.T) { FILE: leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III.go function containsNearbyAlmostDuplicate (line 4) | func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool { function containsNearbyAlmostDuplicate1 (line 37) | func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool { function abs (line 57) | func abs(a int) int { FILE: leetcode/0220.Contains-Duplicate-III/220. Contains Duplicate III_test.go type question220 (line 8) | type question220 struct type para220 (line 15) | type para220 struct type ans220 (line 23) | type ans220 struct function Test_Problem220 (line 27) | func Test_Problem220(t *testing.T) { FILE: leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go function countNodes (line 19) | func countNodes(root *TreeNode) int { FILE: leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go type question222 (line 10) | type question222 struct type para222 (line 17) | type para222 struct type ans222 (line 23) | type ans222 struct function Test_Problem222 (line 27) | func Test_Problem222(t *testing.T) { FILE: leetcode/0223.Rectangle-Area/223. Rectangle Area.go function computeArea (line 3) | func computeArea(A int, B int, C int, D int, E int, F int, G int, H int)... function area (line 8) | func area(x0, y0, x1, y1 int) int { function max (line 16) | func max(a int, b int) int { function min (line 23) | func min(a int, b int) int { FILE: leetcode/0223.Rectangle-Area/223. Rectangle Area_test.go type question223 (line 8) | type question223 struct type para223 (line 15) | type para223 struct type ans223 (line 28) | type ans223 struct function Test_Problem223 (line 32) | func Test_Problem223(t *testing.T) { FILE: leetcode/0224.Basic-Calculator/224. Basic Calculator.go function calculate (line 10) | func calculate(s string) int { function calculate1 (line 44) | func calculate1(s string) int { function calculateStr (line 70) | func calculateStr(str string) int { function isDigital (line 114) | func isDigital(v byte) bool { FILE: leetcode/0224.Basic-Calculator/224. Basic Calculator_test.go type question224 (line 8) | type question224 struct type para224 (line 15) | type para224 struct type ans224 (line 21) | type ans224 struct function Test_Problem224 (line 25) | func Test_Problem224(t *testing.T) { FILE: leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues.go type MyStack (line 3) | type MyStack struct method Push (line 14) | func (this *MyStack) Push(x int) { method Pop (line 19) | func (this *MyStack) Pop() int { method Top (line 33) | func (this *MyStack) Top() int { method Empty (line 41) | func (this *MyStack) Empty() bool { function Constructor225 (line 9) | func Constructor225() MyStack { FILE: leetcode/0225.Implement-Stack-using-Queues/225. Implement Stack using Queues_test.go function Test_Problem225 (line 8) | func Test_Problem225(t *testing.T) { FILE: leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree.go function invertTree (line 19) | func invertTree(root *TreeNode) *TreeNode { FILE: leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go type question226 (line 10) | type question226 struct type para226 (line 17) | type para226 struct type ans226 (line 23) | type ans226 struct function Test_Problem226 (line 27) | func Test_Problem226(t *testing.T) { FILE: leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go function calculate (line 3) | func calculate(s string) int { FILE: leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go type question227 (line 8) | type question227 struct type para227 (line 15) | type para227 struct type ans227 (line 21) | type ans227 struct function Test_Problem227 (line 25) | func Test_Problem227(t *testing.T) { FILE: leetcode/0228.Summary-Ranges/228. Summary Ranges.go function summaryRanges (line 7) | func summaryRanges(nums []int) (ans []string) { FILE: leetcode/0228.Summary-Ranges/228. Summary Ranges_test.go type question228 (line 8) | type question228 struct type para228 (line 15) | type para228 struct type ans228 (line 21) | type ans228 struct function Test_Problem228 (line 25) | func Test_Problem228(t *testing.T) { FILE: leetcode/0229.Majority-Element-II/229. Majority Element II.go function majorityElement229 (line 4) | func majorityElement229(nums []int) []int { function majorityElement229_1 (line 49) | func majorityElement229_1(nums []int) []int { FILE: leetcode/0229.Majority-Element-II/229. Majority Element II_test.go type question229 (line 8) | type question229 struct type para229 (line 15) | type para229 struct type ans229 (line 21) | type ans229 struct function Test_Problem229 (line 25) | func Test_Problem229(t *testing.T) { FILE: leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go function kthSmallest (line 19) | func kthSmallest(root *TreeNode, k int) int { function inorder230 (line 25) | func inorder230(node *TreeNode, k int, count *int, ans *int) { FILE: leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go type question230 (line 10) | type question230 struct type para230 (line 17) | type para230 struct type ans230 (line 24) | type ans230 struct function Test_Problem230 (line 28) | func Test_Problem230(t *testing.T) { FILE: leetcode/0231.Power-of-Two/231. Power of Two.go function isPowerOfTwo (line 4) | func isPowerOfTwo(num int) bool { function isPowerOfTwo1 (line 9) | func isPowerOfTwo1(num int) bool { function isPowerOfTwo2 (line 14) | func isPowerOfTwo2(num int) bool { function isPowerOfTwo3 (line 21) | func isPowerOfTwo3(num int) bool { FILE: leetcode/0231.Power-of-Two/231. Power of Two_test.go type question231 (line 8) | type question231 struct type para231 (line 15) | type para231 struct type ans231 (line 21) | type ans231 struct function Test_Problem231 (line 25) | func Test_Problem231(t *testing.T) { FILE: leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks.go type MyQueue (line 3) | type MyQueue struct method Push (line 15) | func (this *MyQueue) Push(x int) { method Pop (line 20) | func (this *MyQueue) Pop() int { method Peek (line 31) | func (this *MyQueue) Peek() int { method Empty (line 40) | func (this *MyQueue) Empty() bool { method fromStackToQueue (line 44) | func (this *MyQueue) fromStackToQueue(s, q *[]int) { function Constructor232 (line 9) | func Constructor232() MyQueue { FILE: leetcode/0232.Implement-Queue-using-Stacks/232. Implement Queue using Stacks_test.go function Test_Problem232 (line 8) | func Test_Problem232(t *testing.T) { FILE: leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go function isPalindrome (line 19) | func isPalindrome(head *ListNode) bool { function isPalindrome1 (line 37) | func isPalindrome1(head *ListNode) bool { function L2ss (line 82) | func L2ss(head *ListNode) []int { FILE: leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go type question234 (line 10) | type question234 struct type para234 (line 17) | type para234 struct type ans234 (line 23) | type ans234 struct function Test_Problem234 (line 27) | func Test_Problem234(t *testing.T) { FILE: leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go function lowestCommonAncestor (line 19) | func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode { FILE: leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go type question235 (line 10) | type question235 struct type para235 (line 17) | type para235 struct type ans235 (line 25) | type ans235 struct function Test_Problem235 (line 29) | func Test_Problem235(t *testing.T) { FILE: leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go function lowestCommonAncestor236 (line 19) | func lowestCommonAncestor236(root, p, q *TreeNode) *TreeNode { FILE: leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go type question236 (line 10) | type question236 struct type para236 (line 17) | type para236 struct type ans236 (line 25) | type ans236 struct function Test_Problem236 (line 29) | func Test_Problem236(t *testing.T) { FILE: leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go function deleteNode (line 17) | func deleteNode(node *ListNode) { FILE: leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go type question237 (line 10) | type question237 struct type para237 (line 17) | type para237 struct type ans237 (line 24) | type ans237 struct function Test_Problem237 (line 28) | func Test_Problem237(t *testing.T) { function removeElements (line 77) | func removeElements(head *ListNode, val int) *ListNode { FILE: leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum.go function maxSlidingWindow1 (line 4) | func maxSlidingWindow1(a []int, k int) []int { function maxSlidingWindow (line 24) | func maxSlidingWindow(nums []int, k int) []int { FILE: leetcode/0239.Sliding-Window-Maximum/239. Sliding Window Maximum_test.go type question239 (line 8) | type question239 struct type para239 (line 15) | type para239 struct type ans239 (line 22) | type ans239 struct function Test_Problem239 (line 26) | func Test_Problem239(t *testing.T) { FILE: leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II.go function searchMatrix240 (line 4) | func searchMatrix240(matrix [][]int, target int) bool { function searchMatrix2401 (line 22) | func searchMatrix2401(matrix [][]int, target int) bool { FILE: leetcode/0240.Search-a-2D-Matrix-II/240. Search a 2D Matrix II_test.go type question240 (line 8) | type question240 struct type para240 (line 15) | type para240 struct type ans240 (line 22) | type ans240 struct function Test_Problem240 (line 26) | func Test_Problem240(t *testing.T) { FILE: leetcode/0242.Valid-Anagram/242. Valid Anagram.go function isAnagram (line 4) | func isAnagram(s string, t string) bool { function isAnagram1 (line 26) | func isAnagram1(s string, t string) bool { FILE: leetcode/0242.Valid-Anagram/242. Valid Anagram_test.go type question242 (line 8) | type question242 struct type para242 (line 15) | type para242 struct type ans242 (line 22) | type ans242 struct function Test_Problem242 (line 26) | func Test_Problem242(t *testing.T) { FILE: leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go function binaryTreePaths (line 21) | func binaryTreePaths(root *TreeNode) []string { FILE: leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go type question257 (line 10) | type question257 struct type para257 (line 17) | type para257 struct type ans257 (line 23) | type ans257 struct function Test_Problem257 (line 27) | func Test_Problem257(t *testing.T) { FILE: leetcode/0258.Add-Digits/258. Add Digits.go function addDigits (line 3) | func addDigits(num int) int { FILE: leetcode/0258.Add-Digits/258. Add Digits_test.go type question258 (line 8) | type question258 struct type para258 (line 15) | type para258 struct type ans258 (line 21) | type ans258 struct function Test_Problem258 (line 25) | func Test_Problem258(t *testing.T) { FILE: leetcode/0260.Single-Number-III/260. Single Number III.go function singleNumberIII (line 3) | func singleNumberIII(nums []int) []int { FILE: leetcode/0260.Single-Number-III/260. Single Number III_test.go type question260 (line 8) | type question260 struct type para260 (line 15) | type para260 struct type ans260 (line 21) | type ans260 struct function Test_Problem260 (line 25) | func Test_Problem260(t *testing.T) { FILE: leetcode/0263.Ugly-Number/263. Ugly Number.go function isUgly (line 3) | func isUgly(num int) bool { FILE: leetcode/0263.Ugly-Number/263. Ugly Number_test.go type question263 (line 8) | type question263 struct type para263 (line 15) | type para263 struct type ans263 (line 21) | type ans263 struct function Test_Problem263 (line 25) | func Test_Problem263(t *testing.T) { FILE: leetcode/0264.Ugly-Number-II/264. Ugly Number II.go function nthUglyNumber (line 3) | func nthUglyNumber(n int) int { function min (line 22) | func min(a, b int) int { FILE: leetcode/0264.Ugly-Number-II/264. Ugly Number II_test.go type question264 (line 8) | type question264 struct type para264 (line 15) | type para264 struct type ans264 (line 21) | type ans264 struct function Test_Problem264 (line 25) | func Test_Problem264(t *testing.T) { FILE: leetcode/0268.Missing-Number/268. Missing Number.go function missingNumber (line 3) | func missingNumber(nums []int) int { FILE: leetcode/0268.Missing-Number/268. Missing Number_test.go type question268 (line 8) | type question268 struct type para268 (line 15) | type para268 struct type ans268 (line 21) | type ans268 struct function Test_Problem268 (line 25) | func Test_Problem268(t *testing.T) { FILE: leetcode/0274.H-Index/274. H-Index.go function hIndex (line 4) | func hIndex(citations []int) int { function hIndex1 (line 25) | func hIndex1(citations []int) int { function quickSort164 (line 38) | func quickSort164(a []int, lo, hi int) { function partition164 (line 47) | func partition164(a []int, lo, hi int) int { FILE: leetcode/0274.H-Index/274. H-Index_test.go type question274 (line 8) | type question274 struct type para274 (line 15) | type para274 struct type ans274 (line 21) | type ans274 struct function Test_Problem274 (line 25) | func Test_Problem274(t *testing.T) { FILE: leetcode/0275.H-Index-II/275. H-Index II.go function hIndex275 (line 3) | func hIndex275(citations []int) int { FILE: leetcode/0275.H-Index-II/275. H-Index II_test.go type question275 (line 8) | type question275 struct type para275 (line 15) | type para275 struct type ans275 (line 21) | type ans275 struct function Test_Problem275 (line 25) | func Test_Problem275(t *testing.T) { FILE: leetcode/0278.First-Bad-Version/278. First Bad Version.go function firstBadVersion (line 13) | func firstBadVersion(n int) int { function isBadVersion (line 17) | func isBadVersion(version int) bool { FILE: leetcode/0278.First-Bad-Version/278. First Bad Version_test.go type question278 (line 8) | type question278 struct type para278 (line 15) | type para278 struct type ans278 (line 21) | type ans278 struct function Test_Problem278 (line 25) | func Test_Problem278(t *testing.T) { FILE: leetcode/0279.Perfect-Squares/279. Perfect Squares.go function numSquares (line 5) | func numSquares(n int) int { function isPerfectSquare (line 22) | func isPerfectSquare(n int) bool { function checkAnswer4 (line 28) | func checkAnswer4(x int) bool { FILE: leetcode/0279.Perfect-Squares/279. Perfect Squares_test.go type question279 (line 8) | type question279 struct type para279 (line 15) | type para279 struct type ans279 (line 21) | type ans279 struct function Test_Problem279 (line 25) | func Test_Problem279(t *testing.T) { FILE: leetcode/0283.Move-Zeroes/283. Move Zeroes.go function moveZeroes (line 3) | func moveZeroes(nums []int) { FILE: leetcode/0283.Move-Zeroes/283. Move Zeroes_test.go type question283 (line 8) | type question283 struct type para283 (line 15) | type para283 struct type ans283 (line 21) | type ans283 struct function Test_Problem283 (line 25) | func Test_Problem283(t *testing.T) { FILE: leetcode/0284.Peeking-Iterator/284. Peeking Iterator.go type Iterator (line 5) | type Iterator struct method hasNext (line 8) | func (this *Iterator) hasNext() bool { method next (line 13) | func (this *Iterator) next() int { type PeekingIterator (line 18) | type PeekingIterator struct method hasNext (line 30) | func (this *PeekingIterator) hasNext() bool { method next (line 37) | func (this *PeekingIterator) next() int { method peek (line 46) | func (this *PeekingIterator) peek() int { function Constructor (line 24) | func Constructor(iter *Iterator) *PeekingIterator { FILE: leetcode/0284.Peeking-Iterator/284. Peeking Iterator_test.go function Test_Problem284 (line 7) | func Test_Problem284(t *testing.T) { FILE: leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number.go function findDuplicate (line 6) | func findDuplicate(nums []int) int { function findDuplicate1 (line 22) | func findDuplicate1(nums []int) int { function findDuplicate2 (line 41) | func findDuplicate2(nums []int) int { FILE: leetcode/0287.Find-the-Duplicate-Number/287. Find the Duplicate Number_test.go type question287 (line 8) | type question287 struct type para287 (line 15) | type para287 struct type ans287 (line 21) | type ans287 struct function Test_Problem287 (line 25) | func Test_Problem287(t *testing.T) { FILE: leetcode/0290.Word-Pattern/290. Word Pattern.go function wordPattern (line 5) | func wordPattern(pattern string, str string) bool { FILE: leetcode/0290.Word-Pattern/290. Word Pattern_test.go type question290 (line 8) | type question290 struct type para290 (line 15) | type para290 struct type ans290 (line 22) | type ans290 struct function Test_Problem290 (line 26) | func Test_Problem290(t *testing.T) { FILE: leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.go type Codec (line 12) | type Codec struct method serialize (line 22) | func (this *Codec) serialize(root *TreeNode) string { method deserialize (line 34) | func (this *Codec) deserialize(data string) *TreeNode { method deserializeHelper (line 42) | func (this *Codec) deserializeHelper() *TreeNode { function Constructor (line 17) | func Constructor() Codec { FILE: leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree_test.go type question297 (line 10) | type question297 struct type para297 (line 17) | type para297 struct type ans297 (line 23) | type ans297 struct function Test_Problem297 (line 27) | func Test_Problem297(t *testing.T) { FILE: leetcode/0299.Bulls-and-Cows/299.Bulls and Cows.go function getHint (line 5) | func getHint(secret string, guess string) string { FILE: leetcode/0299.Bulls-and-Cows/299.Bulls and Cows_test.go type question299 (line 8) | type question299 struct type para299 (line 14) | type para299 struct type ans299 (line 20) | type ans299 struct function Test_Problem299 (line 24) | func Test_Problem299(t *testing.T) { FILE: leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence.go function lengthOfLIS (line 6) | func lengthOfLIS(nums []int) int { function max (line 21) | func max(a int, b int) int { function lengthOfLIS1 (line 29) | func lengthOfLIS1(nums []int) int { FILE: leetcode/0300.Longest-Increasing-Subsequence/300. Longest Increasing Subsequence_test.go type question300 (line 8) | type question300 struct type para300 (line 15) | type para300 struct type ans300 (line 21) | type ans300 struct function Test_Problem300 (line 25) | func Test_Problem300(t *testing.T) { FILE: leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses.go function removeInvalidParentheses (line 12) | func removeInvalidParentheses(s string) []string { function backtrace (line 37) | func backtrace(i int, cur string, lmoves int, rmoves int, score int) { function min (line 64) | func min(a, b int) int { FILE: leetcode/0301.Remove-Invalid-Parentheses/301.Remove Invalid Parentheses_test.go type question301 (line 8) | type question301 struct type para301 (line 14) | type para301 struct type ans301 (line 19) | type ans301 struct function Test_Problem301 (line 23) | func Test_Problem301(t *testing.T) { FILE: leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go type NumArray (line 10) | type NumArray struct method SumRange (line 24) | func (ma *NumArray) SumRange(i int, j int) int { function Constructor303 (line 15) | func Constructor303(nums []int) NumArray { FILE: leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable_test.go function Test_Problem303 (line 8) | func Test_Problem303(t *testing.T) { FILE: leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable.go type NumMatrix (line 3) | type NumMatrix struct method SumRegion (line 22) | func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 in... function Constructor (line 7) | func Constructor(matrix [][]int) NumMatrix { FILE: leetcode/0304.Range-Sum-Query-2D-Immutable/304. Range Sum Query 2D - Immutable_test.go function Test_Problem304 (line 8) | func Test_Problem304(t *testing.T) { FILE: leetcode/0306.Additive-Number/306. Additive Number.go function isAdditiveNumber (line 9) | func isAdditiveNumber(num string) bool { function max (line 31) | func max(a int, b int) int { function recursiveCheck (line 39) | func recursiveCheck(num string, x1 int, x2 int, left int) bool { FILE: leetcode/0306.Additive-Number/306. Additive Number_test.go type question306 (line 8) | type question306 struct type para306 (line 15) | type para306 struct type ans306 (line 21) | type ans306 struct function Test_Problem306 (line 25) | func Test_Problem306(t *testing.T) { FILE: leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go type NumArray (line 6) | type NumArray struct method Update (line 20) | func (this *NumArray) Update(i int, val int) { method SumRange (line 25) | func (this *NumArray) SumRange(i int, j int) int { function Constructor307 (line 11) | func Constructor307(nums []int) NumArray { FILE: leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go function Test_Problem307 (line 8) | func Test_Problem307(t *testing.T) { FILE: leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown.go function maxProfit309 (line 8) | func maxProfit309(prices []int) int { function max (line 26) | func max(a int, b int) int { function maxProfit309_1 (line 34) | func maxProfit309_1(prices []int) int { FILE: leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/309. Best Time to Buy and Sell Stock with Cooldown_test.go type question309 (line 8) | type question309 struct type para309 (line 15) | type para309 struct type ans309 (line 21) | type ans309 struct function Test_Problem309 (line 25) | func Test_Problem309(t *testing.T) { FILE: leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go function countSmaller (line 10) | func countSmaller(nums []int) []int { function countSmaller1 (line 41) | func countSmaller1(nums []int) []int { FILE: leetcode/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self_test.go type question315 (line 8) | type question315 struct type para315 (line 15) | type para315 struct type ans315 (line 21) | type ans315 struct function Test_Problem315 (line 25) | func Test_Problem315(t *testing.T) { FILE: leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths.go function maxProduct318 (line 3) | func maxProduct318(words []string) int { FILE: leetcode/0318.Maximum-Product-of-Word-Lengths/318. Maximum Product of Word Lengths_test.go type question318 (line 8) | type question318 struct type para318 (line 15) | type para318 struct type ans318 (line 21) | type ans318 struct function Test_Problem318 (line 25) | func Test_Problem318(t *testing.T) { FILE: leetcode/0319.Bulb-Switcher/319.Bulb Switcher.go function bulbSwitch (line 5) | func bulbSwitch(n int) int { FILE: leetcode/0319.Bulb-Switcher/319.Bulb Switcher_test.go type question319 (line 8) | type question319 struct type para319 (line 14) | type para319 struct type ans319 (line 19) | type ans319 struct function Test_Problem319 (line 23) | func Test_Problem319(t *testing.T) { FILE: leetcode/0322.Coin-Change/322. Coin Change.go function coinChange (line 3) | func coinChange(coins []int, amount int) int { function min (line 22) | func min(a int, b int) int { FILE: leetcode/0322.Coin-Change/322. Coin Change_test.go type question322 (line 8) | type question322 struct type para322 (line 15) | type para322 struct type ans322 (line 22) | type ans322 struct function Test_Problem322 (line 26) | func Test_Problem322(t *testing.T) { FILE: leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II.go function wiggleSort (line 8) | func wiggleSort(nums []int) { function indexMap (line 29) | func indexMap(index, n int) int { function findKthLargest324 (line 33) | func findKthLargest324(nums []int, k int) int { function selection324 (line 40) | func selection324(arr []int, l, r, k int) int { function partition324 (line 55) | func partition324(a []int, lo, hi int) int { function wiggleSort1 (line 69) | func wiggleSort1(nums []int) { FILE: leetcode/0324.Wiggle-Sort-II/324. Wiggle Sort II_test.go type question324 (line 8) | type question324 struct type para324 (line 15) | type para324 struct type ans324 (line 21) | type ans324 struct function Test_Problem324 (line 25) | func Test_Problem324(t *testing.T) { FILE: leetcode/0326.Power-of-Three/326. Power of Three.go function isPowerOfThree (line 4) | func isPowerOfThree(n int) bool { function isPowerOfThree1 (line 10) | func isPowerOfThree1(n int) bool { function isPowerOfThree2 (line 18) | func isPowerOfThree2(num int) bool { FILE: leetcode/0326.Power-of-Three/326. Power of Three_test.go type question326 (line 8) | type question326 struct type para326 (line 15) | type para326 struct type ans326 (line 21) | type ans326 struct function Test_Problem326 (line 25) | func Test_Problem326(t *testing.T) { FILE: leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.go function countRangeSum (line 10) | func countRangeSum(nums []int, lower int, upper int) int { function countRangeSum1 (line 44) | func countRangeSum1(nums []int, lower int, upper int) int { function countRangeSum2 (line 75) | func countRangeSum2(nums []int, lower int, upper int) int { FILE: leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum_test.go type question327 (line 8) | type question327 struct type para327 (line 15) | type para327 struct type ans327 (line 23) | type ans327 struct function Test_Problem327 (line 27) | func Test_Problem327(t *testing.T) { FILE: leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List.go function oddEvenList (line 18) | func oddEvenList(head *ListNode) *ListNode { FILE: leetcode/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go type question328 (line 10) | type question328 struct type para328 (line 17) | type para328 struct type ans328 (line 23) | type ans328 struct function Test_Problem328 (line 27) | func Test_Problem328(t *testing.T) { FILE: leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix.go function longestIncreasingPath (line 14) | func longestIncreasingPath(matrix [][]int) int { function max (line 28) | func max(a int, b int) int { function isInIntBoard (line 35) | func isInIntBoard(board [][]int, x, y int) bool { function searchPath (line 39) | func searchPath(board, cache [][]int, lastNum, x, y int) int { FILE: leetcode/0329.Longest-Increasing-Path-in-a-Matrix/329. Longest Increasing Path in a Matrix_test.go type question329 (line 8) | type question329 struct type para329 (line 15) | type para329 struct type ans329 (line 21) | type ans329 struct function Test_Problem329 (line 25) | func Test_Problem329(t *testing.T) { FILE: leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree.go function isValidSerialization (line 5) | func isValidSerialization(preorder string) bool { FILE: leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/331. Verify Preorder Serialization of a Binary Tree_test.go type question331 (line 8) | type question331 struct type para331 (line 15) | type para331 struct type ans331 (line 21) | type ans331 struct function Test_Problem331 (line 25) | func Test_Problem331(t *testing.T) { FILE: leetcode/0337.House-Robber-III/337. House Robber III.go function rob337 (line 18) | func rob337(root *TreeNode) int { function dfsTreeRob (line 23) | func dfsTreeRob(root *TreeNode) (a, b int) { function max (line 36) | func max(a int, b int) int { FILE: leetcode/0337.House-Robber-III/337. House Robber III_test.go type question337 (line 10) | type question337 struct type para337 (line 17) | type para337 struct type ans337 (line 23) | type ans337 struct function Test_Problem337 (line 27) | func Test_Problem337(t *testing.T) { FILE: leetcode/0338.Counting-Bits/338. Counting Bits.go function countBits (line 3) | func countBits(num int) []int { FILE: leetcode/0338.Counting-Bits/338. Counting Bits_test.go type question338 (line 8) | type question338 struct type para338 (line 15) | type para338 struct type ans338 (line 21) | type ans338 struct function Test_Problem338 (line 25) | func Test_Problem338(t *testing.T) { FILE: leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator.go type NestedInteger (line 7) | type NestedInteger struct method IsInteger (line 11) | func (this NestedInteger) IsInteger() bool { return true } method GetInteger (line 16) | func (this NestedInteger) GetInteger() int { return 0 } method SetInteger (line 19) | func (n *NestedInteger) SetInteger(value int) {} method Add (line 22) | func (this *NestedInteger) Add(elem NestedInteger) {} method GetList (line 27) | func (this NestedInteger) GetList() []*NestedInteger { return nil } type NestedIterator (line 29) | type NestedIterator struct method Next (line 44) | func (this *NestedIterator) Next() int { method HasNext (line 55) | func (this *NestedIterator) HasNext() bool { type listIndex (line 33) | type listIndex struct function Constructor (line 38) | func Constructor(nestedList []*NestedInteger) *NestedIterator { FILE: leetcode/0341.Flatten-Nested-List-Iterator/341. Flatten Nested List Iterator_test.go function Test_Problem338 (line 8) | func Test_Problem338(t *testing.T) { FILE: leetcode/0342.Power-of-Four/342. Power of Four.go function isPowerOfFour (line 4) | func isPowerOfFour(num int) bool { function isPowerOfFour1 (line 9) | func isPowerOfFour1(num int) bool { FILE: leetcode/0342.Power-of-Four/342. Power of Four_test.go type question342 (line 8) | type question342 struct type para342 (line 15) | type para342 struct type ans342 (line 21) | type ans342 struct function Test_Problem342 (line 25) | func Test_Problem342(t *testing.T) { FILE: leetcode/0343.Integer-Break/343. Integer Break.go function integerBreak (line 3) | func integerBreak(n int) int { function max (line 15) | func max(a int, b int) int { FILE: leetcode/0343.Integer-Break/343. Integer Break_test.go type question343 (line 8) | type question343 struct type para343 (line 15) | type para343 struct type ans343 (line 21) | type ans343 struct function Test_Problem343 (line 25) | func Test_Problem343(t *testing.T) { FILE: leetcode/0344.Reverse-String/344. Reverse String.go function reverseString (line 3) | func reverseString(s []byte) { FILE: leetcode/0344.Reverse-String/344. Reverse String_test.go type question344 (line 8) | type question344 struct type para344 (line 15) | type para344 struct type ans344 (line 21) | type ans344 struct function Test_Problem344 (line 25) | func Test_Problem344(t *testing.T) { FILE: leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String.go function reverseVowels (line 3) | func reverseVowels(s string) string { function isVowel (line 21) | func isVowel(s byte) bool { FILE: leetcode/0345.Reverse-Vowels-of-a-String/345. Reverse Vowels of a String_test.go type question345 (line 8) | type question345 struct type para345 (line 15) | type para345 struct type ans345 (line 21) | type ans345 struct function Test_Problem345 (line 25) | func Test_Problem345(t *testing.T) { FILE: leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements.go function topKFrequent (line 5) | func topKFrequent(nums []int, k int) []int { type Item (line 23) | type Item struct type PriorityQueue (line 29) | type PriorityQueue method Len (line 31) | func (pq PriorityQueue) Len() int { method Less (line 35) | func (pq PriorityQueue) Less(i, j int) bool { method Swap (line 40) | func (pq PriorityQueue) Swap(i, j int) { method Push (line 45) | func (pq *PriorityQueue) Push(x interface{}) { method Pop (line 51) | func (pq *PriorityQueue) Pop() interface{} { FILE: leetcode/0347.Top-K-Frequent-Elements/347. Top K Frequent Elements_test.go type question347 (line 8) | type question347 struct type para347 (line 15) | type para347 struct type ans347 (line 22) | type ans347 struct function Test_Problem347 (line 26) | func Test_Problem347(t *testing.T) { FILE: leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays.go function intersection (line 3) | func intersection(nums1 []int, nums2 []int) []int { FILE: leetcode/0349.Intersection-of-Two-Arrays/349. Intersection of Two Arrays_test.go type question349 (line 8) | type question349 struct type para349 (line 15) | type para349 struct type ans349 (line 22) | type ans349 struct function Test_Problem349 (line 26) | func Test_Problem349(t *testing.T) { FILE: leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II.go function intersect (line 3) | func intersect(nums1 []int, nums2 []int) []int { FILE: leetcode/0350.Intersection-of-Two-Arrays-II/350. Intersection of Two Arrays II_test.go type question350 (line 8) | type question350 struct type para350 (line 15) | type para350 struct type ans350 (line 22) | type ans350 struct function Test_Problem350 (line 26) | func Test_Problem350(t *testing.T) { FILE: leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals.go type SummaryRanges (line 5) | type SummaryRanges struct method AddNum (line 17) | func (this *SummaryRanges) AddNum(val int) { method GetIntervals (line 25) | func (this *SummaryRanges) GetIntervals() [][]int { function Constructor (line 10) | func Constructor() SummaryRanges { FILE: leetcode/0352.Data-Stream-as-Disjoint-Intervals/352.Data Stream as Disjoint Intervals_test.go type question352 (line 8) | type question352 struct type para352 (line 14) | type para352 struct type ans352 (line 20) | type ans352 struct function Test_Problem352 (line 24) | func Test_Problem352(t *testing.T) { FILE: leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes.go type sortEnvelopes (line 7) | type sortEnvelopes method Len (line 9) | func (s sortEnvelopes) Len() int { method Less (line 12) | func (s sortEnvelopes) Less(i, j int) bool { method Swap (line 18) | func (s sortEnvelopes) Swap(i, j int) { function maxEnvelopes (line 22) | func maxEnvelopes(envelopes [][]int) int { FILE: leetcode/0354.Russian-Doll-Envelopes/354. Russian Doll Envelopes_test.go type question354 (line 8) | type question354 struct type para354 (line 15) | type para354 struct type ans354 (line 21) | type ans354 struct function Test_Problem354 (line 25) | func Test_Problem354(t *testing.T) { FILE: leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits.go function countNumbersWithUniqueDigits1 (line 4) | func countNumbersWithUniqueDigits1(n int) int { function countNumbersWithUniqueDigits (line 13) | func countNumbersWithUniqueDigits(n int) int { FILE: leetcode/0357.Count-Numbers-with-Unique-Digits/357. Count Numbers with Unique Digits_test.go type question357 (line 8) | type question357 struct type para357 (line 15) | type para357 struct type ans357 (line 21) | type ans357 struct function Test_Problem357 (line 25) | func Test_Problem357(t *testing.T) { FILE: leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square.go function isPerfectSquare (line 3) | func isPerfectSquare(num int) bool { FILE: leetcode/0367.Valid-Perfect-Square/367. Valid Perfect Square_test.go type question367 (line 8) | type question367 struct type para367 (line 15) | type para367 struct type ans367 (line 21) | type ans367 struct function Test_Problem367 (line 25) | func Test_Problem367(t *testing.T) { FILE: leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset.go function largestDivisibleSubset (line 5) | func largestDivisibleSubset(nums []int) []int { FILE: leetcode/0368.Largest-Divisible-Subset/368. Largest Divisible Subset_test.go type question368 (line 8) | type question368 struct type para368 (line 15) | type para368 struct type ans368 (line 21) | type ans368 struct function Test_Problem368 (line 25) | func Test_Problem368(t *testing.T) { FILE: leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers.go function getSum (line 3) | func getSum(a int, b int) int { FILE: leetcode/0371.Sum-of-Two-Integers/371. Sum of Two Integers_test.go type question371 (line 8) | type question371 struct type para371 (line 15) | type para371 struct type ans371 (line 22) | type ans371 struct function Test_Problem371 (line 26) | func Test_Problem371(t *testing.T) { FILE: leetcode/0372.Super-Pow/372. Super Pow.go function superPow (line 16) | func superPow(a int, b []int) int { function qpow (line 25) | func qpow(x, n int) int { function superPow1 (line 40) | func superPow1(a int, b []int) int { FILE: leetcode/0372.Super-Pow/372. Super Pow_test.go type question372 (line 8) | type question372 struct type para372 (line 15) | type para372 struct type ans372 (line 22) | type ans372 struct function Test_Problem372 (line 26) | func Test_Problem372(t *testing.T) { FILE: leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums.go function kSmallestPairs (line 9) | func kSmallestPairs(nums1 []int, nums2 []int, k int) [][]int { type minHeap (line 31) | type minHeap method Len (line 33) | func (h minHeap) Len() int { return len(h) } method Less (line 34) | func (h minHeap) Less(i, j int) bool { return h[i][0]+h[i][1] < h[j][0... method Swap (line 35) | func (h minHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] } method Push (line 37) | func (h *minHeap) Push(x interface{}) { method Pop (line 41) | func (h *minHeap) Pop() interface{} { function kSmallestPairs1 (line 50) | func kSmallestPairs1(nums1 []int, nums2 []int, k int) [][]int { FILE: leetcode/0373.Find-K-Pairs-with-Smallest-Sums/373. Find K Pairs with Smallest Sums_test.go type question373 (line 8) | type question373 struct type para373 (line 15) | type para373 struct type ans373 (line 23) | type ans373 struct function Test_Problem373 (line 27) | func Test_Problem373(t *testing.T) { FILE: leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower.go function guessNumber (line 14) | func guessNumber(n int) int { function guess (line 18) | func guess(num int) int { FILE: leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower_test.go type question374 (line 8) | type question374 struct type para374 (line 15) | type para374 struct type ans374 (line 21) | type ans374 struct function Test_Problem374 (line 25) | func Test_Problem374(t *testing.T) { FILE: leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence.go function wiggleMaxLength (line 3) | func wiggleMaxLength(nums []int) int { FILE: leetcode/0376.Wiggle-Subsequence/376. Wiggle Subsequence_test.go type question376 (line 8) | type question376 struct type para376 (line 15) | type para376 struct type ans376 (line 21) | type ans376 struct function Test_Problem376 (line 25) | func Test_Problem376(t *testing.T) { FILE: leetcode/0377.Combination-Sum-IV/377. Combination Sum IV.go function combinationSum4 (line 3) | func combinationSum4(nums []int, target int) int { function combinationSum41 (line 17) | func combinationSum41(nums []int, target int) int { function findcombinationSum4 (line 26) | func findcombinationSum4(nums []int, target, index int, c []int, res *in... FILE: leetcode/0377.Combination-Sum-IV/377. Combination Sum IV_test.go type question377 (line 8) | type question377 struct type para377 (line 15) | type para377 struct type ans377 (line 22) | type ans377 struct function Test_Problem377 (line 26) | func Test_Problem377(t *testing.T) { FILE: leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix.go function kthSmallest378 (line 8) | func kthSmallest378(matrix [][]int, k int) int { function counterKthSmall (line 23) | func counterKthSmall(m, n, mid int, matrix [][]int) int { function kthSmallest3781 (line 37) | func kthSmallest3781(matrix [][]int, k int) int { type pq (line 58) | type pq struct method Len (line 63) | func (p *pq) Len() int { method Less (line 67) | func (p *pq) Less(a, b int) bool { method Swap (line 71) | func (p *pq) Swap(a, b int) { method Push (line 75) | func (p *pq) Push(o interface{}) { method Head (line 80) | func (p *pq) Head() interface{} { method Pop (line 84) | func (p *pq) Pop() interface{} { FILE: leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/378. Kth Smallest Element in a Sorted Matrix_test.go type question378 (line 8) | type question378 struct type para378 (line 15) | type para378 struct type ans378 (line 22) | type ans378 struct function Test_Problem378 (line 26) | func Test_Problem378(t *testing.T) { FILE: leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node.go type Solution (line 19) | type Solution struct method GetRandom (line 32) | func (this *Solution) GetRandom() int { function Constructor (line 27) | func Constructor(head *ListNode) Solution { FILE: leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node_test.go function Test_Problem382 (line 10) | func Test_Problem382(t *testing.T) { FILE: leetcode/0383.Ransom-Note/383.Ransom Note.go function canConstruct (line 3) | func canConstruct(ransomNote string, magazine string) bool { FILE: leetcode/0383.Ransom-Note/383.Ransom Note_test.go type question383 (line 8) | type question383 struct type para383 (line 14) | type para383 struct type ans383 (line 20) | type ans383 struct function Test_Problem383 (line 24) | func Test_Problem383(t *testing.T) { FILE: leetcode/0384.Shuffle-an-Array/384.Shuffle an Array.go type Solution (line 5) | type Solution struct method Reset (line 16) | func (this *Solution) Reset() []int { method Shuffle (line 21) | func (this *Solution) Shuffle() []int { function Constructor (line 9) | func Constructor(nums []int) Solution { FILE: leetcode/0384.Shuffle-an-Array/384.Shuffle an Array_test.go type question384 (line 8) | type question384 struct type para384 (line 14) | type para384 struct type ans384 (line 20) | type ans384 struct function Test_Problem384 (line 24) | func Test_Problem384(t *testing.T) { FILE: leetcode/0385.Mini-Parser/385. Mini Parser.go type NestedInteger (line 35) | type NestedInteger struct method IsInteger (line 41) | func (n NestedInteger) IsInteger() bool { method GetInteger (line 49) | func (n NestedInteger) GetInteger() int { method SetInteger (line 54) | func (n *NestedInteger) SetInteger(value int) { method Add (line 59) | func (n *NestedInteger) Add(elem NestedInteger) { method GetList (line 64) | func (n NestedInteger) GetList() []*NestedInteger { method Print (line 69) | func (n NestedInteger) Print() { function deserialize (line 84) | func deserialize(s string) *NestedInteger { function isDigital (line 119) | func isDigital(v byte) bool { FILE: leetcode/0385.Mini-Parser/385. Mini Parser_test.go type question385 (line 8) | type question385 struct type para385 (line 15) | type para385 struct type ans385 (line 21) | type ans385 struct function Test_Problem385 (line 25) | func Test_Problem385(t *testing.T) { FILE: leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers.go function lexicalOrder (line 3) | func lexicalOrder(n int) []int { function dfs386 (line 9) | func dfs386(x, n int, res *[]int) { FILE: leetcode/0386.Lexicographical-Numbers/386. Lexicographical Numbers_test.go type question386 (line 8) | type question386 struct type para386 (line 15) | type para386 struct type ans386 (line 21) | type ans386 struct function Test_Problem386 (line 25) | func Test_Problem386(t *testing.T) { FILE: leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String.go function firstUniqChar (line 4) | func firstUniqChar(s string) int { function firstUniqChar1 (line 20) | func firstUniqChar1(s string) int { FILE: leetcode/0387.First-Unique-Character-in-a-String/387. First Unique Character in a String_test.go type question387 (line 8) | type question387 struct type para387 (line 15) | type para387 struct type ans387 (line 21) | type ans387 struct function Test_Problem387 (line 25) | func Test_Problem387(t *testing.T) { FILE: leetcode/0389.Find-the-Difference/389. Find the Difference.go function findTheDifference (line 3) | func findTheDifference(s string, t string) byte { FILE: leetcode/0389.Find-the-Difference/389. Find the Difference_test.go type question389 (line 8) | type question389 struct type para389 (line 15) | type para389 struct type ans389 (line 22) | type ans389 struct function Test_Problem389 (line 26) | func Test_Problem389(t *testing.T) { FILE: leetcode/0390.Elimination-Game/390. Elimination Game.go function lastRemaining (line 3) | func lastRemaining(n int) int { FILE: leetcode/0390.Elimination-Game/390. Elimination Game_test.go type question390 (line 8) | type question390 struct type para390 (line 15) | type para390 struct type ans390 (line 21) | type ans390 struct function Test_Problem390 (line 25) | func Test_Problem390(t *testing.T) { FILE: leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle.go type point (line 3) | type point struct function isRectangleCover (line 8) | func isRectangleCover(rectangles [][]int) bool { function min (line 41) | func min(a, b int) int { function max (line 48) | func max(a, b int) int { FILE: leetcode/0391.Perfect-Rectangle/391.Perfect Rectangle_test.go type question391 (line 8) | type question391 struct type para391 (line 14) | type para391 struct type ans391 (line 19) | type ans391 struct function Test_Problem391 (line 23) | func Test_Problem391(t *testing.T) { FILE: leetcode/0392.Is-Subsequence/392. Is Subsequence.go function isSubsequence (line 4) | func isSubsequence(s string, t string) bool { function isSubsequence1 (line 25) | func isSubsequence1(s string, t string) bool { FILE: leetcode/0392.Is-Subsequence/392. Is Subsequence_test.go type question392 (line 8) | type question392 struct type para392 (line 15) | type para392 struct type ans392 (line 22) | type ans392 struct function Test_Problem392 (line 26) | func Test_Problem392(t *testing.T) { FILE: leetcode/0393.UTF-8-Validation/393. UTF-8 Validation.go function validUtf8 (line 3) | func validUtf8(data []int) bool { FILE: leetcode/0393.UTF-8-Validation/393. UTF-8 Validation_test.go type question393 (line 8) | type question393 struct type para393 (line 15) | type para393 struct type ans393 (line 21) | type ans393 struct function Test_Problem393 (line 25) | func Test_Problem393(t *testing.T) { FILE: leetcode/0394.Decode-String/394. Decode String.go function decodeString (line 7) | func decodeString(s string) string { FILE: leetcode/0394.Decode-String/394. Decode String_test.go type question394 (line 8) | type question394 struct type para394 (line 15) | type para394 struct type ans394 (line 21) | type ans394 struct function Test_Problem394 (line 25) | func Test_Problem394(t *testing.T) { FILE: leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters.go function longestSubstring (line 6) | func longestSubstring(s string, k int) int { function max (line 41) | func max(a, b int) int { function longestSubstring1 (line 49) | func longestSubstring1(s string, k int) int { FILE: leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/395. Longest Substring with At Least K Repeating Characters_test.go type question395 (line 8) | type question395 struct type para395 (line 15) | type para395 struct type ans395 (line 22) | type ans395 struct function Test_Problem395 (line 26) | func Test_Problem395(t *testing.T) { FILE: leetcode/0396.Rotate-Function/396. Rotate Function.go function maxRotateFunction (line 3) | func maxRotateFunction(nums []int) int { FILE: leetcode/0396.Rotate-Function/396. Rotate Function_test.go type question396 (line 8) | type question396 struct type para396 (line 15) | type para396 struct type ans396 (line 21) | type ans396 struct function Test_Problem396 (line 25) | func Test_Problem396(t *testing.T) { FILE: leetcode/0397.Integer-Replacement/397. Integer Replacement.go function integerReplacement (line 3) | func integerReplacement(n int) int { FILE: leetcode/0397.Integer-Replacement/397. Integer Replacement_test.go type question397 (line 8) | type question397 struct type para397 (line 15) | type para397 struct type ans397 (line 21) | type ans397 struct function Test_Problem397 (line 25) | func Test_Problem397(t *testing.T) { FILE: leetcode/0399.Evaluate-Division/399. Evaluate Division.go type stringUnionFind (line 3) | type stringUnionFind struct method add (line 8) | func (suf stringUnionFind) add(x string) { method find (line 16) | func (suf stringUnionFind) find(x string) string { method union (line 34) | func (suf stringUnionFind) union(x, y string, v float64) { function calcEquation (line 45) | func calcEquation(equations [][]string, values []float64, queries [][]st... FILE: leetcode/0399.Evaluate-Division/399. Evaluate Division_test.go type question399 (line 8) | type question399 struct type para399 (line 15) | type para399 struct type ans399 (line 23) | type ans399 struct function Test_Problem399 (line 27) | func Test_Problem399(t *testing.T) { FILE: leetcode/0400.Nth-Digit/400.Nth Digit.go function findNthDigit (line 5) | func findNthDigit(n int) int { FILE: leetcode/0400.Nth-Digit/400.Nth Digit_test.go type question400 (line 8) | type question400 struct type para400 (line 14) | type para400 struct type ans400 (line 19) | type ans400 struct function Test_Problem400 (line 23) | func Test_Problem400(t *testing.T) { FILE: leetcode/0401.Binary-Watch/401. Binary Watch.go function readBinaryWatch (line 9) | func readBinaryWatch(num int) []string { function readBinaryWatch1 (line 64) | func readBinaryWatch1(num int) []string { function findReadBinaryWatchMinute (line 86) | func findReadBinaryWatchMinute(target, index int, c []int, res *[]string) { function findReadBinaryWatchHour (line 110) | func findReadBinaryWatchHour(target, index int, c []int, res *[]string) { FILE: leetcode/0401.Binary-Watch/401. Binary Watch_test.go type question401 (line 8) | type question401 struct type para401 (line 15) | type para401 struct type ans401 (line 21) | type ans401 struct function Test_Problem401 (line 25) | func Test_Problem401(t *testing.T) { FILE: leetcode/0402.Remove-K-Digits/402. Remove K Digits.go function removeKdigits (line 3) | func removeKdigits(num string, k int) string { FILE: leetcode/0402.Remove-K-Digits/402. Remove K Digits_test.go type question402 (line 8) | type question402 struct type para402 (line 15) | type para402 struct type ans402 (line 22) | type ans402 struct function Test_Problem402 (line 26) | func Test_Problem402(t *testing.T) { FILE: leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go function sumOfLeftLeaves (line 19) | func sumOfLeftLeaves(root *TreeNode) int { FILE: leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go type question404 (line 10) | type question404 struct type para404 (line 17) | type para404 struct type ans404 (line 23) | type ans404 struct function Test_Problem404 (line 27) | func Test_Problem404(t *testing.T) { FILE: leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal.go function toHex (line 3) | func toHex(num int) string { FILE: leetcode/0405.Convert-a-Number-to-Hexadecimal/405. Convert a Number to Hexadecimal_test.go type question405 (line 8) | type question405 struct type para405 (line 15) | type para405 struct type ans405 (line 21) | type ans405 struct function Test_Problem405 (line 25) | func Test_Problem405(t *testing.T) { FILE: leetcode/0409.Longest-Palindrome/409. Longest Palindrome.go function longestPalindrome (line 3) | func longestPalindrome(s string) int { FILE: leetcode/0409.Longest-Palindrome/409. Longest Palindrome_test.go type question409 (line 8) | type question409 struct type para409 (line 15) | type para409 struct type ans409 (line 21) | type ans409 struct function Test_Problem409 (line 25) | func Test_Problem409(t *testing.T) { FILE: leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum.go function splitArray (line 3) | func splitArray(nums []int, m int) int { function calSum (line 26) | func calSum(mid, m int, nums []int) bool { FILE: leetcode/0410.Split-Array-Largest-Sum/410. Split Array Largest Sum_test.go type question410 (line 8) | type question410 struct type para410 (line 15) | type para410 struct type ans410 (line 22) | type ans410 struct function Test_Problem410 (line 26) | func Test_Problem410(t *testing.T) { FILE: leetcode/0412.Fizz-Buzz/412. Fizz Buzz.go function fizzBuzz (line 5) | func fizzBuzz(n int) []string { FILE: leetcode/0412.Fizz-Buzz/412. Fizz Buzz_test.go function Test_fizzBuzz (line 35) | func Test_fizzBuzz(t *testing.T) { function Benchmark_fizzBuzz (line 43) | func Benchmark_fizzBuzz(b *testing.B) { FILE: leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices.go function numberOfArithmeticSlices (line 3) | func numberOfArithmeticSlices(A []int) int { FILE: leetcode/0413.Arithmetic-Slices/413. Arithmetic Slices_test.go type question413 (line 8) | type question413 struct type para413 (line 15) | type para413 struct type ans413 (line 21) | type ans413 struct function Test_Problem413 (line 25) | func Test_Problem413(t *testing.T) { FILE: leetcode/0414.Third-Maximum-Number/414. Third Maximum Number.go function thirdMax (line 7) | func thirdMax(nums []int) int { FILE: leetcode/0414.Third-Maximum-Number/414. Third Maximum Number_test.go type question414 (line 8) | type question414 struct type para414 (line 15) | type para414 struct type ans414 (line 21) | type ans414 struct function Test_Problem414 (line 25) | func Test_Problem414(t *testing.T) { FILE: leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go function canPartition (line 3) | func canPartition(nums []int) bool { FILE: leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum_test.go type question416 (line 8) | type question416 struct type para416 (line 15) | type para416 struct type ans416 (line 21) | type ans416 struct function Test_Problem416 (line 25) | func Test_Problem416(t *testing.T) { FILE: leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow.go function pacificAtlantic (line 5) | func pacificAtlantic(matrix [][]int) [][]int { function dfs (line 33) | func dfs(matrix [][]int, row, col int, visited *[][]bool, height int) { FILE: leetcode/0417.Pacific-Atlantic-Water-Flow/417. Pacific Atlantic Water Flow_test.go type question417 (line 8) | type question417 struct type para417 (line 15) | type para417 struct type ans417 (line 21) | type ans417 struct function Test_Problem417 (line 25) | func Test_Problem417(t *testing.T) { FILE: leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board.go function countBattleships (line 3) | func countBattleships(board [][]byte) (ans int) { FILE: leetcode/0419.Battleships-in-a-Board/419. Battleships in a Board_test.go type question419 (line 9) | type question419 struct type para419 (line 16) | type para419 struct type ans419 (line 22) | type ans419 struct function Test_Problem419 (line 26) | func Test_Problem419(t *testing.T) { function bytesArrayToStringArray (line 53) | func bytesArrayToStringArray(b [][]byte) []string { FILE: leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array.go function findMaximumXOR (line 4) | func findMaximumXOR(nums []int) int { function findMaximumXOR1 (line 44) | func findMaximumXOR1(nums []int) int { FILE: leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/421. Maximum XOR of Two Numbers in an Array_test.go type question421 (line 8) | type question421 struct type para421 (line 15) | type para421 struct type ans421 (line 21) | type ans421 struct function Test_Problem421 (line 25) | func Test_Problem421(t *testing.T) { FILE: leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English.go function originalDigits (line 7) | func originalDigits(s string) string { function convert (line 26) | func convert(b byte, digits []int, s string, num string) string { FILE: leetcode/0423.Reconstruct-Original-Digits-from-English/423. Reconstruct Original Digits from English_test.go type question423 (line 8) | type question423 struct type para423 (line 15) | type para423 struct type ans423 (line 21) | type ans423 struct function Test_Problem423 (line 25) | func Test_Problem423(t *testing.T) { FILE: leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement.go function characterReplacement (line 3) | func characterReplacement(s string, k int) int { function max (line 17) | func max(a int, b int) int { FILE: leetcode/0424.Longest-Repeating-Character-Replacement/424. Longest Repeating Character Replacement_test.go type question424 (line 8) | type question424 struct type para424 (line 15) | type para424 struct type ans424 (line 22) | type ans424 struct function Test_Problem424 (line 26) | func Test_Problem424(t *testing.T) { FILE: leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal.go type Node (line 11) | type Node struct function levelOrder (line 16) | func levelOrder(root *Node) [][]int { FILE: leetcode/0429.N-ary-Tree-Level-Order-Traversal/429. N-ary Tree Level Order Traversal_test.go function Test_Problem429 (line 8) | func Test_Problem429(t *testing.T) { FILE: leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation.go function minMutation (line 4) | func minMutation(start string, end string, bank []string) int { function getWordMap (line 27) | func getWordMap(wordList []string, beginWord string) map[string]int { function getCandidates433 (line 39) | func getCandidates433(word string) []string { function minMutation1 (line 52) | func minMutation1(start string, end string, bank []string) int { function dfsMutation (line 71) | func dfsMutation(start uint32, m map[uint32]struct{}, step map[uint32]in... function check (line 91) | func check(val uint32) bool { function convert (line 110) | func convert(gene string) uint32 { FILE: leetcode/0433.Minimum-Genetic-Mutation/433. Minimum Genetic Mutation_test.go type question433 (line 8) | type question433 struct type para433 (line 15) | type para433 struct type ans433 (line 23) | type ans433 struct function Test_Problem433 (line 27) | func Test_Problem433(t *testing.T) { FILE: leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String.go function countSegments (line 3) | func countSegments(s string) int { FILE: leetcode/0434.Number-of-Segments-in-a-String/434.Number of Segments in a String_test.go type question434 (line 8) | type question434 struct type para434 (line 14) | type para434 struct type ans434 (line 19) | type ans434 struct function Test_Problem434 (line 23) | func Test_Problem434(t *testing.T) { FILE: leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals.go function eraseOverlapIntervals (line 8) | func eraseOverlapIntervals(intervals [][]int) int { function max (line 30) | func max(a int, b int) int { type Intervals (line 38) | type Intervals method Len (line 40) | func (a Intervals) Len() int { method Swap (line 43) | func (a Intervals) Swap(i, j int) { method Less (line 46) | func (a Intervals) Less(i, j int) bool { function eraseOverlapIntervals1 (line 60) | func eraseOverlapIntervals1(intervals [][]int) int { FILE: leetcode/0435.Non-overlapping-Intervals/435. Non-overlapping Intervals_test.go type question435 (line 8) | type question435 struct type para435 (line 15) | type para435 struct type ans435 (line 21) | type ans435 struct function Test_Problem435 (line 25) | func Test_Problem435(t *testing.T) { FILE: leetcode/0436.Find-Right-Interval/436. Find Right Interval.go function findRightInterval (line 13) | func findRightInterval(intervals [][]int) []int { type interval (line 32) | type interval struct type intervalList (line 37) | type intervalList method Len (line 39) | func (in intervalList) Len() int { return len(in) } method Less (line 40) | func (in intervalList) Less(i, j int) bool { method Swap (line 43) | func (in intervalList) Swap(i, j int) { in[i], in[j] = in[j], in[i] } function findRightInterval1 (line 46) | func findRightInterval1(intervals [][]int) []int { function searchFirstGreaterInterval (line 66) | func searchFirstGreaterInterval(nums []Interval, target int) int { FILE: leetcode/0436.Find-Right-Interval/436. Find Right Interval_test.go type question436 (line 8) | type question436 struct type para436 (line 15) | type para436 struct type ans436 (line 21) | type ans436 struct function Test_Problem436 (line 25) | func Test_Problem436(t *testing.T) { FILE: leetcode/0437.Path-Sum-III/437. Path Sum III.go function pathSum (line 20) | func pathSum(root *TreeNode, targetSum int) int { function dfs (line 26) | func dfs(root *TreeNode, prefixSum map[int]int, cur, sum int) int { function pathSumIII (line 43) | func pathSumIII(root *TreeNode, sum int) int { function findPath437 (line 54) | func findPath437(root *TreeNode, sum int) int { FILE: leetcode/0437.Path-Sum-III/437. Path Sum III_test.go type question437 (line 10) | type question437 struct type para437 (line 17) | type para437 struct type ans437 (line 24) | type ans437 struct function Test_Problem437 (line 28) | func Test_Problem437(t *testing.T) { FILE: leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String.go function findAnagrams (line 3) | func findAnagrams(s string, p string) []int { FILE: leetcode/0438.Find-All-Anagrams-in-a-String/438. Find All Anagrams in a String_test.go type question438 (line 8) | type question438 struct type para438 (line 15) | type para438 struct type ans438 (line 22) | type ans438 struct function Test_Problem438 (line 26) | func Test_Problem438(t *testing.T) { FILE: leetcode/0441.Arranging-Coins/441. Arranging Coins.go function arrangeCoins (line 6) | func arrangeCoins(n int) int { function arrangeCoins1 (line 15) | func arrangeCoins1(n int) int { FILE: leetcode/0441.Arranging-Coins/441. Arranging Coins_test.go type question441 (line 8) | type question441 struct type para441 (line 15) | type para441 struct type ans441 (line 21) | type ans441 struct function Test_Problem441 (line 25) | func Test_Problem441(t *testing.T) { FILE: leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go function addTwoNumbers445 (line 17) | func addTwoNumbers445(l1 *ListNode, l2 *ListNode) *ListNode { function addNode (line 39) | func addNode(l1 *ListNode, l2 *ListNode, offset int) *ListNode { function getLength (line 61) | func getLength(l *ListNode) int { function addTwoNumbers1 (line 71) | func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode { function reverseList (line 95) | func reverseList(head *ListNode) *ListNode { function addTwoNumbers (line 107) | func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { function pushStack (line 131) | func pushStack(l *ListNode) []int { FILE: leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go type question445 (line 10) | type question445 struct type para445 (line 17) | type para445 struct type ans445 (line 24) | type ans445 struct function Test_Problem445 (line 28) | func Test_Problem445(t *testing.T) { FILE: leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs.go function numberOfBoomerangs (line 3) | func numberOfBoomerangs(points [][]int) int { function dis (line 19) | func dis(pa, pb []int) int { FILE: leetcode/0447.Number-of-Boomerangs/447. Number of Boomerangs_test.go type question447 (line 8) | type question447 struct type para447 (line 15) | type para447 struct type ans447 (line 21) | type ans447 struct function Test_Problem447 (line 25) | func Test_Problem447(t *testing.T) { FILE: leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array/448. Find All Numbers Disappeared in an Array.go function findDisappearedNumbers (line 3) | func findDisappearedNumbers(nums []int) []int { FILE: leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array/448. Find All Numbers Disappeared in an Array_test.go type question448 (line 8) | type question448 struct type para448 (line 15) | type para448 struct type ans448 (line 21) | type ans448 struct function Test_Problem448 (line 25) | func Test_Problem448(t *testing.T) { FILE: leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency.go function frequencySort (line 7) | func frequencySort(s string) string { FILE: leetcode/0451.Sort-Characters-By-Frequency/451. Sort Characters By Frequency_test.go type question451 (line 8) | type question451 struct type para451 (line 15) | type para451 struct type ans451 (line 21) | type ans451 struct function Test_Problem451 (line 25) | func Test_Problem451(t *testing.T) { FILE: leetcode/0453.Minimum-Moves-to-Equal-Array-Elements/453. Minimum Moves to Equal Array Elements.go function minMoves (line 5) | func minMoves(nums []int) int { FILE: leetcode/0453.Minimum-Moves-to-Equal-Array-Elements/453. Minimum Moves to Equal Array Elements_test.go type question453 (line 8) | type question453 struct type para453 (line 15) | type para453 struct type ans453 (line 21) | type ans453 struct function Test_Problem453 (line 25) | func Test_Problem453(t *testing.T) { FILE: leetcode/0454.4Sum-II/454. 4Sum II.go function fourSumCount (line 3) | func fourSumCount(A []int, B []int, C []int, D []int) int { FILE: leetcode/0454.4Sum-II/454. 4Sum II_test.go type question454 (line 8) | type question454 struct type para454 (line 15) | type para454 struct type ans454 (line 24) | type ans454 struct function Test_Problem454 (line 28) | func Test_Problem454(t *testing.T) { FILE: leetcode/0455.Assign-Cookies/455. Assign Cookies.go function findContentChildren (line 5) | func findContentChildren(g []int, s []int) int { FILE: leetcode/0455.Assign-Cookies/455. Assign Cookies_test.go type question455 (line 8) | type question455 struct type para455 (line 15) | type para455 struct type ans455 (line 22) | type ans455 struct function Test_Problem455 (line 26) | func Test_Problem455(t *testing.T) { FILE: leetcode/0456.132-Pattern/456. 132 Pattern.go function find132pattern (line 8) | func find132pattern(nums []int) bool { function find132pattern1 (line 27) | func find132pattern1(nums []int) bool { FILE: leetcode/0456.132-Pattern/456. 132 Pattern_test.go type question456 (line 8) | type question456 struct type para456 (line 15) | type para456 struct type ans456 (line 21) | type ans456 struct function Test_Problem456 (line 25) | func Test_Problem456(t *testing.T) { FILE: leetcode/0457.Circular-Array-Loop/457. Circular Array Loop.go function circularArrayLoop (line 3) | func circularArrayLoop(nums []int) bool { function getNextIndex (line 35) | func getNextIndex(nums []int, index int) int { FILE: leetcode/0457.Circular-Array-Loop/457. Circular Array Loop_test.go type question457 (line 8) | type question457 struct type para457 (line 15) | type para457 struct type ans457 (line 21) | type ans457 struct function Test_Problem457 (line 25) | func Test_Problem457(t *testing.T) { FILE: leetcode/0458.Poor-Pigs/458.Poor Pigs.go function poorPigs (line 5) | func poorPigs(buckets int, minutesToDie int, minutesToTest int) int { FILE: leetcode/0458.Poor-Pigs/458.Poor Pigs_test.go type question458 (line 8) | type question458 struct type para458 (line 14) | type para458 struct type ans458 (line 21) | type ans458 struct function Test_Problem458 (line 25) | func Test_Problem458(t *testing.T) { FILE: leetcode/0460.LFU-Cache/460. LFU Cache.go type LFUCache (line 5) | type LFUCache struct method Get (line 26) | func (this *LFUCache) Get(key int) int { method Put (line 46) | func (this *LFUCache) Put(key int, value int) { type node (line 12) | type node struct function Constructor (line 18) | func Constructor(capacity int) LFUCache { FILE: leetcode/0460.LFU-Cache/460. LFU Cache_test.go function Test_Problem460 (line 8) | func Test_Problem460(t *testing.T) { function MList2Ints (line 42) | func MList2Ints(lfu *LFUCache) map[int][][]int { function MLists2Ints (line 54) | func MLists2Ints(lfu *LFUCache) map[int][]int { FILE: leetcode/0461.Hamming-Distance/461. Hamming Distance.go function hammingDistance (line 3) | func hammingDistance(x int, y int) int { FILE: leetcode/0461.Hamming-Distance/461. Hamming Distance_test.go type question461 (line 8) | type question461 struct type para461 (line 15) | type para461 struct type ans461 (line 22) | type ans461 struct function Test_Problem461 (line 26) | func Test_Problem461(t *testing.T) { FILE: leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II.go function minMoves2 (line 8) | func minMoves2(nums []int) int { FILE: leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II/462. Minimum Moves to Equal Array Elements II_test.go type question462 (line 8) | type question462 struct type para462 (line 15) | type para462 struct type ans462 (line 21) | type ans462 struct function Test_Problem462 (line 25) | func Test_Problem462(t *testing.T) { FILE: leetcode/0463.Island-Perimeter/463. Island Perimeter.go function islandPerimeter (line 3) | func islandPerimeter(grid [][]int) int { FILE: leetcode/0463.Island-Perimeter/463. Island Perimeter_test.go type question463 (line 8) | type question463 struct type para463 (line 15) | type para463 struct type ans463 (line 21) | type ans463 struct function Test_Problem463 (line 25) | func Test_Problem463(t *testing.T) { FILE: leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7().go function rand10 (line 5) | func rand10() int { function rand7 (line 13) | func rand7() int { function rand101 (line 17) | func rand101() int { FILE: leetcode/0470.Implement-Rand10-Using-Rand7/470. Implement Rand10() Using Rand7()_test.go type question470 (line 8) | type question470 struct type para470 (line 15) | type para470 struct type ans470 (line 20) | type ans470 struct function Test_Problem470 (line 24) | func Test_Problem470(t *testing.T) { FILE: leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square.go function makesquare (line 5) | func makesquare(matchsticks []int) bool { function dfs (line 23) | func dfs(matchsticks []int, cur, group, sum, total int, visited *[]bool)... FILE: leetcode/0473.Matchsticks-to-Square/473. Matchsticks to Square_test.go type question473 (line 8) | type question473 struct type para473 (line 15) | type para473 struct type ans473 (line 21) | type ans473 struct function Test_Problem473 (line 25) | func Test_Problem473(t *testing.T) { FILE: leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes.go function findMaxForm (line 5) | func findMaxForm(strs []string, m int, n int) int { function max (line 25) | func max(a int, b int) int { FILE: leetcode/0474.Ones-and-Zeroes/474. Ones and Zeroes_test.go type question474 (line 8) | type question474 struct type para474 (line 15) | type para474 struct type ans474 (line 23) | type ans474 struct function Test_Problem474 (line 27) | func Test_Problem474(t *testing.T) { FILE: leetcode/0475.Heaters/475. Heaters.go function findRadius (line 8) | func findRadius(houses []int, heaters []int) int { function findClosestHeater (line 27) | func findClosestHeater(pos int, heaters []int) int { function findRadius1 (line 53) | func findRadius1(houses []int, heaters []int) int { function max (line 65) | func max(a int, b int) int { function min (line 72) | func min(a int, b int) int { function abs (line 79) | func abs(a int) int { FILE: leetcode/0475.Heaters/475. Heaters_test.go type question475 (line 8) | type question475 struct type para475 (line 15) | type para475 struct type ans475 (line 22) | type ans475 struct function Test_Problem475 (line 26) | func Test_Problem475(t *testing.T) { FILE: leetcode/0476.Number-Complement/476. Number Complement.go function findComplement (line 4) | func findComplement(num int) int { function findComplement1 (line 13) | func findComplement1(num int) int { FILE: leetcode/0476.Number-Complement/476. Number Complement_test.go type question476 (line 8) | type question476 struct type para476 (line 15) | type para476 struct type ans476 (line 21) | type ans476 struct function Test_Problem476 (line 25) | func Test_Problem476(t *testing.T) { FILE: leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance.go function totalHammingDistance (line 3) | func totalHammingDistance(nums []int) int { function totalHammingDistance1 (line 16) | func totalHammingDistance1(nums []int) int { function hammingDistance (line 26) | func hammingDistance(x int, y int) int { FILE: leetcode/0477.Total-Hamming-Distance/477. Total Hamming Distance_test.go type question477 (line 8) | type question477 struct type para477 (line 15) | type para477 struct type ans477 (line 21) | type ans477 struct function Test_Problem477 (line 25) | func Test_Problem477(t *testing.T) { FILE: leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle.go type Solution (line 9) | type Solution struct method RandPoint (line 20) | func (this *Solution) RandPoint() []float64 { function Constructor (line 15) | func Constructor(radius float64, x_center float64, y_center float64) Sol... function angle (line 38) | func angle() float64 { FILE: leetcode/0478.Generate-Random-Point-in-a-Circle/478. Generate Random Point in a Circle_test.go function Test_Problem478 (line 8) | func Test_Problem478(t *testing.T) { FILE: leetcode/0480.Sliding-Window-Median/480. Sliding Window Median.go function medianSlidingWindow (line 10) | func medianSlidingWindow(nums []int, k int) []float64 { function getWindowList (line 23) | func getWindowList(nums []int, k int) *list.List { function removeFromWindow (line 34) | func removeFromWindow(w *list.List, n int) *list.List { function insertInWindow (line 44) | func insertInWindow(w *list.List, n int) *list.List { function getMedian (line 55) | func getMedian(w *list.List, k int) float64 { function medianSlidingWindow1 (line 72) | func medianSlidingWindow1(nums []int, k int) []float64 { type IntHeap (line 112) | type IntHeap struct method Len (line 117) | func (h IntHeap) Len() int { return len(h.data) } method Swap (line 120) | func (h IntHeap) Swap(i, j int) { h.data[i], h.data[j] = h.data[j], h.... method Push (line 123) | func (h *IntHeap) Push(x interface{}) { h.data = append(h.data, x.(int... method Pop (line 126) | func (h *IntHeap) Pop() interface{} { method Top (line 133) | func (h IntHeap) Top() int { type MinHeap (line 138) | type MinHeap struct method Less (line 143) | func (h MinHeap) Less(i, j int) bool { return h.data[i] < h.data[j] } type MaxHeap (line 146) | type MaxHeap struct method Less (line 151) | func (h MaxHeap) Less(i, j int) bool { return h.data[i] > h.data[j] } type MinHeapR (line 154) | type MinHeapR struct method Len (line 159) | func (h MinHeapR) Len() int { return h.hp.Len() - h.hpDel.Len() } method Top (line 162) | func (h *MinHeapR) Top() int { method Pop (line 171) | func (h *MinHeapR) Pop() int { method Push (line 178) | func (h *MinHeapR) Push(x int) { heap.Push(&h.hp, x) } method Remove (line 181) | func (h *MinHeapR) Remove(x int) { heap.Push(&h.hpDel, x) } type MaxHeapR (line 184) | type MaxHeapR struct method Len (line 189) | func (h MaxHeapR) Len() int { return h.hp.Len() - h.hpDel.Len() } method Top (line 192) | func (h *MaxHeapR) Top() int { method Pop (line 201) | func (h *MaxHeapR) Pop() int { method Push (line 208) | func (h *MaxHeapR) Push(x int) { heap.Push(&h.hp, x) } method Remove (line 211) | func (h *MaxHeapR) Remove(x int) { heap.Push(&h.hpDel, x) } FILE: leetcode/0480.Sliding-Window-Median/480. Sliding Window Median_test.go type question480 (line 8) | type question480 struct type para480 (line 15) | type para480 struct type ans480 (line 22) | type ans480 struct function Test_Problem480 (line 26) | func Test_Problem480(t *testing.T) { FILE: leetcode/0483.Smallest-Good-Base/483. Smallest Good Base.go function smallestGoodBase (line 9) | func smallestGoodBase(n string) string { FILE: leetcode/0483.Smallest-Good-Base/483. Smallest Good Base_test.go type question483 (line 8) | type question483 struct type para483 (line 15) | type para483 struct type ans483 (line 21) | type ans483 struct function Test_Problem483 (line 25) | func Test_Problem483(t *testing.T) { FILE: leetcode/0485.Max-Consecutive-Ones/485. Max Consecutive Ones.go function findMaxConsecutiveOnes (line 3) | func findMaxConsecutiveOnes(nums []int) int { FILE: leetcode/0485.Max-Consecutive-Ones/485. Max Consecutive Ones_test.go type question485 (line 8) | type question485 struct type para485 (line 15) | type para485 struct type ans485 (line 21) | type ans485 struct function Test_Problem485 (line 25) | func Test_Problem485(t *testing.T) { FILE: leetcode/0488.Zuma-Game/488.Zuma Game.go function findMinStep (line 3) | func findMinStep(board string, hand string) int { function del3 (line 34) | func del3(str string) string { FILE: leetcode/0488.Zuma-Game/488.Zuma Game_test.go type question488 (line 8) | type question488 struct type para488 (line 14) | type para488 struct type ans488 (line 20) | type ans488 struct function Test_Problem488 (line 24) | func Test_Problem488(t *testing.T) { FILE: leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences.go function findSubsequences (line 3) | func findSubsequences(nums []int) [][]int { function generateIncSubsets (line 16) | func generateIncSubsets(nums []int, current int, c []int, res *[][]int) { FILE: leetcode/0491.Non-decreasing-Subsequences/491. Non-decreasing Subsequences_test.go type question491 (line 8) | type question491 struct type para491 (line 15) | type para491 struct type ans491 (line 21) | type ans491 struct function Test_Problem491 (line 25) | func Test_Problem491(t *testing.T) { FILE: leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle.go function constructRectangle (line 5) | func constructRectangle(area int) []int { FILE: leetcode/0492.Construct-the-Rectangle/492.Construct the Rectangle_test.go type question492 (line 8) | type question492 struct type para492 (line 14) | type para492 struct type ans492 (line 19) | type ans492 struct function Test_Problem492 (line 23) | func Test_Problem492(t *testing.T) { FILE: leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go function reversePairs (line 10) | func reversePairs(nums []int) int { function mergesortCount (line 15) | func mergesortCount(nums, buf []int) int { function reversePairs1 (line 42) | func reversePairs1(nums []int) (cnt int) { function reversePairs2 (line 71) | func reversePairs2(nums []int) int { FILE: leetcode/0493.Reverse-Pairs/493. Reverse Pairs_test.go type question493 (line 8) | type question493 struct type para493 (line 15) | type para493 struct type ans493 (line 21) | type ans493 struct function Test_Problem493 (line 25) | func Test_Problem493(t *testing.T) { FILE: leetcode/0494.Target-Sum/494. Target Sum.go function findTargetSumWays (line 4) | func findTargetSumWays(nums []int, S int) int { function findTargetSumWays1 (line 24) | func findTargetSumWays1(nums []int, S int) int { function dfsFindTargetSumWays (line 36) | func dfsFindTargetSumWays(nums []int, index int, curSum int, S int, res ... FILE: leetcode/0494.Target-Sum/494. Target Sum_test.go type question494 (line 8) | type question494 struct type para494 (line 15) | type para494 struct type ans494 (line 22) | type ans494 struct function Test_Problem494 (line 26) | func Test_Problem494(t *testing.T) { FILE: leetcode/0495.Teemo-Attacking/495.Teemo Attacking.go function findPoisonedDuration (line 3) | func findPoisonedDuration(timeSeries []int, duration int) int { FILE: leetcode/0495.Teemo-Attacking/495.Teemo Attacking_test.go type question495 (line 8) | type question495 struct type para495 (line 14) | type para495 struct type ans495 (line 20) | type ans495 struct function Test_Problem495 (line 24) | func Test_Problem495(t *testing.T) { FILE: leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I.go function nextGreaterElement (line 3) | func nextGreaterElement(nums1 []int, nums2 []int) []int { FILE: leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go type question496 (line 8) | type question496 struct type para496 (line 15) | type para496 struct type ans496 (line 22) | type ans496 struct function Test_Problem496 (line 26) | func Test_Problem496(t *testing.T) { FILE: leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles.go type Solution497 (line 6) | type Solution497 struct method Pick (line 33) | func (so *Solution497) Pick() []int { function Constructor497 (line 12) | func Constructor497(rects [][]int) Solution497 { FILE: leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/497. Random Point in Non-overlapping Rectangles_test.go function Test_Problem497 (line 8) | func Test_Problem497(t *testing.T) { FILE: leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse.go function findDiagonalOrder1 (line 4) | func findDiagonalOrder1(matrix [][]int) []int { function findDiagonalOrder (line 41) | func findDiagonalOrder(matrix [][]int) []int { function addTraverse (line 133) | func addTraverse(matrix [][]int, i, j int, res *[]int) { FILE: leetcode/0498.Diagonal-Traverse/498. Diagonal Traverse_test.go type question498 (line 8) | type question498 struct type para498 (line 15) | type para498 struct type ans498 (line 21) | type ans498 struct function Test_Problem498 (line 25) | func Test_Problem498(t *testing.T) { FILE: leetcode/0500.Keyboard-Row/500. Keyboard Row.go function findWords500 (line 5) | func findWords500(words []string) []string { FILE: leetcode/0500.Keyboard-Row/500. Keyboard Row_test.go type question500 (line 8) | type question500 struct type para500 (line 15) | type para500 struct type ans500 (line 21) | type ans500 struct function Test_Problem500 (line 25) | func Test_Problem500(t *testing.T) { FILE: leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II.go function nextGreaterElements (line 4) | func nextGreaterElements(nums []int) []int { function nextGreaterElements1 (line 23) | func nextGreaterElements1(nums []int) []int { FILE: leetcode/0503.Next-Greater-Element-II/503. Next Greater Element II_test.go type question503 (line 8) | type question503 struct type para503 (line 15) | type para503 struct type ans503 (line 21) | type ans503 struct function Test_Problem503 (line 25) | func Test_Problem503(t *testing.T) { FILE: leetcode/0504.Base-7/504.Base 7.go function convertToBase7 (line 5) | func convertToBase7(num int) string { FILE: leetcode/0504.Base-7/504.Base 7_test.go type question504 (line 8) | type question504 struct type para504 (line 14) | type para504 struct type ans504 (line 19) | type ans504 struct function Test_Problem504 (line 23) | func Test_Problem504(t *testing.T) { FILE: leetcode/0506.Relative-Ranks/506.Relative Ranks.go function findRelativeRanks (line 8) | func findRelativeRanks(score []int) []string { FILE: leetcode/0506.Relative-Ranks/506.Relative Ranks_test.go type question506 (line 8) | type question506 struct type para506 (line 14) | type para506 struct type ans506 (line 19) | type ans506 struct function Test_Problem506 (line 23) | func Test_Problem506(t *testing.T) { FILE: leetcode/0507.Perfect-Number/507. Perfect Number.go function checkPerfectNumber (line 6) | func checkPerfectNumber(num int) bool { function checkPerfectNumber_ (line 22) | func checkPerfectNumber_(num int) bool { FILE: leetcode/0507.Perfect-Number/507. Perfect Number_test.go type question507 (line 8) | type question507 struct type para507 (line 15) | type para507 struct type ans507 (line 21) | type ans507 struct function Test_Problem507 (line 25) | func Test_Problem507(t *testing.T) { FILE: leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go function findFrequentTreeSum (line 22) | func findFrequentTreeSum(root *TreeNode) []int { function collectSum (line 38) | func collectSum(root *TreeNode, memo map[int]int) int { function findFrequentTreeSum1 (line 52) | func findFrequentTreeSum1(root *TreeNode) []int { function findTreeSum (line 70) | func findTreeSum(root *TreeNode, fre map[int]int) int { FILE: leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go type question508 (line 10) | type question508 struct type para508 (line 17) | type para508 struct type ans508 (line 23) | type ans508 struct function Test_Problem508 (line 27) | func Test_Problem508(t *testing.T) { FILE: leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go function fib (line 6) | func fib(N int) int { function fib1 (line 14) | func fib1(N int) int { function fib2 (line 26) | func fib2(N int) int { function memoize (line 33) | func memoize(N int, cache map[int]int) int { function fib3 (line 42) | func fib3(N int) int { function fib4 (line 61) | func fib4(N int) int { function matrixPower (line 73) | func matrixPower(A [2][2]int, N int) [2][2]int { function multiply (line 91) | func multiply(A [2][2]int, B [2][2]int) [2][2]int { function fib5 (line 107) | func fib5(N int) int { function fib6 (line 113) | func fib6(N int) int { function fibb (line 117) | func fibb(n int) <-chan int { FILE: leetcode/0509.Fibonacci-Number/509. Fibonacci Number_test.go type question509 (line 8) | type question509 struct type para509 (line 15) | type para509 struct type ans509 (line 21) | type ans509 struct function Test_Problem509 (line 25) | func Test_Problem509(t *testing.T) { FILE: leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go function findBottomLeftValue (line 20) | func findBottomLeftValue(root *TreeNode) int { function findBottomLeftValueDFS (line 29) | func findBottomLeftValueDFS(root *TreeNode, curHeight int, res, maxHeigh... function findBottomLeftValue1 (line 43) | func findBottomLeftValue1(root *TreeNode) int { FILE: leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go type question513 (line 10) | type question513 struct type para513 (line 17) | type para513 struct type ans513 (line 23) | type ans513 struct function Test_Problem513 (line 27) | func Test_Problem513(t *testing.T) { FILE: leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go function largestValues (line 23) | func largestValues(root *TreeNode) []int { function levelOrder (line 34) | func levelOrder(root *TreeNode) [][]int { function largestValues1 (line 67) | func largestValues1(root *TreeNode) []int { function largestValues3 (line 95) | func largestValues3(root *TreeNode) []int { FILE: leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go type question515 (line 10) | type question515 struct type para515 (line 17) | type para515 struct type ans515 (line 23) | type ans515 struct function Test_Problem515 (line 27) | func Test_Problem515(t *testing.T) { FILE: leetcode/0518.Coin-Change-II/518. Coin Change II.go function change (line 3) | func change(amount int, coins []int) int { FILE: leetcode/0518.Coin-Change-II/518. Coin Change II_test.go type question518 (line 8) | type question518 struct type para518 (line 15) | type para518 struct type ans518 (line 22) | type ans518 struct function Test_Problem518 (line 26) | func Test_Problem518(t *testing.T) { FILE: leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix.go type Solution (line 7) | type Solution struct method Flip (line 23) | func (this *Solution) Flip() []int { method Reset (line 40) | func (this *Solution) Reset() { function Constructor (line 14) | func Constructor(m int, n int) Solution { FILE: leetcode/0519.Random-Flip-Matrix/519.Random Flip Matrix_test.go type question519 (line 8) | type question519 struct type para519 (line 14) | type para519 struct type ans519 (line 20) | type ans519 struct function Test_Problem519 (line 24) | func Test_Problem519(t *testing.T) { FILE: leetcode/0520.Detect-Capital/520.Detect Capital.go function detectCapitalUse (line 5) | func detectCapitalUse(word string) bool { FILE: leetcode/0520.Detect-Capital/520.Detect Capital_test.go type question520 (line 8) | type question520 struct type para520 (line 14) | type para520 struct type ans520 (line 19) | type ans520 struct function Test_Problem520 (line 23) | func Test_Problem520(t *testing.T) { FILE: leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum.go function checkSubarraySum (line 3) | func checkSubarraySum(nums []int, k int) bool { FILE: leetcode/0523.Continuous-Subarray-Sum/523. Continuous Subarray Sum_test.go type question523 (line 8) | type question523 struct type para523 (line 15) | type para523 struct type ans523 (line 22) | type ans523 struct function Test_Problem523 (line 26) | func Test_Problem523(t *testing.T) { FILE: leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting.go function findLongestWord (line 3) | func findLongestWord(s string, d []string) string { FILE: leetcode/0524.Longest-Word-in-Dictionary-through-Deleting/524. Longest Word in Dictionary through Deleting_test.go type question524 (line 8) | type question524 struct type para524 (line 15) | type para524 struct type ans524 (line 22) | type ans524 struct function Test_Problem524 (line 26) | func Test_Problem524(t *testing.T) { FILE: leetcode/0525.Contiguous-Array/525. Contiguous Array.go function findMaxLength (line 3) | func findMaxLength(nums []int) int { function max (line 22) | func max(a, b int) int { FILE: leetcode/0525.Contiguous-Array/525. Contiguous Array_test.go type question525 (line 8) | type question525 struct type para525 (line 15) | type para525 struct type ans525 (line 21) | type ans525 struct function Test_Problem525 (line 25) | func Test_Problem525(t *testing.T) { FILE: leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement.go function countArrangement1 (line 4) | func countArrangement1(N int) int { function countArrangement (line 10) | func countArrangement(N int) int { function generatePermutation526 (line 22) | func generatePermutation526(nums []int, index int, p []int, res *[][]int... function checkDivisible (line 44) | func checkDivisible(num, d int) bool { FILE: leetcode/0526.Beautiful-Arrangement/526. Beautiful Arrangement_test.go type question526 (line 8) | type question526 struct type para526 (line 15) | type para526 struct type ans526 (line 21) | type ans526 struct function Test_Problem526 (line 25) | func Test_Problem526(t *testing.T) { FILE: leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight.go type Solution528 (line 8) | type Solution528 struct method PickIndex (line 26) | func (so *Solution528) PickIndex() int { function Constructor528 (line 13) | func Constructor528(w []int) Solution528 { FILE: leetcode/0528.Random-Pick-with-Weight/528. Random Pick with Weight_test.go function Test_Problem528 (line 8) | func Test_Problem528(t *testing.T) { FILE: leetcode/0529.Minesweeper/529. Minesweeper.go function updateBoard (line 14) | func updateBoard(board [][]byte, click []int) [][]byte { function dfs (line 23) | func dfs(board [][]byte, x, y int) { function isInBoard (line 44) | func isInBoard(board [][]byte, x, y int) bool { FILE: leetcode/0529.Minesweeper/529. Minesweeper_test.go type question529 (line 8) | type question529 struct type para529 (line 15) | type para529 struct type ans529 (line 22) | type ans529 struct function Test_Problem529 (line 26) | func Test_Problem529(t *testing.T) { FILE: leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST.go function getMinimumDifference (line 21) | func getMinimumDifference(root *TreeNode) int { function dfsBST (line 27) | func dfsBST(root *TreeNode, res, pre *int) { function min (line 39) | func min(a, b int) int { function abs (line 46) | func abs(a int) int { FILE: leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST_test.go type question530 (line 10) | type question530 struct type para530 (line 17) | type para530 struct type ans530 (line 23) | type ans530 struct function Test_Problem530 (line 27) | func Test_Problem530(t *testing.T) { FILE: leetcode/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array.go function findPairs (line 3) | func findPairs(nums []int, k int) int { FILE: leetcode/0532.K-diff-Pairs-in-an-Array/532. K-diff Pairs in an Array_test.go type question532 (line 8) | type question532 struct type para532 (line 15) | type para532 struct type ans532 (line 22) | type ans532 struct function Test_Problem532 (line 26) | func Test_Problem532(t *testing.T) { FILE: leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL.go type Codec (line 9) | type Codec struct method encode (line 18) | func (this *Codec) encode(longUrl string) string { method decode (line 24) | func (this *Codec) decode(shortUrl string) string { function Constructor (line 13) | func Constructor() Codec { FILE: leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL_test.go function Test_Problem535 (line 8) | func Test_Problem535(t *testing.T) { FILE: leetcode/0537.Complex-Number-Multiplication/537. Complex Number Multiplication.go function complexNumberMultiply (line 8) | func complexNumberMultiply(a string, b string) string { function parse (line 16) | func parse(s string) (int, int) { FILE: leetcode/0537.Complex-Number-Multiplication/537. Complex Number Multiplication_test.go type question537 (line 8) | type question537 struct type para537 (line 15) | type para537 struct type ans537 (line 22) | type ans537 struct function Test_Problem537 (line 26) | func Test_Problem537(t *testing.T) { FILE: leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree.go function convertBST (line 19) | func convertBST(root *TreeNode) *TreeNode { function dfs538 (line 28) | func dfs538(root *TreeNode, sum *int) { FILE: leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree_test.go type question538 (line 10) | type question538 struct type para538 (line 17) | type para538 struct type ans538 (line 23) | type ans538 struct function Test_Problem538 (line 27) | func Test_Problem538(t *testing.T) { FILE: leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array.go function singleNonDuplicate (line 3) | func singleNonDuplicate(nums []int) int { FILE: leetcode/0540.Single-Element-in-a-Sorted-Array/540.Single Element in a Sorted Array_test.go type question540 (line 8) | type question540 struct type para540 (line 14) | type para540 struct type ans540 (line 19) | type ans540 struct function Test_Problem540 (line 23) | func Test_Problem540(t *testing.T) { FILE: leetcode/0541.Reverse-String-II/541. Reverse String II.go function reverseStr (line 3) | func reverseStr(s string, k int) string { function revers (line 19) | func revers(s string) string { FILE: leetcode/0541.Reverse-String-II/541. Reverse String II_test.go type question541 (line 8) | type question541 struct type para541 (line 15) | type para541 struct type ans541 (line 22) | type ans541 struct function Test_Problem541 (line 26) | func Test_Problem541(t *testing.T) { FILE: leetcode/0542.01-Matrix/542. 01 Matrix.go function updateMatrixBFS (line 8) | func updateMatrixBFS(matrix [][]int) [][]int { function updateMatrixDFS (line 54) | func updateMatrixDFS(matrix [][]int) [][]int { function hasZero (line 79) | func hasZero(matrix [][]int, row, col int) bool { function dfsMatrix (line 95) | func dfsMatrix(matrix [][]int, row, col, val int) { function updateMatrixDP (line 110) | func updateMatrixDP(matrix [][]int) [][]int { function min (line 144) | func min(a int, b int) int { FILE: leetcode/0542.01-Matrix/542. 01 Matrix_test.go type question542 (line 8) | type question542 struct type para542 (line 15) | type para542 struct type ans542 (line 21) | type ans542 struct function Test_Problem542 (line 25) | func Test_Problem542(t *testing.T) { FILE: leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree.go function diameterOfBinaryTree (line 19) | func diameterOfBinaryTree(root *TreeNode) int { function checkDiameter (line 25) | func checkDiameter(root *TreeNode, result *int) int { function max (line 35) | func max(a int, b int) int { FILE: leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree_test.go type question543 (line 10) | type question543 struct type para543 (line 17) | type para543 struct type ans543 (line 23) | type ans543 struct function Test_Problem543 (line 27) | func Test_Problem543(t *testing.T) { FILE: leetcode/0547.Number-of-Provinces/547. Number of Provinces.go function findCircleNum (line 9) | func findCircleNum(M [][]int) int { function findCircleNum1 (line 27) | func findCircleNum1(M [][]int) int { function dfs547 (line 42) | func dfs547(M [][]int, cur int, visited []bool) { FILE: leetcode/0547.Number-of-Provinces/547. Number of Provinces_test.go type question547 (line 8) | type question547 struct type para547 (line 15) | type para547 struct type ans547 (line 21) | type ans547 struct function Test_Problem547 (line 25) | func Test_Problem547(t *testing.T) { FILE: leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I.go function checkRecord (line 3) | func checkRecord(s string) bool { FILE: leetcode/0551.Student-Attendance-Record-I/551.Student Attendance Record I_test.go type question551 (line 8) | type question551 struct type para551 (line 14) | type para551 struct type ans551 (line 19) | type ans551 struct function Test_Problem551 (line 23) | func Test_Problem551(t *testing.T) { FILE: leetcode/0554.Brick-Wall/554. Brick Wall.go function leastBricks (line 3) | func leastBricks(wall [][]int) int { FILE: leetcode/0554.Brick-Wall/554. Brick Wall_test.go type question554 (line 8) | type question554 struct type para554 (line 15) | type para554 struct type ans554 (line 21) | type ans554 struct function Test_Problem554 (line 25) | func Test_Problem554(t *testing.T) { FILE: leetcode/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III.go function reverseWords (line 7) | func reverseWords(s string) string { function revers (line 15) | func revers(s string) string { FILE: leetcode/0557.Reverse-Words-in-a-String-III/557. Reverse Words in a String III_test.go type question557 (line 8) | type question557 struct type para557 (line 15) | type para557 struct type ans557 (line 21) | type ans557 struct function Test_Problem557 (line 25) | func Test_Problem557(t *testing.T) { FILE: leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree.go type Node (line 3) | type Node struct function maxDepth (line 8) | func maxDepth(root *Node) int { function bfs (line 15) | func bfs(root *Node) int { FILE: leetcode/0559.Maximum-Depth-of-N-ary-Tree/559.Maximum Depth of N-ary Tree_test.go type question559 (line 8) | type question559 struct type para559 (line 14) | type para559 struct type ans559 (line 19) | type ans559 struct function Test_Problem559 (line 23) | func Test_Problem559(t *testing.T) { FILE: leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K.go function subarraySum (line 3) | func subarraySum(nums []int, k int) int { FILE: leetcode/0560.Subarray-Sum-Equals-K/560. Subarray Sum Equals K_test.go type question560 (line 8) | type question560 struct type para560 (line 15) | type para560 struct type ans560 (line 22) | type ans560 struct function Test_Problem560 (line 26) | func Test_Problem560(t *testing.T) { FILE: leetcode/0561.Array-Partition/561. Array Partition.go function arrayPairSum (line 3) | func arrayPairSum(nums []int) int { FILE: leetcode/0561.Array-Partition/561. Array Partition_test.go type question561 (line 8) | type question561 struct type para561 (line 15) | type para561 struct type ans561 (line 21) | type ans561 struct function Test_Problem561 (line 25) | func Test_Problem561(t *testing.T) { FILE: leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go function findTilt (line 21) | func findTilt(root *TreeNode) int { function findTiltDFS (line 30) | func findTiltDFS(root *TreeNode, sum *int) int { FILE: leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go type question563 (line 10) | type question563 struct type para563 (line 17) | type para563 struct type ans563 (line 23) | type ans563 struct function Test_Problem563 (line 27) | func Test_Problem563(t *testing.T) { FILE: leetcode/0566.Reshape-the-Matrix/566. Reshape the Matrix.go function matrixReshape (line 3) | func matrixReshape(nums [][]int, r int, c int) [][]int { function canReshape (line 10) | func canReshape(nums [][]int, r, c int) bool { function reshape (line 19) | func reshape(nums [][]int, r, c int) [][]int { FILE: leetcode/0566.Reshape-the-Matrix/566. Reshape the Matrix_test.go type question566 (line 8) | type question566 struct type para566 (line 15) | type para566 struct type ans566 (line 23) | type ans566 struct function Test_Problem566 (line 27) | func Test_Problem566(t *testing.T) { FILE: leetcode/0567.Permutation-in-String/567. Permutation in String.go function checkInclusion (line 3) | func checkInclusion(s1 string, s2 string) bool { FILE: leetcode/0567.Permutation-in-String/567. Permutation in String_test.go type question567 (line 8) | type question567 struct type para567 (line 15) | type para567 struct type ans567 (line 22) | type ans567 struct function Test_Problem567 (line 26) | func Test_Problem567(t *testing.T) { FILE: leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go function isSubtree (line 19) | func isSubtree(s *TreeNode, t *TreeNode) bool { function isSameTree (line 33) | func isSameTree(p *TreeNode, q *TreeNode) bool { FILE: leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go type question572 (line 10) | type question572 struct type para572 (line 17) | type para572 struct type ans572 (line 24) | type ans572 struct function Test_Problem572 (line 28) | func Test_Problem572(t *testing.T) { FILE: leetcode/0575.Distribute-Candies/575. Distribute Candies.go function distributeCandies (line 3) | func distributeCandies(candies []int) int { FILE: leetcode/0575.Distribute-Candies/575. Distribute Candies_test.go type question575 (line 8) | type question575 struct type para575 (line 15) | type para575 struct type ans575 (line 21) | type ans575 struct function Test_Problem575 (line 25) | func Test_Problem575(t *testing.T) { FILE: leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths.go function findPaths (line 10) | func findPaths(m int, n int, maxMove int, startRow int, startColumn int)... function dfs (line 24) | func dfs(x, y, maxMove, m, n int, visited [][][]int) int { FILE: leetcode/0576.Out-of-Boundary-Paths/576. Out of Boundary Paths_test.go type question576 (line 8) | type question576 struct type para576 (line 15) | type para576 struct type ans576 (line 25) | type ans576 struct function Test_Problem576 (line 29) | func Test_Problem576(t *testing.T) { FILE: leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray.go function findUnsortedSubarray (line 5) | func findUnsortedSubarray(nums []int) int { function max (line 46) | func max(a, b int) int { function min (line 53) | func min(a, b int) int { FILE: leetcode/0581.Shortest-Unsorted-Continuous-Subarray/581. Shortest Unsorted Continuous Subarray_test.go type question581 (line 8) | type question581 struct type para581 (line 15) | type para581 struct type ans581 (line 21) | type ans581 struct function Test_Problem581 (line 25) | func Test_Problem581(t *testing.T) { FILE: leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings.go function minDistance (line 3) | func minDistance(word1 string, word2 string) int { function min (line 26) | func min(x, y int) int { FILE: leetcode/0583.Delete-Operation-for-Two-Strings/583. Delete Operation for Two Strings_test.go type question583 (line 8) | type question583 struct type para583 (line 15) | type para583 struct type ans583 (line 22) | type ans583 struct function Test_Problem583 (line 26) | func Test_Problem583(t *testing.T) { FILE: leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal.go type Node (line 4) | type Node struct function preorder (line 10) | func preorder(root *Node) []int { function preorder1 (line 30) | func preorder1(root *Node) []int { function preorderdfs (line 36) | func preorderdfs(root *Node, res *[]int) { FILE: leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal_test.go type question589 (line 10) | type question589 struct type para589 (line 17) | type para589 struct type ans589 (line 23) | type ans589 struct function Test_Problem589 (line 27) | func Test_Problem589(t *testing.T) { function int2NaryNode (line 53) | func int2NaryNode(nodes []int) *Node { FILE: leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence.go function findLHS (line 3) | func findLHS(nums []int) int { FILE: leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go type question594 (line 8) | type question594 struct type para594 (line 15) | type para594 struct type ans594 (line 21) | type ans594 struct function Test_Problem594 (line 25) | func Test_Problem594(t *testing.T) { FILE: leetcode/0598.Range-Addition-II/598. Range Addition II.go function maxCount (line 3) | func maxCount(m int, n int, ops [][]int) int { function min (line 12) | func min(a, b int) int { FILE: leetcode/0598.Range-Addition-II/598. Range Addition II_test.go type question598 (line 8) | type question598 struct type para598 (line 15) | type para598 struct type ans598 (line 23) | type ans598 struct function Test_Problem598 (line 27) | func Test_Problem598(t *testing.T) { FILE: leetcode/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists.go function findRestaurant (line 3) | func findRestaurant(list1 []string, list2 []string) []string { FILE: leetcode/0599.Minimum-Index-Sum-of-Two-Lists/599. Minimum Index Sum of Two Lists_test.go type question599 (line 8) | type question599 struct type para599 (line 15) | type para599 struct type ans599 (line 22) | type ans599 struct function Test_Problem599 (line 26) | func Test_Problem599(t *testing.T) { FILE: leetcode/0605.Can-Place-Flowers/605. Can Place Flowers.go function canPlaceFlowers (line 3) | func canPlaceFlowers(flowerbed []int, n int) bool { FILE: leetcode/0605.Can-Place-Flowers/605. Can Place Flowers_test.go type question605 (line 8) | type question605 struct type para605 (line 15) | type para605 struct type ans605 (line 22) | type ans605 struct function Test_Problem605 (line 26) | func Test_Problem605(t *testing.T) { FILE: leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System.go function findDuplicate (line 5) | func findDuplicate(paths []string) [][]string { FILE: leetcode/0609.Find-Duplicate-File-in-System/609. Find Duplicate File in System_test.go type question609 (line 8) | type question609 struct type para609 (line 15) | type para609 struct type ans609 (line 21) | type ans609 struct function Test_Problem609 (line 25) | func Test_Problem609(t *testing.T) { FILE: leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number.go function triangleNumber (line 5) | func triangleNumber(nums []int) int { FILE: leetcode/0611.Valid-Triangle-Number/611. Valid Triangle Number_test.go type question611 (line 8) | type question611 struct type para611 (line 15) | type para611 struct type ans611 (line 21) | type ans611 struct function Test_Problem611 (line 25) | func Test_Problem611(t *testing.T) { FILE: leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees.go function mergeTrees (line 19) | func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode { FILE: leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees_test.go type question617 (line 10) | type question617 struct type para617 (line 17) | type para617 struct type ans617 (line 24) | type ans617 struct function Test_Problem617 (line 28) | func Test_Problem617(t *testing.T) { FILE: leetcode/0622.Design-Circular-Queue/622. Design Circular Queue.go type MyCircularQueue (line 3) | type MyCircularQueue struct method EnQueue (line 15) | func (this *MyCircularQueue) EnQueue(value int) bool { method DeQueue (line 27) | func (this *MyCircularQueue) DeQueue() bool { method Front (line 37) | func (this *MyCircularQueue) Front() int { method Rear (line 44) | func (this *MyCircularQueue) Rear() int { method IsEmpty (line 54) | func (this *MyCircularQueue) IsEmpty() bool { method IsFull (line 58) | func (this *MyCircularQueue) IsFull() bool { function Constructor (line 11) | func Constructor(k int) MyCircularQueue { FILE: leetcode/0622.Design-Circular-Queue/622. Design Circular Queue_test.go function Test_Problem622 (line 8) | func Test_Problem622(t *testing.T) { FILE: leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree.go function addOneRow (line 18) | func addOneRow(root *TreeNode, v int, d int) *TreeNode { function addTreeRow (line 28) | func addTreeRow(root *TreeNode, v, d int, currLevel *int) { FILE: leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree_test.go type question623 (line 10) | type question623 struct type para623 (line 17) | type para623 struct type ans623 (line 25) | type ans623 struct function Test_Problem623 (line 29) | func Test_Problem623(t *testing.T) { FILE: leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers.go function maximumProduct (line 9) | func maximumProduct(nums []int) int { function max (line 27) | func max(a int, b int) int { function maximumProduct1 (line 35) | func maximumProduct1(nums []int) int { FILE: leetcode/0628.Maximum-Product-of-Three-Numbers/628. Maximum Product of Three Numbers_test.go type question628 (line 8) | type question628 struct type para628 (line 15) | type para628 struct type ans628 (line 21) | type ans628 struct function Test_Problem628 (line 25) | func Test_Problem628(t *testing.T) { FILE: leetcode/0630.Course-Schedule-III/630. Course Schedule III.go function scheduleCourse (line 8) | func scheduleCourse(courses [][]int) int { type Schedule (line 26) | type Schedule method Len (line 28) | func (s Schedule) Len() int { return len(s) } method Less (line 29) | func (s Schedule) Less(i, j int) bool { return s[i] > s[j] } method Swap (line 30) | func (s Schedule) Swap(i, j int) { s[i], s[j] = s[j], s[i] } method Pop (line 31) | func (s *Schedule) Pop() interface{} { method Push (line 37) | func (s *Schedule) Push(x interface{}) { FILE: leetcode/0630.Course-Schedule-III/630. Course Schedule III_test.go type question630 (line 8) | type question630 struct type para630 (line 15) | type para630 struct type ans630 (line 21) | type ans630 struct function Test_Problem630 (line 25) | func Test_Problem630(t *testing.T) { FILE: leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists.go function smallestRange (line 8) | func smallestRange(nums [][]int) []int { type element (line 41) | type element struct type elements (line 46) | type elements method Len (line 49) | func (p elements) Len() int { return len(p) } method Swap (line 52) | func (p elements) Swap(i, j int) { p[i], p[j] = p[j], p[i] } type SortByVal (line 55) | type SortByVal struct method Less (line 58) | func (p SortByVal) Less(i, j int) bool { FILE: leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/632. Smallest Range Covering Elements from K Lists_test.go type question632 (line 8) | type question632 struct type para632 (line 15) | type para632 struct type ans632 (line 21) | type ans632 struct function Test_Problem632 (line 25) | func Test_Problem632(t *testing.T) { FILE: leetcode/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers.go function judgeSquareSum (line 5) | func judgeSquareSum(c int) bool { FILE: leetcode/0633.Sum-of-Square-Numbers/633. Sum of Square Numbers_test.go type question633 (line 8) | type question633 struct type para633 (line 15) | type para633 struct type ans633 (line 21) | type ans633 struct function Test_Problem633 (line 25) | func Test_Problem633(t *testing.T) { FILE: leetcode/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions.go type log (line 8) | type log struct function exclusiveTime (line 14) | func exclusiveTime(n int, logs []string) []int { FILE: leetcode/0636.Exclusive-Time-of-Functions/636. Exclusive Time of Functions_test.go type question636 (line 8) | type question636 struct type para636 (line 15) | type para636 struct type ans636 (line 22) | type ans636 struct function Test_Problem636 (line 26) | func Test_Problem636(t *testing.T) { FILE: leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree.go function averageOfLevels (line 19) | func averageOfLevels(root *TreeNode) []float64 { FILE: leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go type question637 (line 10) | type question637 struct type para637 (line 17) | type para637 struct type ans637 (line 23) | type ans637 struct function Test_Problem637 (line 27) | func Test_Problem637(t *testing.T) { FILE: leetcode/0638.Shopping-Offers/638. Shopping Offers.go function shoppingOffers (line 3) | func shoppingOffers(price []int, special [][]int, needs []int) int { function dfsShoppingOffers (line 9) | func dfsShoppingOffers(price []int, special [][]int, needs []int, pay in... FILE: leetcode/0638.Shopping-Offers/638. Shopping Offers_test.go type question638 (line 8) | type question638 struct type para638 (line 15) | type para638 struct type ans638 (line 23) | type ans638 struct function Test_Problem638 (line 27) | func Test_Problem638(t *testing.T) { FILE: leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I.go function findMaxAverage (line 3) | func findMaxAverage(nums []int, k int) float64 { function max (line 16) | func max(a, b int) int { FILE: leetcode/0643.Maximum-Average-Subarray-I/643. Maximum Average Subarray I_test.go type question643 (line 8) | type question643 struct type para643 (line 15) | type para643 struct type ans643 (line 22) | type ans643 struct function Test_Problem643 (line 26) | func Test_Problem643(t *testing.T) { FILE: leetcode/0645.Set-Mismatch/645. Set Mismatch.go function findErrorNums (line 3) | func findErrorNums(nums []int) []int { FILE: leetcode/0645.Set-Mismatch/645. Set Mismatch_test.go type question645 (line 8) | type question645 struct type para645 (line 15) | type para645 struct type ans645 (line 21) | type ans645 struct function Test_Problem645 (line 25) | func Test_Problem645(t *testing.T) { FILE: leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings.go function countSubstrings (line 3) | func countSubstrings(s string) int { function countPalindrome (line 12) | func countPalindrome(s string, left, right int) int { FILE: leetcode/0647.Palindromic-Substrings/647. Palindromic Substrings_test.go type question647 (line 8) | type question647 struct type para647 (line 15) | type para647 struct type ans647 (line 21) | type ans647 struct function Test_Problem647 (line 25) | func Test_Problem647(t *testing.T) { FILE: leetcode/0648.Replace-Words/648. Replace Words.go function replaceWords (line 6) | func replaceWords(dict []string, sentence string) string { function findWord (line 25) | func findWord(roots map[byte][]string, word []byte) bool { function replaceWords1 (line 38) | func replaceWords1(dict []string, sentence string) string { type Trie (line 66) | type Trie struct method Insert (line 77) | func (this *Trie) Insert(word string) { method Search (line 92) | func (this *Trie) Search(word string) bool { function Constructor208 (line 72) | func Constructor208() Trie { FILE: leetcode/0648.Replace-Words/648. Replace Words_test.go type question648 (line 8) | type question648 struct type para648 (line 15) | type para648 struct type ans648 (line 22) | type ans648 struct function Test_Problem648 (line 26) | func Test_Problem648(t *testing.T) { FILE: leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST.go function findTarget (line 19) | func findTarget(root *TreeNode, k int) bool { function findTargetDFS (line 24) | func findTargetDFS(root *TreeNode, k int, m map[int]int) bool { FILE: leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go type question653 (line 10) | type question653 struct type para653 (line 17) | type para653 struct type ans653 (line 24) | type ans653 struct function Test_Problem653 (line 28) | func Test_Problem653(t *testing.T) { FILE: leetcode/0658.Find-K-Closest-Elements/658. Find K Closest Elements.go function findClosestElements (line 6) | func findClosestElements(arr []int, k int, x int) []int { function findClosestElements1 (line 11) | func findClosestElements1(arr []int, k int, x int) []int { FILE: leetcode/0658.Find-K-Closest-Elements/658. Find K Closest Elements_test.go type question658 (line 8) | type question658 struct type para658 (line 15) | type para658 struct type ans658 (line 23) | type ans658 struct function Test_Problem658 (line 27) | func Test_Problem658(t *testing.T) { FILE: leetcode/0661.Image-Smoother/661. Image Smoother.go function imageSmoother (line 3) | func imageSmoother(M [][]int) [][]int { function smooth (line 16) | func smooth(x, y int, M [][]int) int { FILE: leetcode/0661.Image-Smoother/661. Image Smoother_test.go type question661 (line 8) | type question661 struct type para661 (line 15) | type para661 struct type ans661 (line 21) | type ans661 struct function Test_Problem661 (line 25) | func Test_Problem661(t *testing.T) { FILE: leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree.go function widthOfBinaryTree (line 19) | func widthOfBinaryTree(root *TreeNode) int { function max (line 73) | func max(a int, b int) int { FILE: leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go type question662 (line 10) | type question662 struct type para662 (line 17) | type para662 struct type ans662 (line 23) | type ans662 struct function Test_Problem662 (line 27) | func Test_Problem662(t *testing.T) { FILE: leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array.go function checkPossibility (line 3) | func checkPossibility(nums []int) bool { FILE: leetcode/0665.Non-decreasing-Array/665. Non-decreasing Array_test.go type question665 (line 8) | type question665 struct type para665 (line 15) | type para665 struct type ans665 (line 21) | type ans665 struct function Test_Problem665 (line 25) | func Test_Problem665(t *testing.T) { FILE: leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II.go function constructArray (line 3) | func constructArray(n int, k int) []int { FILE: leetcode/0667.Beautiful-Arrangement-II/667. Beautiful Arrangement II_test.go type question667 (line 8) | type question667 struct type para667 (line 15) | type para667 struct type ans667 (line 22) | type ans667 struct function Test_Problem667 (line 26) | func Test_Problem667(t *testing.T) { FILE: leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table.go function findKthNumber (line 5) | func findKthNumber(m int, n int, k int) int { function counterKthNum (line 18) | func counterKthNum(m, n, mid int) int { FILE: leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/668. Kth Smallest Number in Multiplication Table_test.go type question668 (line 8) | type question668 struct type para668 (line 15) | type para668 struct type ans668 (line 23) | type ans668 struct function Test_Problem668 (line 27) | func Test_Problem668(t *testing.T) { FILE: leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree.go function trimBST (line 19) | func trimBST(root *TreeNode, low int, high int) *TreeNode { FILE: leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree_test.go type question669 (line 10) | type question669 struct type para669 (line 17) | type para669 struct type ans669 (line 25) | type ans669 struct function Test_Problem669 (line 29) | func Test_Problem669(t *testing.T) { FILE: leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence.go function findLengthOfLCIS (line 3) | func findLengthOfLCIS(nums []int) int { function max (line 19) | func max(a, b int) int { FILE: leetcode/0674.Longest-Continuous-Increasing-Subsequence/674. Longest Continuous Increasing Subsequence_test.go type question674 (line 8) | type question674 struct type para674 (line 15) | type para674 struct type ans674 (line 21) | type ans674 struct function Test_Problem674 (line 25) | func Test_Problem674(t *testing.T) { FILE: leetcode/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary.go type MagicDictionary (line 3) | type MagicDictionary struct method BuildDict (line 13) | func (this *MagicDictionary) BuildDict(dict []string) { method Search (line 20) | func (this *MagicDictionary) Search(word string) bool { function Constructor676 (line 8) | func Constructor676() MagicDictionary { FILE: leetcode/0676.Implement-Magic-Dictionary/676. Implement Magic Dictionary_test.go function Test_Problem676 (line 8) | func Test_Problem676(t *testing.T) { FILE: leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs.go type MapSum (line 3) | type MapSum struct method Insert (line 12) | func (this *MapSum) Insert(key string, val int) { method Sum (line 16) | func (this *MapSum) Sum(prefix string) int { function Constructor (line 8) | func Constructor() MapSum { FILE: leetcode/0677.Map-Sum-Pairs/677. Map Sum Pairs_test.go function Test_Problem677 (line 8) | func Test_Problem677(t *testing.T) { FILE: leetcode/0682.Baseball-Game/682. Baseball Game.go function calPoints (line 5) | func calPoints(ops []string) int { FILE: leetcode/0682.Baseball-Game/682. Baseball Game_test.go type question682 (line 8) | type question682 struct type para682 (line 15) | type para682 struct type ans682 (line 21) | type ans682 struct function Test_Problem682 (line 25) | func Test_Problem682(t *testing.T) { FILE: leetcode/0684.Redundant-Connection/684. Redundant Connection.go function findRedundantConnection (line 7) | func findRedundantConnection(edges [][]int) []int { FILE: leetcode/0684.Redundant-Connection/684. Redundant Connection_test.go type question684 (line 8) | type question684 struct type para684 (line 15) | type para684 struct type ans684 (line 21) | type ans684 struct function Test_Problem684 (line 25) | func Test_Problem684(t *testing.T) { FILE: leetcode/0685.Redundant-Connection-II/685. Redundant Connection II.go function findRedundantDirectedConnection (line 3) | func findRedundantDirectedConnection(edges [][]int) []int { function findRoot (line 39) | func findRoot(parent *[]int, k int) int { FILE: leetcode/0685.Redundant-Connection-II/685. Redundant Connection II_test.go type question685 (line 8) | type question685 struct type para685 (line 15) | type para685 struct type ans685 (line 21) | type ans685 struct function Test_Problem685 (line 25) | func Test_Problem685(t *testing.T) { FILE: leetcode/0690.Employee-Importance/690. Employee Importance.go type Employee (line 3) | type Employee struct function getImportance (line 9) | func getImportance(employees []*Employee, id int) int { FILE: leetcode/0690.Employee-Importance/690. Employee Importance_test.go type question690 (line 8) | type question690 struct type para690 (line 15) | type para690 struct type ans690 (line 22) | type ans690 struct function Test_Problem690 (line 26) | func Test_Problem690(t *testing.T) { FILE: leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words.go function topKFrequent (line 5) | func topKFrequent(words []string, k int) []string { type wordCount (line 26) | type wordCount struct type PQ (line 31) | type PQ method Len (line 33) | func (pq PQ) Len() int { return len(pq) } method Swap (line 34) | func (pq PQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] } method Less (line 35) | func (pq PQ) Less(i, j int) bool { method Push (line 41) | func (pq *PQ) Push(x interface{}) { method Pop (line 45) | func (pq *PQ) Pop() interface{} { FILE: leetcode/0692.Top-K-Frequent-Words/692. Top K Frequent Words_test.go type question692 (line 8) | type question692 struct type para692 (line 15) | type para692 struct type ans692 (line 22) | type ans692 struct function Test_Problem692 (line 26) | func Test_Problem692(t *testing.T) { FILE: leetcode/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits.go function hasAlternatingBits (line 4) | func hasAlternatingBits(n int) bool { function hasAlternatingBits1 (line 18) | func hasAlternatingBits1(n int) bool { FILE: leetcode/0693.Binary-Number-with-Alternating-Bits/693. Binary Number with Alternating Bits_test.go type question693 (line 8) | type question693 struct type para693 (line 15) | type para693 struct type ans693 (line 21) | type ans693 struct function Test_Problem693 (line 25) | func Test_Problem693(t *testing.T) { FILE: leetcode/0695.Max-Area-of-Island/695. Max Area of Island.go function maxAreaOfIsland (line 10) | func maxAreaOfIsland(grid [][]int) int { function isInGrid (line 26) | func isInGrid(grid [][]int, x, y int) bool { function areaOfIsland (line 30) | func areaOfIsland(grid [][]int, x, y int) int { FILE: leetcode/0695.Max-Area-of-Island/695. Max Area of Island_test.go type question695 (line 8) | type question695 struct type para695 (line 15) | type para695 struct type ans695 (line 21) | type ans695 struct function Test_Problem695 (line 25) | func Test_Problem695(t *testing.T) { FILE: leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings.go function countBinarySubstrings (line 3) | func countBinarySubstrings(s string) int { function min (line 16) | func min(a, b int) int { FILE: leetcode/0696.Count-Binary-Substrings/696. Count Binary Substrings_test.go type question696 (line 8) | type question696 struct type para696 (line 15) | type para696 struct type ans696 (line 21) | type ans696 struct function Test_Problem696 (line 25) | func Test_Problem696(t *testing.T) { FILE: leetcode/0697.Degree-of-an-Array/697. Degree of an Array.go function findShortestSubArray (line 3) | func findShortestSubArray(nums []int) int { FILE: leetcode/0697.Degree-of-an-Array/697. Degree of an Array_test.go type question697 (line 8) | type question697 struct type para697 (line 15) | type para697 struct type ans697 (line 21) | type ans697 struct function Test_Problem697 (line 25) | func Test_Problem697(t *testing.T) { FILE: leetcode/0699.Falling-Squares/699. Falling Squares.go function fallingSquares (line 9) | func fallingSquares(positions [][]int) []int { function discretization (line 24) | func discretization(positions [][]int) map[int]int { function max (line 40) | func max(a int, b int) int { FILE: leetcode/0699.Falling-Squares/699. Falling Squares_test.go type question699 (line 8) | type question699 struct type para699 (line 15) | type para699 struct type ans699 (line 21) | type ans699 struct function Test_Problem699 (line 25) | func Test_Problem699(t *testing.T) { FILE: leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree.go function searchBST (line 19) | func searchBST(root *TreeNode, val int) *TreeNode { FILE: leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in a Binary Search Tree_test.go type question700 (line 8) | type question700 struct type para700 (line 14) | type para700 struct type ans700 (line 20) | type ans700 struct function Test_Problem700 (line 24) | func Test_Problem700(t *testing.T) { FILE: leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree.go function insert (line 16) | func insert(n *TreeNode, val int) *TreeNode { function insertIntoBST (line 28) | func insertIntoBST(root *TreeNode, val int) *TreeNode { FILE: leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree_test.go type question701 (line 10) | type question701 struct type para701 (line 17) | type para701 struct type ans701 (line 24) | type ans701 struct function Test_Problem701 (line 28) | func Test_Problem701(t *testing.T) { FILE: leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream.go type KthLargest (line 8) | type KthLargest struct method Push (line 21) | func (kl *KthLargest) Push(v interface{}) { method Pop (line 25) | func (kl *KthLargest) Pop() interface{} { method Add (line 32) | func (kl *KthLargest) Add(val int) int { function Constructor (line 13) | func Constructor(k int, nums []int) KthLargest { FILE: leetcode/0703.Kth-Largest-Element-in-a-Stream/703. Kth Largest Element in a Stream_test.go function Test_Problem703 (line 8) | func Test_Problem703(t *testing.T) { FILE: leetcode/0704.Binary-Search/704. Binary Search.go function search704 (line 3) | func search704(nums []int, target int) int { FILE: leetcode/0704.Binary-Search/704. Binary Search_test.go type question704 (line 8) | type question704 struct type para704 (line 15) | type para704 struct type ans704 (line 22) | type ans704 struct function Test_Problem704 (line 26) | func Test_Problem704(t *testing.T) { FILE: leetcode/0705.Design-HashSet/705. Design HashSet.go type MyHashSet (line 3) | type MyHashSet struct method Add (line 14) | func (this *MyHashSet) Add(key int) { method Remove (line 18) | func (this *MyHashSet) Remove(key int) { method Contains (line 23) | func (this *MyHashSet) Contains(key int) bool { function Constructor705 (line 8) | func Constructor705() MyHashSet { FILE: leetcode/0705.Design-HashSet/705. Design HashSet_test.go function Test_Problem705 (line 8) | func Test_Problem705(t *testing.T) { FILE: leetcode/0706.Design-HashMap/706. Design HashMap.go constant Len (line 3) | Len int = 10000 type MyHashMap (line 5) | type MyHashMap struct method Put (line 55) | func (this *MyHashMap) Put(key int, value int) { method Get (line 65) | func (this *MyHashMap) Get(key int) int { method Remove (line 74) | func (this *MyHashMap) Remove(key int) { method Hash (line 82) | func (this *MyHashMap) Hash(value int) int { type HashNode (line 9) | type HashNode struct method Put (line 15) | func (N *HashNode) Put(key int, value int) { method Get (line 27) | func (N *HashNode) Get(key int) int { method Remove (line 37) | func (N *HashNode) Remove(key int) *HashNode { function Constructor706 (line 50) | func Constructor706() MyHashMap { FILE: leetcode/0706.Design-HashMap/706. Design HashMap_test.go function Test_Problem706 (line 8) | func Test_Problem706(t *testing.T) { FILE: leetcode/0707.Design-Linked-List/707. Design Linked List.go type MyLinkedList (line 3) | type MyLinkedList struct method Get (line 19) | func (this *MyLinkedList) Get(index int) int { method AddAtHead (line 32) | func (this *MyLinkedList) AddAtHead(val int) { method AddAtTail (line 42) | func (this *MyLinkedList) AddAtTail(val int) { method AddAtIndex (line 57) | func (this *MyLinkedList) AddAtIndex(index int, val int) { method DeleteAtIndex (line 78) | func (this *MyLinkedList) DeleteAtIndex(index int) { type Node (line 7) | type Node struct function Constructor (line 14) | func Constructor() MyLinkedList { FILE: leetcode/0707.Design-Linked-List/707. Design Linked List_test.go function Test_Problem707 (line 8) | func Test_Problem707(t *testing.T) { function MList2Ints (line 55) | func MList2Ints(head *MyLinkedList) []int { FILE: leetcode/0709.To-Lower-Case/709. To Lower Case.go function toLowerCase (line 3) | func toLowerCase(s string) string { FILE: leetcode/0709.To-Lower-Case/709. To Lower Case_test.go type question709 (line 8) | type question709 struct type para709 (line 15) | type para709 struct type ans709 (line 21) | type ans709 struct function Test_Problem709 (line 25) | func Test_Problem709(t *testing.T) { FILE: leetcode/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist.go type Solution (line 5) | type Solution struct method Pick (line 32) | func (this *Solution) Pick() int { function Constructor710 (line 10) | func Constructor710(N int, blacklist []int) Solution { FILE: leetcode/0710.Random-Pick-with-Blacklist/710. Random Pick with Blacklist_test.go type question710 (line 8) | type question710 struct type para710 (line 15) | type para710 struct type ans710 (line 23) | type ans710 struct function Test_Problem710 (line 27) | func Test_Problem710(t *testing.T) { FILE: leetcode/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K.go function numSubarrayProductLessThanK (line 3) | func numSubarrayProductLessThanK(nums []int, k int) int { FILE: leetcode/0713.Subarray-Product-Less-Than-K/713. Subarray Product Less Than K_test.go type question713 (line 8) | type question713 struct type para713 (line 15) | type para713 struct type ans713 (line 22) | type ans713 struct function Test_Problem713 (line 26) | func Test_Problem713(t *testing.T) { FILE: leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee.go function maxProfit714 (line 8) | func maxProfit714(prices []int, fee int) int { function max (line 24) | func max(a int, b int) int { function maxProfit714_1 (line 32) | func maxProfit714_1(prices []int, fee int) int { FILE: leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/714. Best Time to Buy and Sell Stock with Transaction Fee_test.go type question714 (line 8) | type question714 struct type para714 (line 15) | type para714 struct type ans714 (line 22) | type ans714 struct function Test_Problem714 (line 26) | func Test_Problem714(t *testing.T) { FILE: leetcode/0715.Range-Module/715. Range Module.go type RangeModule (line 4) | type RangeModule struct method AddRange (line 22) | func (rm *RangeModule) AddRange(left int, right int) { method QueryRange (line 27) | func (rm *RangeModule) QueryRange(left int, right int) bool { method RemoveRange (line 32) | func (rm *RangeModule) RemoveRange(left int, right int) { type SegmentTreeNode (line 9) | type SegmentTreeNode struct function Constructor715 (line 17) | func Constructor715() RangeModule { function lazyUpdate (line 36) | func lazyUpdate(node *SegmentTreeNode) { function update (line 53) | func update(node *SegmentTreeNode, start, end int, track bool) { function query (line 77) | func query(node *SegmentTreeNode, start, end int) bool { FILE: leetcode/0715.Range-Module/715. Range Module_test.go function Test_Problem715 (line 8) | func Test_Problem715(t *testing.T) { FILE: leetcode/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters.go function isOneBitCharacter (line 3) | func isOneBitCharacter(bits []int) bool { FILE: leetcode/0717.1-bit-and-2-bit-Characters/717. 1-bit and 2-bit Characters_test.go type question717 (line 8) | type question717 struct type para717 (line 15) | type para717 struct type ans717 (line 21) | type ans717 struct function Test_Problem717 (line 25) | func Test_Problem717(t *testing.T) { FILE: leetcode/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray.go constant primeRK (line 3) | primeRK = 16777619 function findLength (line 6) | func findLength(A []int, B []int) int { function min (line 19) | func min(a int, b int) int { function hashSlice (line 26) | func hashSlice(arr []int, length int) []int { function hasSamePrefix (line 42) | func hasSamePrefix(A, B []int, length int) bool { function hasRepeated (line 51) | func hasRepeated(A, B []int, length int) bool { function findLength1 (line 70) | func findLength1(A []int, B []int) int { FILE: leetcode/0718.Maximum-Length-of-Repeated-Subarray/718. Maximum Length of Repeated Subarray_test.go type question718 (line 8) | type question718 struct type para718 (line 15) | type para718 struct type ans718 (line 22) | type ans718 struct function Test_Problem718 (line 26) | func Test_Problem718(t *testing.T) { FILE: leetcode/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance.go function smallestDistancePair (line 7) | func smallestDistancePair(nums []int, k int) int { function findDistanceCount (line 23) | func findDistanceCount(nums []int, num int) int { function findDistanceCount1 (line 35) | func findDistanceCount1(nums []int, num int) int { FILE: leetcode/0719.Find-K-th-Smallest-Pair-Distance/719. Find K-th Smallest Pair Distance_test.go type question719 (line 8) | type question719 struct type para719 (line 15) | type para719 struct type ans719 (line 22) | type ans719 struct function Test_Problem719 (line 26) | func Test_Problem719(t *testing.T) { FILE: leetcode/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary.go function longestWord (line 7) | func longestWord(words []string) string { FILE: leetcode/0720.Longest-Word-in-Dictionary/720. Longest Word in Dictionary_test.go type question720 (line 8) | type question720 struct type para720 (line 15) | type para720 struct type ans720 (line 21) | type ans720 struct function Test_Problem720 (line 25) | func Test_Problem720(t *testing.T) { FILE: leetcode/0721.Accounts-Merge/721. Accounts Merge.go function accountsMerge (line 10) | func accountsMerge(accounts [][]string) (r [][]string) { function accountsMerge1 (line 40) | func accountsMerge1(accounts [][]string) [][]string { FILE: leetcode/0721.Accounts-Merge/721. Accounts Merge_test.go type question721 (line 8) | type question721 struct type para721 (line 15) | type para721 struct type ans721 (line 21) | type ans721 struct function Test_Problem721 (line 25) | func Test_Problem721(t *testing.T) { FILE: leetcode/0724.Find-Pivot-Index/724. Find Pivot Index.go function pivotIndex (line 6) | func pivotIndex(nums []int) int { FILE: leetcode/0724.Find-Pivot-Index/724. Find Pivot Index_test.go type question724 (line 8) | type question724 struct type para724 (line 15) | type para724 struct type ans724 (line 21) | type ans724 struct function Test_Problem724 (line 25) | func Test_Problem724(t *testing.T) { FILE: leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go function splitListToParts (line 19) | func splitListToParts(root *ListNode, k int) []*ListNode { function getLength (line 72) | func getLength(l *ListNode) int { FILE: leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go type question725 (line 10) | type question725 struct type para725 (line 17) | type para725 struct type ans725 (line 24) | type ans725 struct function Test_Problem725 (line 28) | func Test_Problem725(t *testing.T) { FILE: leetcode/0726.Number-of-Atoms/726. Number of Atoms.go type atom (line 9) | type atom struct type atoms (line 14) | type atoms method Len (line 16) | func (this atoms) Len() int { return len(this) } method Less (line 17) | func (this atoms) Less(i, j int) bool { return strings.Compare(this[i]... method Swap (line 18) | func (this atoms) Swap(i, j int) { this[i], this[j] = this[j], th... method String (line 19) | func (this atoms) String() string { function countOfAtoms (line 30) | func countOfAtoms(s string) string { function isDigital (line 98) | func isDigital(v byte) bool { function isUpperLetter (line 105) | func isUpperLetter(v byte) bool { function isLowerLetter (line 112) | func isLowerLetter(v byte) bool { FILE: leetcode/0726.Number-of-Atoms/726. Number of Atoms_test.go type question726 (line 8) | type question726 struct type para726 (line 15) | type para726 struct type ans726 (line 21) | type ans726 struct function Test_Problem726 (line 25) | func Test_Problem726(t *testing.T) { FILE: leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers.go function selfDividingNumbers (line 3) | func selfDividingNumbers(left int, right int) []int { function selfDividingNum (line 13) | func selfDividingNum(num int) bool { FILE: leetcode/0728.Self-Dividing-Numbers/728.Self Dividing Numbers_test.go type question728 (line 8) | type question728 struct type para728 (line 14) | type para728 struct type ans728 (line 20) | type ans728 struct function Test_Problem728 (line 24) | func Test_Problem728(t *testing.T) { FILE: leetcode/0729.My-Calendar-I/729. My Calendar I.go type Event (line 5) | type Event struct method Insert (line 11) | func (e *Event) Insert(curr *Event) bool { type MyCalendar (line 32) | type MyCalendar struct method Book (line 44) | func (this *MyCalendar) Book(start int, end int) bool { function Constructor729 (line 37) | func Constructor729() MyCalendar { FILE: leetcode/0729.My-Calendar-I/729. My Calendar I_test.go function Test_Problem729 (line 8) | func Test_Problem729(t *testing.T) { FILE: leetcode/0732.My-Calendar-III/732. My Calendar III.go type SegmentTree732 (line 4) | type SegmentTree732 struct method book (line 32) | func (st *SegmentTree732) book(start, end int, maxHeight *int) { type MyCalendarThree (line 10) | type MyCalendarThree struct method Book (line 27) | func (mct *MyCalendarThree) Book(start int, end int) int { function Constructor732 (line 16) | func Constructor732() MyCalendarThree { FILE: leetcode/0732.My-Calendar-III/732. My Calendar III_test.go function Test_Problem732 (line 8) | func Test_Problem732(t *testing.T) { FILE: leetcode/0733.Flood-Fill/733. Flood Fill.go function floodFill (line 10) | func floodFill(image [][]int, sr int, sc int, newColor int) [][]int { function dfs733 (line 19) | func dfs733(image [][]int, x, y int, newColor int) { FILE: leetcode/0733.Flood-Fill/733. Flood Fill_test.go type question733 (line 8) | type question733 struct type para733 (line 15) | type para733 struct type ans733 (line 24) | type ans733 struct function Test_Problem733 (line 28) | func Test_Problem733(t *testing.T) { FILE: leetcode/0735.Asteroid-Collision/735. Asteroid Collision.go function asteroidCollision (line 3) | func asteroidCollision(asteroids []int) []int { FILE: leetcode/0735.Asteroid-Collision/735. Asteroid Collision_test.go type question735 (line 8) | type question735 struct type para735 (line 15) | type para735 struct type ans735 (line 21) | type ans735 struct function Test_Problem735 (line 25) | func Test_Problem735(t *testing.T) { FILE: leetcode/0739.Daily-Temperatures/739. Daily Temperatures.go function dailyTemperatures (line 4) | func dailyTemperatures(T []int) []int { function dailyTemperatures1 (line 18) | func dailyTemperatures1(T []int) []int { FILE: leetcode/0739.Daily-Temperatures/739. Daily Temperatures_test.go type question739 (line 8) | type question739 struct type para739 (line 15) | type para739 struct type ans739 (line 21) | type ans739 struct function Test_Problem739 (line 25) | func Test_Problem739(t *testing.T) { FILE: leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target.go function nextGreatestLetter (line 3) | func nextGreatestLetter(letters []byte, target byte) byte { FILE: leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/744. Find Smallest Letter Greater Than Target_test.go type question744 (line 8) | type question744 struct type para744 (line 15) | type para744 struct type ans744 (line 22) | type ans744 struct function Test_Problem744 (line 26) | func Test_Problem744(t *testing.T) { FILE: leetcode/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search.go type WordFilter (line 6) | type WordFilter struct method F (line 23) | func (this *WordFilter) F(prefix string, suffix string) int { function Constructor745 (line 10) | func Constructor745(words []string) WordFilter { type WordFilter_ (line 32) | type WordFilter_ struct method F_ (line 40) | func (this *WordFilter_) F_(prefix string, suffix string) int { function Constructor_745_ (line 36) | func Constructor_745_(words []string) WordFilter_ { FILE: leetcode/0745.Prefix-and-Suffix-Search/745. Prefix and Suffix Search_test.go function Test_Problem745 (line 8) | func Test_Problem745(t *testing.T) { FILE: leetcode/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs.go function minCostClimbingStairs (line 4) | func minCostClimbingStairs(cost []int) int { function min (line 13) | func min(a int, b int) int { function minCostClimbingStairs1 (line 21) | func minCostClimbingStairs1(cost []int) int { FILE: leetcode/0746.Min-Cost-Climbing-Stairs/746. Min Cost Climbing Stairs_test.go type question746 (line 8) | type question746 struct type para746 (line 15) | type para746 struct type ans746 (line 21) | type ans746 struct function Test_Problem746 (line 25) | func Test_Problem746(t *testing.T) { FILE: leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others.go function dominantIndex (line 3) | func dominantIndex(nums []int) int { FILE: leetcode/0747.Largest-Number-At-Least-Twice-of-Others/747. Largest Number At Least Twice of Others_test.go type question747 (line 8) | type question747 struct type para747 (line 15) | type para747 struct type ans747 (line 21) | type ans747 struct function Test_Problem747 (line 25) | func Test_Problem747(t *testing.T) { FILE: leetcode/0748.Shortest-Completing-Word/748. Shortest Completing Word.go function shortestCompletingWord (line 5) | func shortestCompletingWord(licensePlate string, words []string) string { function genCnter (line 18) | func genCnter(lp string) [26]int { function match (line 28) | func match(lp [26]int, w string) bool { FILE: leetcode/0748.Shortest-Completing-Word/748. Shortest Completing Word_test.go type question748 (line 8) | type question748 struct type para748 (line 15) | type para748 struct type ans748 (line 22) | type ans748 struct function Test_Problem748 (line 26) | func Test_Problem748(t *testing.T) { FILE: leetcode/0752.Open-the-Lock/752. Open the Lock.go function openLock (line 3) | func openLock(deadends []string, target string) int { function strToInt (line 55) | func strToInt(str string) int16 { FILE: leetcode/0752.Open-the-Lock/752. Open the Lock_test.go type question752 (line 8) | type question752 struct type para752 (line 15) | type para752 struct type ans752 (line 22) | type ans752 struct function Test_Problem752 (line 26) | func Test_Problem752(t *testing.T) { FILE: leetcode/0753.Cracking-the-Safe/753. Cracking the Safe.go constant number (line 5) | number = "0123456789" function crackSafe (line 7) | func crackSafe(n int, k int) string { function dfsCrackSafe (line 20) | func dfsCrackSafe(depth, n, k int, str *[]byte, visit *map[string]bool) ... FILE: leetcode/0753.Cracking-the-Safe/753. Cracking the Safe_test.go type question753 (line 8) | type question753 struct type para753 (line 15) | type para753 struct type ans753 (line 22) | type ans753 struct function Test_Problem753 (line 26) | func Test_Problem753(t *testing.T) { FILE: leetcode/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix.go function pyramidTransition (line 3) | func pyramidTransition(bottom string, allowed []string) bool { function dfsT (line 11) | func dfsT(bottom, above string, pyramid map[string][]string) bool { FILE: leetcode/0756.Pyramid-Transition-Matrix/756. Pyramid Transition Matrix_test.go type question756 (line 8) | type question756 struct type para756 (line 15) | type para756 struct type ans756 (line 22) | type ans756 struct function Test_Problem756 (line 26) | func Test_Problem756(t *testing.T) { FILE: leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation.go function countPrimeSetBits (line 5) | func countPrimeSetBits(L int, R int) int { function isPrime (line 15) | func isPrime(x int) bool { FILE: leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/762. Prime Number of Set Bits in Binary Representation_test.go type question762 (line 8) | type question762 struct type para762 (line 15) | type para762 struct type ans762 (line 22) | type ans762 struct function Test_Problem762 (line 26) | func Test_Problem762(t *testing.T) { FILE: leetcode/0763.Partition-Labels/763. Partition Labels.go function partitionLabels (line 4) | func partitionLabels(S string) []int { function partitionLabels1 (line 24) | func partitionLabels1(S string) []int { FILE: leetcode/0763.Partition-Labels/763. Partition Labels_test.go type question763 (line 8) | type question763 struct type para763 (line 15) | type para763 struct type ans763 (line 21) | type ans763 struct function Test_Problem763 (line 25) | func Test_Problem763(t *testing.T) { FILE: leetcode/0765.Couples-Holding-Hands/765. Couples Holding Hands.go function minSwapsCouples (line 7) | func minSwapsCouples(row []int) int { FILE: leetcode/0765.Couples-Holding-Hands/765. Couples Holding Hands_test.go type question765 (line 8) | type question765 struct type para765 (line 15) | type para765 struct type ans765 (line 21) | type ans765 struct function Test_Problem765 (line 25) | func Test_Problem765(t *testing.T) { FILE: leetcode/0766.Toeplitz-Matrix/766. Toeplitz Matrix.go function isToeplitzMatrix (line 3) | func isToeplitzMatrix(matrix [][]int) bool { FILE: leetcode/0766.Toeplitz-Matrix/766. Toeplitz Matrix_test.go type question766 (line 8) | type question766 struct type para766 (line 15) | type para766 struct type ans766 (line 21) | type ans766 struct function Test_Problem766 (line 25) | func Test_Problem766(t *testing.T) { FILE: leetcode/0767.Reorganize-String/767. Reorganize String.go function reorganizeString (line 7) | func reorganizeString(S string) string { function frequencySort767 (line 25) | func frequencySort767(s string) string { FILE: leetcode/0767.Reorganize-String/767. Reorganize String_test.go type question767 (line 8) | type question767 struct type para767 (line 15) | type para767 struct type ans767 (line 21) | type ans767 struct function Test_Problem767 (line 25) | func Test_Problem767(t *testing.T) { FILE: leetcode/0771.Jewels-and-Stones/771. Jewels and Stones.go function numJewelsInStones (line 6) | func numJewelsInStones(J string, S string) int { function numJewelsInStones1 (line 17) | func numJewelsInStones1(J string, S string) int { FILE: leetcode/0771.Jewels-and-Stones/771. Jewels and Stones_test.go type question771 (line 8) | type question771 struct type para771 (line 15) | type para771 struct type ans771 (line 22) | type ans771 struct function Test_Problem771 (line 26) | func Test_Problem771(t *testing.T) { FILE: leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions.go function isIdealPermutation (line 3) | func isIdealPermutation(A []int) bool { function abs (line 12) | func abs(a int) int { FILE: leetcode/0775.Global-and-Local-Inversions/775. Global and Local Inversions_test.go type question775 (line 8) | type question775 struct type para775 (line 15) | type para775 struct type ans775 (line 21) | type ans775 struct function Test_Problem775 (line 25) | func Test_Problem775(t *testing.T) { FILE: leetcode/0778.Swim-in-Rising-Water/778. Swim in Rising Water.go function swimInWater (line 8) | func swimInWater(grid [][]int) int { function addFlags (line 31) | func addFlags(grid [][]int, flags [][]int, flag int, row int, col int) { function swimInWater1 (line 46) | func swimInWater1(grid [][]int) int { FILE: leetcode/0778.Swim-in-Rising-Water/778. Swim in Rising Water_test.go type question778 (line 8) | type question778 struct type para778 (line 15) | type para778 struct type ans778 (line 21) | type ans778 struct function Test_Problem778 (line 25) | func Test_Problem778(t *testing.T) { FILE: leetcode/0781.Rabbits-in-Forest/781. Rabbits in Forest.go function numRabbits (line 3) | func numRabbits(ans []int) int { FILE: leetcode/0781.Rabbits-in-Forest/781. Rabbits in Forest_test.go type question781 (line 8) | type question781 struct type para781 (line 15) | type para781 struct type ans781 (line 21) | type ans781 struct function Test_Problem781 (line 25) | func Test_Problem781(t *testing.T) { FILE: leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes.go function minDiffInBST (line 21) | func minDiffInBST(root *TreeNode) int { function dfsBST (line 27) | func dfsBST(root *TreeNode, res, pre *int) { function min (line 39) | func min(a, b int) int { function abs (line 46) | func abs(a int) int { FILE: leetcode/0783.Minimum-Distance-Between-BST-Nodes/783. Minimum Distance Between BST Nodes_test.go type question783 (line 10) | type question783 struct type para783 (line 17) | type para783 struct type ans783 (line 23) | type ans783 struct function Test_Problem783 (line 27) | func Test_Problem783(t *testing.T) { FILE: leetcode/0784.Letter-Case-Permutation/784. Letter Case Permutation.go function letterCasePermutation (line 8) | func letterCasePermutation(S string) []string { function isLowerLetter (line 25) | func isLowerLetter(v byte) bool { function findLetterCasePermutation (line 32) | func findLetterCasePermutation(s string, pos []int, target, index int, c... function letterCasePermutation1 (line 56) | func letterCasePermutation1(S string) []string { function isLetter784 (line 77) | func isLetter784(c byte) bool { function toUpper (line 81) | func toUpper(s string, i int) string { FILE: leetcode/0784.Letter-Case-Permutation/784. Letter Case Permutation_test.go type question784 (line 8) | type question784 struct type para784 (line 15) | type para784 struct type ans784 (line 21) | type ans784 struct function Test_Problem784 (line 25) | func Test_Problem784(t *testing.T) { FILE: leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite.go function isBipartite (line 4) | func isBipartite(graph [][]int) bool { function dfs (line 17) | func dfs(n int, graph [][]int, colors []int, parentCol int) bool { FILE: leetcode/0785.Is-Graph-Bipartite/785. Is Graph Bipartite_test.go type question785 (line 8) | type question785 struct type para785 (line 15) | type para785 struct type ans785 (line 21) | type ans785 struct function Test_Problem785 (line 25) | func Test_Problem785(t *testing.T) { FILE: leetcode/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction.go function kthSmallestPrimeFraction (line 8) | func kthSmallestPrimeFraction(A []int, K int) []int { function kthSmallestPrimeFraction1 (line 35) | func kthSmallestPrimeFraction1(A []int, K int) []int { type Fraction (line 50) | type Fraction struct type SortByFraction (line 56) | type SortByFraction method Len (line 58) | func (a SortByFraction) Len() int { return len(a) } method Swap (line 59) | func (a SortByFraction) Swap(i, j int) { a[i], a[j] = a[j], a[i] } method Less (line 60) | func (a SortByFraction) Less(i, j int) bool { FILE: leetcode/0786.K-th-Smallest-Prime-Fraction/786. K-th Smallest Prime Fraction_test.go type question786 (line 8) | type question786 struct type para786 (line 15) | type para786 struct type ans786 (line 22) | type ans786 struct function Test_Problem786 (line 26) | func Test_Problem786(t *testing.T) { FILE: leetcode/0791.Custom-Sort-String/791. Custom Sort String.go function customSortString (line 5) | func customSortString(order string, str string) string { FILE: leetcode/0791.Custom-Sort-String/791. Custom Sort String_test.go type question791 (line 8) | type question791 struct type para791 (line 15) | type para791 struct type ans791 (line 22) | type ans791 struct function Test_Problem791 (line 26) | func Test_Problem791(t *testing.T) { FILE: leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences.go function numMatchingSubseq (line 3) | func numMatchingSubseq(s string, words []string) int { FILE: leetcode/0792.Number-of-Matching-Subsequences/792. Number of Matching Subsequences_test.go type question792 (line 8) | type question792 struct type para792 (line 15) | type para792 struct type ans792 (line 22) | type ans792 struct function Test_Problem792 (line 26) | func Test_Problem792(t *testing.T) { FILE: leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function.go function preimageSizeFZF (line 4) | func preimageSizeFZF(K int) int { function trailingZeroes (line 20) | func trailingZeroes(n int) int { function preimageSizeFZF1 (line 28) | func preimageSizeFZF1(K int) int { FILE: leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/793. Preimage Size of Factorial Zeroes Function_test.go type question793 (line 8) | type question793 struct type para793 (line 15) | type para793 struct type ans793 (line 21) | type ans793 struct function Test_Problem793 (line 25) | func Test_Problem793(t *testing.T) { FILE: leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State.go function validTicTacToe (line 3) | func validTicTacToe(board []string) bool { function process (line 23) | func process(board []string, c byte) bool { FILE: leetcode/0794.Valid-Tic-Tac-Toe-State/794.Valid Tic-Tac-Toe State_test.go type question794 (line 8) | type question794 struct type para794 (line 14) | type para794 struct type ans794 (line 19) | type ans794 struct function Test_Problem794 (line 23) | func Test_Problem794(t *testing.T) { FILE: leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum.go function numSubarrayBoundedMax (line 3) | func numSubarrayBoundedMax(nums []int, left int, right int) int { function getAnswerPerBound (line 7) | func getAnswerPerBound(nums []int, bound int) int { FILE: leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum/795. Number of Subarrays with Bounded Maximum_test.go type question795 (line 8) | type question795 struct type para795 (line 15) | type para795 struct type ans795 (line 23) | type ans795 struct function Test_Problem795 (line 27) | func Test_Problem795(t *testing.T) { FILE: leetcode/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States.go function eventualSafeNodes (line 3) | func eventualSafeNodes(graph [][]int) []int { function dfsEventualSafeNodes (line 14) | func dfsEventualSafeNodes(graph [][]int, idx int, color []int) bool { FILE: leetcode/0802.Find-Eventual-Safe-States/802. Find Eventual Safe States_test.go type question802 (line 8) | type question802 struct type para802 (line 15) | type para802 struct type ans802 (line 21) | type ans802 struct function Test_Problem802 (line 25) | func Test_Problem802(t *testing.T) { FILE: leetcode/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit.go function hitBricks (line 14) | func hitBricks(grid [][]int, hits [][]int) []int { function isInGrid (line 50) | func isInGrid(grid [][]int, x, y int) bool { function getUnionFindFromGrid (line 54) | func getUnionFindFromGrid(grid [][]int, x, y int, uf template.UnionFindC... FILE: leetcode/0803.Bricks-Falling-When-Hit/803. Bricks Falling When Hit_test.go type question803 (line 8) | type question803 struct type para803 (line 15) | type para803 struct type ans803 (line 22) | type ans803 struct function Test_Problem803 (line 26) | func Test_Problem803(t *testing.T) { FILE: leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go function maxIncreaseKeepingSkyline (line 3) | func maxIncreaseKeepingSkyline(grid [][]int) int { function min (line 34) | func min(a, b int) int { FILE: leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline_test.go type question807 (line 8) | type question807 struct type para807 (line 14) | type para807 struct type ans807 (line 19) | type ans807 struct function Test_Problem807 (line 23) | func Test_Problem807(t *testing.T) { FILE: leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game.go function xorGame (line 3) | func xorGame(nums []int) bool { FILE: leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game_test.go type question810 (line 8) | type question810 struct type para810 (line 15) | type para810 struct type ans810 (line 21) | type ans810 struct function Test_Problem810 (line 25) | func Test_Problem810(t *testing.T) { FILE: leetcode/0811.Subdomain-Visit-Count/811. Subdomain Visit Count.go function subdomainVisits (line 9) | func subdomainVisits(cpdomains []string) []string { function subdomainVisits1 (line 38) | func subdomainVisits1(cpdomains []string) []string { function splitDomain (line 55) | func splitDomain(domain string, domains map[string]int) { FILE: leetcode/0811.Subdomain-Visit-Count/811. Subdomain Visit Count_test.go type question811 (line 8) | type question811 struct type para811 (line 15) | type para811 struct type ans811 (line 21) | type ans811 struct function Test_Problem811 (line 25) | func Test_Problem811(t *testing.T) { FILE: leetcode/0812.Largest-Triangle-Area/812. Largest Triangle Area.go function largestTriangleArea (line 3) | func largestTriangleArea(points [][]int) float64 { function area (line 15) | func area(p1, p2, p3 []int) float64 { function abs (line 19) | func abs(num int) float64 { function max (line 26) | func max(a, b float64) float64 { FILE: leetcode/0812.Largest-Triangle-Area/812. Largest Triangle Area_test.go type question812 (line 8) | type question812 struct type para812 (line 15) | type para812 struct type ans812 (line 21) | type ans812 struct function Test_Problem812 (line 25) | func Test_Problem812(t *testing.T) { FILE: leetcode/0815.Bus-Routes/815. Bus Routes.go function numBusesToDestination (line 3) | func numBusesToDestination(routes [][]int, S int, T int) int { FILE: leetcode/0815.Bus-Routes/815. Bus Routes_test.go type question815 (line 8) | type question815 struct type para815 (line 15) | type para815 struct type ans815 (line 23) | type ans815 struct function Test_Problem815 (line 27) | func Test_Problem815(t *testing.T) { FILE: leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates.go function ambiguousCoordinates (line 3) | func ambiguousCoordinates(s string) []string { function build (line 18) | func build(s string) []string { FILE: leetcode/0816.Ambiguous-Coordinates/816. Ambiguous Coordinates_test.go type question816 (line 8) | type question816 struct type para816 (line 15) | type para816 struct type ans816 (line 21) | type ans816 struct function Test_Problem816 (line 25) | func Test_Problem816(t *testing.T) { FILE: leetcode/0817.Linked-List-Components/817. Linked List Components.go function numComponents (line 18) | func numComponents(head *ListNode, G []int) int { function toMap (line 41) | func toMap(G []int) map[int]int { FILE: leetcode/0817.Linked-List-Components/817. Linked List Components_test.go type question817 (line 10) | type question817 struct type para817 (line 17) | type para817 struct type ans817 (line 24) | type ans817 struct function Test_Problem817 (line 28) | func Test_Problem817(t *testing.T) { FILE: leetcode/0819.Most-Common-Word/819. Most Common Word.go function mostCommonWord (line 5) | func mostCommonWord(paragraph string, banned []string) string { FILE: leetcode/0819.Most-Common-Word/819. Most Common Word_test.go type question819 (line 8) | type question819 struct type para819 (line 15) | type para819 struct type ans819 (line 22) | type ans819 struct function Test_Problem819 (line 26) | func Test_Problem819(t *testing.T) { FILE: leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words.go function minimumLengthEncoding (line 4) | func minimumLengthEncoding(words []string) int { type node (line 21) | type node struct method has (line 26) | func (t *node) has(b byte) (*node, bool) { method isLeaf (line 38) | func (t *node) isLeaf() bool { method add (line 45) | func (t *node) add(s []byte) { method endNodeOf (line 59) | func (t *node) endNodeOf(s []byte) *node { function minimumLengthEncoding1 (line 71) | func minimumLengthEncoding1(words []string) int { FILE: leetcode/0820.Short-Encoding-of-Words/820. Short Encoding of Words_test.go type question820 (line 8) | type question820 struct type para820 (line 15) | type para820 struct type ans820 (line 21) | type ans820 struct function Test_Problem820 (line 25) | func Test_Problem820(t *testing.T) { FILE: leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character.go function shortestToChar (line 8) | func shortestToChar(s string, c byte) []int { function shortestToChar1 (line 30) | func shortestToChar1(s string, c byte) []int { function min (line 55) | func min(a, b int) int { FILE: leetcode/0821.Shortest-Distance-to-a-Character/821. Shortest Distance to a Character_test.go type question821 (line 8) | type question821 struct type para821 (line 15) | type para821 struct type ans821 (line 22) | type ans821 struct function Test_Problem821 (line 26) | func Test_Problem821(t *testing.T) { FILE: leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors.go constant mod (line 7) | mod = 1e9 + 7 function numFactoredBinaryTrees (line 10) | func numFactoredBinaryTrees(arr []int) int { function dfs (line 33) | func dfs(num int, dict map[int][][2]int, cache map[int]int) int { function numFactoredBinaryTrees1 (line 52) | func numFactoredBinaryTrees1(arr []int) int { FILE: leetcode/0823.Binary-Trees-With-Factors/823. Binary Trees With Factors_test.go type question823 (line 8) | type question823 struct type para823 (line 15) | type para823 struct type ans823 (line 21) | type ans823 struct function Test_Problem823 (line 25) | func Test_Problem823(t *testing.T) { FILE: leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages.go function numFriendRequests (line 6) | func numFriendRequests(ages []int) int { function numFriendRequests1 (line 24) | func numFriendRequests1(ages []int) int { function numFriendRequests2 (line 43) | func numFriendRequests2(ages []int) int { FILE: leetcode/0825.Friends-Of-Appropriate-Ages/825. Friends Of Appropriate Ages_test.go type question825 (line 8) | type question825 struct type para825 (line 15) | type para825 struct type ans825 (line 21) | type ans825 struct function Test_Problem825 (line 25) | func Test_Problem825(t *testing.T) { FILE: leetcode/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work.go type Task (line 9) | type Task struct type Tasks (line 15) | type Tasks method Len (line 18) | func (p Tasks) Len() int { return len(p) } method Swap (line 21) | func (p Tasks) Swap(i, j int) { p[i], p[j] = p[j], p[i] } type SortByDiff (line 24) | type SortByDiff struct method Less (line 27) | func (p SortByDiff) Less(i, j int) bool { function maxProfitAssignment (line 31) | func maxProfitAssignment(difficulty []int, profit []int, worker []int) i... function max (line 57) | func max(a int, b int) int { FILE: leetcode/0826.Most-Profit-Assigning-Work/826. Most Profit Assigning Work_test.go type question826 (line 8) | type question826 struct type para826 (line 15) | type para826 struct type ans826 (line 23) | type ans826 struct function Test_Problem826 (line 27) | func Test_Problem826(t *testing.T) { FILE: leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/828. Count Unique Characters of All Substrings of a Given String.go function uniqueLetterString (line 3) | func uniqueLetterString(S string) int { function uniqueLetterString1 (line 20) | func uniqueLetterString1(S string) int { FILE: leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/828. Count Unique Characters of All Substrings of a Given String_test.go type question828 (line 8) | type question828 struct type para828 (line 15) | type para828 struct type ans828 (line 21) | type ans828 struct function Test_Problem828 (line 25) | func Test_Problem828(t *testing.T) { FILE: leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups.go function largeGroupPositions (line 3) | func largeGroupPositions(S string) [][]int { FILE: leetcode/0830.Positions-of-Large-Groups/830. Positions of Large Groups_test.go type question830 (line 8) | type question830 struct type para830 (line 15) | type para830 struct type ans830 (line 21) | type ans830 struct function Test_Problem830 (line 25) | func Test_Problem830(t *testing.T) { FILE: leetcode/0832.Flipping-an-Image/832. Flipping an Image.go function flipAndInvertImage (line 3) | func flipAndInvertImage(A [][]int) [][]int { FILE: leetcode/0832.Flipping-an-Image/832. Flipping an Image_test.go type question832 (line 8) | type question832 struct type para832 (line 15) | type para832 struct type ans832 (line 21) | type ans832 struct function Test_Problem832 (line 25) | func Test_Problem832(t *testing.T) { FILE: leetcode/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree.go function sumOfDistancesInTree (line 3) | func sumOfDistancesInTree(N int, edges [][]int) []int { function deepFirstSearch (line 21) | func deepFirstSearch(root int, visited []bool, count, res []int, tree []... function deepSecondSearch (line 37) | func deepSecondSearch(root int, visited []bool, count, res []int, tree [... FILE: leetcode/0834.Sum-of-Distances-in-Tree/834. Sum of Distances in Tree_test.go type question834 (line 8) | type question834 struct type para834 (line 15) | type para834 struct type ans834 (line 22) | type ans834 struct function Test_Problem834 (line 26) | func Test_Problem834(t *testing.T) { FILE: leetcode/0836.Rectangle-Overlap/836. Rectangle Overlap.go function isRectangleOverlap (line 3) | func isRectangleOverlap(rec1 []int, rec2 []int) bool { FILE: leetcode/0836.Rectangle-Overlap/836. Rectangle Overlap_test.go type question836 (line 8) | type question836 struct type para836 (line 15) | type para836 struct type ans836 (line 22) | type ans836 struct function Test_Problem836 (line 26) | func Test_Problem836(t *testing.T) { FILE: leetcode/0838.Push-Dominoes/838. Push Dominoes.go function pushDominoes (line 4) | func pushDominoes(dominoes string) string { function push (line 17) | func push(d []byte) { function pushDominoes1 (line 43) | func pushDominoes1(dominoes string) string { FILE: leetcode/0838.Push-Dominoes/838. Push Dominoes_test.go type question838 (line 8) | type question838 struct type para838 (line 15) | type para838 struct type ans838 (line 21) | type ans838 struct function Test_Problem838 (line 25) | func Test_Problem838(t *testing.T) { FILE: leetcode/0839.Similar-String-Groups/839. Similar String Groups.go function numSimilarGroups (line 7) | func numSimilarGroups(A []string) int { function isSimilar (line 20) | func isSimilar(a, b string) bool { FILE: leetcode/0839.Similar-String-Groups/839. Similar String Groups_test.go type question839 (line 8) | type question839 struct type para839 (line 15) | type para839 struct type ans839 (line 21) | type ans839 struct function Test_Problem839 (line 25) | func Test_Problem839(t *testing.T) { FILE: leetcode/0841.Keys-and-Rooms/841. Keys and Rooms.go function canVisitAllRooms (line 3) | func canVisitAllRooms(rooms [][]int) bool { function dfsVisitAllRooms (line 10) | func dfsVisitAllRooms(es [][]int, visited map[int]bool, from int) { FILE: leetcode/0841.Keys-and-Rooms/841. Keys and Rooms_test.go type question841 (line 8) | type question841 struct type para841 (line 15) | type para841 struct type ans841 (line 21) | type ans841 struct function Test_Problem841 (line 25) | func Test_Problem841(t *testing.T) { FILE: leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence.go function splitIntoFibonacci (line 8) | func splitIntoFibonacci(S string) []int { function findRecursiveCheck (line 36) | func findRecursiveCheck(S string, x1 int, x2 int, left int, res *[]int, ... function max (line 59) | func max(a int, b int) int { FILE: leetcode/0842.Split-Array-into-Fibonacci-Sequence/842. Split Array into Fibonacci Sequence_test.go type question842 (line 8) | type question842 struct type para842 (line 15) | type para842 struct type ans842 (line 21) | type ans842 struct function Test_Problem842 (line 25) | func Test_Problem842(t *testing.T) { FILE: leetcode/0844.Backspace-String-Compare/844. Backspace String Compare.go function backspaceCompare (line 3) | func backspaceCompare(S string, T string) bool { FILE: leetcode/0844.Backspace-String-Compare/844. Backspace String Compare_test.go type question844 (line 8) | type question844 struct type para844 (line 15) | type para844 struct type ans844 (line 22) | type ans844 struct function Test_Problem844 (line 26) | func Test_Problem844(t *testing.T) { FILE: leetcode/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array.go function longestMountain (line 3) | func longestMountain(A []int) int { function max (line 27) | func max(a int, b int) int { FILE: leetcode/0845.Longest-Mountain-in-Array/845. Longest Mountain in Array_test.go type question845 (line 8) | type question845 struct type para845 (line 15) | type para845 struct type ans845 (line 21) | type ans845 struct function Test_Problem845 (line 25) | func Test_Problem845(t *testing.T) { FILE: leetcode/0846.Hand-of-Straights/846.Hand of Straights.go function isNStraightHand (line 5) | func isNStraightHand(hand []int, groupSize int) bool { FILE: leetcode/0846.Hand-of-Straights/846.Hand of Straights_test.go type question846 (line 8) | type question846 struct type para846 (line 14) | type para846 struct type ans846 (line 20) | type ans846 struct function Test_Problem846 (line 24) | func Test_Problem846(t *testing.T) { FILE: leetcode/0850.Rectangle-Area-II/850. Rectangle Area II.go function rectangleArea (line 7) | func rectangleArea(rectangles [][]int) int { function discretization850 (line 29) | func discretization850(positions [][]int) (map[int]int, []int, map[int]i... type LineItem (line 64) | type LineItem struct type SegmentItem (line 69) | type SegmentItem struct type SegmentAreaTree (line 75) | type SegmentAreaTree struct method Init (line 83) | func (sat *SegmentAreaTree) Init(nums []int, oper func(i, j int) int) { method buildSegmentTree (line 96) | func (sat *SegmentAreaTree) buildSegmentTree(treeIndex, left, right in... method pushUp (line 107) | func (sat *SegmentAreaTree) pushUp(treeIndex, leftTreeIndex, rightTree... method leftChild (line 119) | func (sat *SegmentAreaTree) leftChild(index int) int { method rightChild (line 123) | func (sat *SegmentAreaTree) rightChild(index int) int { method Query (line 130) | func (sat *SegmentAreaTree) Query(left, right int) int { method queryInTree (line 137) | func (sat *SegmentAreaTree) queryInTree(treeIndex, left, right, queryL... method Update (line 159) | func (sat *SegmentAreaTree) Update(updateLeft, updateRight, val int) { method updateInTree (line 165) | func (sat *SegmentAreaTree) updateInTree(treeIndex, left, right, updat... FILE: leetcode/0850.Rectangle-Area-II/850. Rectangle Area II_test.go type question850 (line 8) | type question850 struct type para850 (line 15) | type para850 struct type ans850 (line 21) | type ans850 struct function Test_Problem850 (line 25) | func Test_Problem850(t *testing.T) { FILE: leetcode/0851.Loud-and-Rich/851. Loud and Rich.go function loudAndRich (line 3) | func loudAndRich(richer [][]int, quiet []int) []int { FILE: leetcode/0851.Loud-and-Rich/851. Loud and Rich_test.go type question851 (line 8) | type question851 struct type para851 (line 15) | type para851 struct type ans851 (line 22) | type ans851 struct function Test_Problem851 (line 26) | func Test_Problem851(t *testing.T) { FILE: leetcode/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array.go function peakIndexInMountainArray (line 4) | func peakIndexInMountainArray(A []int) int { function peakIndexInMountainArray1 (line 22) | func peakIndexInMountainArray1(A []int) int { FILE: leetcode/0852.Peak-Index-in-a-Mountain-Array/852. Peak Index in a Mountain Array_test.go type question852 (line 8) | type question852 struct type para852 (line 15) | type para852 struct type ans852 (line 21) | type ans852 struct function Test_Problem852 (line 25) | func Test_Problem852(t *testing.T) { FILE: leetcode/0853.Car-Fleet/853. Car Fleet.go type car (line 7) | type car struct type ByPosition (line 13) | type ByPosition method Len (line 15) | func (a ByPosition) Len() int { return len(a) } method Swap (line 16) | func (a ByPosition) Swap(i, j int) { a[i], a[j] = a[j], a[i] } method Less (line 17) | func (a ByPosition) Less(i, j int) bool { return a[i].position > a[j].... function carFleet (line 19) | func carFleet(target int, position []int, speed []int) int { FILE: leetcode/0853.Car-Fleet/853. Car Fleet_test.go type question853 (line 8) | type question853 struct type para853 (line 15) | type para853 struct type ans853 (line 23) | type ans853 struct function Test_Problem853 (line 27) | func Test_Problem853(t *testing.T) { FILE: leetcode/0856.Score-of-Parentheses/856. Score of Parentheses.go function scoreOfParentheses (line 3) | func scoreOfParentheses(S string) int { FILE: leetcode/0856.Score-of-Parentheses/856. Score of Parentheses_test.go type question856 (line 8) | type question856 struct type para856 (line 15) | type para856 struct type ans856 (line 21) | type ans856 struct function Test_Problem856 (line 25) | func Test_Problem856(t *testing.T) { FILE: leetcode/0859.Buddy-Strings/859.Buddy Strings.go function buddyStrings (line 3) | func buddyStrings(s string, goal string) bool { FILE: leetcode/0859.Buddy-Strings/859.Buddy Strings_test.go type question859 (line 8) | type question859 struct type para859 (line 14) | type para859 struct type ans859 (line 20) | type ans859 struct function Test_Problem859 (line 24) | func Test_Problem859(t *testing.T) { FILE: leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K.go function shortestSubarray (line 3) | func shortestSubarray(A []int, K int) int { FILE: leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/862. Shortest Subarray with Sum at Least K_test.go type question862 (line 8) | type question862 struct type para862 (line 15) | type para862 struct type ans862 (line 22) | type ans862 struct function Test_Problem862 (line 26) | func Test_Problem862(t *testing.T) { FILE: leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree.go function distanceK (line 18) | func distanceK(root *TreeNode, target *TreeNode, K int) []int { function findDistanceK (line 24) | func findDistanceK(root, target *TreeNode, K int, visit *[]int) int { function findChild (line 51) | func findChild(root *TreeNode, K int, visit *[]int) { FILE: leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/863. All Nodes Distance K in Binary Tree_test.go type question863 (line 10) | type question863 struct type para863 (line 17) | type para863 struct type ans863 (line 25) | type ans863 struct function Test_Problem863 (line 29) | func Test_Problem863(t *testing.T) { FILE: leetcode/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys.go function shortestPathAllKeys (line 16) | func shortestPathAllKeys(grid []string) int { function isInBoard (line 88) | func isInBoard(board [][]byte, x, y int) bool { function shortestPathAllKeys1 (line 93) | func shortestPathAllKeys1(grid []string) int { function searchKeys (line 127) | func searchKeys(board [][]byte, visited *[][][]bool, fullKeys, step, sta... function isLock (line 163) | func isLock(board [][]byte, x, y int) bool { function isKey (line 172) | func isKey(board [][]byte, x, y int) bool { function min (line 181) | func min(a int, b int) int { FILE: leetcode/0864.Shortest-Path-to-Get-All-Keys/864. Shortest Path to Get All Keys_test.go type question864 (line 8) | type question864 struct type para864 (line 15) | type para864 struct type ans864 (line 21) | type ans864 struct function Test_Problem864 (line 25) | func Test_Problem864(t *testing.T) { FILE: leetcode/0867.Transpose-Matrix/867. Transpose Matrix.go function transpose (line 3) | func transpose(A [][]int) [][]int { FILE: leetcode/0867.Transpose-Matrix/867. Transpose Matrix_test.go type question867 (line 8) | type question867 struct type para867 (line 15) | type para867 struct type ans867 (line 21) | type ans867 struct function Test_Problem867 (line 25) | func Test_Problem867(t *testing.T) { FILE: leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2.go function reorderedPowerOf2 (line 5) | func reorderedPowerOf2(n int) bool { function isSame (line 17) | func isSame(t, s string) bool { FILE: leetcode/0869.Reordered-Power-of-2/869. Reordered Power of 2_test.go type question869 (line 8) | type question869 struct type para869 (line 15) | type para869 struct type ans869 (line 21) | type ans869 struct function Test_Problem869 (line 25) | func Test_Problem869(t *testing.T) { FILE: leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle.go function advantageCount1 (line 5) | func advantageCount1(A []int, B []int) []int { FILE: leetcode/0870.Advantage-Shuffle/870. Advantage Shuffle_test.go type question870 (line 8) | type question870 struct type para870 (line 15) | type para870 struct type ans870 (line 22) | type ans870 struct function Test_Problem870 (line 26) | func Test_Problem870(t *testing.T) { FILE: leetcode/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees.go function leafSimilar (line 18) | func leafSimilar(root1 *TreeNode, root2 *TreeNode) bool { function dfsLeaf (line 33) | func dfsLeaf(root *TreeNode, leaf *[]int) { FILE: leetcode/0872.Leaf-Similar-Trees/872. Leaf-Similar Trees_test.go type question872 (line 10) | type question872 struct type para872 (line 17) | type para872 struct type ans872 (line 24) | type ans872 struct function Test_Problem872 (line 28) | func Test_Problem872(t *testing.T) { FILE: leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation.go function robotSim (line 3) | func robotSim(commands []int, obstacles [][]int) int { FILE: leetcode/0874.Walking-Robot-Simulation/874. Walking Robot Simulation_test.go function Test_robotSim (line 5) | func Test_robotSim(t *testing.T) { FILE: leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas.go function minEatingSpeed (line 5) | func minEatingSpeed(piles []int, H int) int { function isPossible (line 18) | func isPossible(piles []int, h, H int) bool { function maxInArr (line 26) | func maxInArr(xs []int) int { FILE: leetcode/0875.Koko-Eating-Bananas/875. Koko Eating Bananas_test.go type question875 (line 8) | type question875 struct type para875 (line 15) | type para875 struct type ans875 (line 22) | type ans875 struct function Test_Problem875 (line 26) | func Test_Problem875(t *testing.T) { FILE: leetcode/0876.Middle-of-the-Linked-List/876. Middle of the Linked List.go function middleNode (line 18) | func middleNode(head *ListNode) *ListNode { FILE: leetcode/0876.Middle-of-the-Linked-List/876. Middle of the Linked List_test.go type question876 (line 10) | type question876 struct type para876 (line 17) | type para876 struct type ans876 (line 23) | type ans876 struct function Test_Problem876 (line 27) | func Test_Problem876(t *testing.T) { FILE: leetcode/0877.Stone-Game/877. Stone Game.go function stoneGame (line 3) | func stoneGame(piles []int) bool { FILE: leetcode/0877.Stone-Game/877. Stone Game_test.go type question877 (line 8) | type question877 struct type para877 (line 15) | type para877 struct type ans877 (line 21) | type ans877 struct function Test_Problem877 (line 25) | func Test_Problem877(t *testing.T) { FILE: leetcode/0878.Nth-Magical-Number/878. Nth Magical Number.go function nthMagicalNumber (line 3) | func nthMagicalNumber(N int, A int, B int) int { function calNthMagicalCount (line 16) | func calNthMagicalCount(num, a, b int64) int64 { function gcd (line 21) | func gcd(a, b int64) int64 { FILE: leetcode/0878.Nth-Magical-Number/878. Nth Magical Number_test.go type question878 (line 8) | type question878 struct type para878 (line 15) | type para878 struct type ans878 (line 23) | type ans878 struct function Test_Problem878 (line 27) | func Test_Problem878(t *testing.T) { FILE: leetcode/0880.Decoded-String-at-Index/880. Decoded String at Index.go function isLetter (line 3) | func isLetter(char byte) bool { function decodeAtIndex (line 10) | func decodeAtIndex(S string, K int) string { FILE: leetcode/0880.Decoded-String-at-Index/880. Decoded String at Index_test.go type question880 (line 8) | type question880 struct type para880 (line 15) | type para880 struct type ans880 (line 22) | type ans880 struct function Test_Problem880 (line 26) | func Test_Problem880(t *testing.T) { FILE: leetcode/0881.Boats-to-Save-People/881. Boats to Save People.go function numRescueBoats (line 7) | func numRescueBoats(people []int, limit int) int { FILE: leetcode/0881.Boats-to-Save-People/881. Boats to Save People_test.go type question881 (line 8) | type question881 struct type para881 (line 15) | type para881 struct type ans881 (line 22) | type ans881 struct function Test_Problem881 (line 26) | func Test_Problem881(t *testing.T) { FILE: leetcode/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences.go function uncommonFromSentences (line 5) | func uncommonFromSentences(A string, B string) []string { FILE: leetcode/0884.Uncommon-Words-from-Two-Sentences/884. Uncommon Words from Two Sentences_test.go type question884 (line 8) | type question884 struct type para884 (line 15) | type para884 struct type ans884 (line 22) | type ans884 struct function Test_Problem884 (line 26) | func Test_Problem884(t *testing.T) { FILE: leetcode/0885.Spiral-Matrix-III/885. Spiral Matrix III.go function spiralMatrixIII (line 3) | func spiralMatrixIII(R int, C int, r0 int, c0 int) [][]int { FILE: leetcode/0885.Spiral-Matrix-III/885. Spiral Matrix III_test.go type question885 (line 8) | type question885 struct type para885 (line 15) | type para885 struct type ans885 (line 24) | type ans885 struct function Test_Problem885 (line 28) | func Test_Problem885(t *testing.T) { FILE: leetcode/0887.Super-Egg-Drop/887. Super Egg Drop.go function superEggDrop (line 4) | func superEggDrop(K int, N int) int { function counterF (line 18) | func counterF(k, n, mid int) int { function superEggDrop1 (line 29) | func superEggDrop1(K int, N int) int { FILE: leetcode/0887.Super-Egg-Drop/887. Super Egg Drop_test.go type question887 (line 8) | type question887 struct type para887 (line 15) | type para887 struct type ans887 (line 22) | type ans887 struct function Test_Problem887 (line 26) | func Test_Problem887(t *testing.T) { FILE: leetcode/0888.Fair-Candy-Swap/888. Fair Candy Swap.go function fairCandySwap (line 3) | func fairCandySwap(A []int, B []int) []int { function diff (line 16) | func diff(A []int, B []int) int { function max (line 29) | func max(a, b int) int { FILE: leetcode/0888.Fair-Candy-Swap/888. Fair Candy Swap_test.go type question888 (line 8) | type question888 struct type para888 (line 15) | type para888 struct type ans888 (line 22) | type ans888 struct function Test_Problem888 (line 26) | func Test_Problem888(t *testing.T) { FILE: leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern.go function findAndReplacePattern (line 3) | func findAndReplacePattern(words []string, pattern string) []string { function match (line 13) | func match(w, p string) bool { FILE: leetcode/0890.Find-and-Replace-Pattern/890. Find and Replace Pattern_test.go type question890 (line 8) | type question890 struct type para890 (line 15) | type para890 struct type ans890 (line 22) | type ans890 struct function Test_Problem890 (line 26) | func Test_Problem890(t *testing.T) { FILE: leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go function sumSubseqWidths (line 7) | func sumSubseqWidths(A []int) int { FILE: leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths_test.go type question891 (line 8) | type question891 struct type para891 (line 15) | type para891 struct type ans891 (line 21) | type ans891 struct function Test_Problem891 (line 25) | func Test_Problem891(t *testing.T) { FILE: leetcode/0892.Surface-Area-of-3D-Shapes/892. Surface Area of 3D Shapes.go function surfaceArea (line 3) | func surfaceArea(grid [][]int) int { function min (line 36) | func min(a, b int) int { FILE: leetcode/0892.Surface-Area-of-3D-Shapes/892. Surface Area of 3D Shapes_test.go type question892 (line 8) | type question892 struct type para892 (line 15) | type para892 struct type ans892 (line 21) | type ans892 struct function Test_Problem892 (line 25) | func Test_Problem892(t *testing.T) { FILE: leetcode/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack.go type FreqStack (line 3) | type FreqStack struct method Push (line 15) | func (this *FreqStack) Push(x int) { method Pop (line 29) | func (this *FreqStack) Pop() int { function Constructor895 (line 9) | func Constructor895() FreqStack { FILE: leetcode/0895.Maximum-Frequency-Stack/895. Maximum Frequency Stack_test.go function Test_Problem895 (line 8) | func Test_Problem895(t *testing.T) { FILE: leetcode/0896.Monotonic-Array/896. Monotonic Array.go function isMonotonic (line 3) | func isMonotonic(A []int) bool { function inc (line 16) | func inc(A []int) bool { function dec (line 25) | func dec(A []int) bool { FILE: leetcode/0896.Monotonic-Array/896. Monotonic Array_test.go type question896 (line 8) | type question896 struct type para896 (line 15) | type para896 struct type ans896 (line 21) | type ans896 struct function Test_Problem896 (line 25) | func Test_Problem896(t *testing.T) { FILE: leetcode/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree.go function increasingBST (line 20) | func increasingBST(root *TreeNode) *TreeNode { function recBST (line 27) | func recBST(root, tail *TreeNode) *TreeNode { function increasingBST1 (line 39) | func increasingBST1(root *TreeNode) *TreeNode { function inorder (line 55) | func inorder(root *TreeNode, output *[]int) { FILE: leetcode/0897.Increasing-Order-Search-Tree/897. Increasing Order Search Tree_test.go type question897 (line 10) | type question897 struct type para897 (line 17) | type para897 struct type ans897 (line 23) | type ans897 struct function Test_Problem897 (line 27) | func Test_Problem897(t *testing.T) { FILE: leetcode/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays.go function subarrayBitwiseORs (line 4) | func subarrayBitwiseORs(A []int) int { function inSlice (line 29) | func inSlice(A []int, T int) bool { function subarrayBitwiseORs1 (line 39) | func subarrayBitwiseORs1(A []int) int { FILE: leetcode/0898.Bitwise-ORs-of-Subarrays/898. Bitwise ORs of Subarrays_test.go type question898 (line 8) | type question898 struct type para898 (line 15) | type para898 struct type ans898 (line 21) | type ans898 struct function Test_Problem898 (line 25) | func Test_Problem898(t *testing.T) { FILE: leetcode/0901.Online-Stock-Span/901. Online Stock Span.go type Node (line 6) | type Node struct type StockSpanner (line 12) | type StockSpanner struct method Next (line 22) | func (this *StockSpanner) Next(price int) int { function Constructor901 (line 16) | func Constructor901() StockSpanner { FILE: leetcode/0901.Online-Stock-Span/901. Online Stock Span_test.go function Test_Problem901 (line 8) | func Test_Problem901(t *testing.T) { FILE: leetcode/0904.Fruit-Into-Baskets/904. Fruit Into Baskets.go function totalFruit (line 3) | func totalFruit(tree []int) int { function max (line 30) | func max(a int, b int) int { FILE: leetcode/0904.Fruit-Into-Baskets/904. Fruit Into Baskets_test.go type question904 (line 8) | type question904 struct type para904 (line 15) | type para904 struct type ans904 (line 21) | type ans904 struct function Test_Problem904 (line 25) | func Test_Problem904(t *testing.T) { FILE: leetcode/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums.go function sumSubarrayMins (line 4) | func sumSubarrayMins(A []int) int { type pair (line 20) | type pair struct function sumSubarrayMins1 (line 26) | func sumSubarrayMins1(A []int) int { function sumSubarrayMins2 (line 56) | func sumSubarrayMins2(A []int) int { FILE: leetcode/0907.Sum-of-Subarray-Minimums/907. Sum of Subarray Minimums_test.go type question907 (line 8) | type question907 struct type para907 (line 15) | type para907 struct type ans907 (line 21) | type ans907 struct function Test_Problem907 (line 25) | func Test_Problem907(t *testing.T) { FILE: leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders.go type pair (line 3) | type pair struct function snakesAndLadders (line 7) | func snakesAndLadders(board [][]int) int { function getRowCol (line 35) | func getRowCol(id, n int) (r, c int) { FILE: leetcode/0909.Snakes-and-Ladders/909. Snakes and Ladders_test.go type question909 (line 8) | type question909 struct type para909 (line 15) | type para909 struct type ans909 (line 21) | type ans909 struct function Test_Problem909 (line 25) | func Test_Problem909(t *testing.T) { FILE: leetcode/0910.Smallest-Range-II/910.Smallest Range II.go function smallestRangeII (line 5) | func smallestRangeII(A []int, K int) int { function max (line 18) | func max(a, b int) int { function min (line 25) | func min(a, b int) int { FILE: leetcode/0910.Smallest-Range-II/910.Smallest Range II_test.go type question910 (line 8) | type question910 struct type para910 (line 13) | type para910 struct type ans910 (line 18) | type ans910 struct function Test_Problem910 (line 23) | func Test_Problem910(t *testing.T) { FILE: leetcode/0911.Online-Election/911. Online Election.go type TopVotedCandidate (line 8) | type TopVotedCandidate struct method Q (line 29) | func (tvc *TopVotedCandidate) Q(t int) int { function Constructor911 (line 14) | func Constructor911(persons []int, times []int) TopVotedCandidate { FILE: leetcode/0911.Online-Election/911. Online Election_test.go function Test_Problem911 (line 8) | func Test_Problem911(t *testing.T) { FILE: leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards/914. X of a Kind in a Deck of Cards.go function hasGroupsSizeX (line 3) | func hasGroupsSizeX(deck []int) bool { function gcd (line 21) | func gcd(a, b int) int { FILE: leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards/914. X of a Kind in a Deck of Cards_test.go type question914 (line 8) | type question914 struct type para914 (line 15) | type para914 struct type ans914 (line 21) | type ans914 struct function Test_Problem914 (line 25) | func Test_Problem914(t *testing.T) { FILE: leetcode/0916.Word-Subsets/916. Word Subsets.go function wordSubsets (line 3) | func wordSubsets(A []string, B []string) []string { FILE: leetcode/0916.Word-Subsets/916. Word Subsets_test.go type question916 (line 8) | type question916 struct type para916 (line 15) | type para916 struct type ans916 (line 22) | type ans916 struct function Test_Problem916 (line 26) | func Test_Problem916(t *testing.T) { FILE: leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray.go function maxSubarraySumCircular (line 5) | func maxSubarraySumCircular(nums []int) int { function max (line 43) | func max(nums ...int) int { FILE: leetcode/0918.Maximum-Sum-Circular-Subarray/918. Maximum Sum Circular Subarray_test.go type question918 (line 8) | type question918 struct type para918 (line 15) | type para918 struct type ans918 (line 21) | type ans918 struct function Test_Problem918 (line 25) | func Test_Problem918(t *testing.T) { FILE: leetcode/0920.Number-of-Music-Playlists/920. Number of Music Playlists.go function numMusicPlaylists (line 3) | func numMusicPlaylists(N int, L int, K int) int { FILE: leetcode/0920.Number-of-Music-Playlists/920. Number of Music Playlists_test.go type question920 (line 8) | type question920 struct type para920 (line 15) | type para920 struct type ans920 (line 23) | type ans920 struct function Test_Problem920 (line 27) | func Test_Problem920(t *testing.T) { FILE: leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid.go function minAddToMakeValid (line 3) | func minAddToMakeValid(S string) int { FILE: leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid/921. Minimum Add to Make Parentheses Valid_test.go type question921 (line 8) | type question921 struct type para921 (line 15) | type para921 struct type ans921 (line 21) | type ans921 struct function Test_Problem921 (line 25) | func Test_Problem921(t *testing.T) { FILE: leetcode/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II.go function sortArrayByParityII (line 3) | func sortArrayByParityII(A []int) []int { FILE: leetcode/0922.Sort-Array-By-Parity-II/922. Sort Array By Parity II_test.go type question922 (line 8) | type question922 struct type para922 (line 15) | type para922 struct type ans922 (line 21) | type ans922 struct function Test_Problem922 (line 25) | func Test_Problem922(t *testing.T) { FILE: leetcode/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity.go function threeSumMulti (line 7) | func threeSumMulti(A []int, target int) int { FILE: leetcode/0923.3Sum-With-Multiplicity/923. 3Sum With Multiplicity_test.go type question923 (line 8) | type question923 struct type para923 (line 15) | type para923 struct type ans923 (line 22) | type ans923 struct function Test_Problem923 (line 26) | func Test_Problem923(t *testing.T) { FILE: leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread.go function minMalwareSpread (line 9) | func minMalwareSpread(graph [][]int, initial []int) int { FILE: leetcode/0924.Minimize-Malware-Spread/924. Minimize Malware Spread_test.go type question924 (line 8) | type question924 struct type para924 (line 15) | type para924 struct type ans924 (line 22) | type ans924 struct function Test_Problem924 (line 26) | func Test_Problem924(t *testing.T) { FILE: leetcode/0925.Long-Pressed-Name/925. Long Pressed Name.go function isLongPressedName (line 3) | func isLongPressedName(name string, typed string) bool { FILE: leetcode/0925.Long-Pressed-Name/925. Long Pressed Name_test.go type question925 (line 8) | type question925 struct type para925 (line 15) | type para925 struct type ans925 (line 22) | type ans925 struct function Test_Problem925 (line 26) | func Test_Problem925(t *testing.T) { FILE: leetcode/0927.Three-Equal-Parts/927. Three Equal Parts.go function threeEqualParts (line 3) | func threeEqualParts(A []int) []int { FILE: leetcode/0927.Three-Equal-Parts/927. Three Equal Parts_test.go type question927 (line 8) | type question927 struct type para927 (line 15) | type para927 struct type ans927 (line 21) | type ans927 struct function Test_Problem927 (line 25) | func Test_Problem927(t *testing.T) { FILE: leetcode/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II.go function minMalwareSpread2 (line 9) | func minMalwareSpread2(graph [][]int, initial []int) int { function min (line 70) | func min(a int, b int) int { FILE: leetcode/0928.Minimize-Malware-Spread-II/928. Minimize Malware Spread II_test.go type question928 (line 8) | type question928 struct type para928 (line 15) | type para928 struct type ans928 (line 22) | type ans928 struct function Test_Problem928 (line 26) | func Test_Problem928(t *testing.T) { FILE: leetcode/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum.go function numSubarraysWithSum (line 5) | func numSubarraysWithSum(A []int, S int) int { FILE: leetcode/0930.Binary-Subarrays-With-Sum/930. Binary Subarrays With Sum_test.go type question930 (line 8) | type question930 struct type para930 (line 15) | type para930 struct type ans930 (line 22) | type ans930 struct function Test_Problem930 (line 26) | func Test_Problem930(t *testing.T) { FILE: leetcode/0933.Number-of-Recent-Calls/933. Number of Recent Calls.go type RecentCounter (line 5) | type RecentCounter struct method Ping (line 15) | func (this *RecentCounter) Ping(t int) int { function Constructor933 (line 9) | func Constructor933() RecentCounter { FILE: leetcode/0933.Number-of-Recent-Calls/933. Number of Recent Calls_test.go function Test_Problem933 (line 8) | func Test_Problem933(t *testing.T) { FILE: leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST.go function rangeSumBST (line 19) | func rangeSumBST(root *TreeNode, low int, high int) int { function preOrder (line 25) | func preOrder(root *TreeNode, low, high int, res *int) { FILE: leetcode/0938.Range-Sum-of-BST/938. Range Sum of BST_test.go type question938 (line 10) | type question938 struct type para938 (line 17) | type para938 struct type ans938 (line 25) | type ans938 struct function Test_Problem938 (line 29) | func Test_Problem938(t *testing.T) { FILE: leetcode/0942.DI-String-Match/942. DI String Match.go function diStringMatch (line 3) | func diStringMatch(S string) []int { FILE: leetcode/0942.DI-String-Match/942. DI String Match_test.go type question942 (line 8) | type question942 struct type para942 (line 15) | type para942 struct type ans942 (line 21) | type ans942 struct function Test_Problem942 (line 25) | func Test_Problem942(t *testing.T) { FILE: leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences.go function validateStackSequences (line 3) | func validateStackSequences(pushed []int, popped []int) bool { FILE: leetcode/0946.Validate-Stack-Sequences/946. Validate Stack Sequences_test.go type question946 (line 8) | type question946 struct type para946 (line 15) | type para946 struct type ans946 (line 22) | type ans946 struct function Test_Problem946 (line 26) | func Test_Problem946(t *testing.T) { FILE: leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column.go function removeStones (line 7) | func removeStones(stones [][]int) int { FILE: leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/947. Most Stones Removed with Same Row or Column_test.go type question947 (line 8) | type question947 struct type para947 (line 15) | type para947 struct type ans947 (line 21) | type ans947 struct function Test_Problem947 (line 25) | func Test_Problem947(t *testing.T) { FILE: leetcode/0949.Largest-Time-for-Given-Digits/949. Largest Time for Given Digits.go function largestTimeFromDigits (line 5) | func largestTimeFromDigits(A []int) string { FILE: leetcode/0949.Largest-Time-for-Given-Digits/949. Largest Time for Given Digits_test.go type question949 (line 8) | type question949 struct type para949 (line 15) | type para949 struct type ans949 (line 21) | type ans949 struct function Test_Problem949 (line 25) | func Test_Problem949(t *testing.T) { FILE: leetcode/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor.go function largestComponentSize (line 8) | func largestComponentSize(A []int) int { function largestComponentSize1 (line 30) | func largestComponentSize1(A []int) int { function max (line 57) | func max(a int, b int) int { FILE: leetcode/0952.Largest-Component-Size-by-Common-Factor/952. Largest Component Size by Common Factor_test.go type question952 (line 8) | type question952 struct type para952 (line 15) | type para952 struct type ans952 (line 21) | type ans952 struct function Test_Problem952 (line 25) | func Test_Problem952(t *testing.T) { FILE: leetcode/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary.go function isAlienSorted (line 3) | func isAlienSorted(words []string, order string) bool { FILE: leetcode/0953.Verifying-an-Alien-Dictionary/953. Verifying an Alien Dictionary_test.go type question953 (line 8) | type question953 struct type para953 (line 15) | type para953 struct type ans953 (line 22) | type ans953 struct function Test_Problem953 (line 26) | func Test_Problem953(t *testing.T) { FILE: leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree.go function isCompleteTree (line 19) | func isCompleteTree(root *TreeNode) bool { FILE: leetcode/0958.Check-Completeness-of-a-Binary-Tree/0958.Check Completeness of a Binary Tree_test.go type question958 (line 10) | type question958 struct type para958 (line 17) | type para958 struct type ans958 (line 23) | type ans958 struct function Test_Problem958 (line 27) | func Test_Problem958(t *testing.T) { FILE: leetcode/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes.go function regionsBySlashes (line 7) | func regionsBySlashes(grid []string) int { function getFaceIdx (line 42) | func getFaceIdx(size, i, j, k int) int { FILE: leetcode/0959.Regions-Cut-By-Slashes/959. Regions Cut By Slashes_test.go type question959 (line 8) | type question959 struct type para959 (line 15) | type para959 struct type ans959 (line 21) | type ans959 struct function Test_Problem959 (line 25) | func Test_Problem959(t *testing.T) { FILE: leetcode/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array.go function repeatedNTimes (line 3) | func repeatedNTimes(A []int) int { FILE: leetcode/0961.N-Repeated-Element-in-Size-2N-Array/961. N-Repeated Element in Size 2N Array_test.go type question961 (line 8) | type question961 struct type para961 (line 15) | type para961 struct type ans961 (line 21) | type ans961 struct function Test_Problem961 (line 25) | func Test_Problem961(t *testing.T) { FILE: leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker.go function spellchecker (line 5) | func spellchecker(wordlist []string, queries []string) []string { function devowel (line 45) | func devowel(word string) string { FILE: leetcode/0966.Vowel-Spellchecker/966. Vowel Spellchecker_test.go type question966 (line 8) | type question966 struct type para966 (line 15) | type para966 struct type ans966 (line 22) | type ans966 struct function Test_Problem966 (line 26) | func Test_Problem966(t *testing.T) { FILE: leetcode/0968.Binary-Tree-Cameras/968. Binary Tree Cameras.go type status (line 19) | type status constant isLeaf (line 22) | isLeaf status = iota constant parentofLeaf (line 23) | parentofLeaf constant isMonitoredWithoutCamera (line 24) | isMonitoredWithoutCamera function minCameraCover (line 27) | func minCameraCover(root *TreeNode) int { function minCameraCoverDFS (line 35) | func minCameraCoverDFS(root *TreeNode, res *int) status { FILE: leetcode/0968.Binary-Tree-Cameras/968. Binary Tree Cameras_test.go type question968 (line 10) | type question968 struct type para968 (line 17) | type para968 struct type ans968 (line 23) | type ans968 struct function Test_Problem968 (line 27) | func Test_Problem968(t *testing.T) { FILE: leetcode/0969.Pancake-Sorting/969. Pancake Sorting.go function pancakeSort (line 3) | func pancakeSort(A []int) []int { function reverse969 (line 24) | func reverse969(nums []int, l, r int) { function find (line 32) | func find(nums []int, t int) int { FILE: leetcode/0969.Pancake-Sorting/969. Pancake Sorting_test.go type question969 (line 8) | type question969 struct type para969 (line 15) | type para969 struct type ans969 (line 21) | type ans969 struct function Test_Problem969 (line 25) | func Test_Problem969(t *testing.T) { FILE: leetcode/0970.Powerful-Integers/970. Powerful Integers.go function powerfulIntegers (line 5) | func powerfulIntegers(x int, y int, bound int) []int { function pow (line 33) | func pow(x, i int) int { FILE: leetcode/0970.Powerful-Integers/970. Powerful Integers_test.go type question970 (line 8) | type question970 struct type para970 (line 15) | type para970 struct type ans970 (line 23) | type ans970 struct function Test_Problem970 (line 27) | func Test_Problem970(t *testing.T) { FILE: leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal.go function flipMatchVoyage (line 19) | func flipMatchVoyage(root *TreeNode, voyage []int) []int { function travelTree (line 27) | func travelTree(root *TreeNode, index *int, voyage []int, res *[]int) bo... FILE: leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/971. Flip Binary Tree To Match Preorder Traversal_test.go type question971 (line 10) | type question971 struct type para971 (line 17) | type para971 struct type ans971 (line 24) | type ans971 struct function Test_Problem971 (line 28) | func Test_Problem971(t *testing.T) { FILE: leetcode/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin.go function KClosest (line 6) | func KClosest(points [][]int, K int) [][]int { FILE: leetcode/0973.K-Closest-Points-to-Origin/973. K Closest Points to Origin_test.go type question973 (line 8) | type question973 struct type para973 (line 15) | type para973 struct type ans973 (line 22) | type ans973 struct function Test_Problem973 (line 26) | func Test_Problem973(t *testing.T) { FILE: leetcode/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle.go function largestPerimeter (line 3) | func largestPerimeter(A []int) int { function quickSort164 (line 16) | func quickSort164(a []int, lo, hi int) { function partition164 (line 25) | func partition164(a []int, lo, hi int) int { FILE: leetcode/0976.Largest-Perimeter-Triangle/976. Largest Perimeter Triangle_test.go type question976 (line 8) | type question976 struct type para976 (line 15) | type para976 struct type ans976 (line 21) | type ans976 struct function Test_Problem976 (line 25) | func Test_Problem976(t *testing.T) { FILE: leetcode/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array.go function sortedSquares (line 6) | func sortedSquares(A []int) []int { function sortedSquares1 (line 21) | func sortedSquares1(A []int) []int { FILE: leetcode/0977.Squares-of-a-Sorted-Array/977. Squares of a Sorted Array_test.go type question977 (line 8) | type question977 struct type para977 (line 15) | type para977 struct type ans977 (line 21) | type ans977 struct function Test_Problem977 (line 25) | func Test_Problem977(t *testing.T) { FILE: leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go function maxTurbulenceSize (line 4) | func maxTurbulenceSize(arr []int) int { function max (line 23) | func max(a int, b int) int { function min (line 30) | func min(a int, b int) int { function maxTurbulenceSize1 (line 38) | func maxTurbulenceSize1(arr []int) int { FILE: leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray_test.go type question978 (line 8) | type question978 struct type para978 (line 15) | type para978 struct type ans978 (line 21) | type ans978 struct function Test_Problem978 (line 25) | func Test_Problem978(t *testing.T) { FILE: leetcode/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree.go function distributeCoins (line 19) | func distributeCoins(root *TreeNode) int { function distributeCoinsDFS (line 25) | func distributeCoinsDFS(root *TreeNode, res *int) int { function abs (line 34) | func abs(a int) int { FILE: leetcode/0979.Distribute-Coins-in-Binary-Tree/979. Distribute Coins in Binary Tree_test.go type question979 (line 10) | type question979 struct type para979 (line 17) | type para979 struct type ans979 (line 23) | type ans979 struct function Test_Problem979 (line 27) | func Test_Problem979(t *testing.T) { FILE: leetcode/0980.Unique-Paths-III/980. Unique Paths III.go function uniquePathsIII (line 10) | func uniquePathsIII(grid [][]int) int { function isInPath (line 32) | func isInPath(board [][]int, x, y int) bool { function findUniquePathIII (line 36) | func findUniquePathIII(board [][]int, visited [][]bool, path []int, empt... FILE: leetcode/0980.Unique-Paths-III/980. Unique Paths III_test.go type question980 (line 8) | type question980 struct type para980 (line 15) | type para980 struct type ans980 (line 21) | type ans980 struct function Test_Problem980 (line 25) | func Test_Problem980(t *testing.T) { FILE: leetcode/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store.go type data (line 5) | type data struct type TimeMap (line 12) | type TimeMap method Set (line 20) | func (t TimeMap) Set(key string, value string, timestamp int) { method Get (line 31) | func (t TimeMap) Get(key string, timestamp int) string { function Constructor981 (line 15) | func Constructor981() TimeMap { FILE: leetcode/0981.Time-Based-Key-Value-Store/981. Time Based Key-Value Store_test.go function Test_Problem981 (line 8) | func Test_Problem981(t *testing.T) { FILE: leetcode/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB.go function strWithout3a3b (line 3) | func strWithout3a3b(A int, B int) string { FILE: leetcode/0984.String-Without-AAA-or-BBB/984. String Without AAA or BBB_test.go type question984 (line 8) | type question984 struct type para984 (line 15) | type para984 struct type ans984 (line 22) | type ans984 struct function Test_Problem984 (line 26) | func Test_Problem984(t *testing.T) { FILE: leetcode/0985.Sum-of-Even-Numbers-After-Queries/985. Sum of Even Numbers After Queries.go function sumEvenAfterQueries (line 3) | func sumEvenAfterQueries(A []int, queries [][]int) []int { FILE: leetcode/0985.Sum-of-Even-Numbers-After-Queries/985. Sum of Even Numbers After Queries_test.go type question985 (line 8) | type question985 struct type para985 (line 15) | type para985 struct type ans985 (line 22) | type ans985 struct function Test_Problem985 (line 26) | func Test_Problem985(t *testing.T) { FILE: leetcode/0986.Interval-List-Intersections/986. Interval List Intersections.go function intervalIntersection (line 17) | func intervalIntersection(A []Interval, B []Interval) []Interval { function max (line 34) | func max(a int, b int) int { function min (line 41) | func min(a int, b int) int { FILE: leetcode/0986.Interval-List-Intersections/986. Interval List Intersections_test.go type question986 (line 8) | type question986 struct type para986 (line 15) | type para986 struct type ans986 (line 22) | type ans986 struct function Test_Problem986 (line 26) | func Test_Problem986(t *testing.T) { FILE: leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree.go type node (line 22) | type node struct function verticalTraversal (line 26) | func verticalTraversal(root *TreeNode) [][]int { FILE: leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree/987. Vertical Order Traversal of a Binary Tree_test.go type question987 (line 10) | type question987 struct type para987 (line 17) | type para987 struct type ans987 (line 23) | type ans987 struct function Test_Problem987 (line 27) | func Test_Problem987(t *testing.T) { FILE: leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer.go function addToArrayForm (line 3) | func addToArrayForm(A []int, K int) []int { function reverse (line 21) | func reverse(A []int) { FILE: leetcode/0989.Add-to-Array-Form-of-Integer/989. Add to Array-Form of Integer_test.go type question989 (line 8) | type question989 struct type para989 (line 15) | type para989 struct type ans989 (line 22) | type ans989 struct function Test_Problem989 (line 26) | func Test_Problem989(t *testing.T) { FILE: leetcode/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations.go function equationsPossible (line 7) | func equationsPossible(equations []string) bool { FILE: leetcode/0990.Satisfiability-of-Equality-Equations/990. Satisfiability of Equality Equations_test.go type question990 (line 8) | type question990 struct type para990 (line 15) | type para990 struct type ans990 (line 21) | type ans990 struct function Test_Problem990 (line 25) | func Test_Problem990(t *testing.T) { FILE: leetcode/0991.Broken-Calculator/991. Broken Calculator.go function brokenCalc (line 3) | func brokenCalc(X int, Y int) int { FILE: leetcode/0991.Broken-Calculator/991. Broken Calculator_test.go type question991 (line 8) | type question991 struct type para991 (line 15) | type para991 struct type ans991 (line 22) | type ans991 struct function Test_Problem991 (line 26) | func Test_Problem991(t *testing.T) { FILE: leetcode/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers.go function subarraysWithKDistinct (line 3) | func subarraysWithKDistinct(A []int, K int) int { function subarraysWithKDistinctSlideWindow (line 7) | func subarraysWithKDistinctSlideWindow(A []int, K int) int { FILE: leetcode/0992.Subarrays-with-K-Different-Integers/992. Subarrays with K Different Integers_test.go type question992 (line 8) | type question992 struct type para992 (line 15) | type para992 struct type ans992 (line 22) | type ans992 struct function Test_Problem992 (line 26) | func Test_Problem992(t *testing.T) { FILE: leetcode/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree.go function isCousins (line 20) | func isCousins(root *TreeNode, x int, y int) bool { function findLevel (line 31) | func findLevel(root *TreeNode, x, level int) int { function haveSameParents (line 45) | func haveSameParents(root *TreeNode, x, y int) bool { type mark (line 57) | type mark struct function isCousinsBFS (line 62) | func isCousinsBFS(root *TreeNode, x int, y int) bool { function isCousinsDFS (line 93) | func isCousinsDFS(root *TreeNode, x int, y int) bool { function dfsCousins (line 100) | func dfsCousins(root *TreeNode, val, depth, last int, parent, res *int) { FILE: leetcode/0993.Cousins-in-Binary-Tree/993. Cousins in Binary Tree_test.go type question993 (line 10) | type question993 struct type para993 (line 17) | type para993 struct type ans993 (line 25) | type ans993 struct function Test_Problem993 (line 29) | func Test_Problem993(t *testing.T) { FILE: leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips.go function minKBitFlips (line 3) | func minKBitFlips(A []int, K int) int { FILE: leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/995. Minimum Number of K Consecutive Bit Flips_test.go type question995 (line 8) | type question995 struct type para995 (line 15) | type para995 struct type ans995 (line 22) | type ans995 struct function Test_Problem995 (line 26) | func Test_Problem995(t *testing.T) { FILE: leetcode/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays.go function numSquarefulPerms (line 8) | func numSquarefulPerms(A []int) int { function generatePermutation996 (line 18) | func generatePermutation996(nums []int, index int, p []int, res *[][]int... function checkSquare (line 52) | func checkSquare(num int) bool { FILE: leetcode/0996.Number-of-Squareful-Arrays/996. Number of Squareful Arrays_test.go type question996 (line 8) | type question996 struct type para996 (line 15) | type para996 struct type ans996 (line 21) | type ans996 struct function Test_Problem996 (line 25) | func Test_Problem996(t *testing.T) { FILE: leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge.go function findJudge (line 3) | func findJudge(n int, trust [][]int) int { FILE: leetcode/0997.Find-the-Town-Judge/997.Find the Town Judge_test.go type question997 (line 8) | type question997 struct type para997 (line 14) | type para997 struct type ans997 (line 20) | type ans997 struct function Test_Problem997 (line 24) | func Test_Problem997(t *testing.T) { FILE: leetcode/0999.Available-Captures-for-Rook/999. Available Captures for Rook.go function numRookCaptures (line 3) | func numRookCaptures(board [][]byte) int { function caputure (line 18) | func caputure(board [][]byte, x, y int, bx, by int) int { FILE: leetcode/0999.Available-Captures-for-Rook/999. Available Captures for Rook_test.go type question999 (line 8) | type question999 struct type para999 (line 15) | type para999 struct type ans999 (line 21) | type ans999 struct function Test_Problem999 (line 25) | func Test_Problem999(t *testing.T) { FILE: leetcode/1002.Find-Common-Characters/1002. Find Common Characters.go function commonChars (line 5) | func commonChars(A []string) []string { FILE: leetcode/1002.Find-Common-Characters/1002. Find Common Characters_test.go type question1002 (line 8) | type question1002 struct type para1002 (line 15) | type para1002 struct type ans1002 (line 21) | type ans1002 struct function Test_Problem1002 (line 25) | func Test_Problem1002(t *testing.T) { FILE: leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions.go function isValid1003 (line 3) | func isValid1003(S string) bool { FILE: leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions/1003. Check If Word Is Valid After Substitutions_test.go type question1003 (line 8) | type question1003 struct type para1003 (line 15) | type para1003 struct type ans1003 (line 21) | type ans1003 struct function Test_Problem1003 (line 25) | func Test_Problem1003(t *testing.T) { FILE: leetcode/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III.go function longestOnes (line 3) | func longestOnes(A []int, K int) int { function max (line 24) | func max(a int, b int) int { FILE: leetcode/1004.Max-Consecutive-Ones-III/1004. Max Consecutive Ones III_test.go type question1004 (line 8) | type question1004 struct type para1004 (line 15) | type para1004 struct type ans1004 (line 22) | type ans1004 struct function Test_Problem1004 (line 26) | func Test_Problem1004(t *testing.T) { FILE: leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations.go function largestSumAfterKNegations (line 7) | func largestSumAfterKNegations(A []int, K int) int { FILE: leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations/1005. Maximize Sum Of Array After K Negations_test.go type question1005 (line 8) | type question1005 struct type para1005 (line 15) | type para1005 struct type ans1005 (line 22) | type ans1005 struct function Test_Problem1005 (line 26) | func Test_Problem1005(t *testing.T) { FILE: leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial.go function clumsy (line 3) | func clumsy(N int) int { FILE: leetcode/1006.Clumsy-Factorial/1006. Clumsy Factorial_test.go type question1006 (line 8) | type question1006 struct type para1006 (line 15) | type para1006 struct type ans1006 (line 21) | type ans1006 struct function Test_Problem1006 (line 25) | func Test_Problem1006(t *testing.T) { FILE: leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer.go function bitwiseComplement (line 3) | func bitwiseComplement(n int) int { FILE: leetcode/1009.Complement-of-Base-10-Integer/1009. Complement of Base 10 Integer_test.go type question1009 (line 8) | type question1009 struct type para1009 (line 15) | type para1009 struct type ans1009 (line 21) | type ans1009 struct function Test_Problem1009 (line 25) | func Test_Problem1009(t *testing.T) { FILE: leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60.go function numPairsDivisibleBy60 (line 3) | func numPairsDivisibleBy60(time []int) int { FILE: leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010. Pairs of Songs With Total Durations Divisible by 60_test.go type question1010 (line 8) | type question1010 struct type para1010 (line 15) | type para1010 struct type ans1010 (line 21) | type ans1010 struct function Test_Problem1010 (line 25) | func Test_Problem1010(t *testing.T) { FILE: leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days.go function shipWithinDays (line 3) | func shipWithinDays(weights []int, D int) int { function calSum (line 26) | func calSum(mid, m int, nums []int) bool { FILE: leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/1011. Capacity To Ship Packages Within D Days_test.go type question1011 (line 8) | type question1011 struct type para1011 (line 15) | type para1011 struct type ans1011 (line 22) | type ans1011 struct function Test_Problem1011 (line 26) | func Test_Problem1011(t *testing.T) { FILE: leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2.go function baseNeg2 (line 5) | func baseNeg2(N int) string { FILE: leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2_test.go type question1017 (line 8) | type question1017 struct type para1017 (line 15) | type para1017 struct type ans1017 (line 21) | type ans1017 struct function Test_Problem1017 (line 25) | func Test_Problem1017(t *testing.T) { FILE: leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5.go function prefixesDivBy5 (line 3) | func prefixesDivBy5(a []int) []bool { FILE: leetcode/1018.Binary-Prefix-Divisible-By-5/1018. Binary Prefix Divisible By 5_test.go type question1018 (line 8) | type question1018 struct type para1018 (line 15) | type para1018 struct type ans1018 (line 21) | type ans1018 struct function Test_Problem1018 (line 25) | func Test_Problem1018(t *testing.T) { FILE: leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go function nextLargerNodes (line 19) | func nextLargerNodes(head *ListNode) []int { FILE: leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List_test.go type question1019 (line 10) | type question1019 struct type para1019 (line 17) | type para1019 struct type ans1019 (line 23) | type ans1019 struct function Test_Problem1019 (line 27) | func Test_Problem1019(t *testing.T) { FILE: leetcode/1020.Number-of-Enclaves/1020. Number of Enclaves.go function numEnclaves (line 10) | func numEnclaves(A [][]int) int { function dfsNumEnclaves (line 32) | func dfsNumEnclaves(A [][]int, x, y int) { function isInGrid (line 44) | func isInGrid(grid [][]int, x, y int) bool { FILE: leetcode/1020.Number-of-Enclaves/1020. Number of Enclaves_test.go type question1020 (line 8) | type question1020 struct type para1020 (line 15) | type para1020 struct type ans1020 (line 21) | type ans1020 struct function Test_Problem1020 (line 25) | func Test_Problem1020(t *testing.T) { FILE: leetcode/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses.go function removeOuterParentheses (line 4) | func removeOuterParentheses(S string) string { function removeOuterParentheses1 (line 22) | func removeOuterParentheses1(S string) string { FILE: leetcode/1021.Remove-Outermost-Parentheses/1021. Remove Outermost Parentheses_test.go type question1021 (line 8) | type question1021 struct type para1021 (line 15) | type para1021 struct type ans1021 (line 21) | type ans1021 struct function Test_Problem1021 (line 25) | func Test_Problem1021(t *testing.T) { FILE: leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers.go function sumRootToLeaf (line 16) | func sumRootToLeaf(root *TreeNode) int { FILE: leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers/1022. Sum of Root To Leaf Binary Numbers_test.go type question1022 (line 10) | type question1022 struct type para1022 (line 17) | type para1022 struct type ans1022 (line 23) | type ans1022 struct function Test_Problem1022 (line 27) | func Test_Problem1022(t *testing.T) { FILE: leetcode/1025.Divisor-Game/1025. Divisor Game.go function divisorGame (line 3) | func divisorGame(N int) bool { FILE: leetcode/1025.Divisor-Game/1025. Divisor Game_test.go type question1025 (line 8) | type question1025 struct type para1025 (line 15) | type para1025 struct type ans1025 (line 21) | type ans1025 struct function Test_Problem1025 (line 25) | func Test_Problem1025(t *testing.T) { FILE: leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor.go function maxAncestorDiff (line 18) | func maxAncestorDiff(root *TreeNode) int { function dfsAncestorDiff (line 24) | func dfsAncestorDiff(root *TreeNode, res *int) (int, int) { function max (line 42) | func max(a int, b int) int { function min (line 49) | func min(a int, b int) int { function abs (line 56) | func abs(a int) int { FILE: leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/1026. Maximum Difference Between Node and Ancestor_test.go type question1026 (line 10) | type question1026 struct type para1026 (line 17) | type para1026 struct type ans1026 (line 23) | type ans1026 struct function Test_Problem1026 (line 27) | func Test_Problem1026(t *testing.T) { FILE: leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal.go function recoverFromPreorder (line 21) | func recoverFromPreorder(S string) *TreeNode { function dfsBuildPreorderTree (line 31) | func dfsBuildPreorderTree(S string, index, level *int, cur *TreeNode) (n... function isDigital (line 79) | func isDigital(v byte) bool { FILE: leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/1028. Recover a Tree From Preorder Traversal_test.go type question1028 (line 10) | type question1028 struct type para1028 (line 17) | type para1028 struct type ans1028 (line 23) | type ans1028 struct function Test_Problem1028 (line 27) | func Test_Problem1028(t *testing.T) { FILE: leetcode/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order.go function allCellsDistOrder (line 3) | func allCellsDistOrder(R int, C int, r0 int, c0 int) [][]int { function max (line 25) | func max(a int, b int) int { function abs (line 32) | func abs(a int) int { FILE: leetcode/1030.Matrix-Cells-in-Distance-Order/1030. Matrix Cells in Distance Order_test.go type question1030 (line 8) | type question1030 struct type para1030 (line 15) | type para1030 struct type ans1030 (line 24) | type ans1030 struct function Test_Problem1030 (line 28) | func Test_Problem1030(t *testing.T) { FILE: leetcode/1034.Coloring-A-Border/1034.Coloring A Border.go type point (line 3) | type point struct type gridInfo (line 8) | type gridInfo struct function colorBorder (line 15) | func colorBorder(grid [][]int, row, col, color int) [][]int { function dfs (line 36) | func dfs(x, y int, gInfo gridInfo, dirs []point, vis [][]bool, borders *... FILE: leetcode/1034.Coloring-A-Border/1034.Coloring A Border_test.go type question1034 (line 8) | type question1034 struct type para1034 (line 14) | type para1034 struct type ans1034 (line 22) | type ans1034 struct function Test_Problem1034 (line 26) | func Test_Problem1034(t *testing.T) { FILE: leetcode/1037.Valid-Boomerang/1037. Valid Boomerang.go function isBoomerang (line 3) | func isBoomerang(points [][]int) bool { FILE: leetcode/1037.Valid-Boomerang/1037. Valid Boomerang_test.go type question1037 (line 8) | type question1037 struct type para1037 (line 15) | type para1037 struct type ans1037 (line 21) | type ans1037 struct function Test_Problem1037 (line 25) | func Test_Problem1037(t *testing.T) { FILE: leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree.go function bstToGst (line 19) | func bstToGst(root *TreeNode) *TreeNode { function dfs1038 (line 28) | func dfs1038(root *TreeNode, sum *int) { FILE: leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038. Binary Search Tree to Greater Sum Tree_test.go type question1038 (line 10) | type question1038 struct type para1038 (line 17) | type para1038 struct type ans1038 (line 23) | type ans1038 struct function Test_Problem1038 (line 27) | func Test_Problem1038(t *testing.T) { FILE: leetcode/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II.go function numMovesStonesII (line 8) | func numMovesStonesII(stones []int) []int { function max (line 36) | func max(a int, b int) int { function min (line 43) | func min(a int, b int) int { FILE: leetcode/1040.Moving-Stones-Until-Consecutive-II/1040. Moving Stones Until Consecutive II_test.go type question1040 (line 8) | type question1040 struct type para1040 (line 15) | type para1040 struct type ans1040 (line 21) | type ans1040 struct function Test_Problem1040 (line 25) | func Test_Problem1040(t *testing.T) { FILE: leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String.go function removeDuplicates1047 (line 3) | func removeDuplicates1047(S string) string { FILE: leetcode/1047.Remove-All-Adjacent-Duplicates-In-String/1047. Remove All Adjacent Duplicates In String_test.go type question1047 (line 8) | type question1047 struct type para1047 (line 15) | type para1047 struct type ans1047 (line 21) | type ans1047 struct function Test_Problem1047 (line 25) | func Test_Problem1047(t *testing.T) { FILE: leetcode/1048.Longest-String-Chain/1048. Longest String Chain.go function longestStrChain (line 5) | func longestStrChain(words []string) int { function max (line 26) | func max(a, b int) int { function isPredecessor (line 33) | func isPredecessor(long, short string) bool { FILE: leetcode/1048.Longest-String-Chain/1048. Longest String Chain_test.go type question1048 (line 8) | type question1048 struct type para1048 (line 15) | type para1048 struct type ans1048 (line 21) | type ans1048 struct function Test_Problem1048 (line 25) | func Test_Problem1048(t *testing.T) { FILE: leetcode/1049.Last-Stone-Weight-II/1049. Last Stone Weight II.go function lastStoneWeightII (line 3) | func lastStoneWeightII(stones []int) int { function max (line 24) | func max(a int, b int) int { FILE: leetcode/1049.Last-Stone-Weight-II/1049. Last Stone Weight II_test.go type question1049 (line 8) | type question1049 struct type para1049 (line 15) | type para1049 struct type ans1049 (line 21) | type ans1049 struct function Test_Problem1049 (line 25) | func Test_Problem1049(t *testing.T) { FILE: leetcode/1051.Height-Checker/1051. Height Checker.go function heightChecker (line 5) | func heightChecker(heights []int) int { FILE: leetcode/1051.Height-Checker/1051. Height Checker_test.go type question1051 (line 8) | type question1051 struct type para1051 (line 15) | type para1051 struct type ans1051 (line 21) | type ans1051 struct function Test_Problem1051 (line 25) | func Test_Problem1051(t *testing.T) { FILE: leetcode/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner.go function maxSatisfied (line 4) | func maxSatisfied(customers []int, grumpy []int, X int) int { function maxSatisfied1 (line 26) | func maxSatisfied1(customers []int, grumpy []int, X int) int { function max (line 41) | func max(a int, b int) int { function sumSatisfied (line 48) | func sumSatisfied(customers []int, grumpy []int, start, end int) int { FILE: leetcode/1052.Grumpy-Bookstore-Owner/1052. Grumpy Bookstore Owner_test.go type question1052 (line 8) | type question1052 struct type para1052 (line 15) | type para1052 struct type ans1052 (line 23) | type ans1052 struct function Test_Problem1052 (line 27) | func Test_Problem1052(t *testing.T) { FILE: leetcode/1054.Distant-Barcodes/1054. Distant Barcodes.go function rearrangeBarcodes (line 5) | func rearrangeBarcodes(barcodes []int) []int { function barcodesFrequencySort (line 22) | func barcodesFrequencySort(s []int) []int { FILE: leetcode/1054.Distant-Barcodes/1054. Distant Barcodes_test.go type question1054 (line 8) | type question1054 struct type para1054 (line 15) | type para1054 struct type ans1054 (line 21) | type ans1054 struct function Test_Problem1054 (line 25) | func Test_Problem1054(t *testing.T) { FILE: leetcode/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers.go function addNegabinary (line 4) | func addNegabinary(arr1 []int, arr2 []int) []int { function addNegabinary1 (line 27) | func addNegabinary1(arr1 []int, arr2 []int) []int { function negabinaryToInt (line 31) | func negabinaryToInt(arr []int) int { function intToNegabinary (line 47) | func intToNegabinary(num int) []int { FILE: leetcode/1073.Adding-Two-Negabinary-Numbers/1073. Adding Two Negabinary Numbers_test.go type question1073 (line 8) | type question1073 struct type para1073 (line 15) | type para1073 struct type ans1073 (line 22) | type ans1073 struct function Test_Problem1073 (line 26) | func Test_Problem1073(t *testing.T) { FILE: leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target.go function numSubmatrixSumTarget (line 3) | func numSubmatrixSumTarget(matrix [][]int, target int) int { function numSubmatrixSumTarget1 (line 29) | func numSubmatrixSumTarget1(matrix [][]int, target int) int { function numSubmatrixSumTarget2 (line 49) | func numSubmatrixSumTarget2(matrix [][]int, target int) int { function sumSubmatrix (line 66) | func sumSubmatrix(matrix [][]int, startx, starty, endx, endy int) int { FILE: leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/1074. Number of Submatrices That Sum to Target_test.go type question1074 (line 8) | type question1074 struct type para1074 (line 15) | type para1074 struct type ans1074 (line 22) | type ans1074 struct function Test_Problem1074 (line 26) | func Test_Problem1074(t *testing.T) { FILE: leetcode/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram.go function findOcurrences (line 5) | func findOcurrences(text string, first string, second string) []string { FILE: leetcode/1078.Occurrences-After-Bigram/1078. Occurrences After Bigram_test.go type question1078 (line 8) | type question1078 struct type para1078 (line 15) | type para1078 struct type ans1078 (line 23) | type ans1078 struct function Test_Problem1078 (line 27) | func Test_Problem1078(t *testing.T) { FILE: leetcode/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities.go function numTilePossibilities (line 4) | func numTilePossibilities(tiles string) int { function numTileDFS (line 16) | func numTileDFS(arr []int) (r int) { function numTilePossibilities1 (line 30) | func numTilePossibilities1(tiles string) int { function findTile (line 36) | func findTile(tiles, tmp []byte, used *[]bool, index int, res *int, tMap... FILE: leetcode/1079.Letter-Tile-Possibilities/1079. Letter Tile Possibilities_test.go type question1079 (line 8) | type question1079 struct type para1079 (line 15) | type para1079 struct type ans1079 (line 21) | type ans1079 struct function Test_Problem1079 (line 25) | func Test_Problem1079(t *testing.T) { FILE: leetcode/1089.Duplicate-Zeros/1089. Duplicate Zeros.go function duplicateZeros (line 3) | func duplicateZeros(arr []int) { FILE: leetcode/1089.Duplicate-Zeros/1089. Duplicate Zeros_test.go type question1089 (line 8) | type question1089 struct type para1089 (line 15) | type para1089 struct type ans1089 (line 21) | type ans1089 struct function Test_Problem1089 (line 24) | func Test_Problem1089(t *testing.T) { FILE: leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix.go function shortestPathBinaryMatrix (line 14) | func shortestPathBinaryMatrix(grid [][]int) int { function isInBoard (line 52) | func isInBoard(board [][]int, x, y int) bool { FILE: leetcode/1091.Shortest-Path-in-Binary-Matrix/1091. Shortest Path in Binary Matrix_test.go type question1091 (line 8) | type question1091 struct type para1091 (line 15) | type para1091 struct type ans1091 (line 21) | type ans1091 struct function Test_Problem1091 (line 25) | func Test_Problem1091(t *testing.T) { FILE: leetcode/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample.go function sampleStats (line 3) | func sampleStats(count []int) []float64 { FILE: leetcode/1093.Statistics-from-a-Large-Sample/1093. Statistics from a Large Sample_test.go type question1093 (line 8) | type question1093 struct type para1093 (line 15) | type para1093 struct type ans1093 (line 21) | type ans1093 struct function Test_Problem1093 (line 25) | func Test_Problem1093(t *testing.T) { FILE: leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree.go function pathInZigZagTree (line 3) | func pathInZigZagTree(label int) []int { function getLevel (line 17) | func getLevel(label int) int { function getParent (line 29) | func getParent(index int, level int) (parent int, parentIndex int) { function reverse (line 35) | func reverse(nums []int) []int { FILE: leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree/1104.Path In Zigzag Labelled Binary Tree_test.go type question1104 (line 8) | type question1104 struct type para1104 (line 14) | type para1104 struct type ans1104 (line 19) | type ans1104 struct function Test_Problem1104 (line 23) | func Test_Problem1104(t *testing.T) { FILE: leetcode/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves.go function minHeightShelves (line 3) | func minHeightShelves(books [][]int, shelfWidth int) int { function max (line 18) | func max(a int, b int) int { function min (line 25) | func min(a int, b int) int { FILE: leetcode/1105.Filling-Bookcase-Shelves/1105. Filling Bookcase Shelves_test.go type question1105 (line 8) | type question1105 struct type para1105 (line 15) | type para1105 struct type ans1105 (line 22) | type ans1105 struct function Test_Problem1105 (line 26) | func Test_Problem1105(t *testing.T) { FILE: leetcode/1108.Defanging-an-IP-Address/1108. Defanging an IP Address.go function defangIPaddr (line 5) | func defangIPaddr(address string) string { FILE: leetcode/1108.Defanging-an-IP-Address/1108. Defanging an IP Address_test.go type question1108 (line 8) | type question1108 struct type para1108 (line 15) | type para1108 struct type ans1108 (line 21) | type ans1108 struct function Test_Problem1108 (line 25) | func Test_Problem1108(t *testing.T) { FILE: leetcode/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest.go function delNodes (line 18) | func delNodes(root *TreeNode, toDelete []int) []*TreeNode { function dfsDelNodes (line 30) | func dfsDelNodes(root *TreeNode, toDel map[int]bool, isRoot bool, res *[... FILE: leetcode/1110.Delete-Nodes-And-Return-Forest/1110. Delete Nodes And Return Forest_test.go type question1110 (line 10) | type question1110 struct type para1110 (line 17) | type para1110 struct type ans1110 (line 24) | type ans1110 struct function Test_Problem1110 (line 28) | func Test_Problem1110(t *testing.T) { FILE: leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.go function maxDepthAfterSplit (line 4) | func maxDepthAfterSplit(seq string) []int { function max (line 35) | func max(a int, b int) int { function maxDepthAfterSplit1 (line 43) | func maxDepthAfterSplit1(seq string) []int { FILE: leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111. Maximum Nesting Depth of Two Valid Parentheses Strings_test.go type question1111 (line 8) | type question1111 struct type para1111 (line 15) | type para1111 struct type ans1111 (line 21) | type ans1111 struct function Test_Problem1111 (line 25) | func Test_Problem1111(t *testing.T) { FILE: leetcode/1122.Relative-Sort-Array/1122. Relative Sort Array.go function relativeSortArray (line 6) | func relativeSortArray(A, B []int) []int { function relativeSortArray1 (line 28) | func relativeSortArray1(arr1 []int, arr2 []int) []int { FILE: leetcode/1122.Relative-Sort-Array/1122. Relative Sort Array_test.go type question1122 (line 8) | type question1122 struct type para1122 (line 15) | type para1122 struct type ans1122 (line 22) | type ans1122 struct function Test_Problem1122 (line 26) | func Test_Problem1122(t *testing.T) { FILE: leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves.go function lcaDeepestLeaves (line 19) | func lcaDeepestLeaves(root *TreeNode) *TreeNode { function lcaDeepestLeavesDFS (line 28) | func lcaDeepestLeavesDFS(lca **TreeNode, maxLevel *int, depth int, root ... function max (line 41) | func max(a int, b int) int { FILE: leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/1123. Lowest Common Ancestor of Deepest Leaves_test.go type question1123 (line 10) | type question1123 struct type para1123 (line 17) | type para1123 struct type ans1123 (line 23) | type ans1123 struct function Test_Problem1123 (line 27) | func Test_Problem1123(t *testing.T) { FILE: leetcode/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs.go function numEquivDominoPairs (line 3) | func numEquivDominoPairs(dominoes [][]int) int { FILE: leetcode/1128.Number-of-Equivalent-Domino-Pairs/1128. Number of Equivalent Domino Pairs_test.go type question1128 (line 8) | type question1128 struct type para1128 (line 15) | type para1128 struct type ans1128 (line 21) | type ans1128 struct function Test_Problem1128 (line 25) | func Test_Problem1128(t *testing.T) { FILE: leetcode/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number.go function tribonacci (line 3) | func tribonacci(n int) int { FILE: leetcode/1137.N-th-Tribonacci-Number/1137. N-th Tribonacci Number_test.go type question1137 (line 8) | type question1137 struct type para1137 (line 15) | type para1137 struct type ans1137 (line 21) | type ans1137 struct function Test_Problem1137 (line 25) | func Test_Problem1137(t *testing.T) { FILE: leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence.go function longestCommonSubsequence (line 3) | func longestCommonSubsequence(text1 string, text2 string) int { function max (line 23) | func max(a, b int) int { FILE: leetcode/1143.Longest-Common-Subsequence/1143. Longest Common Subsequence_test.go type question1143 (line 8) | type question1143 struct type para1143 (line 15) | type para1143 struct type ans1143 (line 22) | type ans1143 struct function Test_Problem1143 (line 26) | func Test_Problem1143(t *testing.T) { FILE: leetcode/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game.go function btreeGameWinningMove (line 19) | func btreeGameWinningMove(root *TreeNode, n int, x int) bool { function dfsBtreeGameWinningMove (line 27) | func dfsBtreeGameWinningMove(node *TreeNode, left, right *int, x int) int { FILE: leetcode/1145.Binary-Tree-Coloring-Game/1145. Binary Tree Coloring Game_test.go type question1145 (line 10) | type question1145 struct type para1145 (line 17) | type para1145 struct type ans1145 (line 25) | type ans1145 struct function Test_Problem1145 (line 29) | func Test_Problem1145(t *testing.T) { FILE: leetcode/1154.Day-of-the-Year/1154. Day of the Year.go function dayOfYear (line 5) | func dayOfYear(date string) int { FILE: leetcode/1154.Day-of-the-Year/1154. Day of the Year_test.go type question1154 (line 8) | type question1154 struct type para1154 (line 15) | type para1154 struct type ans1154 (line 21) | type ans1154 struct function Test_Problem1154 (line 25) | func Test_Problem1154(t *testing.T) { FILE: leetcode/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray.go type segmentItem (line 7) | type segmentItem struct type MajorityChecker (line 13) | type MajorityChecker struct method buildSegmentTree (line 49) | func (mc *MajorityChecker) buildSegmentTree(treeIndex, left, right int) { method leftChild (line 61) | func (mc *MajorityChecker) leftChild(index int) int { method rightChild (line 65) | func (mc *MajorityChecker) rightChild(index int) int { method query (line 70) | func (mc *MajorityChecker) query(left, right int) segmentItem { method queryInTree (line 77) | func (mc *MajorityChecker) queryInTree(treeIndex, left, right, queryLe... method Query (line 93) | func (mc *MajorityChecker) Query(left int, right int, threshold int) i... function Constructor1157 (line 21) | func Constructor1157(arr []int) MajorityChecker { FILE: leetcode/1157.Online-Majority-Element-In-Subarray/1157. Online Majority Element In Subarray_test.go function Test_Problem1157 (line 8) | func Test_Problem1157(t *testing.T) { FILE: leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters.go function countCharacters (line 3) | func countCharacters(words []string, chars string) int { function canBeFormed (line 15) | func canBeFormed(w string, c []int) bool { FILE: leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/1160. Find Words That Can Be Formed by Characters_test.go type question1160 (line 8) | type question1160 struct type para1160 (line 15) | type para1160 struct type ans1160 (line 22) | type ans1160 struct function Test_Problem1160 (line 26) | func Test_Problem1160(t *testing.T) { FILE: leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character.go function numSmallerByFrequency (line 5) | func numSmallerByFrequency(queries []string, words []string) []int { function countFunc (line 18) | func countFunc(s string) int { FILE: leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/1170. Compare Strings by Frequency of the Smallest Character_test.go type question1170 (line 8) | type question1170 struct type para1170 (line 15) | type para1170 struct type ans1170 (line 22) | type ans1170 struct function Test_Problem1170 (line 26) | func Test_Problem1170(t *testing.T) { FILE: leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List.go function removeZeroSumSublists (line 19) | func removeZeroSumSublists(head *ListNode) *ListNode { function removeZeroSumSublists1 (line 53) | func removeZeroSumSublists1(head *ListNode) *ListNode { FILE: leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171. Remove Zero Sum Consecutive Nodes from Linked List_test.go type question1171 (line 10) | type question1171 struct type para1171 (line 17) | type para1171 struct type ans1171 (line 23) | type ans1171 struct function Test_Problem1171 (line 27) | func Test_Problem1171(t *testing.T) { FILE: leetcode/1175.Prime-Arrangements/1175. Prime Arrangements.go function numPrimeArrangements (line 7) | func numPrimeArrangements(n int) int { function factorial (line 12) | func factorial(n int) int { FILE: leetcode/1175.Prime-Arrangements/1175. Prime Arrangements_test.go type question1175 (line 8) | type question1175 struct type para1175 (line 15) | type para1175 struct type ans1175 (line 21) | type ans1175 struct function Test_Problem1175 (line 25) | func Test_Problem1175(t *testing.T) { FILE: leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle.go function findNumOfValidWords (line 9) | func findNumOfValidWords(words []string, puzzles []string) []int { function toBitMap (line 24) | func toBitMap(word []byte) uint32 { function findNum (line 33) | func findNum(puzzles []byte, bitMap uint32, totalNum *int, m map[uint32]... FILE: leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle/1178. Number of Valid Words for Each Puzzle_test.go function Test_findNumOfValidWords (line 8) | func Test_findNumOfValidWords(t *testing.T) { FILE: leetcode/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops.go function distanceBetweenBusStops (line 3) | func distanceBetweenBusStops(distance []int, start int, destination int)... FILE: leetcode/1184.Distance-Between-Bus-Stops/1184. Distance Between Bus Stops_test.go type question1184 (line 8) | type question1184 struct type para1184 (line 15) | type para1184 struct type ans1184 (line 23) | type ans1184 struct function Test_Problem1184 (line 27) | func Test_Problem1184(t *testing.T) { FILE: leetcode/1185.Day-of-the-Week/1185. Day of the Week.go function dayOfTheWeek (line 5) | func dayOfTheWeek(day int, month int, year int) string { FILE: leetcode/1185.Day-of-the-Week/1185. Day of the Week_test.go type question1185 (line 8) | type question1185 struct type para1185 (line 15) | type para1185 struct type ans1185 (line 23) | type ans1185 struct function Test_Problem1185 (line 27) | func Test_Problem1185(t *testing.T) { FILE: leetcode/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons.go function maxNumberOfBalloons (line 3) | func maxNumberOfBalloons(text string) int { function min (line 16) | func min(a int, b int) int { FILE: leetcode/1189.Maximum-Number-of-Balloons/1189. Maximum Number of Balloons_test.go type question1189 (line 8) | type question1189 struct type para1189 (line 15) | type para1189 struct type ans1189 (line 21) | type ans1189 struct function Test_Problem1189 (line 25) | func Test_Problem1189(t *testing.T) { FILE: leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses.go function reverseParentheses (line 3) | func reverseParentheses(s string) string { FILE: leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190. Reverse Substrings Between Each Pair of Parentheses_test.go type question1190 (line 8) | type question1190 struct type para1190 (line 15) | type para1190 struct type ans1190 (line 21) | type ans1190 struct function Test_Problem1190 (line 25) | func Test_Problem1190(t *testing.T) { FILE: leetcode/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference.go function minimumAbsDifference (line 8) | func minimumAbsDifference(arr []int) [][]int { FILE: leetcode/1200.Minimum-Absolute-Difference/1200. Minimum Absolute Difference_test.go type question1200 (line 8) | type question1200 struct type para1200 (line 15) | type para1200 struct type ans1200 (line 21) | type ans1200 struct function Test_Problem1200 (line 25) | func Test_Problem1200(t *testing.T) { FILE: leetcode/1201.Ugly-Number-III/1201. Ugly Number III.go function nthUglyNumber (line 3) | func nthUglyNumber(n int, a int, b int, c int) int { function calNthCount (line 16) | func calNthCount(num, a, b, c int64) int64 { function gcd (line 22) | func gcd(a, b int64) int64 { FILE: leetcode/1201.Ugly-Number-III/1201. Ugly Number III_test.go type question1201 (line 8) | type question1201 struct type para1201 (line 15) | type para1201 struct type ans1201 (line 24) | type ans1201 struct function Test_Problem1201 (line 28) | func Test_Problem1201(t *testing.T) { FILE: leetcode/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps.go function smallestStringWithSwaps (line 9) | func smallestStringWithSwaps(s string, pairs [][]int) string { FILE: leetcode/1202.Smallest-String-With-Swaps/1202. Smallest String With Swaps_test.go type question1202 (line 8) | type question1202 struct type para1202 (line 15) | type para1202 struct type ans1202 (line 22) | type ans1202 struct function Test_Problem1202 (line 26) | func Test_Problem1202(t *testing.T) { FILE: leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies.go function sortItems (line 4) | func sortItems(n int, m int, group []int, beforeItems [][]int) []int { function sortItemsDFS (line 48) | func sortItemsDFS(i, n int, res, inDegrees *[]int, groups *[][]int) { function sortItems1 (line 61) | func sortItems1(n int, m int, group []int, beforeItems [][]int) []int { function topSort (line 104) | func topSort(graph [][]int, deg, items []int) (orders []int) { FILE: leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies/1203. Sort Items by Groups Respecting Dependencies_test.go type question1203 (line 8) | type question1203 struct type para1203 (line 15) | type para1203 struct type ans1203 (line 24) | type ans1203 struct function Test_Problem1203 (line 28) | func Test_Problem1203(t *testing.T) { FILE: leetcode/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences.go function uniqueOccurrences (line 3) | func uniqueOccurrences(arr []int) bool { FILE: leetcode/1207.Unique-Number-of-Occurrences/1207. Unique Number of Occurrences_test.go type question1207 (line 8) | type question1207 struct type para1207 (line 15) | type para1207 struct type ans1207 (line 21) | type ans1207 struct function Test_Problem1207 (line 25) | func Test_Problem1207(t *testing.T) { FILE: leetcode/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget.go function equalSubstring (line 3) | func equalSubstring(s string, t string, maxCost int) int { function max (line 18) | func max(a int, b int) int { function abs (line 25) | func abs(a int) int { FILE: leetcode/1208.Get-Equal-Substrings-Within-Budget/1208. Get Equal Substrings Within Budget_test.go type question1208 (line 8) | type question1208 struct type para1208 (line 15) | type para1208 struct type ans1208 (line 23) | type ans1208 struct function Test_Problem1208 (line 27) | func Test_Problem1208(t *testing.T) { FILE: leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II.go function removeDuplicates (line 4) | func removeDuplicates(s string, k int) string { function removeDuplicates1 (line 27) | func removeDuplicates1(s string, k int) string { FILE: leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II/1209. Remove All Adjacent Duplicates in String II_test.go type question1209 (line 8) | type question1209 struct type para1209 (line 15) | type para1209 struct type ans1209 (line 22) | type ans1209 struct function Test_Problem1209 (line 26) | func Test_Problem1209(t *testing.T) { FILE: leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/1217. Minimum Cost to Move Chips to The Same Position.go function minCostToMoveChips (line 3) | func minCostToMoveChips(chips []int) int { function min (line 15) | func min(a int, b int) int { FILE: leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/1217. Minimum Cost to Move Chips to The Same Position_test.go type question1217 (line 8) | type question1217 struct type para1217 (line 15) | type para1217 struct type ans1217 (line 21) | type ans1217 struct function Test_Problem1217 (line 25) | func Test_Problem1217(t *testing.T) { FILE: leetcode/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings.go function balancedStringSplit (line 3) | func balancedStringSplit(s string) int { FILE: leetcode/1221.Split-a-String-in-Balanced-Strings/1221. Split a String in Balanced Strings_test.go type question1221 (line 8) | type question1221 struct type para1221 (line 15) | type para1221 struct type ans1221 (line 21) | type ans1221 struct function Test_Problem1221 (line 25) | func Test_Problem1221(t *testing.T) { FILE: leetcode/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line.go function checkStraightLine (line 3) | func checkStraightLine(coordinates [][]int) bool { FILE: leetcode/1232.Check-If-It-Is-a-Straight-Line/1232. Check If It Is a Straight Line_test.go type question1232 (line 8) | type question1232 struct type para1232 (line 15) | type para1232 struct type ans1232 (line 21) | type ans1232 struct function Test_Problem1232 (line 25) | func Test_Problem1232(t *testing.T) { FILE: leetcode/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String.go function balancedString (line 3) | func balancedString(s string) int { function min (line 26) | func min(a int, b int) int { FILE: leetcode/1234.Replace-the-Substring-for-Balanced-String/1234. Replace the Substring for Balanced String_test.go type question1234 (line 8) | type question1234 struct type para1234 (line 15) | type para1234 struct type ans1234 (line 21) | type ans1234 struct function Test_Problem1234 (line 25) | func Test_Problem1234(t *testing.T) { FILE: leetcode/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling.go type job (line 5) | type job struct function jobScheduling (line 11) | func jobScheduling(startTime []int, endTime []int, profit []int) int { function max (line 37) | func max(a int, b int) int { type sortJobs (line 44) | type sortJobs method Len (line 46) | func (s sortJobs) Len() int { method Less (line 49) | func (s sortJobs) Less(i, j int) bool { method Swap (line 55) | func (s sortJobs) Swap(i, j int) { FILE: leetcode/1235.Maximum-Profit-in-Job-Scheduling/1235. Maximum Profit in Job Scheduling_test.go type question1235 (line 8) | type question1235 struct type para1235 (line 15) | type para1235 struct type ans1235 (line 23) | type ans1235 struct function Test_Problem1235 (line 27) | func Test_Problem1235(t *testing.T) { FILE: leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters.go function maxLength (line 7) | func maxLength(arr []string) int { function dfs (line 23) | func dfs(c []uint32, index int, mask uint32, res *int) { function max (line 33) | func max(a, b int) int { FILE: leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239. Maximum Length of a Concatenated String with Unique Characters_test.go type question1239 (line 8) | type question1239 struct type para1239 (line 15) | type para1239 struct type ans1239 (line 21) | type ans1239 struct function Test_Problem1239 (line 25) | func Test_Problem1239(t *testing.T) { FILE: leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses.go function minRemoveToMakeValid (line 3) | func minRemoveToMakeValid(s string) string { FILE: leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses/1249. Minimum Remove to Make Valid Parentheses_test.go type question1249 (line 8) | type question1249 struct type para1249 (line 15) | type para1249 struct type ans1249 (line 21) | type ans1249 struct function Test_Problem1249 (line 25) | func Test_Problem1249(t *testing.T) { FILE: leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix.go function oddCells (line 4) | func oddCells(n int, m int, indices [][]int) int { function oddCells1 (line 28) | func oddCells1(n int, m int, indices [][]int) int { FILE: leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/1252. Cells with Odd Values in a Matrix_test.go type question1252 (line 8) | type question1252 struct type para1252 (line 15) | type para1252 struct type ans1252 (line 23) | type ans1252 struct function Test_Problem1252 (line 27) | func Test_Problem1252(t *testing.T) { FILE: leetcode/1254.Number-of-Closed-Islands/1254. Number of Closed Islands.go function closedIsland (line 10) | func closedIsland(grid [][]int) int { function checkIslands (line 38) | func checkIslands(grid [][]int, visited *[][]bool, x, y int, isEdge *boo... function isIntInBoard (line 53) | func isIntInBoard(board [][]int, x, y int) bool { FILE: leetcode/1254.Number-of-Closed-Islands/1254. Number of Closed Islands_test.go type question1254 (line 8) | type question1254 struct type para1254 (line 15) | type para1254 struct type ans1254 (line 21) | type ans1254 struct function Test_Problem1254 (line 25) | func Test_Problem1254(t *testing.T) { FILE: leetcode/1260.Shift-2D-Grid/1260. Shift 2D Grid.go function shiftGrid (line 3) | func shiftGrid(grid [][]int, k int) [][]int { FILE: leetcode/1260.Shift-2D-Grid/1260. Shift 2D Grid_test.go type question1260 (line 8) | type question1260 struct type para1260 (line 15) | type para1260 struct type ans1260 (line 22) | type ans1260 struct function Test_Problem1260 (line 26) | func Test_Problem1260(t *testing.T) { FILE: leetcode/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points.go function minTimeToVisitAllPoints (line 3) | func minTimeToVisitAllPoints(points [][]int) int { function max (line 11) | func max(a int, b int) int { function abs (line 18) | func abs(a int) int { FILE: leetcode/1266.Minimum-Time-Visiting-All-Points/1266. Minimum Time Visiting All Points_test.go type question1266 (line 8) | type question1266 struct type para1266 (line 15) | type para1266 struct type ans1266 (line 21) | type ans1266 struct function Test_Problem1266 (line 25) | func Test_Problem1266(t *testing.T) { FILE: leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System.go function suggestedProducts (line 7) | func suggestedProducts(products []string, searchWord string) [][]string { FILE: leetcode/1268.Search-Suggestions-System/1268. Search Suggestions System_test.go type question1268 (line 8) | type question1268 struct type para1268 (line 15) | type para1268 struct type ans1268 (line 22) | type ans1268 struct function Test_Problem1268 (line 26) | func Test_Problem1268(t *testing.T) { FILE: leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game/1275. Find Winner on a Tic Tac Toe Game.go function tictactoe (line 3) | func tictactoe(moves [][]int) string { FILE: leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game/1275. Find Winner on a Tic Tac Toe Game_test.go type question1275 (line 8) | type question1275 struct type para1275 (line 15) | type para1275 struct type ans1275 (line 21) | type ans1275 struct function Test_Problem1275 (line 25) | func Test_Problem1275(t *testing.T) { FILE: leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer.go function subtractProductAndSum (line 3) | func subtractProductAndSum(n int) int { FILE: leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281. Subtract the Product and Sum of Digits of an Integer_test.go type question1281 (line 8) | type question1281 struct type para1281 (line 15) | type para1281 struct type ans1281 (line 21) | type ans1281 struct function Test_Problem1281 (line 25) | func Test_Problem1281(t *testing.T) { FILE: leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold.go function smallestDivisor (line 3) | func smallestDivisor(nums []int, threshold int) int { function calDivisor (line 16) | func calDivisor(nums []int, mid, threshold int) bool { FILE: leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/1283. Find the Smallest Divisor Given a Threshold_test.go type question1283 (line 8) | type question1283 struct type para1283 (line 15) | type para1283 struct type ans1283 (line 22) | type ans1283 struct function Test_Problem1283 (line 26) | func Test_Problem1283(t *testing.T) { FILE: leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array.go function findSpecialInteger (line 3) | func findSpecialInteger(arr []int) int { FILE: leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/1287. Element Appearing More Than 25% In Sorted Array_test.go type question1287 (line 8) | type question1287 struct type para1287 (line 15) | type para1287 struct type ans1287 (line 21) | type ans1287 struct function Test_Problem1287 (line 25) | func Test_Problem1287(t *testing.T) { FILE: leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer.go function getDecimalValue (line 17) | func getDecimalValue(head *ListNode) int { FILE: leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/1290. Convert Binary Number in a Linked List to Integer_test.go type question1290 (line 10) | type question1290 struct type para1290 (line 17) | type para1290 struct type ans1290 (line 23) | type ans1290 struct function Test_Problem1290 (line 27) | func Test_Problem1290(t *testing.T) { FILE: leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination.go type pos (line 10) | type pos struct function shortestPath (line 16) | func shortestPath(grid [][]int, k int) int { function isInBoard (line 69) | func isInBoard(board [][]int, x, y int) bool { FILE: leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293. Shortest Path in a Grid with Obstacles Elimination_test.go type question1293 (line 8) | type question1293 struct type para1293 (line 15) | type para1293 struct type ans1293 (line 22) | type ans1293 struct function Test_Problem1293 (line 26) | func Test_Problem1293(t *testing.T) { FILE: leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits.go function findNumbers (line 5) | func findNumbers(nums []int) int { FILE: leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/1295. Find Numbers with Even Number of Digits_test.go type question1295 (line 8) | type question1295 struct type para1295 (line 15) | type para1295 struct type ans1295 (line 21) | type ans1295 struct function Test_Problem1295 (line 25) | func Test_Problem1295(t *testing.T) { FILE: leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers.go function isPossibleDivide (line 5) | func isPossibleDivide(nums []int, k int) bool { FILE: leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.Divide Array in Sets of K Consecutive Numbers_test.go type question1296 (line 8) | type question1296 struct type para1296 (line 14) | type para1296 struct type ans1296 (line 20) | type ans1296 struct function Test_Problem1296 (line 24) | func Test_Problem1296(t *testing.T) { FILE: leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side.go function replaceElements (line 3) | func replaceElements(arr []int) []int { function max (line 13) | func max(a int, b int) int { FILE: leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/1299. Replace Elements with Greatest Element on Right Side_test.go type question1299 (line 8) | type question1299 struct type para1299 (line 15) | type para1299 struct type ans1299 (line 21) | type ans1299 struct function Test_Problem1299 (line 25) | func Test_Problem1299(t *testing.T) { FILE: leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target.go function findBestValue (line 3) | func findBestValue(arr []int, target int) int { function calculateSum (line 30) | func calculateSum(arr []int, mid int) int { function min (line 38) | func min(a int, b int) int { FILE: leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/1300. Sum of Mutated Array Closest to Target_test.go type question1300 (line 8) | type question1300 struct type para1300 (line 15) | type para1300 struct type ans1300 (line 22) | type ans1300 struct function Test_Problem1300 (line 26) | func Test_Problem1300(t *testing.T) { FILE: leetcode/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum.go function deepestLeavesSum (line 18) | func deepestLeavesSum(root *TreeNode) int { function dfsDeepestLeavesSum (line 24) | func dfsDeepestLeavesSum(root *TreeNode, level int, maxLevel, sum *int) { FILE: leetcode/1302.Deepest-Leaves-Sum/1302. Deepest Leaves Sum_test.go type question1302 (line 10) | type question1302 struct type para1302 (line 17) | type para1302 struct type ans1302 (line 23) | type ans1302 struct function Test_Problem1302 (line 27) | func Test_Problem1302(t *testing.T) { FILE: leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero.go function sumZero (line 3) | func sumZero(n int) []int { FILE: leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/1304. Find N Unique Integers Sum up to Zero_test.go type question1304 (line 8) | type question1304 struct type para1304 (line 15) | type para1304 struct type ans1304 (line 21) | type ans1304 struct function Test_Problem1304 (line 25) | func Test_Problem1304(t *testing.T) { FILE: leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees.go function getAllElements (line 22) | func getAllElements(root1 *TreeNode, root2 *TreeNode) []int { function inorderTraversal (line 31) | func inorderTraversal(root *TreeNode) []int { function inorder (line 37) | func inorder(root *TreeNode, output *[]int) { function merge (line 46) | func merge(nums1 []int, m int, nums2 []int, n int) { function getAllElements1 (line 75) | func getAllElements1(root1 *TreeNode, root2 *TreeNode) []int { function preorderTraversal (line 84) | func preorderTraversal(root *TreeNode) []int { FILE: leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go type question1305 (line 10) | type question1305 struct type para1305 (line 17) | type para1305 struct type ans1305 (line 24) | type ans1305 struct function Test_Problem1305 (line 28) | func Test_Problem1305(t *testing.T) { FILE: leetcode/1306.Jump-Game-III/1306. Jump Game III.go function canReach (line 3) | func canReach(arr []int, start int) bool { FILE: leetcode/1306.Jump-Game-III/1306. Jump Game III_test.go type question1306 (line 8) | type question1306 struct type para1306 (line 15) | type para1306 struct type ans1306 (line 22) | type ans1306 struct function Test_Problem1306 (line 26) | func Test_Problem1306(t *testing.T) { FILE: leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray.go function xorQueries (line 3) | func xorQueries(arr []int, queries [][]int) []int { FILE: leetcode/1310.XOR-Queries-of-a-Subarray/1310. XOR Queries of a Subarray_test.go type question1310 (line 8) | type question1310 struct type para1310 (line 15) | type para1310 struct type ans1310 (line 22) | type ans1310 struct function Test_Problem1310 (line 26) | func Test_Problem1310(t *testing.T) { FILE: leetcode/1313.Decompress-Run-Length-Encoded-List/1313. Decompress Run-Length Encoded List.go function decompressRLElist (line 3) | func decompressRLElist(nums []int) []int { FILE: leetcode/1313.Decompress-Run-Length-Encoded-List/1313. Decompress Run-Length Encoded List_test.go type question1313 (line 8) | type question1313 struct type para1313 (line 15) | type para1313 struct type ans1313 (line 21) | type ans1313 struct function Test_Problem1313 (line 25) | func Test_Problem1313(t *testing.T) { FILE: leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317. Convert Integer to the Sum of Two No-Zero Integers.go function getNoZeroIntegers (line 3) | func getNoZeroIntegers(n int) []int { function isNoZero (line 14) | func isNoZero(n int) bool { FILE: leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317. Convert Integer to the Sum of Two No-Zero Integers_test.go type question1317 (line 8) | type question1317 struct type para1317 (line 15) | type para1317 struct type ans1317 (line 21) | type ans1317 struct function Test_Problem1317 (line 25) | func Test_Problem1317(t *testing.T) { FILE: leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected.go function makeConnected (line 7) | func makeConnected(n int, connections [][]int) int { FILE: leetcode/1319.Number-of-Operations-to-Make-Network-Connected/1319. Number of Operations to Make Network Connected_test.go type question1319 (line 8) | type question1319 struct type para1319 (line 15) | type para1319 struct type ans1319 (line 22) | type ans1319 struct function Test_Problem1319 (line 26) | func Test_Problem1319(t *testing.T) { FILE: leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally.go function diagonalSort (line 7) | func diagonalSort(mat [][]int) [][]int { FILE: leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally_test.go type question1329 (line 8) | type question1329 struct type para1329 (line 15) | type para1329 struct type ans1329 (line 21) | type ans1329 struct function Test_Problem1329 (line 25) | func Test_Problem1329(t *testing.T) { FILE: leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences.go function removePalindromeSub (line 3) | func removePalindromeSub(s string) int { FILE: leetcode/1332.Remove-Palindromic-Subsequences/1332. Remove Palindromic Subsequences_test.go type question1332 (line 8) | type question1332 struct type para1332 (line 15) | type para1332 struct type ans1332 (line 21) | type ans1332 struct function Test_Problem1332 (line 25) | func Test_Problem1332(t *testing.T) { FILE: leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix.go function kWeakestRows (line 3) | func kWeakestRows(mat [][]int, k int) []int { FILE: leetcode/1337.The-K-Weakest-Rows-in-a-Matrix/1337. The K Weakest Rows in a Matrix_test.go type question1337 (line 8) | type question1337 struct type para1337 (line 15) | type para1337 struct type ans1337 (line 22) | type ans1337 struct function Test_Problem1337 (line 26) | func Test_Problem1337(t *testing.T) { FILE: leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended.go function maxEvents (line 7) | func maxEvents(events [][]int) int { function max (line 30) | func max(a, b int) int { FILE: leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended/1353. Maximum Number of Events That Can Be Attended_test.go type question1353 (line 8) | type question1353 struct type para1353 (line 15) | type para1353 struct type ans1353 (line 21) | type ans1353 struct function Test_Problem1353 (line 25) | func Test_Problem1353(t *testing.T) { FILE: leetcode/1380.Lucky-Numbers-in-a-Matrix/1380. Lucky Numbers in a Matrix.go function luckyNumbers (line 3) | func luckyNumbers(matrix [][]int) []int { FILE: leetcode/1380.Lucky-Numbers-in-a-Matrix/1380. Lucky Numbers in a Matrix_test.go type question1380 (line 8) | type question1380 struct type para1380 (line 15) | type para1380 struct type ans1380 (line 21) | type ans1380 struct function Test_Problem1380 (line 25) | func Test_Problem1380(t *testing.T) { FILE: leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team.go function maxPerformance (line 8) | func maxPerformance(n int, speed []int, efficiency []int, k int) int { type speedHeap (line 31) | type speedHeap method Less (line 33) | func (h speedHeap) Less(i, j int) bool { return h[i] < h[j] } method Swap (line 34) | func (h speedHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] } method Len (line 35) | func (h speedHeap) Len() int { return len(h) } method Push (line 36) | func (h *speedHeap) Push(x interface{}) { *h = append(*h, x.(int)) } method Pop (line 37) | func (h *speedHeap) Pop() interface{} { function Max (line 43) | func Max(a, b int64) int64 { FILE: leetcode/1383.Maximum-Performance-of-a-Team/1383. Maximum Performance of a Team_test.go type question1383 (line 8) | type question1383 struct type para1383 (line 15) | type para1383 struct type ans1383 (line 24) | type ans1383 struct function Test_Problem1383 (line 28) | func Test_Problem1383(t *testing.T) { FILE: leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays/1385. Find the Distance Value Between Two Arrays.go function findTheDistanceValue (line 3) | func findTheDistanceValue(arr1 []int, arr2 []int, d int) int { function abs (line 18) | func abs(a int) int { FILE: leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays/1385. Find the Distance Value Between Two Arrays_test.go type question1385 (line 8) | type question1385 struct type para1385 (line 15) | type para1385 struct type ans1385 (line 23) | type ans1385 struct function Test_Problem1385 (line 27) | func Test_Problem1385(t *testing.T) { FILE: leetcode/1389.Create-Target-Array-in-the-Given-Order/1389. Create Target Array in the Given Order.go function createTargetArray (line 3) | func createTargetArray(nums []int, index []int) []int { FILE: leetcode/1389.Create-Target-Array-in-the-Given-Order/1389. Create Target Array in the Given Order_test.go type question1389 (line 8) | type question1389 struct type para1389 (line 15) | type para1389 struct type ans1389 (line 22) | type ans1389 struct function Test_Problem1389 (line 26) | func Test_Problem1389(t *testing.T) { FILE: leetcode/1396.Design-Underground-System/1396. Design Underground System.go type checkin (line 3) | type checkin struct type stationTime (line 8) | type stationTime struct type UndergroundSystem (line 12) | type UndergroundSystem struct method CheckIn (line 24) | func (s *UndergroundSystem) CheckIn(id int, stationName string, t int) { method CheckOut (line 28) | func (s *UndergroundSystem) CheckOut(id int, stationName string, t int) { method GetAverageTime (line 44) | func (s *UndergroundSystem) GetAverageTime(startStation string, endSta... function Constructor (line 17) | func Constructor() UndergroundSystem { FILE: leetcode/1396.Design-Underground-System/1396. Design Underground System_test.go function Test_Problem (line 8) | func Test_Problem(t *testing.T) { FILE: leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards.go function maxScore (line 3) | func maxScore(cardPoints []int, k int) int { FILE: leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards/1423. Maximum Points You Can Obtain from Cards_test.go type question1423 (line 8) | type question1423 struct type para1423 (line 15) | type para1423 struct type ans1423 (line 22) | type ans1423 struct function Test_Problem1423 (line 26) | func Test_Problem1423(t *testing.T) { FILE: leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away.go function kLengthApart (line 3) | func kLengthApart(nums []int, k int) bool { FILE: leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/1437. Check If All 1s Are at Least Length K Places Away_test.go type question1437 (line 8) | type question1437 struct type para1437 (line 15) | type para1437 struct type ans1437 (line 22) | type ans1437 struct function Test_Problem1437 (line 26) | func Test_Problem1437(t *testing.T) { FILE: leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.go function longestSubarray (line 3) | func longestSubarray(nums []int, limit int) int { FILE: leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit_test.go type question1438 (line 8) | type question1438 struct type para1438 (line 15) | type para1438 struct type ans1438 (line 22) | type ans1438 struct function Test_Problem1438 (line 26) | func Test_Problem1438(t *testing.T) { FILE: leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.go function kthSmallest (line 5) | func kthSmallest(mat [][]int, k int) int { function kSmallestPairs (line 19) | func kSmallestPairs(nums1 []int, nums2 []int, k int) []int { type pddata (line 54) | type pddata struct type priorityQueue (line 60) | type priorityQueue method Len (line 68) | func (pq priorityQueue) Len() int { return len(pq) } method Swap (line 69) | func (pq priorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq... method Less (line 70) | func (pq priorityQueue) Less(i, j int) bool { return pq[i].n1+pq[i].n2... method Pop (line 71) | func (pq *priorityQueue) Pop() interface{} { method Push (line 79) | func (pq *priorityQueue) Push(i interface{}) { function newPriorityQueue (line 62) | func newPriorityQueue() *priorityQueue { FILE: leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows_test.go type question1439 (line 8) | type question1439 struct type para1439 (line 15) | type para1439 struct type ans1439 (line 22) | type ans1439 struct function Test_Problem1439 (line 26) | func Test_Problem1439(t *testing.T) { FILE: leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR.go function countTriplets (line 3) | func countTriplets(arr []int) int { FILE: leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442. Count Triplets That Can Form Two Arrays of Equal XOR_test.go type question1442 (line 8) | type question1442 struct type para1442 (line 15) | type para1442 struct type ans1442 (line 21) | type ans1442 struct function Test_Problem1442 (line 25) | func Test_Problem1442(t *testing.T) { FILE: leetcode/1446.Consecutive-Characters/1446.Consecutive Characters.go function maxPower (line 3) | func maxPower(s string) int { FILE: leetcode/1446.Consecutive-Characters/1446.Consecutive Characters_test.go type question1446 (line 8) | type question1446 struct type para1446 (line 14) | type para1446 struct type ans1446 (line 19) | type ans1446 struct function Test_Problem1446 (line 23) | func Test_Problem1446(t *testing.T) { FILE: leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.go function isPrefixOfWord (line 5) | func isPrefixOfWord(sentence string, searchWord string) int { FILE: leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence_test.go type question1455 (line 8) | type question1455 struct type para1455 (line 15) | type para1455 struct type ans1455 (line 22) | type ans1455 struct function Test_Problem1455 (line 26) | func Test_Problem1455(t *testing.T) { FILE: leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K.go function hasAllCodes (line 5) | func hasAllCodes(s string, k int) bool { FILE: leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/1461. Check If a String Contains All Binary Codes of Size K_test.go type question1461 (line 8) | type question1461 struct type para1461 (line 15) | type para1461 struct type ans1461 (line 22) | type ans1461 struct function Test_Problem1461 (line 26) | func Test_Problem1461(t *testing.T) { FILE: leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II.go function cherryPickup (line 3) | func cherryPickup(grid [][]int) int { function isInBoard (line 47) | func isInBoard(dp [][][]int, i, j, k int) int { FILE: leetcode/1463.Cherry-Pickup-II/1463. Cherry Pickup II_test.go type question1463 (line 8) | type question1463 struct type para1463 (line 13) | type para1463 struct type ans1463 (line 17) | type ans1463 struct function Test_Problem1463 (line 21) | func Test_Problem1463(t *testing.T) { FILE: leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array/1464. Maximum Product of Two Elements in an Array.go function maxProduct (line 3) | func maxProduct(nums []int) int { FILE: leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array/1464. Maximum Product of Two Elements in an Array_test.go type question1464 (line 8) | type question1464 struct type para1464 (line 15) | type para1464 struct type ans1464 (line 21) | type ans1464 struct function Test_Problem1464 (line 25) | func Test_Problem1464(t *testing.T) { FILE: leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.go function maxArea (line 5) | func maxArea(h int, w int, horizontalCuts []int, verticalCuts []int) int { FILE: leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts_test.go type question1465 (line 8) | type question1465 struct type para1465 (line 15) | type para1465 struct type ans1465 (line 24) | type ans1465 struct function Test_Problem1465 (line 28) | func Test_Problem1465(t *testing.T) { FILE: leetcode/1470.Shuffle-the-Array/1470. Shuffle the Array.go function shuffle (line 3) | func shuffle(nums []int, n int) []int { FILE: leetcode/1470.Shuffle-the-Array/1470. Shuffle the Array_test.go type question1470 (line 8) | type question1470 struct type para1470 (line 15) | type para1470 struct type ans1470 (line 22) | type ans1470 struct function Test_Problem1470 (line 26) | func Test_Problem1470(t *testing.T) { FILE: leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array.go function runningSum (line 3) | func runningSum(nums []int) []int { FILE: leetcode/1480.Running-Sum-of-1d-Array/1480. Running Sum of 1d Array_test.go type question1480 (line 8) | type question1480 struct type para1480 (line 15) | type para1480 struct type ans1480 (line 21) | type ans1480 struct function Test_Problem1480 (line 25) | func Test_Problem1480(t *testing.T) { FILE: leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets.go function minDays (line 5) | func minDays(bloomDay []int, m int, k int) int { FILE: leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/1482. Minimum Number of Days to Make m Bouquets_test.go type question1482 (line 8) | type question1482 struct type para1482 (line 15) | type para1482 struct type ans1482 (line 23) | type ans1482 struct function Test_Problem1482 (line 27) | func Test_Problem1482(t *testing.T) { FILE: leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array.go function xorOperation (line 3) | func xorOperation(n int, start int) int { FILE: leetcode/1486.XOR-Operation-in-an-Array/1486. XOR Operation in an Array_test.go type question1486 (line 8) | type question1486 struct type para1486 (line 15) | type para1486 struct type ans1486 (line 22) | type ans1486 struct function Test_Problem1486 (line 26) | func Test_Problem1486(t *testing.T) { FILE: leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs.go function numIdenticalPairs (line 3) | func numIdenticalPairs(nums []int) int { FILE: leetcode/1512.Number-of-Good-Pairs/1512. Number of Good Pairs_test.go type question1512 (line 8) | type question1512 struct type para1512 (line 15) | type para1512 struct type ans1512 (line 21) | type ans1512 struct function Test_Problem1512 (line 25) | func Test_Problem1512(t *testing.T) { FILE: leetcode/1518.Water-Bottles/1518.Water Bottles.go function numWaterBottles (line 3) | func numWaterBottles(numBottles int, numExchange int) int { FILE: leetcode/1518.Water-Bottles/1518.Water Bottles_test.go type question1518 (line 8) | type question1518 struct type para1518 (line 14) | type para1518 struct type ans1518 (line 20) | type ans1518 struct function Test_Problem1518 (line 24) | func Test_Problem1518(t *testing.T) { FILE: leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number.go function findKthPositive (line 3) | func findKthPositive(arr []int, k int) int { FILE: leetcode/1539.Kth-Missing-Positive-Number/1539. Kth Missing Positive Number_test.go type question1539 (line 8) | type question1539 struct type para1539 (line 15) | type para1539 struct type ans1539 (line 22) | type ans1539 struct function Test_Problem1539 (line 26) | func Test_Problem1539(t *testing.T) { FILE: leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal.go function minOperations (line 3) | func minOperations(n int) int { FILE: leetcode/1551.Minimum-Operations-to-Make-Array-Equal/1551. Minimum Operations to Make Array Equal_test.go type question1551 (line 8) | type question1551 struct type para1551 (line 15) | type para1551 struct type ans1551 (line 21) | type ans1551 struct function Test_Problem1551 (line 25) | func Test_Problem1551(t *testing.T) { FILE: leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum.go function diagonalSum (line 3) | func diagonalSum(mat [][]int) int { FILE: leetcode/1572.Matrix-Diagonal-Sum/1572.Matrix Diagonal Sum_test.go type question1572 (line 8) | type question1572 struct type para1572 (line 14) | type para1572 struct type ans1572 (line 20) | type ans1572 struct function Test_Problem1572 (line 24) | func Test_Problem1572(t *testing.T) { FILE: leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String.go function numWays (line 3) | func numWays(s string) int { FILE: leetcode/1573.Number-of-Ways-to-Split-a-String/1573. Number of Ways to Split a String_test.go type question1573 (line 8) | type question1573 struct type para1573 (line 15) | type para1573 struct type ans1573 (line 21) | type ans1573 struct function Test_Problem1573 (line 25) | func Test_Problem1573(t *testing.T) { FILE: leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.go function modifyString (line 3) | func modifyString(s string) string { FILE: leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/1576. Replace-All-s-to-Avoid-Consecutive-Repeating-Characters_test.go type question1576 (line 8) | type question1576 struct type para1576 (line 15) | type para1576 struct type ans1576 (line 21) | type ans1576 struct function Test_Problem1576 (line 25) | func Test_Problem1576(t *testing.T) { FILE: leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable.go function maxNumEdgesToRemove (line 7) | func maxNumEdgesToRemove(n int, edges [][]int) int { FILE: leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go type question1579 (line 8) | type question1579 struct type para1579 (line 15) | type para1579 struct type ans1579 (line 22) | type ans1579 struct function Test_Problem1579 (line 26) | func Test_Problem1579(t *testing.T) { FILE: leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go type ThroneInheritance (line 3) | type ThroneInheritance struct method Birth (line 13) | func (t *ThroneInheritance) Birth(parentName, childName string) { method Death (line 17) | func (t *ThroneInheritance) Death(name string) { method GetInheritanceOrder (line 21) | func (t *ThroneInheritance) GetInheritanceOrder() (res []string) { function Constructor (line 9) | func Constructor(kingName string) (t ThroneInheritance) { FILE: leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go function Test_Problem1600 (line 8) | func Test_Problem1600(t *testing.T) { FILE: leetcode/1603.Design-Parking-System/1603. Design Parking System.go type ParkingSystem (line 3) | type ParkingSystem struct method AddCar (line 17) | func (this *ParkingSystem) AddCar(carType int) bool { function Constructor (line 9) | func Constructor(big int, medium int, small int) ParkingSystem { FILE: leetcode/1603.Design-Parking-System/1603. Design Parking System_test.go function Test_Problem1603 (line 8) | func Test_Problem1603(t *testing.T) { FILE: leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X.go function specialArray (line 5) | func specialArray(nums []int) int { FILE: leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/1608. Special Array With X Elements Greater Than or Equal X_test.go type question1608 (line 8) | type question1608 struct type para1608 (line 15) | type para1608 struct type ans1608 (line 21) | type ans1608 struct function Test_Problem1608 (line 25) | func Test_Problem1608(t *testing.T) { FILE: leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree.go type TreeNode (line 3) | type TreeNode struct function isEvenOddTree (line 9) | func isEvenOddTree(root *TreeNode) bool { function odd (line 40) | func odd(nums []int) bool { function even (line 57) | func even(nums []int) bool { FILE: leetcode/1609.Even-Odd-Tree/1609.Even Odd Tree_test.go type question1609 (line 8) | type question1609 struct type para1609 (line 14) | type para1609 struct type ans1609 (line 19) | type ans1609 struct function Test_Problem1609 (line 23) | func Test_Problem1609(t *testing.T) { FILE: leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses.go function maxDepth (line 3) | func maxDepth(s string) int { function max (line 16) | func max(a, b int) int { FILE: leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses/1614. Maximum Nesting Depth of the Parentheses_test.go type question1614 (line 8) | type question1614 struct type para1614 (line 15) | type para1614 struct type ans1614 (line 21) | type ans1614 struct function Test_Problem1614 (line 25) | func Test_Problem1614(t *testing.T) { FILE: leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements.go function trimMean (line 5) | func trimMean(arr []int) float64 { FILE: leetcode/1619.Mean-of-Array-After-Removing-Some-Elements/1619. Mean of Array After Removing Some Elements_test.go type question1619 (line 8) | type question1619 struct type para1619 (line 15) | type para1619 struct type ans1619 (line 21) | type ans1619 struct function Test_Problem1619 (line 25) | func Test_Problem1619(t *testing.T) { FILE: leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters.go function maxLengthBetweenEqualCharacters (line 5) | func maxLengthBetweenEqualCharacters(s string) int { FILE: leetcode/1624.Largest-Substring-Between-Two-Equal-Characters/1624. Largest Substring Between Two Equal Characters_test.go type question1624 (line 8) | type question1624 struct type para1624 (line 15) | type para1624 struct type ans1624 (line 21) | type ans1624 struct function Test_Problem1624 (line 25) | func Test_Problem1624(t *testing.T) { FILE: leetcode/1629.Slowest-Key/1629. Slowest Key.go function slowestKey (line 3) | func slowestKey(releaseTimes []int, keysPressed string) byte { FILE: leetcode/1629.Slowest-Key/1629. Slowest Key_test.go type question1629 (line 8) | type question1629 struct type para1629 (line 15) | type para1629 struct type ans1629 (line 22) | type ans1629 struct function Test_Problem1629 (line 26) | func Test_Problem1629(t *testing.T) { FILE: leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort.go function minimumEffortPath (line 17) | func minimumEffortPath(heights [][]int) int { function hasPath (line 40) | func hasPath(heights [][]int, visited [][]bool, i, j, threshold int) bool { function abs (line 60) | func abs(a int) int { function min (line 67) | func min(a, b int) int { function max (line 74) | func max(a, b int) int { function minimumEffortPath1 (line 82) | func minimumEffortPath1(heights [][]int) int { type edge (line 106) | type edge struct FILE: leetcode/1631.Path-With-Minimum-Effort/1631. Path With Minimum Effort_test.go type question1631 (line 8) | type question1631 struct type para1631 (line 15) | type para1631 struct type ans1631 (line 21) | type ans1631 struct function Test_Problem1631 (line 25) | func Test_Problem1631(t *testing.T) { FILE: leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency.go function frequencySort (line 5) | func frequencySort(nums []int) []int { FILE: leetcode/1636.Sort-Array-by-Increasing-Frequency/1636. Sort Array by Increasing Frequency_test.go type question1636 (line 8) | type question1636 struct type para1636 (line 15) | type para1636 struct type ans1636 (line 21) | type ans1636 struct function Test_Problem1636 (line 25) | func Test_Problem1636(t *testing.T) { FILE: leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation.go function canFormArray (line 3) | func canFormArray(arr []int, pieces [][]int) bool { FILE: leetcode/1640.Check-Array-Formation-Through-Concatenation/1640. Check Array Formation Through Concatenation_test.go type question1640 (line 8) | type question1640 struct type para1640 (line 15) | type para1640 struct type ans1640 (line 22) | type ans1640 struct function Test_Problem1640 (line 26) | func Test_Problem1640(t *testing.T) { FILE: leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings.go function countVowelStrings (line 4) | func countVowelStrings(n int) int { function makeTable (line 9) | func makeTable() []int { function countVowelStringsDFS (line 19) | func countVowelStringsDFS(n, index int, cur []string, vowels []string, r... function countVowelStrings1 (line 33) | func countVowelStrings1(n int) int { FILE: leetcode/1641.Count-Sorted-Vowel-Strings/1641. Count Sorted Vowel Strings_test.go type question1641 (line 8) | type question1641 struct type para1641 (line 15) | type para1641 struct type ans1641 (line 21) | type ans1641 struct function Test_Problem1641 (line 25) | func Test_Problem1641(t *testing.T) { FILE: leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach.go function furthestBuilding (line 7) | func furthestBuilding(heights []int, bricks int, ladder int) int { type heightDiffPQ (line 30) | type heightDiffPQ method Len (line 32) | func (pq heightDiffPQ) Len() int { return len(pq) } method Less (line 33) | func (pq heightDiffPQ) Less(i, j int) bool { return pq[i] < pq[j] } method Swap (line 34) | func (pq heightDiffPQ) Swap(i, j int) { pq[i], pq[j] = pq[j], pq... method Push (line 35) | func (pq *heightDiffPQ) Push(x interface{}) { *pq = append(*pq, x.(int... method Pop (line 36) | func (pq *heightDiffPQ) Pop() interface{} { FILE: leetcode/1642.Furthest-Building-You-Can-Reach/1642. Furthest Building You Can Reach_test.go type question1642 (line 8) | type question1642 struct type para1642 (line 15) | type para1642 struct type ans1642 (line 23) | type ans1642 struct function Test_Problem1642 (line 27) | func Test_Problem1642(t *testing.T) { FILE: leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array.go function getMaximumGenerated (line 3) | func getMaximumGenerated(n int) int { FILE: leetcode/1646.Get-Maximum-in-Generated-Array/1646. Get Maximum in Generated Array_test.go type question1646 (line 8) | type question1646 struct type para1646 (line 15) | type para1646 struct type ans1646 (line 21) | type ans1646 struct function Test_Problem1646 (line 25) | func Test_Problem1646(t *testing.T) { FILE: leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique.go function minDeletions (line 7) | func minDeletions(s string) int { FILE: leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/1647. Minimum Deletions to Make Character Frequencies Unique_test.go type question1647 (line 8) | type question1647 struct type para1647 (line 15) | type para1647 struct type ans1647 (line 21) | type ans1647 struct function Test_Problem1647 (line 25) | func Test_Problem1647(t *testing.T) { FILE: leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls.go function maxProfit (line 8) | func maxProfit(inventory []int, orders int) int { function max (line 47) | func max(a int, b int) int { function maxProfit_ (line 55) | func maxProfit_(inventory []int, orders int) int { type Item (line 70) | type Item struct type PriorityQueue (line 75) | type PriorityQueue method Len (line 77) | func (pq PriorityQueue) Len() int { method Less (line 81) | func (pq PriorityQueue) Less(i, j int) bool { method Swap (line 86) | func (pq PriorityQueue) Swap(i, j int) { method Push (line 91) | func (pq *PriorityQueue) Push(x interface{}) { method Pop (line 97) | func (pq *PriorityQueue) Pop() interface{} { FILE: leetcode/1648.Sell-Diminishing-Valued-Colored-Balls/1648. Sell Diminishing-Valued Colored Balls_test.go type question1648 (line 8) | type question1648 struct type para1648 (line 15) | type para1648 struct type ans1648 (line 22) | type ans1648 struct function Test_Problem1648 (line 26) | func Test_Problem1648(t *testing.T) { FILE: leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions.go function createSortedArray (line 10) | func createSortedArray(instructions []int) int { function createSortedArray1 (line 23) | func createSortedArray1(instructions []int) int { function discretization1649 (line 42) | func discretization1649(instructions []int) (map[int]int, []int, []int) { function min (line 60) | func min(a int, b int) int { FILE: leetcode/1649.Create-Sorted-Array-through-Instructions/1649. Create Sorted Array through Instructions_test.go type question1649 (line 8) | type question1649 struct type para1649 (line 15) | type para1649 struct type ans1649 (line 21) | type ans1649 struct function Test_Problem1649 (line 25) | func Test_Problem1649(t *testing.T) { FILE: leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb.go function decrypt (line 3) | func decrypt(code []int, k int) []int { FILE: leetcode/1652.Defuse-the-Bomb/1652. Defuse the Bomb_test.go type question1652 (line 8) | type question1652 struct type para1652 (line 15) | type para1652 struct type ans1652 (line 22) | type ans1652 struct function Test_Problem1652 (line 26) | func Test_Problem1652(t *testing.T) { FILE: leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced.go function minimumDeletions (line 4) | func minimumDeletions(s string) int { function min (line 17) | func min(a, b int) int { function minimumDeletions1 (line 25) | func minimumDeletions1(s string) int { FILE: leetcode/1653.Minimum-Deletions-to-Make-String-Balanced/1653. Minimum Deletions to Make String Balanced_test.go type question1653 (line 8) | type question1653 struct type para1653 (line 15) | type para1653 struct type ans1653 (line 21) | type ans1653 struct function Test_Problem1653 (line 25) | func Test_Problem1653(t *testing.T) { FILE: leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home.go function minimumJumps (line 3) | func minimumJumps(forbidden []int, a int, b int, x int) int { FILE: leetcode/1654.Minimum-Jumps-to-Reach-Home/1654. Minimum Jumps to Reach Home_test.go type question1654 (line 8) | type question1654 struct type para1654 (line 15) | type para1654 struct type ans1654 (line 24) | type ans1654 struct function Test_Problem1654 (line 28) | func Test_Problem1654(t *testing.T) { FILE: leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers.go function canDistribute (line 3) | func canDistribute(nums []int, quantity []int) bool { function dfs (line 11) | func dfs(freq map[int]int, quantity []int) bool { FILE: leetcode/1655.Distribute-Repeating-Integers/1655. Distribute Repeating Integers_test.go type question1655 (line 8) | type question1655 struct type para1655 (line 15) | type para1655 struct type ans1655 (line 22) | type ans1655 struct function Test_Problem1655 (line 26) | func Test_Problem1655(t *testing.T) { FILE: leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream.go type OrderedStream (line 3) | type OrderedStream struct method Insert (line 13) | func (this *OrderedStream) Insert(id int, value string) []string { function Constructor (line 8) | func Constructor(n int) OrderedStream { FILE: leetcode/1656.Design-an-Ordered-Stream/1656. Design an Ordered Stream_test.go function Test_Problem1656 (line 8) | func Test_Problem1656(t *testing.T) { FILE: leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close.go function closeStrings (line 7) | func closeStrings(word1 string, word2 string) bool { FILE: leetcode/1657.Determine-if-Two-Strings-Are-Close/1657. Determine if Two Strings Are Close_test.go type question1657 (line 8) | type question1657 struct type para1657 (line 15) | type para1657 struct type ans1657 (line 22) | type ans1657 struct function Test_Problem1657 (line 26) | func Test_Problem1657(t *testing.T) { FILE: leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero.go function minOperations (line 3) | func minOperations(nums []int, x int) int { function max (line 35) | func max(a, b int) int { FILE: leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero/1658. Minimum Operations to Reduce X to Zero_test.go type question1658 (line 8) | type question1658 struct type para1658 (line 15) | type para1658 struct type ans1658 (line 22) | type ans1658 struct function Test_Problem1658 (line 26) | func Test_Problem1658(t *testing.T) { FILE: leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness.go function getMaxGridHappiness (line 7) | func getMaxGridHappiness(m int, n int, introvertsCount int, extrovertsCo... function closeScore (line 66) | func closeScore(x, y int) int { function dfs (line 81) | func dfs(lineStatusLast, row, introvertsCount, extrovertsCount, m, n3 in... function max (line 102) | func max(a int, b int) int { FILE: leetcode/1659.Maximize-Grid-Happiness/1659. Maximize Grid Happiness_test.go type question1659 (line 8) | type question1659 struct type para1659 (line 15) | type para1659 struct type ans1659 (line 24) | type ans1659 struct function Test_Problem1659 (line 28) | func Test_Problem1659(t *testing.T) { FILE: leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent.go function arrayStringsAreEqual (line 3) | func arrayStringsAreEqual(word1 []string, word2 []string) bool { FILE: leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent/1662. Check If Two String Arrays are Equivalent_test.go type question1662 (line 8) | type question1662 struct type para1662 (line 15) | type para1662 struct type ans1662 (line 22) | type ans1662 struct function Test_Problem1662 (line 26) | func Test_Problem1662(t *testing.T) { FILE: leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value.go function getSmallestString (line 4) | func getSmallestString(n int, k int) string { function getSmallestString1 (line 19) | func getSmallestString1(n int, k int) string { function findSmallestString (line 28) | func findSmallestString(value int, length, k, index int, str []byte, res... FILE: leetcode/1663.Smallest-String-With-A-Given-Numeric-Value/1663. Smallest String With A Given Numeric Value_test.go type question1663 (line 8) | type question1663 struct type para1663 (line 15) | type para1663 struct type ans1663 (line 22) | type ans1663 struct function Test_Problem1663 (line 26) | func Test_Problem1663(t *testing.T) { FILE: leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array.go function waysToMakeFair (line 4) | func waysToMakeFair(nums []int) int { function waysToMakeFair1 (line 20) | func waysToMakeFair1(nums []int) int { FILE: leetcode/1664.Ways-to-Make-a-Fair-Array/1664. Ways to Make a Fair Array_test.go type question1664 (line 8) | type question1664 struct type para1664 (line 15) | type para1664 struct type ans1664 (line 21) | type ans1664 struct function Test_Problem1664 (line 25) | func Test_Problem1664(t *testing.T) { FILE: leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks.go function minimumEffort (line 7) | func minimumEffort(tasks [][]int) int { function max (line 21) | func max(a, b int) int { type Task (line 29) | type Task method Len (line 31) | func (task Task) Len() int { method Less (line 35) | func (task Task) Less(i, j int) bool { method Swap (line 43) | func (task Task) Swap(i, j int) { FILE: leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks/1665. Minimum Initial Energy to Finish Tasks_test.go type question1665 (line 8) | type question1665 struct type para1665 (line 15) | type para1665 struct type ans1665 (line 21) | type ans1665 struct function Test_Problem1665 (line 25) | func Test_Problem1665(t *testing.T) { FILE: leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring.go function maxRepeating (line 7) | func maxRepeating(sequence string, word string) int { FILE: leetcode/1668.Maximum-Repeating-Substring/1668. Maximum Repeating Substring_test.go type question1668 (line 8) | type question1668 struct type para1668 (line 15) | type para1668 struct type ans1668 (line 22) | type ans1668 struct function Test_Problem1668 (line 26) | func Test_Problem1668(t *testing.T) { FILE: leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists.go function mergeInBetween (line 18) | func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *Lis... FILE: leetcode/1669.Merge-In-Between-Linked-Lists/1669. Merge In Between Linked Lists_test.go type question1669 (line 10) | type question1669 struct type para1669 (line 17) | type para1669 struct type ans1669 (line 26) | type ans1669 struct function Test_Problem1669 (line 30) | func Test_Problem1669(t *testing.T) { FILE: leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue.go type FrontMiddleBackQueue (line 7) | type FrontMiddleBackQueue struct method PushFront (line 16) | func (this *FrontMiddleBackQueue) PushFront(val int) { method PushMiddle (line 25) | func (this *FrontMiddleBackQueue) PushMiddle(val int) { method PushBack (line 37) | func (this *FrontMiddleBackQueue) PushBack(val int) { method PopFront (line 46) | func (this *FrontMiddleBackQueue) PopFront() int { method PopMiddle (line 59) | func (this *FrontMiddleBackQueue) PopMiddle() int { method PopBack (line 72) | func (this *FrontMiddleBackQueue) PopBack() int { function Constructor (line 12) | func Constructor() FrontMiddleBackQueue { FILE: leetcode/1670.Design-Front-Middle-Back-Queue/1670. Design Front Middle Back Queue_test.go function Test_Problem1670 (line 8) | func Test_Problem1670(t *testing.T) { function MList2Ints (line 105) | func MList2Ints(this *FrontMiddleBackQueue) []int { FILE: leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth.go function maximumWealth (line 3) | func maximumWealth(accounts [][]int) int { FILE: leetcode/1672.Richest-Customer-Wealth/1672. Richest Customer Wealth_test.go type question1672 (line 8) | type question1672 struct type para1672 (line 15) | type para1672 struct type ans1672 (line 21) | type ans1672 struct function Test_Problem1672 (line 25) | func Test_Problem1672(t *testing.T) { FILE: leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence.go function mostCompetitive (line 4) | func mostCompetitive(nums []int, k int) []int { FILE: leetcode/1673.Find-the-Most-Competitive-Subsequence/1673. Find the Most Competitive Subsequence_test.go type question1673 (line 8) | type question1673 struct type para1673 (line 15) | type para1673 struct type ans1673 (line 22) | type ans1673 struct function Test_Problem1673 (line 26) | func Test_Problem1673(t *testing.T) { FILE: leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary.go function minMoves (line 3) | func minMoves(nums []int, limit int) int { function min (line 22) | func min(a, b int) int { function max (line 29) | func max(a, b int) int { FILE: leetcode/1674.Minimum-Moves-to-Make-Array-Complementary/1674. Minimum Moves to Make Array Complementary_test.go type question1674 (line 8) | type question1674 struct type para1674 (line 15) | type para1674 struct type ans1674 (line 22) | type ans1674 struct function Test_Problem1674 (line 26) | func Test_Problem1674(t *testing.T) { FILE: leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array.go function minimumDeviation (line 3) | func minimumDeviation(nums []int) int { FILE: leetcode/1675.Minimize-Deviation-in-Array/1675. Minimize Deviation in Array_test.go type question1675 (line 8) | type question1675 struct type para1675 (line 15) | type para1675 struct type ans1675 (line 21) | type ans1675 struct function Test_Problem1675 (line 25) | func Test_Problem1675(t *testing.T) { FILE: leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation.go function interpret (line 3) | func interpret(command string) string { FILE: leetcode/1678.Goal-Parser-Interpretation/1678. Goal Parser Interpretation_test.go type question1678 (line 8) | type question1678 struct type para1678 (line 15) | type para1678 struct type ans1678 (line 21) | type ans1678 struct function Test_Problem1678 (line 25) | func Test_Problem1678(t *testing.T) { FILE: leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs.go function maxOperations (line 4) | func maxOperations(nums []int, k int) int { function maxOperations_ (line 29) | func maxOperations_(nums []int, k int) int { FILE: leetcode/1679.Max-Number-of-K-Sum-Pairs/1679. Max Number of K-Sum Pairs_test.go type question1679 (line 8) | type question1679 struct type para1679 (line 15) | type para1679 struct type ans1679 (line 22) | type ans1679 struct function Test_Problem1679 (line 26) | func Test_Problem1679(t *testing.T) { FILE: leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers.go function concatenatedBinary (line 8) | func concatenatedBinary(n int) int { function concatenatedBinary1 (line 20) | func concatenatedBinary1(n int) int { FILE: leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers/1680. Concatenation of Consecutive Binary Numbers_test.go type question1680 (line 8) | type question1680 struct type para1680 (line 15) | type para1680 struct type ans1680 (line 21) | type ans1680 struct function Test_Problem1680 (line 25) | func Test_Problem1680(t *testing.T) { FILE: leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility.go function minimumIncompatibility (line 8) | func minimumIncompatibility(nums []int, k int) int { function generatePermutation1681 (line 30) | func generatePermutation1681(nums, counts, order []int, index, sum, each... FILE: leetcode/1681.Minimum-Incompatibility/1681. Minimum Incompatibility_test.go type question1681 (line 8) | type question1681 struct type para1681 (line 15) | type para1681 struct type ans1681 (line 22) | type ans1681 struct function Test_Problem1681 (line 26) | func Test_Problem1681(t *testing.T) { FILE: leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings.go function countConsistentStrings (line 3) | func countConsistentStrings(allowed string, words []string) int { FILE: leetcode/1684.Count-the-Number-of-Consistent-Strings/1684. Count the Number of Consistent Strings_test.go type question1684 (line 8) | type question1684 struct type para1684 (line 15) | type para1684 struct type ans1684 (line 22) | type ans1684 struct function Test_Problem1684 (line 26) | func Test_Problem1684(t *testing.T) { FILE: leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array.go function getSumAbsoluteDifferences (line 4) | func getSumAbsoluteDifferences(nums []int) []int { function getSumAbsoluteDifferences1 (line 25) | func getSumAbsoluteDifferences1(nums []int) []int { FILE: leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/1685. Sum of Absolute Differences in a Sorted Array_test.go type question1685 (line 8) | type question1685 struct type para1685 (line 15) | type para1685 struct type ans1685 (line 21) | type ans1685 struct function Test_Problem1685 (line 25) | func Test_Problem1685(t *testing.T) { FILE: leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament.go function numberOfMatches (line 4) | func numberOfMatches(n int) int { function numberOfMatches1 (line 9) | func numberOfMatches1(n int) int { FILE: leetcode/1688.Count-of-Matches-in-Tournament/1688. Count of Matches in Tournament_test.go type question1688 (line 8) | type question1688 struct type para1688 (line 15) | type para1688 struct type ans1688 (line 21) | type ans1688 struct function Test_Problem1688 (line 25) | func Test_Problem1688(t *testing.T) { FILE: leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.go function minPartitions (line 3) | func minPartitions(n string) int { FILE: leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/1689. Partitioning Into Minimum Number Of Deci-Binary Numbers_test.go type question1689 (line 8) | type question1689 struct type para1689 (line 15) | type para1689 struct type ans1689 (line 21) | type ans1689 struct function Test_Problem1689 (line 25) | func Test_Problem1689(t *testing.T) { FILE: leetcode/1690.Stone-Game-VII/1690. Stone Game VII.go function stoneGameVII (line 4) | func stoneGameVII(stones []int) int { function stoneGameVII1 (line 37) | func stoneGameVII1(stones []int) int { function max (line 60) | func max(a, b int) int { FILE: leetcode/1690.Stone-Game-VII/1690. Stone Game VII_test.go type question1690 (line 8) | type question1690 struct type para1690 (line 15) | type para1690 struct type ans1690 (line 21) | type ans1690 struct function Test_Problem1690 (line 25) | func Test_Problem1690(t *testing.T) { FILE: leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids.go function maxHeight (line 5) | func maxHeight(cuboids [][]int) int { function max (line 37) | func max(x, y int) int { FILE: leetcode/1691.Maximum-Height-by-Stacking-Cuboids/1691. Maximum Height by Stacking Cuboids_test.go type question1691 (line 8) | type question1691 struct type para1691 (line 15) | type para1691 struct type ans1691 (line 21) | type ans1691 struct function Test_Problem1691 (line 25) | func Test_Problem1691(t *testing.T) { FILE: leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number.go function reformatNumber (line 7) | func reformatNumber(number string) string { FILE: leetcode/1694.Reformat-Phone-Number/1694. Reformat Phone Number_test.go type question1694 (line 8) | type question1694 struct type para1694 (line 15) | type para1694 struct type ans1694 (line 21) | type ans1694 struct function Test_Problem1694 (line 25) | func Test_Problem1694(t *testing.T) { FILE: leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value.go function maximumUniqueSubarray (line 3) | func maximumUniqueSubarray(nums []int) int { function max (line 25) | func max(a int, b int) int { FILE: leetcode/1695.Maximum-Erasure-Value/1695. Maximum Erasure Value_test.go type question1695 (line 8) | type question1695 struct type para1695 (line 15) | type para1695 struct type ans1695 (line 21) | type ans1695 struct function Test_Problem1695 (line 25) | func Test_Problem1695(t *testing.T) { FILE: leetcode/1696.Jump-Game-VI/1696. Jump Game VI.go function maxResult (line 8) | func maxResult(nums []int, k int) int { function maxResult1 (line 29) | func maxResult1(nums []int, k int) int { function max (line 48) | func max(a, b int) int { FILE: leetcode/1696.Jump-Game-VI/1696. Jump Game VI_test.go type question1696 (line 8) | type question1696 struct type para1696 (line 15) | type para1696 struct type ans1696 (line 22) | type ans1696 struct function Test_Problem1696 (line 26) | func Test_Problem1696(t *testing.T) { FILE: leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch.go function countStudents (line 3) | func countStudents(students []int, sandwiches []int) int { FILE: leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch/1700. Number of Students Unable to Eat Lunch_test.go type question1700 (line 8) | type question1700 struct type para1700 (line 15) | type para1700 struct type ans1700 (line 22) | type ans1700 struct function Test_Problem1700 (line 26) | func Test_Problem1700(t *testing.T) { FILE: leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike.go function halvesAreAlike (line 3) | func halvesAreAlike(s string) bool { function numVowels (line 7) | func numVowels(x string) int { FILE: leetcode/1704.Determine-if-String-Halves-Are-Alike/1704. Determine if String Halves Are Alike_test.go type question1704 (line 8) | type question1704 struct type para1704 (line 15) | type para1704 struct type ans1704 (line 21) | type ans1704 struct function Test_Problem1704 (line 25) | func Test_Problem1704(t *testing.T) { FILE: leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples.go function eatenApples (line 5) | func eatenApples(apples []int, days []int) int { function min (line 39) | func min(a, b int) int { type data (line 46) | type data struct type hp (line 51) | type hp method Len (line 53) | func (h hp) Len() int { return len(h) } method Less (line 54) | func (h hp) Less(i, j int) bool { return h[i].end < h[j].end } method Swap (line 55) | func (h hp) Swap(i, j int) { h[i], h[j] = h[j], h[i] } method Push (line 57) | func (h *hp) Push(x interface{}) { method Pop (line 61) | func (h *hp) Pop() interface{} { FILE: leetcode/1705.Maximum-Number-of-Eaten-Apples/1705.Maximum Number of Eaten Apples_test.go type question1705 (line 8) | type question1705 struct type para1705 (line 14) | type para1705 struct type ans1705 (line 20) | type ans1705 struct function Test_Problem1705 (line 24) | func Test_Problem1705(t *testing.T) { FILE: leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck.go function maximumUnits (line 5) | func maximumUnits(boxTypes [][]int, truckSize int) int { FILE: leetcode/1710.Maximum-Units-on-a-Truck/1710. Maximum Units on a Truck_test.go type question1710 (line 8) | type question1710 struct type para1710 (line 15) | type para1710 struct type ans1710 (line 22) | type ans1710 struct function Test_Problem1710 (line 26) | func Test_Problem1710(t *testing.T) { FILE: leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank.go function totalMoney (line 3) | func totalMoney(n int) int { FILE: leetcode/1716.Calculate-Money-in-Leetcode-Bank/1716. Calculate Money in Leetcode Bank_test.go type question1716 (line 8) | type question1716 struct type para1716 (line 15) | type para1716 struct type ans1716 (line 21) | type ans1716 struct function Test_Problem1716 (line 25) | func Test_Problem1716(t *testing.T) { FILE: leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array.go function decode (line 3) | func decode(encoded []int, first int) []int { FILE: leetcode/1720.Decode-XORed-Array/1720. Decode XORed Array_test.go type question1720 (line 8) | type question1720 struct type para1720 (line 15) | type para1720 struct type ans1720 (line 22) | type ans1720 struct function Test_Problem1720 (line 26) | func Test_Problem1720(t *testing.T) { FILE: leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List.go function swapNodes (line 17) | func swapNodes(head *ListNode, k int) *ListNode { FILE: leetcode/1721.Swapping-Nodes-in-a-Linked-List/1721. Swapping Nodes in a Linked List_test.go type question2 (line 10) | type question2 struct type para2 (line 17) | type para2 struct type ans2 (line 24) | type ans2 struct function Test_Problem2 (line 28) | func Test_Problem2(t *testing.T) { FILE: leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square.go function countGoodRectangles (line 3) | func countGoodRectangles(rectangles [][]int) int { FILE: leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/1725. Number Of Rectangles That Can Form The Largest Square_test.go type question1725 (line 8) | type question1725 struct type para1725 (line 15) | type para1725 struct type ans1725 (line 21) | type ans1725 struct function Test_Problem1725 (line 25) | func Test_Problem1725(t *testing.T) { FILE: leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude.go function largestAltitude (line 3) | func largestAltitude(gain []int) int { FILE: leetcode/1732.Find-the-Highest-Altitude/1732. Find the Highest Altitude_test.go type question1732 (line 8) | type question1732 struct type para1732 (line 15) | type para1732 struct type ans1732 (line 21) | type ans1732 struct function Test_Problem1732 (line 25) | func Test_Problem1732(t *testing.T) { FILE: leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation.go function decode (line 3) | func decode(encoded []int) []int { FILE: leetcode/1734.Decode-XORed-Permutation/1734. Decode XORed Permutation_test.go type question1734 (line 8) | type question1734 struct type para1734 (line 15) | type para1734 struct type ans1734 (line 21) | type ans1734 struct function Test_Problem1734 (line 25) | func Test_Problem1734(t *testing.T) { FILE: leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits.go function maximumTime (line 3) | func maximumTime(time string) string { FILE: leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits/1736. Latest Time by Replacing Hidden Digits_test.go type question1736 (line 8) | type question1736 struct type para1736 (line 15) | type para1736 struct type ans1736 (line 21) | type ans1736 struct function Test_Problem1736 (line 25) | func Test_Problem1736(t *testing.T) { FILE: leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value.go function kthLargestValue (line 6) | func kthLargestValue(matrix [][]int, k int) int { function kthLargestValue1 (line 24) | func kthLargestValue1(matrix [][]int, k int) int { FILE: leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value/1738. Find Kth Largest XOR Coordinate Value_test.go type question1738 (line 8) | type question1738 struct type para1738 (line 15) | type para1738 struct type ans1738 (line 22) | type ans1738 struct function Test_Problem1738 (line 26) | func Test_Problem1738(t *testing.T) { FILE: leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box.go function countBalls (line 3) | func countBalls(lowLimit int, highLimit int) int { FILE: leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box_test.go type question1742 (line 8) | type question1742 struct type para1742 (line 15) | type para1742 struct type ans1742 (line 22) | type ans1742 struct function Test_Problem1742 (line 26) | func Test_Problem1742(t *testing.T) { FILE: leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day.go function canEat (line 3) | func canEat(candiesCount []int, queries [][]int) []bool { FILE: leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/1744. Can You Eat Your Favorite Candy on Your Favorite Day_test.go type question1744 (line 8) | type question1744 struct type para1744 (line 15) | type para1744 struct type ans1744 (line 22) | type ans1744 struct function Test_Problem1744 (line 26) | func Test_Problem1744(t *testing.T) { FILE: leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements.go function sumOfUnique (line 3) | func sumOfUnique(nums []int) int { FILE: leetcode/1748.Sum-of-Unique-Elements/1748. Sum of Unique Elements_test.go type question1748 (line 8) | type question1748 struct type para1748 (line 15) | type para1748 struct type ans1748 (line 21) | type ans1748 struct function Test_Problem1748 (line 25) | func Test_Problem1748(t *testing.T) { FILE: leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated.go function check (line 3) | func check(nums []int) bool { FILE: leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated/1752. Check if Array Is Sorted and Rotated_test.go type question1752 (line 8) | type question1752 struct type para1752 (line 15) | type para1752 struct type ans1752 (line 21) | type ans1752 struct function Test_Problem1752 (line 25) | func Test_Problem1752(t *testing.T) { FILE: leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String.go function minOperations (line 3) | func minOperations(s string) int { function min (line 13) | func min(a, b int) int { FILE: leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String/1758. Minimum Changes To Make Alternating Binary String_test.go type question1758 (line 8) | type question1758 struct type para1758 (line 15) | type para1758 struct type ans1758 (line 21) | type ans1758 struct function Test_Problem1758 (line 25) | func Test_Problem1758(t *testing.T) { FILE: leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring.go function longestNiceSubstring (line 6) | func longestNiceSubstring(s string) string { function longestNiceSubstring1 (line 35) | func longestNiceSubstring1(s string) (ans string) { function longestNiceSubstring2 (line 53) | func longestNiceSubstring2(s string) string { function checkNiceString (line 68) | func checkNiceString(m map[byte]int) bool { FILE: leetcode/1763.Longest-Nice-Substring/1763. Longest Nice Substring_test.go type question1763 (line 8) | type question1763 struct type para1763 (line 15) | type para1763 struct type ans1763 (line 21) | type ans1763 struct function Test_Problem1763 (line 25) | func Test_Problem1763(t *testing.T) { FILE: leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph.go function findCenter (line 3) | func findCenter(edges [][]int) int { FILE: leetcode/1791.Find-Center-of-Star-Graph/1791.Find Center of Star Graph_test.go type question1791 (line 8) | type question1791 struct type para1791 (line 14) | type para1791 struct type ans1791 (line 19) | type ans1791 struct function Test_Problem1791 (line 23) | func Test_Problem1791(t *testing.T) { FILE: leetcode/1816.Truncate-Sentence/1816.Truncate Sentence.go function truncateSentence (line 3) | func truncateSentence(s string, k int) string { FILE: leetcode/1816.Truncate-Sentence/1816.Truncate Sentence_test.go type question1816 (line 8) | type question1816 struct type para1816 (line 14) | type para1816 struct type ans1816 (line 20) | type ans1816 struct function Test_Problem1816 (line 24) | func Test_Problem1816(t *testing.T) { FILE: leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference.go function minAbsoluteSumDiff (line 3) | func minAbsoluteSumDiff(nums1 []int, nums2 []int) int { function max (line 19) | func max(a, b int) int { function abs (line 26) | func abs(a int) int { function min (line 33) | func min(a, b int) int { FILE: leetcode/1818.Minimum-Absolute-Sum-Difference/1818. Minimum Absolute Sum Difference_test.go type question1818 (line 8) | type question1818 struct type para1818 (line 15) | type para1818 struct type ans1818 (line 22) | type ans1818 struct function Test_Problem1818 (line 26) | func Test_Problem1818(t *testing.T) { FILE: leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging.go function maximumElementAfterDecrementingAndRearranging (line 3) | func maximumElementAfterDecrementingAndRearranging(arr []int) int { function min (line 20) | func min(a, b int) int { FILE: leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging/1846. Maximum Element After Decreasing and Rearranging_test.go type question1846 (line 8) | type question1846 struct type para1846 (line 15) | type para1846 struct type ans1846 (line 21) | type ans1846 struct function Test_Problem1846 (line 25) | func Test_Problem1846(t *testing.T) { FILE: leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array.go function minPairSum (line 5) | func minPairSum(nums []int) int { function max (line 14) | func max(a, b int) int { FILE: leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array/1877. Minimize Maximum Pair Sum in Array_test.go type question1877 (line 8) | type question1877 struct type para1877 (line 15) | type para1877 struct type ans1877 (line 21) | type ans1877 struct function Test_Problem1877 (line 25) | func Test_Problem1877(t *testing.T) { FILE: leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores.go function minimumDifference (line 5) | func minimumDifference(nums []int, k int) int { FILE: leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/1984.Minimum Difference Between Highest and Lowest of K Scores_test.go type question1984 (line 8) | type question1984 struct type para1984 (line 14) | type para1984 struct type ans1984 (line 20) | type ans1984 struct function Test_Problem1984 (line 24) | func Test_Problem1984(t *testing.T) { FILE: leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street.go type lightItem (line 7) | type lightItem struct function brightestPosition (line 12) | func brightestPosition(lights [][]int) int { FILE: leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street_test.go type question2021 (line 8) | type question2021 struct type para2021 (line 14) | type para2021 struct type ans2021 (line 19) | type ans2021 struct function Test_Problem2021 (line 23) | func Test_Problem2021(t *testing.T) { FILE: leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array.go function construct2DArray (line 3) | func construct2DArray(original []int, m int, n int) [][]int { FILE: leetcode/2022.Convert-1D-Array-Into-2D-Array/2022. Convert 1D Array Into 2D Array_test.go type question2022 (line 8) | type question2022 struct type para2022 (line 15) | type para2022 struct type ans2022 (line 23) | type ans2022 struct function Test_Problem2022 (line 27) | func Test_Problem2022(t *testing.T) { FILE: leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone.go function minMovesToSeat (line 5) | func minMovesToSeat(seats []int, students []int) int { function abs (line 16) | func abs(a, b int) int { FILE: leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone/2037.Minimum Number of Moves to Seat Everyone_test.go type question2037 (line 8) | type question2037 struct type para2037 (line 14) | type para2037 struct type ans2037 (line 20) | type ans2037 struct function Test_Problem2037 (line 24) | func Test_Problem2037(t *testing.T) { FILE: leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color.go function winnerOfGame (line 3) | func winnerOfGame(colors string) bool { FILE: leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/2038.Remove Colored Pieces if Both Neighbors are the Same Color_test.go type question2038 (line 8) | type question2038 struct type para2038 (line 14) | type para2038 struct type ans2038 (line 19) | type ans2038 struct function Test_Problem2038 (line 23) | func Test_Problem2038(t *testing.T) { FILE: leetcode/2043.Simple-Bank-System/2043.Simple Bank System.go type Bank (line 3) | type Bank struct method Transfer (line 15) | func (this *Bank) Transfer(account1 int, account2 int, money int64) bo... method Deposit (line 27) | func (this *Bank) Deposit(account int, money int64) bool { method Withdraw (line 35) | func (this *Bank) Withdraw(account int, money int64) bool { function Constructor (line 8) | func Constructor(balance []int64) Bank { FILE: leetcode/2043.Simple-Bank-System/2043.Simple Bank System_test.go type question2043 (line 8) | type question2043 struct type para2043 (line 14) | type para2043 struct type ans2043 (line 20) | type ans2043 struct function Test_Problem2043 (line 24) | func Test_Problem2043(t *testing.T) { FILE: leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another.go function getDirections (line 19) | func getDirections(root *TreeNode, startValue int, destValue int) string { function findPath (line 39) | func findPath(root *TreeNode, value int, path *[]byte) bool { function reverse (line 57) | func reverse(path []byte) { function replace (line 66) | func replace(path []byte) { function min (line 72) | func min(i, j int) int { FILE: leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096. Step-By-Step Directions From a Binary Tree Node to Another_test.go type question2096 (line 10) | type question2096 struct type para2096 (line 17) | type para2096 struct type ans2096 (line 25) | type ans2096 struct function Test_Problem2096 (line 29) | func Test_Problem2096(t *testing.T) { FILE: leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently.go function sortEvenOdd (line 7) | func sortEvenOdd(nums []int) []int { FILE: leetcode/2164.Sort-Even-and-Odd-Indices-Independently/2164. Sort Even and Odd Indices Independently_test.go type question2164 (line 8) | type question2164 struct type para2164 (line 15) | type para2164 struct type ans2164 (line 21) | type ans2164 struct function Test_Problem1 (line 25) | func Test_Problem1(t *testing.T) { FILE: leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number.go function smallestNumber (line 5) | func smallestNumber(num int64) int64 { FILE: leetcode/2165.Smallest-Value-of-the-Rearranged-Number/2165. Smallest Value of the Rearranged Number_test.go type question2165 (line 8) | type question2165 struct type para2165 (line 15) | type para2165 struct type ans2165 (line 21) | type ans2165 struct function Test_Problem1 (line 25) | func Test_Problem1(t *testing.T) { FILE: leetcode/2166.Design-Bitset/2166. Design Bitset.go type Bitset (line 3) | type Bitset struct method Fix (line 25) | func (this *Bitset) Fix(idx int) { method Unfix (line 33) | func (this *Bitset) Unfix(idx int) { method Flip (line 41) | func (this *Bitset) Flip() { method All (line 46) | func (this *Bitset) All() bool { method One (line 50) | func (this *Bitset) One() bool { method Count (line 54) | func (this *Bitset) Count() int { method ToString (line 58) | func (this *Bitset) ToString() string { function Constructor (line 10) | func Constructor(size int) Bitset { FILE: leetcode/2166.Design-Bitset/2166. Design Bitset_test.go function Test_Problem2166 (line 8) | func Test_Problem2166(t *testing.T) { FILE: leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods.go function minimumTime (line 6) | func minimumTime(s string) int { function init (line 30) | func init() { debug.SetGCPercent(-1) } function minimumTime1 (line 33) | func minimumTime1(s string) int { function min (line 42) | func min(a, b int) int { FILE: leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/2167. Minimum Time to Remove All Cars Containing Illegal Goods_test.go type question2167 (line 8) | type question2167 struct type para2167 (line 15) | type para2167 struct type ans2167 (line 21) | type ans2167 struct function Test_Problem2167 (line 25) | func Test_Problem2167(t *testing.T) { FILE: leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero.go function countOperations (line 3) | func countOperations(num1 int, num2 int) int { FILE: leetcode/2169.Count-Operations-to-Obtain-Zero/2169. Count Operations to Obtain Zero_test.go type question2169 (line 8) | type question2169 struct type para2169 (line 15) | type para2169 struct type ans2169 (line 22) | type ans2169 struct function Test_Problem2169 (line 26) | func Test_Problem2169(t *testing.T) { FILE: leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating.go type node (line 7) | type node struct function minimumOperations (line 12) | func minimumOperations(nums []int) int { function min (line 55) | func min(a, b int) int { FILE: leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating/2170. Minimum Operations to Make the Array Alternating_test.go type question2170 (line 8) | type question2170 struct type para2170 (line 15) | type para2170 struct type ans2170 (line 21) | type ans2170 struct function Test_Problem1 (line 25) | func Test_Problem1(t *testing.T) { FILE: leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans.go function minimumRemoval (line 5) | func minimumRemoval(beans []int) int64 { function max (line 15) | func max(a, b int) int { FILE: leetcode/2171.Removing-Minimum-Number-of-Magic-Beans/2171. Removing Minimum Number of Magic Beans_test.go type question2170 (line 8) | type question2170 struct type para2170 (line 15) | type para2170 struct type ans2170 (line 21) | type ans2170 struct function Test_Problem1 (line 25) | func Test_Problem1(t *testing.T) { FILE: leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum.go function countEven (line 3) | func countEven(num int) int { function addSum (line 13) | func addSum(num int) int { FILE: leetcode/2180.Count-Integers-With-Even-Digit-Sum/2180. Count Integers With Even Digit Sum_test.go type question2180 (line 8) | type question2180 struct type para2180 (line 15) | type para2180 struct type ans2180 (line 21) | type ans2180 struct function Test_Problem1 (line 25) | func Test_Problem1(t *testing.T) { FILE: leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros.go function mergeNodes (line 17) | func mergeNodes(head *ListNode) *ListNode { FILE: leetcode/2181.Merge-Nodes-in-Between-Zeros/2181. Merge Nodes in Between Zeros_test.go type question2181 (line 10) | type question2181 struct type para2181 (line 17) | type para2181 struct type ans2181 (line 23) | type ans2181 struct function Test_Problem2181 (line 27) | func Test_Problem2181(t *testing.T) { function removeElements (line 51) | func removeElements(head *ListNode, val int) *ListNode { FILE: leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit.go function repeatLimitedString (line 3) | func repeatLimitedString(s string, repeatLimit int) string { function min (line 31) | func min(a, b int) int { FILE: leetcode/2182.Construct-String-With-Repeat-Limit/2182. Construct String With Repeat Limit_test.go type question2182 (line 8) | type question2182 struct type para2182 (line 15) | type para2182 struct type ans2182 (line 22) | type ans2182 struct function Test_Problem2182 (line 26) | func Test_Problem2182(t *testing.T) { FILE: leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K.go function countPairs (line 5) | func countPairs(nums []int, k int) int64 { function gcd (line 27) | func gcd(a, b int) int { FILE: leetcode/2183.Count-Array-Pairs-Divisible-by-K/2183. Count Array Pairs Divisible by K_test.go type question2182 (line 8) | type question2182 struct type para2182 (line 15) | type para2182 struct type ans2182 (line 22) | type ans2182 struct function Test_Problem2182 (line 26) | func Test_Problem2182(t *testing.T) { FILE: leetcode/9990085.Maximal-Rectangle/85. Maximal Rectangle.go function maximalRectangle (line 3) | func maximalRectangle(matrix [][]byte) int { FILE: leetcode/9990085.Maximal-Rectangle/85. Maximal Rectangle_test.go type question85 (line 8) | type question85 struct type para85 (line 15) | type para85 struct type ans85 (line 21) | type ans85 struct function Test_Problem85 (line 25) | func Test_Problem85(t *testing.T) { FILE: leetcode/9990132.Palindrome-Partitioning-II/132. Palindrome Partitioning II.go function minCut (line 3) | func minCut(s string) int { function dfs132 (line 13) | func dfs132(s string, idx int, cur []string, result *int) { function min (line 26) | func min(a int, b int) int { function isPal (line 33) | func isPal(str string, s, e int) bool { FILE: leetcode/9990132.Palindrome-Partitioning-II/132. Palindrome Partitioning II_test.go type question132 (line 8) | type question132 struct type para132 (line 15) | type para132 struct type ans132 (line 21) | type ans132 struct function Test_Problem132 (line 25) | func Test_Problem132(t *testing.T) { FILE: leetcode/9990316.Remove-Duplicate-Letters/316. Remove Duplicate Letters.go function removeDuplicateLetters (line 3) | func removeDuplicateLetters(s string) string { FILE: leetcode/9990316.Remove-Duplicate-Letters/316. Remove Duplicate Letters_test.go type question316 (line 8) | type question316 struct type para316 (line 15) | type para316 struct type ans316 (line 21) | type ans316 struct function Test_Problem316 (line 25) | func Test_Problem316(t *testing.T) { FILE: leetcode/9990352.Data-Stream-as-Disjoint-Intervals/352. Data Stream as Disjoint Intervals.go type SummaryRanges (line 11) | type SummaryRanges struct method AddNum (line 21) | func (sr *SummaryRanges) AddNum(val int) { method GetIntervals (line 88) | func (sr *SummaryRanges) GetIntervals() [][]int { function Constructor352 (line 16) | func Constructor352() SummaryRanges { FILE: leetcode/9990352.Data-Stream-as-Disjoint-Intervals/352. Data Stream as Disjoint Intervals_test.go function Test_Problem352 (line 8) | func Test_Problem352(t *testing.T) { FILE: leetcode/9990363.Max-Sum-of-Rectangle-No-Larger-Than-K/363. Max Sum of Rectangle No Larger Than K.go function maxSumSubmatrix (line 8) | func maxSumSubmatrix(matrix [][]int, k int) int { function kadaneK (line 35) | func kadaneK(a []int, k int) int { function binarySearchOfKadane (line 49) | func binarySearchOfKadane(a []int, v int) int { function insertSort (line 62) | func insertSort(a []int, v int) []int { function maxSumSubmatrix1 (line 73) | func maxSumSubmatrix1(matrix [][]int, k int) int { function findSumSubmatrix (line 94) | func findSumSubmatrix(matrix [][]int, target int) int { FILE: leetcode/9990363.Max-Sum-of-Rectangle-No-Larger-Than-K/363. Max Sum of Rectangle No Larger Than K_test.go type question363 (line 8) | type question363 struct type para363 (line 15) | type para363 struct type ans363 (line 22) | type ans363 struct function Test_Problem363 (line 26) | func Test_Problem363(t *testing.T) { FILE: leetcode/9990975.Odd-Even-Jump/975. Odd Even Jump.go function oddEvenJumps (line 7) | func oddEvenJumps(A []int) int { FILE: leetcode/9990975.Odd-Even-Jump/975. Odd Even Jump_test.go type question975 (line 8) | type question975 struct type para975 (line 15) | type para975 struct type ans975 (line 21) | type ans975 struct function Test_Problem975 (line 25) | func Test_Problem975(t *testing.T) { FILE: leetcode/9991044.Longest-Duplicate-Substring/1044. Longest Duplicate Substring.go function longestDupSubstring (line 4) | func longestDupSubstring(S string) string { function longestDupSubstring1 (line 61) | func longestDupSubstring1(S string) string { function isDuplicate (line 75) | func isDuplicate(length int, str string, res *string) bool { FILE: leetcode/9991044.Longest-Duplicate-Substring/1044. Longest Duplicate Substring_test.go type question1044 (line 8) | type question1044 struct type para1044 (line 15) | type para1044 struct type ans1044 (line 21) | type ans1044 struct function Test_Problem1044 (line 25) | func Test_Problem1044(t *testing.T) { FILE: leetcode/9991292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold.go function maxSideLength (line 3) | func maxSideLength(mat [][]int, threshold int) int { FILE: leetcode/9991292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold_test.go type question1292 (line 8) | type question1292 struct type para1292 (line 15) | type para1292 struct type ans1292 (line 22) | type ans1292 struct function Test_Problem1292 (line 26) | func Test_Problem1292(t *testing.T) { FILE: structures/Heap.go type intHeap (line 4) | type intHeap method Len (line 6) | func (h intHeap) Len() int { method Less (line 10) | func (h intHeap) Less(i, j int) bool { method Swap (line 14) | func (h intHeap) Swap(i, j int) { method Push (line 18) | func (h *intHeap) Push(x interface{}) { method Pop (line 24) | func (h *intHeap) Pop() interface{} { FILE: structures/Heap_test.go function Test_intHeap (line 11) | func Test_intHeap(t *testing.T) { FILE: structures/Interval.go type Interval (line 4) | type Interval struct function Interval2Ints (line 10) | func Interval2Ints(i Interval) []int { function IntervalSlice2Intss (line 15) | func IntervalSlice2Intss(is []Interval) [][]int { function Intss2IntervalSlice (line 24) | func Intss2IntervalSlice(intss [][]int) []Interval { function QuickSort (line 33) | func QuickSort(a []Interval, lo, hi int) { function partitionSort (line 42) | func partitionSort(a []Interval, lo, hi int) int { FILE: structures/Interval_test.go function Test_Interval2Ints (line 9) | func Test_Interval2Ints(t *testing.T) { function Test_IntervalSlice2Intss (line 17) | func Test_IntervalSlice2Intss(t *testing.T) { function Test_Intss2IntervalSlice (line 39) | func Test_Intss2IntervalSlice(t *testing.T) { FILE: structures/ListNode.go type ListNode (line 9) | type ListNode struct method GetNodeWith (line 52) | func (l *ListNode) GetNodeWith(val int) *ListNode { function List2Ints (line 15) | func List2Ints(head *ListNode) []int { function Ints2List (line 37) | func Ints2List(nums []int) *ListNode { function Ints2ListWithCycle (line 66) | func Ints2ListWithCycle(nums []int, pos int) *ListNode { FILE: structures/ListNode_test.go function Test_l2s (line 9) | func Test_l2s(t *testing.T) { function Test_s2l (line 29) | func Test_s2l(t *testing.T) { function Test_getNodeWith (line 42) | func Test_getNodeWith(t *testing.T) { function Test_Ints2ListWithCycle (line 60) | func Test_Ints2ListWithCycle(t *testing.T) { FILE: structures/NestedInteger.go type NestedInteger (line 5) | type NestedInteger struct method IsInteger (line 11) | func (n NestedInteger) IsInteger() bool { method GetInteger (line 18) | func (n NestedInteger) GetInteger() int { method SetInteger (line 23) | func (n *NestedInteger) SetInteger(value int) { method Add (line 28) | func (n *NestedInteger) Add(elem NestedInteger) { method GetList (line 35) | func (n NestedInteger) GetList() []*NestedInteger { FILE: structures/NestedInterger_test.go function Test_NestedInteger (line 9) | func Test_NestedInteger(t *testing.T) { FILE: structures/Point.go type Point (line 4) | type Point struct function Intss2Points (line 9) | func Intss2Points(points [][]int) []Point { function Points2Intss (line 21) | func Points2Intss(points []Point) [][]int { FILE: structures/Point_test.go function Test_Intss2Points (line 8) | func Test_Intss2Points(t *testing.T) { function Test_Points2Intss (line 44) | func Test_Points2Intss(t *testing.T) { FILE: structures/PriorityQueue.go type entry (line 10) | type entry struct type PQ (line 20) | type PQ method Len (line 22) | func (pq PQ) Len() int { return len(pq) } method Less (line 24) | func (pq PQ) Less(i, j int) bool { method Swap (line 28) | func (pq PQ) Swap(i, j int) { method Push (line 35) | func (pq *PQ) Push(x interface{}) { method Pop (line 42) | func (pq *PQ) Pop() interface{} { method update (line 50) | func (pq *PQ) update(entry *entry, value string, priority int) { FILE: structures/PriorityQueue_test.go function Test_priorityQueue (line 10) | func Test_priorityQueue(t *testing.T) { FILE: structures/Queue.go type Queue (line 4) | type Queue struct method Push (line 14) | func (q *Queue) Push(n int) { method Pop (line 19) | func (q *Queue) Pop() int { method Len (line 26) | func (q *Queue) Len() int { method IsEmpty (line 31) | func (q *Queue) IsEmpty() bool { function NewQueue (line 9) | func NewQueue() *Queue { FILE: structures/Queue_test.go function Test_Queue (line 9) | func Test_Queue(t *testing.T) { FILE: structures/Stack.go type Stack (line 4) | type Stack struct method Push (line 14) | func (s *Stack) Push(n int) { method Pop (line 19) | func (s *Stack) Pop() int { method Len (line 26) | func (s *Stack) Len() int { method IsEmpty (line 31) | func (s *Stack) IsEmpty() bool { function NewStack (line 9) | func NewStack() *Stack { FILE: structures/Stack_test.go function Test_Stack (line 9) | func Test_Stack(t *testing.T) { FILE: structures/TreeNode.go type TreeNode (line 9) | type TreeNode struct method Equal (line 182) | func (tn *TreeNode) Equal(a *TreeNode) bool { function Ints2TreeNode (line 19) | func Ints2TreeNode(ints []int) *TreeNode { function GetTargetNode (line 55) | func GetTargetNode(root *TreeNode, target int) *TreeNode { function indexOf (line 67) | func indexOf(val int, nums []int) int { function PreIn2Tree (line 79) | func PreIn2Tree(pre, in []int) *TreeNode { function InPost2Tree (line 105) | func InPost2Tree(in, post []int) *TreeNode { function Tree2Preorder (line 131) | func Tree2Preorder(root *TreeNode) []int { function Tree2Inorder (line 148) | func Tree2Inorder(root *TreeNode) []int { function Tree2Postorder (line 165) | func Tree2Postorder(root *TreeNode) []int { function Tree2ints (line 195) | func Tree2ints(tn *TreeNode) []int { function T2s (line 223) | func T2s(head *TreeNode, array *[]int) { function Strings2TreeNode (line 237) | func Strings2TreeNode(strs []string) *TreeNode { function Tree2LevelOrderStrings (line 267) | func Tree2LevelOrderStrings(root *TreeNode) []string { function Tree2PreOrderStrings (line 294) | func Tree2PreOrderStrings(root *TreeNode) []string { FILE: structures/TreeNode_test.go function Test_Ints2TreeNode (line 23) | func Test_Ints2TreeNode(t *testing.T) { function Test_preIn2Tree (line 34) | func Test_preIn2Tree(t *testing.T) { function Test_inPost2Tree (line 46) | func Test_inPost2Tree(t *testing.T) { function Test_tree2Ints (line 58) | func Test_tree2Ints(t *testing.T) { function Test_indexOf (line 72) | func Test_indexOf(t *testing.T) { function Test_TreeNode_Equal (line 80) | func Test_TreeNode_Equal(t *testing.T) { function Test_GetTargetNode (line 115) | func Test_GetTargetNode(t *testing.T) { function Test_Tree2ints (line 159) | func Test_Tree2ints(t *testing.T) { FILE: template/BIT.go type BinaryIndexedTree (line 4) | type BinaryIndexedTree struct method Init (line 10) | func (bit *BinaryIndexedTree) Init(capacity int) { method Add (line 15) | func (bit *BinaryIndexedTree) Add(index int, val int) { method Query (line 22) | func (bit *BinaryIndexedTree) Query(index int) int { method InitWithNums (line 31) | func (bit *BinaryIndexedTree) InitWithNums(nums []int) { function lowbit (line 41) | func lowbit(x int) int { type BinaryIndexedTree2D (line 46) | type BinaryIndexedTree2D struct method Add (line 53) | func (bit2 *BinaryIndexedTree2D) Add(i, j int, val int) { method Query (line 65) | func (bit2 *BinaryIndexedTree2D) Query(i, j int) int { FILE: template/BIT_test.go function Test_BIT (line 8) | func Test_BIT(t *testing.T) { FILE: template/CLRUCache.go type command (line 9) | type command constant MoveToFront (line 13) | MoveToFront command = iota constant PushFront (line 15) | PushFront constant Delete (line 17) | Delete type clear (line 20) | type clear struct type CLRUCache (line 25) | type CLRUCache struct method Get (line 61) | func (c *CLRUCache) Get(key string) interface{} { method Put (line 71) | func (c *CLRUCache) Put(key string, value interface{}) { method move (line 79) | func (c *CLRUCache) move(el *list.Element) { method Delete (line 87) | func (c *CLRUCache) Delete(key string) bool { method Clear (line 97) | func (c *CLRUCache) Clear() { method Count (line 104) | func (c *CLRUCache) Count() int { method bucket (line 112) | func (c *CLRUCache) bucket(key string) *bucket { method stop (line 118) | func (c *CLRUCache) stop() { method restart (line 123) | func (c *CLRUCache) restart() { method worker (line 130) | func (c *CLRUCache) worker() { method doMove (line 168) | func (c *CLRUCache) doMove(el *list.Element) bool { type Pair (line 37) | type Pair struct function New (line 44) | func New(capacity int) *CLRUCache { FILE: template/CLRUCache_test.go function Test_CLRUCache (line 14) | func Test_CLRUCache(t *testing.T) { function MList2Ints (line 41) | func MList2Ints(lru *CLRUCache) [][]interface{} { function BenchmarkGetAndPut1 (line 50) | func BenchmarkGetAndPut1(b *testing.B) { type Cache (line 68) | type Cache struct method Get (line 87) | func (c *Cache) Get(key string) interface{} { method Put (line 97) | func (c *Cache) Put(key string, value string) { type pair (line 75) | type pair struct function NewLRUCache (line 79) | func NewLRUCache(capacity int) Cache { function BenchmarkGetAndPut2 (line 114) | func BenchmarkGetAndPut2(b *testing.B) { FILE: template/LFUCache.go type LFUCache (line 6) | type LFUCache struct method Get (line 29) | func (lfuCache *LFUCache) Get(key int) int { method Put (line 50) | func (lfuCache *LFUCache) Put(key int, value int) { type node (line 13) | type node struct function Constructor (line 20) | func Constructor(capacity int) LFUCache { FILE: template/LRUCache.go type LRUCache (line 4) | type LRUCache struct method Get (line 22) | func (lruCache *LRUCache) Get(key int) int { method Put (line 32) | func (lruCache *LRUCache) Put(key int, value int) { method Add (line 50) | func (lruCache *LRUCache) Add(node *Node) { method Remove (line 64) | func (lruCache *LRUCache) Remove(node *Node) { type Node (line 11) | type Node struct function ConstructorLRU (line 17) | func ConstructorLRU(capacity int) LRUCache { FILE: template/SegmentTree.go type SegmentTree (line 4) | type SegmentTree struct method Init (line 11) | func (st *SegmentTree) Init(nums []int, oper func(i, j int) int) { method buildSegmentTree (line 24) | func (st *SegmentTree) buildSegmentTree(treeIndex, left, right int) { method leftChild (line 35) | func (st *SegmentTree) leftChild(index int) int { method rightChild (line 39) | func (st *SegmentTree) rightChild(index int) int { method Query (line 46) | func (st *SegmentTree) Query(left, right int) int { method queryInTree (line 54) | func (st *SegmentTree) queryInTree(treeIndex, left, right, queryLeft, ... method QueryLazy (line 71) | func (st *SegmentTree) QueryLazy(left, right int) int { method queryLazyInTree (line 78) | func (st *SegmentTree) queryLazyInTree(treeIndex, left, right, queryLe... method Update (line 112) | func (st *SegmentTree) Update(index, val int) { method updateInTree (line 119) | func (st *SegmentTree) updateInTree(treeIndex, left, right, index, val... method UpdateLazy (line 139) | func (st *SegmentTree) UpdateLazy(updateLeft, updateRight, val int) { method updateLazyInTree (line 145) | func (st *SegmentTree) updateLazyInTree(treeIndex, left, right, update... type SegmentCountTree (line 185) | type SegmentCountTree struct method Init (line 192) | func (st *SegmentCountTree) Init(nums []int, oper func(i, j int) int) { method buildSegmentTree (line 203) | func (st *SegmentCountTree) buildSegmentTree(treeIndex, left, right in... method leftChild (line 214) | func (st *SegmentCountTree) leftChild(index int) int { method rightChild (line 218) | func (st *SegmentCountTree) rightChild(index int) int { method Query (line 225) | func (st *SegmentCountTree) Query(left, right int) int { method queryInTree (line 233) | func (st *SegmentCountTree) queryInTree(treeIndex, left, right, queryL... method UpdateCount (line 248) | func (st *SegmentCountTree) UpdateCount(val int) { method updateCountInTree (line 255) | func (st *SegmentCountTree) updateCountInTree(treeIndex, left, right, ... FILE: template/UnionFind.go type UnionFind (line 5) | type UnionFind struct method Init (line 11) | func (uf *UnionFind) Init(n int) { method Find (line 21) | func (uf *UnionFind) Find(p int) int { method Union (line 36) | func (uf *UnionFind) Union(p, q int) { method TotalCount (line 54) | func (uf *UnionFind) TotalCount() int { type UnionFindCount (line 60) | type UnionFindCount struct method Init (line 66) | func (uf *UnionFindCount) Init(n int) { method Find (line 76) | func (uf *UnionFindCount) Find(p int) int { method Union (line 98) | func (uf *UnionFindCount) Union(p, q int) { method Count (line 120) | func (uf *UnionFindCount) Count() []int { method MaxUnionCount (line 125) | func (uf *UnionFindCount) MaxUnionCount() int { function max (line 129) | func max(a int, b int) int { FILE: template/bucket.go type bucket (line 8) | type bucket struct method pairCount (line 13) | func (b *bucket) pairCount() int { method get (line 19) | func (b *bucket) get(key string) *list.Element { method set (line 28) | func (b *bucket) set(key string, value interface{}) (*list.Element, *l... method update (line 37) | func (b *bucket) update(key string, el *list.Element) { method delete (line 43) | func (b *bucket) delete(key string) *list.Element { method clear (line 51) | func (b *bucket) clear() { FILE: website/content/ChapterFour/pytool/WordCount.py function str_count2 (line 6) | def str_count2(str): FILE: website/static/prism.js function e (line 72) | function e(e,t){return Array.prototype.slice.call((t||document).querySel... function t (line 72) | function t(e,t){return t=" "+t+" ",(" "+e.className+" ").replace(/[\n\t]... function n (line 72) | function n(e,n,i){for(var o,a=n.replace(/\s+/g,"").split(","),l=+e.getAt... function i (line 72) | function i(){var t=location.hash.slice(1);e(".temporary.line-highlight")... FILE: website/themes/book/assets/search.js function focusSearchFieldOnKeyPress (line 22) | function focusSearchFieldOnKeyPress(event) { function isHotkey (line 40) | function isHotkey(character) { function init (line 45) | function init() { function search (line 56) | function search() { function loadScript (line 82) | function loadScript(src, callback) { function element (line 96) | function element(content) { FILE: website/themes/book/static/js/sw-toolbox.js function o (line 15) | function o(c,s){if(!n[c]){if(!t[c]){var a="function"==typeof require&&re... function r (line 15) | function r(e,t){t=t||{},(t.debug||m.debug)&&console.log("[sw-toolbox] "+e)} function o (line 15) | function o(e){var t;return e&&e.cache&&(t=e.cache.name),t=t||m.cache.nam... function i (line 15) | function i(e,t){t=t||{};var n=t.successResponses||m.successResponses;ret... function c (line 15) | function c(e,t,n){var r=s.bind(null,e,t,n);d=d?d.then(r):r()} function s (line 15) | function s(e,t,n){var o=e.url,i=n.maxAgeSeconds,c=n.maxEntries,s=n.name,... function a (line 15) | function a(e,t,n){return r("Renaming cache: ["+e+"] to ["+t+"]",n),cache... function u (line 15) | function u(e,t){return o(t).then(function(t){return t.add(e)})} function f (line 15) | function f(e,t){return o(t).then(function(t){return t.delete(e)})} function h (line 15) | function h(e){e instanceof Promise||p(e),m.preCacheItems=m.preCacheItems... function p (line 15) | function p(e){var t=Array.isArray(e);if(t&&e.forEach(function(e){"string... function l (line 15) | function l(e,t,n){if(!e)return!1;if(t){var r=e.headers.get("date");if(r)... function r (line 15) | function r(e){return new Promise(function(t,n){var r=indexedDB.open(u+e,... function o (line 15) | function o(e){return e in d||(d[e]=r(e)),d[e]} function i (line 15) | function i(e,t,n){return new Promise(function(r,o){var i=e.transaction(h... function c (line 15) | function c(e,t,n){return t?new Promise(function(r,o){var i=1e3*t,c=[],s=... function s (line 15) | function s(e,t){return t?new Promise(function(n,r){var o=[],i=e.transact... function a (line 15) | function a(e,t,n,r){return c(e,n,r).then(function(n){return s(e,t).then(... function r (line 15) | function r(e){var t=a.match(e.request);t?e.respondWith(t(e.request)):a.d... function o (line 15) | function o(e){s.debug("activate event fired");var t=u.cache.name+"$$$ina... function i (line 15) | function i(e){return e.reduce(function(e,t){return e.concat(t)},[])} function c (line 15) | function c(e){var t=u.cache.name+"$$$inactive$$$";s.debug("install event... function r (line 15) | function r(e){return e.replace(/[-\/\\^$*+?.()|[\]{}]/g,"\\$&")} function r (line 15) | function r(e,t,n){n=n||{};var r=n.cache||o.cache,c=r.queryOptions;return... function r (line 15) | function r(e,t,n){n=n||{};var r=n.cache||o.cache,c=r.queryOptions;return... function r (line 15) | function r(e,t,n){return o.debug("Strategy: fastest ["+e.url+"]",n),new ... function r (line 15) | function r(e,t,n){n=n||{};var r=n.cache||o.cache,c=r.queryOptions,s=n.su... function r (line 15) | function r(e,t,n){return o.debug("Strategy: network only ["+e.url+"]",n)... function r (line 15) | function r(e,t){for(var n,r=[],o=0,i=0,c="",s=t&&t.delimiter||"/";null!=... function o (line 15) | function o(e,t){return s(r(e,t))} function i (line 15) | function i(e){return encodeURI(e).replace(/[\/?#]/g,function(e){return"%... function c (line 15) | function c(e){return encodeURI(e).replace(/[?#]/g,function(e){return"%"+... function s (line 15) | function s(e){for(var t=new Array(e.length),n=0;n