Leetcode with dani
Photo
share ur answer in the comment section , i will check it
Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
👍3
Sieve of Eratosthenes
Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so.
Following is the algorithm to find all the prime numbers less than or equal to a given integer n by the Eratosthene’s method:
When the algorithm terminates, all the numbers in the list that are not marked are prime.
Explanation with Example:
Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so.
Following is the algorithm to find all the prime numbers less than or equal to a given integer n by the Eratosthene’s method:
When the algorithm terminates, all the numbers in the list that are not marked are prime.
Explanation with Example:
So, the prime numbers are the unmarked ones: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89 and 97.
👍1🆒1
🎯 Problem of the Day: Sort Colors
Problem Denoscription
You are given an array
- Represent the colors using integers:
-
-
-
⚠️ Note: You must not use the library's sort function.
---
Example 1
Input:
Output:
Example 2
Input:
Output:
---
📝 Practice Questions for A2SV Preparation
1. Core Problem:
- Solve LeetCode 75: Sort Colors () using Dutch National Flag Algorithm for \( O(n) \) time complexity.
2. Related Problems:
- LeetCode 215 : Kth Largest Element in an Array
- LeetCode 347 : Top K Frequent Elements
- LeetCode 56 : Merge Intervals
3. Challenge Problem:
- LeetCode 88: Merge Sorted Array
---
💡 Tip: Use a two-pointer or three-pointer approach to keep track of boundaries for the different colors! Try to optimize your solution to \( O(n) \) in both time and space.
🧠 Share your solution and discuss your approach with the community! 🌟
Problem Denoscription
You are given an array
nums with \( n \) objects colored red, white, or blue. Sort the array in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue. - Represent the colors using integers:
-
0 → Red -
1 → White -
2 → Blue ⚠️ Note: You must not use the library's sort function.
---
Example 1
Input:
nums = [2,0,2,1,1,0]
Output:
[0,0,1,1,2,2]
Example 2
Input:
nums = [2,0,1]
Output:
[0,1,2]
---
📝 Practice Questions for A2SV Preparation
1. Core Problem:
- Solve LeetCode 75: Sort Colors () using Dutch National Flag Algorithm for \( O(n) \) time complexity.
2. Related Problems:
- LeetCode 215 : Kth Largest Element in an Array
- LeetCode 347 : Top K Frequent Elements
- LeetCode 56 : Merge Intervals
3. Challenge Problem:
- LeetCode 88: Merge Sorted Array
---
💡 Tip: Use a two-pointer or three-pointer approach to keep track of boundaries for the different colors! Try to optimize your solution to \( O(n) \) in both time and space.
🧠 Share your solution and discuss your approach with the community! 🌟
LeetCode
Sort Colors - LeetCode
Can you solve this real interview question? Sort Colors - Given an array nums with n objects colored red, white, or blue, sort them in-place [https://en.wikipedia.org/wiki/In-place_algorithm] so that objects of the same color are adjacent, with the colors…
👍4
238. Product of Array Except Self
Difficulty: Medium
Problem:
Given an integer array nums, return an array answer such that answer[i] is the product of all elements of nums except nums[i].
Conditions:
- The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
- Your algorithm must run in O(n) time and must not use the division operation.
Examples:
Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
Constraints:
2 <= nums.length <= 10^5
-30 <= nums[i] <= 30
Can you solve it?
👍3
A2SV N PERSON EDUCATION
Anonymous Poll
26%
didnt apply
3%
im student there
60%
get a chance for interview
11%
rejected for intervew
Question: Can You Make This String a Palindrome?
A palindrome is a string that reads the same forwards and backwards. Given a string, determine if it's possible to rearrange the characters to form a palindrome.
Examples:
1. Input:
• Output:
• Explanation: The string is already a palindrome.
2. Input:
• Output:
• Explanation: Rearranging the characters can form the palindrome
3. Input:
• Output:
• Explanation: No rearrangement can form a palindrome.
4. Input:
• Output:
• Explanation: Rearranging the characters can form the palindrome
5. Input:
• Output:
• Explanation: The string is already a palindrome.
Challenge:
Write a function that takes a string as input and returns
A palindrome is a string that reads the same forwards and backwards. Given a string, determine if it's possible to rearrange the characters to form a palindrome.
Examples:
1. Input:
"civic"• Output:
True• Explanation: The string is already a palindrome.
2. Input:
"ivicc"• Output:
True• Explanation: Rearranging the characters can form the palindrome
"civic".3. Input:
"hello"• Output:
False• Explanation: No rearrangement can form a palindrome.
4. Input:
"aabbcc"• Output:
True• Explanation: Rearranging the characters can form the palindrome
"abcba".5. Input:
"racecar"• Output:
True• Explanation: The string is already a palindrome.
Challenge:
Write a function that takes a string as input and returns
True if the string can be rearranged to form a palindrome, and False otherwise.👍4
Question: Count Substrings with Same Start and End Character
Given a string
▎Examples:
1. Input: "abcba"
Output: 7
Explanation: The substrings are: "a", "b", "c", "b", "a", "bcb", and "abcba".
2. Input: "abacada"
Output: 9
Explanation: The substrings are: "a", "b", "a", "c", "a", "d", "aba", "aca", and "abaca".
3. Input: "a"
Output: 1
Explanation: The only substring is "a".
4. Input: "zzzz"
Output: 10
Explanation: All substrings start and end with 'z': "z", "z", "z", "z", "zz", "zz", "zz", "zz", "zzz", and "zzzz".
▎Challenge:
Write a function that takes a string as input and returns the total count of substrings that start and end with the same character.
Given a string
s consisting only of lowercase English letters, your task is to find the number of substrings that start and end with the same character.▎Examples:
1. Input: "abcba"
Output: 7
Explanation: The substrings are: "a", "b", "c", "b", "a", "bcb", and "abcba".
2. Input: "abacada"
Output: 9
Explanation: The substrings are: "a", "b", "a", "c", "a", "d", "aba", "aca", and "abaca".
3. Input: "a"
Output: 1
Explanation: The only substring is "a".
4. Input: "zzzz"
Output: 10
Explanation: All substrings start and end with 'z': "z", "z", "z", "z", "zz", "zz", "zz", "zz", "zzz", and "zzzz".
▎Challenge:
Write a function that takes a string as input and returns the total count of substrings that start and end with the same character.
👍3🔥2