Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"

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 Day71 "1496. Path Crossing" starting from zero

Right now, I'm prioritizing the Medium of the Top 100 Liked Questions. I solved all Easy, so if you are interested, please go to the table of contents.

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

1498. Number of Subsequences That Satisfy the Given Sum Condition The difficulty level is Medium.

The problem is given an array of integers nums and an integer target. Returns the number of non-empty subsequences such that the sum of the minimum and maximum values of nums is less than or equal to the target value.

The answer may be too large, so it returns the modulo 10 ^ 9 + 7.

Example 1:

Input: nums = [3,5,6,7], target = 9 Output: 4 Explanation: There are 4 subsequences that satisfy the condition. [3] -> Min value + max value <= target (3 + 3 <= 9) [3,5] -> (3 + 5 <= 9) [3,5,6] -> (3 + 6 <= 9) [3,6] -> (3 + 6 <= 9)

Example 2:

Input: nums = [3,3,6,8], target = 10 Output: 6 Explanation: There are 6 subsequences that satisfy the condition. (nums can have repeated numbers). [3] , [3] , [3,3], [3,6] , [3,6] , [3,3,6]

Example 3:

Input: nums = [2,3,3,4,6,7], target = 12 Output: 61 Explanation: There are 63 non-empty subsequences, two of them don't satisfy the condition ([6,7], [7]). Number of valid subsequences (63 - 2 = 61).

Example 4:

Input: nums = [5,2,4,1,7,6,8], target = 16 Output: 127 Explanation: All non-empty subset satisfy the condition (2^7 - 1) = 127

Constraints:

  • 1 <= nums.length <= 10^5

solution

class Solution:
    def numSubseq(self, nums: List[int], target: int) -> int:
        ans,mod = 0,10**9+7
        nums.sort()
        for i,j in enumerate(nums):
            if target < j*2:
                break
            b = bisect.bisect(nums,target-j,lo=i)
            ans += pow(2, b-i-1, mod)
        return ans % mod
# Runtime: 888 ms, faster than 82.84% of Python3 online submissions for Number of Subsequences That Satisfy the Given Sum Condition.
# Memory Usage: 25.2 MB, less than 100.00% of Python3 online submissions for Number of Subsequences That Satisfy the Given Sum Condition.

As specified in the problem statement, I wrote that mod (10 ** 9 + 7) is specified first and a binary search is performed in the for statement. The arguments of bisect are as follows.

bisect(a,b,(lo,hi))

a:list
b:Value to insert
lo:Lower limit of search range
hi:Upper limit of search range

As many of you who read this article know, the list is sorted at the beginning of the code because it is a prerequisite that the binary search is sorted. As far as the example is seen, it seems that there are many cases where it is not sorted ...

By the way, 10 ** 9 + 7 comes out quite a lot when doing other competitive programming (not limited to one because there are many sites). Some people have written easy-to-understand explanation articles about it, so if you are interested, please do that too.

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

Recommended Posts

Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day14 starting from zero "136. Single Number"
Let Code Day 11 Starting from Zero "1315. Sum of Nodes with Even-Valued Grandparent"
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day1 Starting from Zero "1389. Create Target Array in the Given Order"
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day4 starting from scratch "938. Range Sum of BST"
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
Let Code Day 79 "1282. Group the People Given the Group Size They Belong To" Starting from Zero
Let Code Day75 starting from scratch "15.3 Sum"
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day53 Starting from Zero "1365. How Many Numbers Are Smaller Than the Current Number"
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day89 "62. Unique Paths" Starting from Zero
Let Code Day 55 "22. Generate Parentheses" Starting from Zero
Let Code Table of Contents Starting from Zero
Let Code Day18 starting from zero "53. Maximum Subarray"
Let Code Day 13 "338. Counting Bits" Starting from Zero
Let Code Day71 Starting from Zero "1496. Path Crossing"
Let Code Day 61 "7. Reverse Integer" starting from zero
Let Code Day 39 "494. Target Sum" starting from scratch
Let Code Day 82 "392. Is Subsequence" Starting from Zero
Let Code Day51 Starting from Zero "647. Palindromic Substrings"
Let Code Day 50 "739. Daily Temperatures" Starting from Zero
Let Code Day 15 "283. Move Zeroes" starting from zero
Let Code Day 33 "1. Two Sum" starting from scratch
Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day73 Starting from Zero "1491. Average Salary Excluding the Minimum and Maximum Salary"
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 Day 32 "437. Path Sum III" starting from scratch
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 Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day 65 "560. Subarray Sum Equals K" starting from scratch
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted 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 Day 29 "46. Permutations" starting from scratch
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 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 Day69 starting from scratch "279. Perfect Squares"
Let Code Day 34 starting from scratch "118. Pascal's Triangle"
Let Code Day85 starting from scratch "6. ZigZag Conversion"