Need live java help for solving some questions.
Example question:
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.
For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.
Given A = [1, 2, 3], the function should return 4.
Given A = [−1, −3], the function should return 1.
Write an efficient algorithm for the following assumptions:
• N is an integer within the range [1..100,000];
• each element of array A is an integer within the range [−1,000,000..1,000,000]
I'll help you with your applications. I'm a civil engineer but I code in Java. I have experience in mobile applications and desktop applications using Java.
Hi...
My name is Muhammad Ali...
I can do this job pretty easily....
this just needs short amount of time to get completed....
I can immediately start....
waiting for your response...
Hi ,am a Java programmer and Java tutor I can help solve any Java or algorithms related problems, contact me to get your problem solved within the shortest time
Hi
How are you?
I understood all of your problem.
If you give me the assignment, I can help you with it quickly.
If you award me ,i can explain algorithm.
Please connect me.
thank you.