Let Code Day87 Starting from Zero "1512. Number of Good Pairs"

Overview

It seems that coding tests are conducted overseas in interviews with engineers, and in many cases, the main thing is to implement specific functions and classes according to the theme.

Apparently, many engineers take measures on the site called LetCode.

It is a site that trains the algorithmic power that can withstand the coding test that is being done in the early story, and it is an inevitable path for those who want to build a career at an overseas tech company.

I wrote it in a big way, but I have no plans to have such an interview at the moment.

However, as an IT engineer, it would be better to have the same level of algorithm power as a person, so I would like to solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

I'm solving it with Python3.

Leet Code Table of Contents Starting from Zero

Last time Leet Code Day86 "33. Search in Rotated Sorted Array" starting from zero

Twitter I'm doing it.

** Technical Blog Started! !! ** ** I think the technology will write about LetCode, Django, Nuxt, and so on. ** This is faster to update **, so please bookmark it!

problem

1512. Number of Good Pairs The difficulty level is Easy.

The problem is given an array of integers nums.

If nums [i] == nums [j] and ʻi <j, enable pairs (i, j) `and design an algorithm that returns the number of valid pairs.

Example 1:

Input: nums = [1,2,3,1,1,3] Output: 4 Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.

Example 2:

Input: nums = [1,1,1,1] Output: 6 Explanation: Each pair in the array are good.

Example 3:

Input: nums = [1,2,3] Output: 0

solution

class Solution:
    def numIdenticalPairs(self, nums: List[int]) -> int:
        ans,dic = 0,{}
        for i,j in enumerate(nums):
            if j in dic:
                ans += dic[j]
                dic[j] += 1
            else:
                dic[j] = 1
        return ans
# Runtime: 32 ms, faster than 100.00% of Python3 online submissions for Number of Good Pairs.
# Memory Usage: 13.6 MB, less than 100.00% of Python3 online submissions for Number of Good Pairs.

Manage your elements with dic and you're done! I think it was a pretty good one in terms of speed and capacity (self-proclaimed). I wrote it in a hurry, so I can't go into a deep explanation, but I think you can also use Counter or two pointers. If you want the answer, please post it on disucuss.

So that's it for this time. Thank you for your hard work.

Recommended Posts

Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day14 starting from zero "136. Single Number"
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day16 Starting from Zero "344. Reverse String"
Let Code Day89 "62. Unique Paths" Starting from Zero
Let Code Day 55 "22. Generate Parentheses" Starting from Zero
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
Let Code Day18 starting from zero "53. Maximum Subarray"
Let Code Day 13 "338. Counting Bits" Starting from Zero
Let Code Day 82 "392. Is Subsequence" Starting from Zero
Let Code Day51 Starting from Zero "647. Palindromic Substrings"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day 11 Starting from Zero "1315. Sum of Nodes with Even-Valued Grandparent"
Let Code Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day 42 "2. Add Two Numbers" Starting from Zero
Let Code Day57 Starting from Zero "35. Search Insert Position"
Let Code Day47 Starting from Zero "14. Longest Common Prefix"
Let Code Day78 Starting from Zero "206. Reverse Linked List"
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day24 Starting from Zero "21. Merge Two Sorted Lists"
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day2 Starting from Zero "1108. Defanging an IP Address"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day4 starting from scratch "938. Range Sum of BST"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"
Let Code Day5 starting from zero "1266. Minimum Time Visiting All Points"
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day53 Starting from Zero "1365. How Many Numbers Are Smaller Than the Current Number"
Let Code Day 27 "101. Symmetric Tree" starting from scratch
Let Code Day 41 "394. Decode String" starting from scratch
Let Code Day 25 "70. Climbing Stairs" starting from scratch
Let Code Day 34 starting from scratch "118. Pascal's Triangle"
Let Code Day20 starting from scratch "134. Gas Station"
Let Code Day 88 "139. Word Break" starting from scratch
Let Code Day 28 "198. House Robber" starting from scratch
Let Code Day 39 "494. Target Sum" starting from scratch
Let Code Day 36 "155. Min Stack" starting from scratch
Let Code Day 17 "169. Majority Element" starting from scratch
Let Code Day 33 "1. Two Sum" starting from scratch
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
Let Code Day59 starting from zero "1221. Split a String in Balanced Strings"
Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day 23 "226. Invert Binary Tree" starting from scratch
Let Code Day8 starting from scratch "1302. Deepest Leaves Sum"
Let Code Day 22 starting from scratch "141. Linked List Cycle"
Let Code Day 30 starting from scratch "234. Palindrome Linked List"
Let Code Day68 starting from scratch "709. To Lower Case"
Let Code Day73 Starting from Zero "1491. Average Salary Excluding the Minimum and Maximum Salary"