LeetCode 4079 | Prime Subset Selection I | Sieve + Prefix Sum + Binary Search | C++

LeetCode 4079: Prime Subset Selection I Sieve Algo :    • Sieve of Eratosthenes | Find All Prime Num...   Problem Link : https://leetcode.com/problems/prime-s... Source Code : https://github.com/Krishnkantm/DSA-Co... In this video, we solve Prime Subset Selection I using the Sieve of Eratosthenes, Prefix Sum, and Binary Search. Approach: Generate prime numbers up to N using the Sieve of Eratosthenes Store all prime numbers in a vector Build a prefix sum array of the prime numbers Use upper_bound to find the largest prefix sum not exceeding S Return the prime numbers included in that prefix Topics: Sieve of Eratosthenes, Prime Numbers, Prefix Sum, Binary Search, upper_bound, Number Theory, Competitive Programming, DSA Time Complexity: O(N log log N) Space Complexity: O(N) Subscribe to Logic Mode for LeetCode, GFG and competitive programming solutions in C++.