Write an algorithm program in java for the following question..
1) S is a set of integers.X is an integer obtained by sum of two digits in S.
Write logic for whether or not the X is from the S.
The time of algorithm should not exceed o(n logn).
- 0 Answers
- 1696 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is the type of lambda expression?
Explain wait() method of object class ?
Does java support function overloading, pointers, structures, unions or linked lists?
What technique can be employed to compare two strings?
What are instance variables?
What is the most important feature of java? What is an interface?
how is final different from finally and finalize in java?
What is the use of bufferedreader?
Is 0 a prime number?
Write a program to check for a prime number in java?
can used Protected Class outside Function.?
I want to persist data of objects for later use. What’s the best approach to do so?
Core Java 
