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  

---

Can I have constructor in Interface?

2 Answers  

---

What is the difference between a public and a non-public class?

2 Answers  

---

Which is easier netbeans or eclipse?

0 Answers  

---

Explain the importance of finalize() method.

0 Answers  

---

In the below example, what will be the output?

0 Answers  

---

What is thread safe singleton?

0 Answers  

---

Write a program to print 15 random numbers using foreach of java 8?

0 Answers  

---

Is hashset ordered java?

0 Answers  

---

What makes a function well defined?

0 Answers  

---

I have an HashMap object, which has with key and value pair. It has 10 keys and values in that object. Now the question is I want insert new key and value in middle or any where in that list but not at the end or at the top. Is it possible or not. If yes how can we achieve this one?

2 Answers   Huawei,

---

Why is string buffer better than string ?

0 Answers   Cyient,

---