Instruction stringlengths 261 35k | Response stringclasses 1
value |
|---|---|
For this Question: Power Rangers have to trap a evil spirit monster into a cuboid shape box with dimensions A*B*C, where A, B and C are positive integers. The volume of the box should be exactly X cubic units (that is A*B*C should be equal to X). To allow minimum evil aura to leak from the box the surface area of the b... | Compilable |
For this Question: Power Rangers have to trap a evil spirit monster into a cuboid shape box with dimensions A*B*C, where A, B and C are positive integers. The volume of the box should be exactly X cubic units (that is A*B*C should be equal to X). To allow minimum evil aura to leak from the box the surface area of the b... | Compilable |
For this Question: Power Rangers have to trap a evil spirit monster into a cuboid shape box with dimensions A*B*C, where A, B and C are positive integers. The volume of the box should be exactly X cubic units (that is A*B*C should be equal to X). To allow minimum evil aura to leak from the box the surface area of the b... | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked or not.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete t... | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked or not.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete t... | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked or not.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete t... | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked or not.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete t... | Compilable |
For this Question: Sara is trying to open a lock for that she needs a passcode. Sara knows that the passcode contains N digits in it and the digits at even indices(0- indexing) are even and the digits at odd indices are {2, 3, 5, 7}.
Now Sara wants to know how many different passcodes are possible so that she can open... | Compilable |
For this Question: Sara is trying to open a lock for that she needs a passcode. Sara knows that the passcode contains N digits in it and the digits at even indices(0- indexing) are even and the digits at odd indices are {2, 3, 5, 7}.
Now Sara wants to know how many different passcodes are possible so that she can open... | Compilable |
For this Question: Given a number N, find out whether it is divisible by 3.The first and the only line of input contains the number N.
<b>Constraints</b>
1 <= N <= 10^100000 (N may consist of 100001 digits).
<b>No usual datatype will be able to input such large number.</b>Output "Yes" if the number is divisibl... | Compilable |
For this Question: Given a number N, find out whether it is divisible by 3.The first and the only line of input contains the number N.
<b>Constraints</b>
1 <= N <= 10^100000 (N may consist of 100001 digits).
<b>No usual datatype will be able to input such large number.</b>Output "Yes" if the number is divisibl... | Compilable |
For this Question: Given a number N, find out whether it is divisible by 3.The first and the only line of input contains the number N.
<b>Constraints</b>
1 <= N <= 10^100000 (N may consist of 100001 digits).
<b>No usual datatype will be able to input such large number.</b>Output "Yes" if the number is divisibl... | Compilable |
For this Question: For a given integer N, super primes are those integers from 1 to N whose multiples (other than themselves) do no exist in the range [1, N].
Your task is to generate all super primes <= N in sorted order.
</b>Note: Super primes are not related to primes in any way.</b><b>User Task:</b>
Since this... | Compilable |
For this Question: For a given integer N, super primes are those integers from 1 to N whose multiples (other than themselves) do no exist in the range [1, N].
Your task is to generate all super primes <= N in sorted order.
</b>Note: Super primes are not related to primes in any way.</b><b>User Task:</b>
Since this... | Compilable |
For this Question: Given a sorted doubly linked list containing n nodes. Your task is to remove duplicate nodes from the given list.
Example 1:
Input
1<->2<->2-<->3<->3<->4
Output:
1<->2<->3<->4
Example 2:
Input
1<->1<->1<->1
Output
1<b>User Task:</b>
Since this will be a functional problem, you don'... | Compilable |
For this Question: Shivansh wants to give chapo to Arpit, but only if he is able to solve the following problem.
As you are a dear friend of Arpit, you decide to help Arpit solve the problem.
Given an array Arr of N numbers. You have to process Q queries on that array. Queries can be of following types :
> add x to ... | Compilable |
For this Question: Given a sting S of lowercase English character's. Your task is to find the minimum length subsequence which contains all characters from 'a' to 'z' in increasing order (i. e "abcdefghijklmnopqrstuvwxyz").Input contains a single string S.
Constraints:-
1 <= |S| <= 100000
Note:- Sting will conta... | Compilable |
For this Question: Given a sting S of lowercase English character's. Your task is to find the minimum length subsequence which contains all characters from 'a' to 'z' in increasing order (i. e "abcdefghijklmnopqrstuvwxyz").Input contains a single string S.
Constraints:-
1 <= |S| <= 100000
Note:- Sting will conta... | Compilable |
For this Question: There are N candies, i<sup>th</sup> of them costing p<sub>i</sub>. You have M amount of money with you. Find the maximum number of candies you can buy.The first line of the input contains two integers N and M.
The second line of the input contains N space seperated integers.
Constraints:
1 <= N ... | Compilable |
For this Question: Given a string s, find the minimum number of changes required to it so that all substrings of the string become distinct.
Note: length of string is atmost 26.The first line contains an integer T, number of test cases. For each testcase there is only one line containing s atmost 26 characters.
1... | Compilable |
For this Question: Given a string s, find the minimum number of changes required to it so that all substrings of the string become distinct.
Note: length of string is atmost 26.The first line contains an integer T, number of test cases. For each testcase there is only one line containing s atmost 26 characters.
1... | Compilable |
For this Question: Given a string s, find the minimum number of changes required to it so that all substrings of the string become distinct.
Note: length of string is atmost 26.The first line contains an integer T, number of test cases. For each testcase there is only one line containing s atmost 26 characters.
1... | Compilable |
For this Question: Ronaldo has challenged Messi to beat his team in the upcoming “Friendly” fixture. But both these legends are tired of the original football rules, so they decided to play Football with a twist. Each player is assigned an ID, from 1 to 10^6. Initially Ronaldo has the ball in his posession. Given a seq... | Compilable |
For this Question: Ronaldo has challenged Messi to beat his team in the upcoming “Friendly” fixture. But both these legends are tired of the original football rules, so they decided to play Football with a twist. Each player is assigned an ID, from 1 to 10^6. Initially Ronaldo has the ball in his posession. Given a seq... | Compilable |
For this Question: Ronaldo has challenged Messi to beat his team in the upcoming “Friendly” fixture. But both these legends are tired of the original football rules, so they decided to play Football with a twist. Each player is assigned an ID, from 1 to 10^6. Initially Ronaldo has the ball in his posession. Given a seq... | Compilable |
For this Question: Alexa has a drink that has A kilocalories of energy per 100 milliliters. How many kilocalories of energy does B milliliters of this drink have?The input consists of two space separated integers A and B.
<b>Constraints</b>
0 ≤ A, B ≤1000
All values in input are integers.Print a number repre... | Compilable |
For this Question: Alexa has a drink that has A kilocalories of energy per 100 milliliters. How many kilocalories of energy does B milliliters of this drink have?The input consists of two space separated integers A and B.
<b>Constraints</b>
0 ≤ A, B ≤1000
All values in input are integers.Print a number repre... | Compilable |
For this Question: Alexa has a drink that has A kilocalories of energy per 100 milliliters. How many kilocalories of energy does B milliliters of this drink have?The input consists of two space separated integers A and B.
<b>Constraints</b>
0 ≤ A, B ≤1000
All values in input are integers.Print a number repre... | Compilable |
For this Question: Given an integer N, your task is to check whether the given number is prime or notThe input contains a single integer N.
Constraints:-
1 <= N <= 100000000000Print "YES" If the given number is prime else print "NO".Sample Input:-
2
Sample Output:-
YES
Sample Input:-
4
Sample Output:-
... | Compilable |
For this Question: Given an integer N, your task is to check whether the given number is prime or notThe input contains a single integer N.
Constraints:-
1 <= N <= 100000000000Print "YES" If the given number is prime else print "NO".Sample Input:-
2
Sample Output:-
YES
Sample Input:-
4
Sample Output:-
... | Compilable |
For this Question: Given an integer N, your task is to check whether the given number is prime or notThe input contains a single integer N.
Constraints:-
1 <= N <= 100000000000Print "YES" If the given number is prime else print "NO".Sample Input:-
2
Sample Output:-
YES
Sample Input:-
4
Sample Output:-
... | Compilable |
For this Question: You are given a 2X2 square matrix. You need to find the determinant of the matrix.The input contains two-line, each line contain two integers separated by spaces.
Each element of the matrix is from 1 to 100.Output a single integer, the determinant of the matrix.Sample Input
4 5
2 3
Sample Out... | Compilable |
For this Question: You are given a 2X2 square matrix. You need to find the determinant of the matrix.The input contains two-line, each line contain two integers separated by spaces.
Each element of the matrix is from 1 to 100.Output a single integer, the determinant of the matrix.Sample Input
4 5
2 3
Sample Out... | Compilable |
For this Question: You are given a 2X2 square matrix. You need to find the determinant of the matrix.The input contains two-line, each line contain two integers separated by spaces.
Each element of the matrix is from 1 to 100.Output a single integer, the determinant of the matrix.Sample Input
4 5
2 3
Sample Out... | Compilable |
For this Question: Given of array of N integers, find its number of increasing subsequences modulo (10^9 + 7)
A subsequence of the given array is the array formed after removing zero or more elements from it.
It is said to be increasing when every element is greater than its previous one.First line of input contains ... | Compilable |
For this Question: Given of array of N integers, find its number of increasing subsequences modulo (10^9 + 7)
A subsequence of the given array is the array formed after removing zero or more elements from it.
It is said to be increasing when every element is greater than its previous one.First line of input contains ... | Compilable |
For this Question: Given a positive integer N. You need to print the sum of the first N natural numbers.The first line of input contains a single integer T, the next T lines contains a single integer N.
Constraints:
1 < = T < = 100
1 < = N < = 100Print the sum of first N natural numbers for each test case in a new... | Compilable |
For this Question: Given a positive integer N. You need to print the sum of the first N natural numbers.The first line of input contains a single integer T, the next T lines contains a single integer N.
Constraints:
1 < = T < = 100
1 < = N < = 100Print the sum of first N natural numbers for each test case in a new... | Compilable |
For this Question: Given a positive integer N. You need to print the sum of the first N natural numbers.The first line of input contains a single integer T, the next T lines contains a single integer N.
Constraints:
1 < = T < = 100
1 < = N < = 100Print the sum of first N natural numbers for each test case in a new... | Compilable |
For this Question: Given a sorted array arr[] of N integers and a number K is given. The task is to check if the element K is present in the array or not.
<b>Note:</b> Use binary search to solve the problemThe first line of input contains a number of test cases T. For each test case, the first line of input contains a... | Compilable |
For this Question: Given a sorted array arr[] of N integers and a number K is given. The task is to check if the element K is present in the array or not.
<b>Note:</b> Use binary search to solve the problemThe first line of input contains a number of test cases T. For each test case, the first line of input contains a... | Compilable |
For this Question: Given a sorted array arr[] of N integers and a number K is given. The task is to check if the element K is present in the array or not.
<b>Note:</b> Use binary search to solve the problemThe first line of input contains a number of test cases T. For each test case, the first line of input contains a... | Compilable |
For this Question: Given a sorted array arr[] of N integers and a number K is given. The task is to check if the element K is present in the array or not.
<b>Note:</b> Use binary search to solve the problemThe first line of input contains a number of test cases T. For each test case, the first line of input contains a... | Compilable |
For this Question: Given a number N. The task is to generate and print all binary numbers with decimal values from 1 to N.
Try solving this using a queue.The only line of input contains a single integer N.
1 <= N <= 50000Print all binary numbers with decimal values from 1 to N in a single line.Sample Input:
5
... | Compilable |
For this Question: Given a number N. The task is to generate and print all binary numbers with decimal values from 1 to N.
Try solving this using a queue.The only line of input contains a single integer N.
1 <= N <= 50000Print all binary numbers with decimal values from 1 to N in a single line.Sample Input:
5
... | Compilable |
For this Question: Given a number N. The task is to generate and print all binary numbers with decimal values from 1 to N.
Try solving this using a queue.The only line of input contains a single integer N.
1 <= N <= 50000Print all binary numbers with decimal values from 1 to N in a single line.Sample Input:
5
... | Compilable |
For this Question: You are given the following pseudocode:
code :
res = a
for i = 1 to k
if i is odd
res = res & b
else
res = res | b
You are also given the values of a, b and k. Find the value of res.First line contains of single integer t denoting number of test cases.
Each test cases cons... | Compilable |
For this Question: You are given the following pseudocode:
code :
res = a
for i = 1 to k
if i is odd
res = res & b
else
res = res | b
You are also given the values of a, b and k. Find the value of res.First line contains of single integer t denoting number of test cases.
Each test cases cons... | Compilable |
For this Question: You are given the following pseudocode:
code :
res = a
for i = 1 to k
if i is odd
res = res & b
else
res = res | b
You are also given the values of a, b and k. Find the value of res.First line contains of single integer t denoting number of test cases.
Each test cases cons... | Compilable |
For this Question: While Solo was enjoying her daddy's party, her little sister Tono gave her the following problem to solve:
Given an array A of N integers, find the number of occurrences of the maximum integer in the array.
As Solo is small and enjoying the party, please help her solve this problem.The first line... | Compilable |
For this Question: While Solo was enjoying her daddy's party, her little sister Tono gave her the following problem to solve:
Given an array A of N integers, find the number of occurrences of the maximum integer in the array.
As Solo is small and enjoying the party, please help her solve this problem.The first line... | Compilable |
For this Question: While Solo was enjoying her daddy's party, her little sister Tono gave her the following problem to solve:
Given an array A of N integers, find the number of occurrences of the maximum integer in the array.
As Solo is small and enjoying the party, please help her solve this problem.The first line... | Compilable |
For this Question: Given an array A of size N (N is always even), you need to find exactly (N/2) numbers where each number represents the pair-wise sum of consecutive elements of the array A.
In simple terms print (A[1]+A[2]), (A[3]+A[4]), ..., (A[N-1]+A[N]).The first line of the input contains the number of test ca... | Compilable |
For this Question: Given an array A of size N (N is always even), you need to find exactly (N/2) numbers where each number represents the pair-wise sum of consecutive elements of the array A.
In simple terms print (A[1]+A[2]), (A[3]+A[4]), ..., (A[N-1]+A[N]).The first line of the input contains the number of test ca... | Compilable |
For this Question: Given an array A of size N (N is always even), you need to find exactly (N/2) numbers where each number represents the pair-wise sum of consecutive elements of the array A.
In simple terms print (A[1]+A[2]), (A[3]+A[4]), ..., (A[N-1]+A[N]).The first line of the input contains the number of test ca... | Compilable |
For this Question: Given a linked list consisting of N nodes and an integer K, your task is to reverse every alternate K nodes.
In other words , you have to reverse first k nodes , then skip the next k nodes , then reverse next k nodes and so on .
NOTE: if there are not K nodes to reverse then reverse all the no... | Compilable |
For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.
<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11
... | Compilable |
For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.
<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11
... | Compilable |
For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.
<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11
... | Compilable |
For this Question: A graph is given with N nodes and M edges. The first visit to a vertex i will give 2<sup>i-1</sup> -1 score. Initially, we are at node 1. Then calculate the maximum score that we can get if we are only allowed to move to an adjacent vertex at most K times.First line contains 3 integers separated by s... | Compilable |
For this Question: For an integer N, your task is to calculate sum of first N natural numbers.<b>User Task:</b>
Since this will be a functional problem, you don't have to worry about input. You just have to complete the function <b>sum()</b> which takes the integer N as a parameter.
Constraints:
1 <= N < = 1000000... | Compilable |
For this Question: There are N pizza delivery people, they need to deliver pizzas to M customers in the town. The town is a straight line, and all the above N + M people are at distinct positions in it. The initial position of i-th pizza delivery person is P<sub>i</sub> and the initial position i-th person to whom pizz... | Compilable |
For this Question: There are N pizza delivery people, they need to deliver pizzas to M customers in the town. The town is a straight line, and all the above N + M people are at distinct positions in it. The initial position of i-th pizza delivery person is P<sub>i</sub> and the initial position i-th person to whom pizz... | Compilable |
For this Question: You are given an array A of size N. You have to print the maximum in every <b>K-sized subarray</b> from the left to the right in the array A.
More formally, you have to print N - K + 1 integers X<sub>1</sub>, X<sub>2</sub>, ..., X<sub>N-K+1</sub> such that X<sub>i</sub> (1 <= i <= N - K + 1) is the ... | Compilable |
For this Question: You are given an array A of size N. You have to print the maximum in every <b>K-sized subarray</b> from the left to the right in the array A.
More formally, you have to print N - K + 1 integers X<sub>1</sub>, X<sub>2</sub>, ..., X<sub>N-K+1</sub> such that X<sub>i</sub> (1 <= i <= N - K + 1) is the ... | Compilable |
For this Question: You are given an array A of size N. You have to print the maximum in every <b>K-sized subarray</b> from the left to the right in the array A.
More formally, you have to print N - K + 1 integers X<sub>1</sub>, X<sub>2</sub>, ..., X<sub>N-K+1</sub> such that X<sub>i</sub> (1 <= i <= N - K + 1) is the ... | Compilable |
For this Question: Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products ... | Compilable |
For this Question: Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products ... | Compilable |
For this Question: Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products ... | Compilable |
For this Question: Given a tree consisting of N nodes (from 1 to N) rooted at 1. You are given a node, your task is to calculate the sum of values of all nodes present at the same level that is of the given node.First line of input contains two space separated integers denoting the number of nodes N and the given node ... | Compilable |
For this Question: Given a tree consisting of N nodes (from 1 to N) rooted at 1. You are given a node, your task is to calculate the sum of values of all nodes present at the same level that is of the given node.First line of input contains two space separated integers denoting the number of nodes N and the given node ... | Compilable |
For this Question: Given a tree consisting of N nodes (from 1 to N) rooted at 1. You are given a node, your task is to calculate the sum of values of all nodes present at the same level that is of the given node.First line of input contains two space separated integers denoting the number of nodes N and the given node ... | Compilable |
For this Question: Joffrey has issued orders for Stark's execution. Now, you are trying to predict if Stark will survive or not. You are confident that Stark's survival depends on the N<sup>th</sup> fibonacci number's parity. If it is odd you will predict that Stark lives but if it is even you will predict that Stark d... | Compilable |
For this Question: Joffrey has issued orders for Stark's execution. Now, you are trying to predict if Stark will survive or not. You are confident that Stark's survival depends on the N<sup>th</sup> fibonacci number's parity. If it is odd you will predict that Stark lives but if it is even you will predict that Stark d... | Compilable |
For this Question: Joffrey has issued orders for Stark's execution. Now, you are trying to predict if Stark will survive or not. You are confident that Stark's survival depends on the N<sup>th</sup> fibonacci number's parity. If it is odd you will predict that Stark lives but if it is even you will predict that Stark d... | Compilable |
For this Question: Given an integer array <strong>arr[]</strong> of size <strong>N</strong> and an element <strong>X</strong>. The task is to find and print the indices of the given element if it is present in array if not then print “<strong>Not found</strong>” without quotes.
<strong>Note</strong>: The elements m... | Compilable |
For this Question: Given an integer array <strong>arr[]</strong> of size <strong>N</strong> and an element <strong>X</strong>. The task is to find and print the indices of the given element if it is present in array if not then print “<strong>Not found</strong>” without quotes.
<strong>Note</strong>: The elements m... | Compilable |
For this Question: Given an integer array <strong>arr[]</strong> of size <strong>N</strong> and an element <strong>X</strong>. The task is to find and print the indices of the given element if it is present in array if not then print “<strong>Not found</strong>” without quotes.
<strong>Note</strong>: The elements m... | Compilable |
For this Question: Insertion is a basic but frequently used operation. Arrays in most languages cannnot be dynamically shrinked or expanded. Here, we will work with such arrays and try to insert an element at the end of array.
You are given an array arr. The size of the array is N. You need to insert an element at ... | Compilable |
For this Question: Insertion is a basic but frequently used operation. Arrays in most languages cannnot be dynamically shrinked or expanded. Here, we will work with such arrays and try to insert an element at the end of array.
You are given an array arr. The size of the array is N. You need to insert an element at ... | Compilable |
For this Question: Insertion is a basic but frequently used operation. Arrays in most languages cannnot be dynamically shrinked or expanded. Here, we will work with such arrays and try to insert an element at the end of array.
You are given an array arr. The size of the array is N. You need to insert an element at ... | Compilable |
For this Question: For an integer N, your task is to calculate sum of first N natural numbers.<b>User Task:</b>
Since this will be a functional problem, you don't have to worry about input. You just have to complete the function <b>sum()</b> which takes the integer N as a parameter.
Constraints:
1 <= N < = 1000000... | Compilable |
For this Question: The flower shop near his house sells flowers of N types. It is found that the store has Ai flowers of the i-th type. We like odd numbers. Therefore, we have decided that there should be an odd number of flowers of each type in the bouquet, and the total number of flowers in the bouquet should also be... | Compilable |
For this Question: The flower shop near his house sells flowers of N types. It is found that the store has Ai flowers of the i-th type. We like odd numbers. Therefore, we have decided that there should be an odd number of flowers of each type in the bouquet, and the total number of flowers in the bouquet should also be... | Compilable |
For this Question: The flower shop near his house sells flowers of N types. It is found that the store has Ai flowers of the i-th type. We like odd numbers. Therefore, we have decided that there should be an odd number of flowers of each type in the bouquet, and the total number of flowers in the bouquet should also be... | Compilable |
For this Question: There is a saying in Sara's village that "A number is called prime if the sum of all the factors of N is less than or equal to (3*N)/2 ". Given the number N, your task is to check if it is a myth or a fact for the number given.<b>User Task:</b>
Since this will be a functional problem, you don't have... | Compilable |
For this Question: There is a saying in Sara's village that "A number is called prime if the sum of all the factors of N is less than or equal to (3*N)/2 ". Given the number N, your task is to check if it is a myth or a fact for the number given.<b>User Task:</b>
Since this will be a functional problem, you don't have... | Compilable |
For this Question: There is a saying in Sara's village that "A number is called prime if the sum of all the factors of N is less than or equal to (3*N)/2 ". Given the number N, your task is to check if it is a myth or a fact for the number given.<b>User Task:</b>
Since this will be a functional problem, you don't have... | Compilable |
For this Question: There is a saying in Sara's village that "A number is called prime if the sum of all the factors of N is less than or equal to (3*N)/2 ". Given the number N, your task is to check if it is a myth or a fact for the number given.<b>User Task:</b>
Since this will be a functional problem, you don't have... | Compilable |
For this Question: Given a circular linked list consisting of N nodes and an integer K, your task is to add the integer K at the end of the list.
<b>Note:
Sample Input and Output just show how a linked list will look depending on the questions. Do not copy-paste as it is in custom input</b><b>User Task:</b>
Sinc... | Compilable |
For this Question: Complete the function isArray which takes an input which can be any data type and returns true
if it's an array else false.Could be any datatype string number object or an arraytrue or falseSample Input:-
1
[2, 3]
Sample Output
false
true, I have written this Solution Code: import java.io.*;
im... | Compilable |
For this Question: Complete the function isArray which takes an input which can be any data type and returns true
if it's an array else false.Could be any datatype string number object or an arraytrue or falseSample Input:-
1
[2, 3]
Sample Output
false
true, I have written this Solution Code: function isArray(i... | Compilable |
For this Question: Create a new class VipCustomer
it should have 3 fields name, creditLimit(double), and email address, there default value is as {name:"XYZ", creditLimit:"10", email:"xyz@abc. com"} respectively means ordering of parameter should be same.
E.g constructor(name,creditLimit,email);
create 3 constru... | Compilable |
For this Question: A number (n) is represented in Linked List such that each digit corresponds to a node in linked list. Add 1 to it.
<b>Note:-</b> Linked list representation of a number is from left to right i.e if the number is 123 than in linked list it is represented as 3->2->1<b>User Task:</b>
Since this will ... | Compilable |
For this Question: An array of numbers is given. It has all unique elements except one. Find the only duplicate element in that array having all other unique elements.The first line contains an integer N, the number of elements in the array.
The second line contains N integers.
Constraints:
1 <= N <= 10^5
1 <= El... | Compilable |
For this Question: An array of numbers is given. It has all unique elements except one. Find the only duplicate element in that array having all other unique elements.The first line contains an integer N, the number of elements in the array.
The second line contains N integers.
Constraints:
1 <= N <= 10^5
1 <= El... | Compilable |
For this Question: Given a string s, find the first non-repeating character in the string and return its index. If it does not exist, return -1.First line of the input contains the string s.
<b>Constraints</b>
1<= s. length <= 100000Print the index of the first non- repeating character in a stringInput
s = "newto... | Compilable |
For this Question: Given a string s, find the first non-repeating character in the string and return its index. If it does not exist, return -1.First line of the input contains the string s.
<b>Constraints</b>
1<= s. length <= 100000Print the index of the first non- repeating character in a stringInput
s = "newto... | Compilable |
For this Question: Given a string s, find the first non-repeating character in the string and return its index. If it does not exist, return -1.First line of the input contains the string s.
<b>Constraints</b>
1<= s. length <= 100000Print the index of the first non- repeating character in a stringInput
s = "newto... | Compilable |
For this Question: Ram has a military dog who has the special ability of hearing, He can hear frequencies starting from 70Hz to 44000Hz (both inclusive). Now Ram wants to detect some unusual sounds across him. Tell "Yes" or "No" whether his dog can detect the sound or not.First line of the input contains the value of T... | Compilable |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.