Skip to main content
Code Review

Return to Question

replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/
Source Link
edited tags
Link
200_success
  • 145.5k
  • 22
  • 190
  • 479
Post Reopened by Jamal
deleted 131 characters in body; edited title
Source Link
Jamal
  • 35.2k
  • 13
  • 134
  • 238

Java Interview - Missing level of technical depth (Recursive to Iterative)

They refused me by saying that"as we felt they didn't demonstrate the level of technical depth we're seeking from candidates"

as we felt they didn't demonstrate the level of technical depth we're seeking from candidates

Question 2 : Java Interview - MissingMissing level of technical depth (Flatten Tree)

Question 3 : Java Interview - MissingMissing level of technical depth (Common Ancestor)

Question 1: - Reimplement this code so that its results will always be the same, but that it does not cause a stack overflow on large inputs. Your solution must still implement the Folder interface.

Reimplement this code so that its results will always be the same, but that it does not cause a stack overflow on large inputs. Your solution must still implement the Folder interface.

//------------------------------------------------------


package iteration;
 
public interface Function2<T, U, R>
{
 R apply(T t, U u);
}

//------------------------------------------------------


Java Interview - Missing level of technical depth (Recursive to Iterative)

They refused me by saying that"as we felt they didn't demonstrate the level of technical depth we're seeking from candidates"

Question 2 : Java Interview - Missing level of technical depth (Flatten Tree)

Question 3 : Java Interview - Missing level of technical depth (Common Ancestor)

Question 1: - Reimplement this code so that its results will always be the same, but that it does not cause a stack overflow on large inputs. Your solution must still implement the Folder interface.

//------------------------------------------------------

package iteration;
 
public interface Function2<T, U, R>
{
 R apply(T t, U u);
}

//------------------------------------------------------

Missing level of technical depth (Recursive to Iterative)

They refused me by saying that

as we felt they didn't demonstrate the level of technical depth we're seeking from candidates

Question 2 : Missing level of technical depth (Flatten Tree)

Question 3 : Missing level of technical depth (Common Ancestor)

Question 1:

Reimplement this code so that its results will always be the same, but that it does not cause a stack overflow on large inputs. Your solution must still implement the Folder interface.


package iteration;
 
public interface Function2<T, U, R>
{
 R apply(T t, U u);
}

split into three separate questions as per rule
Source Link
AAhad
  • 409
  • 1
  • 3
  • 10
Loading
Post Closed as "Needs more focus" by rolfl
Source Link
AAhad
  • 409
  • 1
  • 3
  • 10
Loading
lang-java

AltStyle によって変換されたページ (->オリジナル) /