A community for students.
Here's the question you clicked on:
 0 viewing
 2 years ago
I'm here for Java help, let me know if anyone needs anything. I scroll around the group, but sadly most of it is Python and noncomp sci stuff :(.
 2 years ago
I'm here for Java help, let me know if anyone needs anything. I scroll around the group, but sadly most of it is Python and noncomp sci stuff :(.

This Question is Closed

Yacub93
 2 years ago
Best ResponseYou've already chosen the best response.0Hi, I may require your assistance with some of my Java programs.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3@xaadi I don't need to ask, I'm here to tell.

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0@KonradZuse where were you when I took my twitter online interview with the 2 sets of problems each 30 min timed??

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0I already passed with 120 points from 200 but u wanna see one problem? Java ofcourse.

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0A nonempty zeroindexed array A consisting of N integers is given. A pair of integers (P, Q) is called Kcomplementary in array A if 0 ? P, Q < N and A[P] + A[Q] = K. For example, consider array A such that: A[0] = 1 A[1] = 8 A[2]= 3 A[3] = 0 A[4] = 1 A[5]= 3 A[6] = 2 A[7] = 4 A[8]= 5 The following pairs are 6complementary in array A: (0,8), (1,6), (4,8), (5,5), (6,1), (8,0), (8,4). For instance, the pair (4,8) is 6complementary because A[4] + A[8] = 1 + 5 = 6. Write a function: class Solution { public int complementary_pairs(int K,int[] A); } that, given an integer K and a nonempty zeroindexed array A consisting of N integers, returns the number of Kcomplementary pairs in array A. For example, given K = 6 and array A such that: A[0] = 1 A[1] = 8 A[2]= 3 A[3] = 0 A[4] = 1 A[5]= 3 A[6] = 2 A[7] = 4 A[8]= 5 the function should return 7, as explained above. Assume that: N is an integer within the range [1..50,000]; K is an integer within the range [2,147,483,648..2,147,483,647]; each element of array A is an integer within the range [2,147,483,648..2,147,483,647]. Complexity: expected worstcase time complexity is O(N*log(N)); expected worstcase space complexity is O(N), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0or if you like this one better: A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001) and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps. Write a function: class Solution { public int binary_gap(int N); } that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap. For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5.Assume that: N is an integer within the range [1..2,147,483,647].

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3Lol such useless questions.....

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0I know, but I had to resolve both in 60 minutes.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3Yeah that's bs too. oh wells...

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3? Did you want me to solve them?

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0No, no, it's useless now, no  thanks alot

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0Just showing you how twitter tests are when you send your resume.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3I think it's sad that interviewers ask such dumb questions. I' a part of a site called the Code Ranch, and one dude said an interviewer asked him what the "3 minor pillars of Java were." There were SOO MANY answers from guys who havebeen doing this for years, and professionals like Bear B, and Paul C, and Cambell....

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3Interviewers should ask questions that are legit, and actually pertain to something.. Give examples of real world crap, not this stuff that no one will ever use... I guess when you're onyl given an hour they give you some tricky q's.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3One dude was telling me they askeds him about statics and some bs that was a trick Q.....

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3It's like you want Swing GUI's, FX, Open Gl, Databases, etc I can do it, but don't give me some stupid bs Q Lol :)

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0exactly. but if you dont answer THEIR Q' you're irrelevant.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3Yeah they suck I hate them :P. Good thing I wont have to work for any of them!

g152xx
 2 years ago
Best ResponseYou've already chosen the best response.0Big Moose Saloon lool. Sounds fun.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3:) The code ranch is the best, even though half of them have HUUUUUUUUUUUUUGE Egos.

Amarda
 2 years ago
Best ResponseYou've already chosen the best response.0Can you make a simple code where there are two constructors that turns exactly the same thing ?

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3There are 3 sites I recommend. http://docs.oracle.com/javase/tutorial/index.html There is a also www.learnnowjava.com ; however that isnt' free like the Oracle Trail. www.CodeRanch.com also has a ton of professionals, but they wont do your code for you, just help you along the way.

thenewguy
 2 years ago
Best ResponseYou've already chosen the best response.0Any idea about JSP anyone?..I dont know anything about JSP and I am desperate to know. Where should I start from? Some video tutorials would be of great help. Do you know any website from where I can download JSP videos?

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.3oracle trail has tuts on everything.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.