https://www.youtube.com/channel/UC-tiNJLxqiix-yswWo65cRw
Will share the video on this channel so you can visit and will not miss the recording too
Will share the video on this channel so you can visit and will not miss the recording too
Java Hyd Team
Next Sunday again we will be covering core java, advance java, Spring and spring boot , React-Js
Not conducted as one interview scheduled from trilogy innovations
It will be till 2pm so didn't started as full day packed after this will prepare video n upload for exception handling 😊
It will be till 2pm so didn't started as full day packed after this will prepare video n upload for exception handling 😊
till then solve this question If we list all the natural numbers below 10that are multiples of 3 or5 , we get 3,5,6 and9 . The sum of these multiples is .23
Find the sum of all the multiples of 3 or5 below .
Input Format
First line contains that denotes the number of test cases. This is followed by lines, each containing an integer, .
Constraints
Output Format
For each test case, print an integer that denotes the sum of all the multiples of 3 or 5 below N .
Find the sum of all the multiples of 3 or5 below .
Input Format
First line contains that denotes the number of test cases. This is followed by lines, each containing an integer, .
Constraints
Output Format
For each test case, print an integer that denotes the sum of all the multiples of 3 or 5 below N .
Mind blown after their programming questions literally headache after the level of question
Forwarded from Aman Raj
There are 2xN comedians and M audience member in a comedy show. The first N comedians are male and the last N are female. In a comedy show, all the comics gets one slot to perform their act. The slots are alloted randomly and any allocation is equaly probable.
$1
Each of the comdedians has a humour level given by the array A. The charge of each comedian is given by the array B.
Q
Each of the audience member has a tolerance level given by array C and seriousness level given by array D. The gender of the members given by the array E where E[i] = 1 denotes that member is male and E[i] = 2 denotes that member is female.
Q2
A comic of same gender as an audience member will make that member laugh if there have been atleast c[i] comics before them of the same gender such that their humour level is more than D[i] of that member.
Q3
A comic of opposite gender as an audience member will make that member laugh if there have been atleast C[i] comics before them of the same gender of the comic such that their humour level is more than the 2xD[i] of that member.
Q4
BLIC
ER
If a member laughs, then they have to pay that comedian B[i] coins
What is the expected sum of amount that all the comedians will earn in a single show. Express the expected sum
as an irreducible fraction u/v, then you have to find the value of uxv¹ mod 10"+7.
Problem Constraints
1 <= N<= 105
1 <= M <= 105
1 <= A[i] <= 109
1 <= B[i] <= 109
1 <= C[i] <= N
$1
Each of the comdedians has a humour level given by the array A. The charge of each comedian is given by the array B.
Q
Each of the audience member has a tolerance level given by array C and seriousness level given by array D. The gender of the members given by the array E where E[i] = 1 denotes that member is male and E[i] = 2 denotes that member is female.
Q2
A comic of same gender as an audience member will make that member laugh if there have been atleast c[i] comics before them of the same gender such that their humour level is more than D[i] of that member.
Q3
A comic of opposite gender as an audience member will make that member laugh if there have been atleast C[i] comics before them of the same gender of the comic such that their humour level is more than the 2xD[i] of that member.
Q4
BLIC
ER
If a member laughs, then they have to pay that comedian B[i] coins
What is the expected sum of amount that all the comedians will earn in a single show. Express the expected sum
as an irreducible fraction u/v, then you have to find the value of uxv¹ mod 10"+7.
Problem Constraints
1 <= N<= 105
1 <= M <= 105
1 <= A[i] <= 109
1 <= B[i] <= 109
1 <= C[i] <= N
Forwarded from Aman Raj
Longest Odd Pallindromes
Flag Question
Problem Description
Given a string $(consisting of only lower case characters) and Q queries.
In each query you will given an integer i and your task is to find the length of longest odd palindromic substring whose middle index is i.
Q 2
Note:
1) Assume 1 based indexing.
Q3
2.) Longest odd palindrome: A palindrome substring whose length is odd.
Q4
Problem Constraints
Input Format
First argument A is string S.
Second argument B is an array of integers where Bi] denotes the query index of ith query.
BLIC
ER
Flag Question
Problem Description
Given a string $(consisting of only lower case characters) and Q queries.
In each query you will given an integer i and your task is to find the length of longest odd palindromic substring whose middle index is i.
Q 2
Note:
1) Assume 1 based indexing.
Q3
2.) Longest odd palindrome: A palindrome substring whose length is odd.
Q4
Problem Constraints
Input Format
First argument A is string S.
Second argument B is an array of integers where Bi] denotes the query index of ith query.
BLIC
ER
Forwarded from Aman Raj
And The Bits
Problem Description
You are given an array of integers A and many queries in the form of a 2-D integer array B. In each query, you are given 4 integers 11, r1, 12, 12. These integers represent two ranges, one that goes from 11 to r1 and another goes from 12 to 12. You need to return the bitwise XOR of element-wise bitwise AND of integers in these two ranges. That is, first do bitwise AND of all integers in 11 to r1, let's call it x1. similarly do it for 12 to 12 and we get x2. Now, the answer for this query would be x1 XOR x2. Return an integer array with the ith index containing the answer for the ith query.
Q2
Q
Q
BLIC
ER
Problem Constraints
1 <= A size() <= 1e5
1<-A] <1e9
1<= B.size() <= 165
1- B(0), B(1), B02), B03) <= A.size()
Input Format
First argument is the integer array A Second argument is the 2-D integer array B.
Output Format
Return a single integer array as per the given problem.
Problem Description
You are given an array of integers A and many queries in the form of a 2-D integer array B. In each query, you are given 4 integers 11, r1, 12, 12. These integers represent two ranges, one that goes from 11 to r1 and another goes from 12 to 12. You need to return the bitwise XOR of element-wise bitwise AND of integers in these two ranges. That is, first do bitwise AND of all integers in 11 to r1, let's call it x1. similarly do it for 12 to 12 and we get x2. Now, the answer for this query would be x1 XOR x2. Return an integer array with the ith index containing the answer for the ith query.
Q2
Q
Q
BLIC
ER
Problem Constraints
1 <= A size() <= 1e5
1<-A] <1e9
1<= B.size() <= 165
1- B(0), B(1), B02), B03) <= A.size()
Input Format
First argument is the integer array A Second argument is the 2-D integer array B.
Output Format
Return a single integer array as per the given problem.
Forwarded from Aman Raj
Beautiful Numbers in a Range
S1
Problem Description
Flag Question
Q1
A number is beautiful if the xor sum of the digits of the number is strictly greater than the average of the minimum and maximum digit of the number. Given A and B, find the count of beautiful numbers in the range [A, B]. Since the answer can be very large, output the remainder after dividing the answer by 109+7
Q 2
Note: The xor sum of the digits of a number is the bitwise XOR of all its digits.
Q3
Q4
BLIC
ER!
Problem Constraints
1 <= A <= B <= 10¹
Input Format
First argument A is a number in form of a string. Second argument B is a number in form of a string.
Output Format
Return an integer
S1
Problem Description
Flag Question
Q1
A number is beautiful if the xor sum of the digits of the number is strictly greater than the average of the minimum and maximum digit of the number. Given A and B, find the count of beautiful numbers in the range [A, B]. Since the answer can be very large, output the remainder after dividing the answer by 109+7
Q 2
Note: The xor sum of the digits of a number is the bitwise XOR of all its digits.
Q3
Q4
BLIC
ER!
Problem Constraints
1 <= A <= B <= 10¹
Input Format
First argument A is a number in form of a string. Second argument B is a number in form of a string.
Output Format
Return an integer
No answer on Google so please do by self 😂😂 after completion i checked on Google