27:I[95456,["/_next/static/chunks/6cfcfcbc82e7a4b8.js","/_next/static/chunks/317ca732161d3f91.js","/_next/static/chunks/c97ce11de527676d.js","/_next/static/chunks/cc3c0377689b6dab.js","/_next/static/chunks/7dc827f89a6f97f4.js","/_next/static/chunks/ec29b44e938f8889.js","/_next/static/chunks/79d4be038fc384dc.js"],"default"] 2a:I[44092,["/_next/static/chunks/6cfcfcbc82e7a4b8.js","/_next/static/chunks/317ca732161d3f91.js","/_next/static/chunks/c97ce11de527676d.js","/_next/static/chunks/cc3c0377689b6dab.js","/_next/static/chunks/7dc827f89a6f97f4.js","/_next/static/chunks/ec29b44e938f8889.js","/_next/static/chunks/79d4be038fc384dc.js"],"BlogTocSidebar"] 24:["$","div",null,{"className":"flex items-center gap-4 pb-4 border-b border-border","children":["$","div",null,{"className":"inline-flex items-center gap-1.5 text-sm text-muted-foreground","children":[["$","svg",null,{"ref":"$undefined","xmlns":"http://www.w3.org/2000/svg","width":24,"height":24,"viewBox":"0 0 24 24","fill":"none","stroke":"currentColor","strokeWidth":2,"strokeLinecap":"round","strokeLinejoin":"round","className":"lucide lucide-calendar h-4 w-4","children":[["$","path","1cmpym",{"d":"M8 2v4"}],["$","path","4m81vk",{"d":"M16 2v4"}],["$","rect","1hopcy",{"width":"18","height":"18","x":"3","y":"4","rx":"2"}],["$","path","8toen8",{"d":"M3 10h18"}],"$undefined"]}],["$","time",null,{"children":"8 Januari 2024"}]]}]}] 28:T51f,import "sort" func threeSum(nums []int) [][]int { sort.Ints(nums) // wajib diurutkan: o(n log n) var result [][]int for i := 0; i < len(nums)-2; i++ { // hindari duplikat untuk pointer pertama if i > 0 && nums[i] == nums[i-1] { continue } // ubah menjadi masalah two-pointer left := i + 1 right := len(nums) - 1 for left < right { total := nums[i] + nums[left] + nums[right] if total < 0 { left++ } else if total > 0 { right-- } else { result = append(result, []int{nums[i], nums[left], nums[right]}) // hindari duplikat untuk pointer kedua dan ketiga for left < right && nums[left] == nums[left+1] { left++ } for left < right && nums[right] == nums[right-1] { right-- } // maju mencari kombinasi lain left++ right-- } } } return result } // time complexity: o(n^2) // space complexity: o(1) hingga o(n) tergantung implementasi sorting di golang.29:T51f,import "sort" func threeSum(nums []int) [][]int { sort.Ints(nums) // wajib diurutkan: o(n log n) var result [][]int for i := 0; i < len(nums)-2; i++ { // hindari duplikat untuk pointer pertama if i > 0 && nums[i] == nums[i-1] { continue } // ubah menjadi masalah two-pointer left := i + 1 right := len(nums) - 1 for left < right { total := nums[i] + nums[left] + nums[right] if total < 0 { left++ } else if total > 0 { right-- } else { result = append(result, []int{nums[i], nums[left], nums[right]}) // hindari duplikat untuk pointer kedua dan ketiga for left < right && nums[left] == nums[left+1] { left++ } for left < right && nums[right] == nums[right-1] { right-- } // maju mencari kombinasi lain left++ right-- } } } return result } // time complexity: o(n^2) // space complexity: o(1) hingga o(n) tergantung implementasi sorting di golang.