<div>
What do all the cases you are failing have in common?
</div>

<div>
<blockquote>
one extra 5
</blockquote>
 That's what's wrong with your result. 
 
But what do the input arrays have in common?
</div>

<div>
also every 4 has a number after it that is not a 4
</div>

<div>
they have 5 at beginning and failing 
 
Below passes all tests 
 

<pre><code class="code-10 nolinks" id="code-20-41768155-1">public int[] fix45(int[] nums) {
		 for (int x = 0; x &lt; nums.length; x++) {
		 if (nums[x] == 4) {
		 for (int y = 0; y &lt; nums.length; y++) {
		 if (nums[y] == 5) {
		 if (y &gt; 0 &amp;&amp; nums[y-1] != 4) {
		 int buffer = nums[x+1];
		 nums[x+1] = 5;
		 nums[y] = buffer;
		 } 
		 else if (y == 0) {
		 int buff = nums[x+1];
		 nums[x+1] = 5;
		 nums[y] = buff;
		 }
		 
		 }
		 }
		 }
		 }
		 return nums;
		}
</code></pre>
 

<blockquote>
Expected &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Run &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 9, 4, 9, 5]) → [9, 4, 5, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[9, 4, 5, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([1, 4, 1, 5]) → [1, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([1, 4, 1, 5, 5, 4, 1]) → [1, 4, 5, 1, 1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5, 1, 1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 9, 4, 9, 5, 5, 4, 9, 5]) → [4, 5, 4, 5, 9, 9, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 9, 9, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 5, 4, 1, 4, 1]) → [1, 1, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 1, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 2, 2, 5]) → [4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 2, 4, 2, 5, 5]) → [4, 5, 4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 2, 4, 5, 5]) → [4, 5, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([1, 1, 1]) → [1, 1, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 1, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 5]) → [4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 1]) → [1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([]) → [] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 5, 4, 1]) → [1, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 5, 4, 1, 5]) → [4, 5, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([3, 4, 5]) → [3, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[3, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 1, 5]) → [4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 1]) → [1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([2, 4, 2, 5]) → [2, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[2, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
other tests 

</blockquote>
 

<pre><code class="code-10 nolinks" id="code-20-41768155-2">package com.solution;

import java.util.Arrays;

public class Fix45 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] ar={1,4,1,5};
		System.out.println(&quot;fix45 --&gt;&quot;+Arrays.toString(fix45(ar)));

	}

	
	public static int[] fix45(int[] nums) {
		 for (int x = 0; x &lt; nums.length; x++) {
		 if (nums[x] == 4) {
		 for (int y = 0; y &lt; nums.length; y++) {
		 if (nums[y] == 5) {
		 if (y &gt; 0 &amp;&amp; nums[y-1] != 4) {
		 int buffer = nums[x+1];
		 nums[x+1] = 5;
		 nums[y] = buffer;
		 } 
		 else if (y == 0) {
		 int buff = nums[x+1];
		 nums[x+1] = 5;
		 nums[y] = buff;
		 }
		 
		 }
		 }
		 }
		 }
		 return nums;
		}
}
</code></pre>
 
fix45 --&gt;[1, 4, 5, 1] 
 
any improvement/refinement/alternate approach?
</div>

<div>
I don't know if my solution is any better than yours. &nbsp;I create a new array. I fill it with the values from the input array. I return the new array.
<pre><code class="code-10 nolinks" id="code-20-41768178-1">public int[] fix45(int[] nums) {
 int[] arr = new int[nums.length];
 	 for (int z = 0; z &lt; nums.length; z++){
	 if (nums[z] == 4) {
	 arr[z] = 4;
	 arr[z + 1] = 5;
	 }
 }
 int mark = 0;
	 for (int j = 0; j &lt; nums.length; j++){
	 if(arr[j] == 0){
	 for (int k = mark; k &lt; nums.length; k++){
	 if(nums[k] != 4 &amp;&amp; nums[k] != 5){
	 arr[j] = nums[k];
	 mark = k + 1;
	 break;
	 }
	 }
	 } 
 }
	 return arr;
}
</code></pre>
</div>

<div>
How does your pseudo code compare with this: 

<pre><code class="code-10 nolinks" id="code-20-41768779-1">b = 0
for i= 0 to length
 if (nums[i] == 4) 
 buff[b] = nums[i+1]
 nums[i+1] = 5
 b ++

b = 0
for i= 0 to length	
 if (nums[i] == 5)
 if (i == 0)
 nums[i] = buff[b]
 b++
 else if (nums[i-1] != 4)
 nums[i] = buff[b]
 b++
</code></pre>
</div>

<div>
what is the purpose of 
 
&nbsp; mark = k + 1; 
 

<blockquote>
public int[] fix45(int[] nums) { 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int[] arr = new int[nums.length]; 
&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp;for (int z = 0; z &lt;&nbsp;nums.length; z++){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if (nums[z] == 4) { 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr[z] = 4; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr[z + 1] = 5; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} 
&nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp; &nbsp; &nbsp; &nbsp; int mark = 0; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;for (int j = 0; j &lt;&nbsp;nums.length; j++){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(arr[j] == 0){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;for (int k = mark; k &lt;&nbsp;nums.length; k++){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(nums[k] != 4 &amp;&amp;&nbsp;nums[k] != 5){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; arr[j] = nums[k]; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; mark = k + 1; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} 
&nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;return arr; 
}
</blockquote>
 

<pre><code class="code-10 nolinks" id="code-20-41769211-1">package com.solution;

import java.util.Arrays;

public class Fix46_2 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] ar = { 1, 4, 1, 5 };
		System.out.println(&quot;fix45 --&gt;&quot; + Arrays.toString(fix45(ar)));

	}

	public static int[] fix45(int[] nums) {
		
 int[] arr = new int[nums.length];
	 for (int z = 0; z &lt; nums.length; z++){
	 if (nums[z] == 4) {
	 arr[z] = 4;
	 arr[z + 1] = 5;
	 }
 }
 int mark = 0;
	 for (int j = 0; j &lt; nums.length; j++){
	 if(arr[j] == 0){
	 for (int k = mark; k &lt; nums.length; k++){
	 if(nums[k] != 4 &amp;&amp; nums[k] != 5){
	 arr[j] = nums[k];
	 mark = k + 1;
	 break;
	 }
	 }
	 } 
 }
	 return arr;
}
}
</code></pre>
</div>

<div>
i see using mark and other for loop you are trying to fill non 4 and non 5 values from imput nums asrray to output new arr array. 
 
I found your solution of filling new array is more straight forward? 
why are &nbsp;we starting second for loop from mark rather than 0? 

<blockquote>
public int[] fix45(int[] nums) { 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int[] arr = new int[nums.length]; 
&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp;for (int z = 0; z &lt;&nbsp;nums.length; z++){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if (nums[z] == 4) { 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr[z] = 4; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr[z + 1] = 5; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} 
&nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp; &nbsp; &nbsp; &nbsp; int mark = 0; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;for (int j = 0; j &lt;&nbsp;nums.length; j++){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(arr[j] == 0){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;for (int k = mark; k &lt;&nbsp;nums.length; k++){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(nums[k] != 4 &amp;&amp;&nbsp;nums[k] != 5){ 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; arr[j] = nums[k]; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; mark = k + 1; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} 
&nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;return arr; 
}
</blockquote>
</div>

<div>
can i solve fix34 challenge with same above approach?
</div>

<div>
i see you are using mark to increment inner for loop with k as you are breaking out of it prematurely for k++ to take place later.
</div>

<div>
<blockquote>
i see you are using mark to increment inner for loop with k as you are breaking out of it prematurely for k++ to take place later.
</blockquote>
 I used the mark variable to know where to begin looking for the next number to use to fill into the arr array. The increment in the loop(k++) is still used. &nbsp; 
There probably is room for improvement. But, when you closed this question, I stopped working on this. &nbsp;Anyway, maybe adding some debug statements, will shed some light on my code. See below, 
<pre><code class="code-10 nolinks" id="code-20-41769725-1">import java.util.Arrays;
public class Fix{
	public static void main(String[] args) {
		int[] input = {2, 3, 4, 6, 4, 7, 5, 5, 4, 8, 5};
		System.out.println(&quot; input --&gt;&quot; + Arrays.toString(input));
		fix45(input);
	}
	public static int[] fix45(int[] nums) {
 int[] arr = new int[nums.length];
 	 for (int z = 0; z &lt; nums.length; z++){
	 if (nums[z] == 4) {
	 arr[z] = 4;
	 arr[z + 1] = 5;
	 }
 }
		System.out.println(&quot; output --&gt;&quot; + Arrays.toString(arr) + &quot; (after first for loop)&quot;);
 int mark = 0;
	 for (int j = 0; j &lt; nums.length; j++){
	 if(arr[j] == 0){
	 for (int k = mark; k &lt; nums.length; k++){
	 if(nums[k] != 4 &amp;&amp; nums[k] != 5){
	 arr[j] = nums[k];
				 mark = k + 1;
				 System.out.println(&quot; j is &quot; + j + &quot;, k is &quot; + k + &quot;, mark is &quot; + mark);
				 System.out.println(&quot; output --&gt;&quot; + Arrays.toString(arr));
	 break;
	 } 
	 }
	 } 
 }
	 return arr;	
}
}
</code></pre>
 The output is : &nbsp; &nbsp; 
&nbsp; input --&gt;[2, 3, 4, 6, 4, 7, 5, 5, 4, 8, 5] 
&nbsp;output --&gt;[0, 0, 4, 5, 4, 5, 0, 0, 4, 5, 0] (after first for loop) 
&nbsp;j is 0, k is 0, mark is 1 
&nbsp;output --&gt;[2, 0, 4, 5, 4, 5, 0, 0, 4, 5, 0] 
&nbsp;j is 1, k is 1, mark is 2 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 0, 0, 4, 5, 0] 
&nbsp;j is 6, k is 3, mark is 4 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 6, 0, 4, 5, 0] 
&nbsp;j is 7, k is 5, mark is 6 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 6, 7, 4, 5, 0] 
&nbsp;j is 10, k is 9, mark is 10 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 6, 7, 4, 5, 8]
</div>

<div>
<blockquote>
 &nbsp;input --&gt;[2, 3, 4, 6, 4, 7, 5, 5, 4, 8, 5] 
&nbsp;output --&gt;[0, 0, 4, 5, 4, 5, 0, 0, 4, 5, 0] (after first for loop) 
&nbsp;j is 0, k is 0, mark is 1 
&nbsp;output --&gt;[2, 0, 4, 5, 4, 5, 0, 0, 4, 5, 0] 
&nbsp;j is 1, k is 1, mark is 2 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 0, 0, 4, 5, 0] 
&nbsp;j is 6, k is 3, mark is 4 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 6, 0, 4, 5, 0] 
&nbsp;j is 7, k is 5, mark is 6 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 6, 7, 4, 5, 0] 
&nbsp;j is 10, k is 9, mark is 10 
&nbsp;output --&gt;[2, 3, 4, 5, 4, 5, 6, 7, 4, 5, 8] 

</blockquote>
 
above output is more clear now. To understand again today taking some time around 1 hour even though i saw this day before yesterday?
</div>

<div>
<div class="content wysiwyg-content">
Hi, 
 
I am working on below challenge. 
<a href="http://codingbat.com/prob/p125819" rel="ugc">http://codingbat.com/prob/p125819</a> 
 
My psedo code of approach is 
1. iterate given arry 
2. find position of 4 
3. set next position to 5 by keeping orignal value in buffere 
4. create other for loop from &nbsp;index position where we found 4 plus two and if that value is 5 replace with buffere 
5. return modified array 
 

<pre><code class="code-10 nolinks" id="code-10-28965152-1">public int[] fix45(int[] nums) {
 

	 for (int z = 0; z &lt; nums.length; z++)
	 if (nums[z] == 4) {
	 int buffer = nums[z + 1];
	 nums[z + 1] = 5;
	 for (int j = z + 2; j &lt; nums.length; j++)
	 if (nums[j] == 5) 
	 	nums[j] = buffer;
	 }
	 return nums;
	

}
</code></pre>
 
i am failing below tests. please advise 

<blockquote>
Expected &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Run &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 9, 4, 9, 5]) → [9, 4, 5, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[5, 4, 5, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;X &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([1, 4, 1, 5]) → [1, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([1, 4, 1, 5, 5, 4, 1]) → [1, 4, 5, 1, 1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 4, 5, 1, 1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 9, 4, 9, 5, 5, 4, 9, 5]) → [4, 5, 4, 5, 9, 9, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 9, 9, 4, 5, 9] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 5, 4, 1, 4, 1]) → [1, 1, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[5, 5, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;X &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 2, 2, 5]) → [4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 2, 4, 2, 5, 5]) → [4, 5, 4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 2, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 2, 4, 5, 5]) → [4, 5, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([1, 1, 1]) → [1, 1, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[1, 1, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 5]) → [4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 1]) → [1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;X &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([]) → [] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 5, 4, 1]) → [1, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[5, 4, 5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;X &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 5, 4, 1, 5]) → [4, 5, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([3, 4, 5]) → [3, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[3, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([4, 1, 5]) → [4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[4, 5, 1] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([5, 4, 1]) → [1, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[5, 4, 5] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;X &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
fix45([2, 4, 2, 5]) → [2, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[2, 4, 5, 2] &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;OK &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
other tests
</blockquote>
</div>
</div>

Hi,

I am working on below challenge.
http://codingbat.com/prob/p125819

My psedo code of approach is
1. iterate given arry
2. find position of 4
3. set next position to 5 by keeping orignal value in buffere
4. create other for loop from  index position where we found 4 plus two and if that value is 5 replace with buffere
5. return modified array

(CODE)

i am failing below tests. please advise
Expected	Run		
fix45([5, 4, 9, 4, 9, 5]) → [9, 4, 5, 4, 5, 9]	[5, 4, 5, 4, 5, 9]	X	
fix45([1, 4, 1, 5]) → [1, 4, 5, 1]	[1, 4, 5, 1]	OK	
fix45([1, 4, 1, 5, 5, 4, 1]) → [1, 4, 5, 1, 1, 4, 5]	[1, 4, 5, 1, 1, 4, 5]	OK	
fix45([4, 9, 4, 9, 5, 5, 4, 9, 5]) → [4, 5, 4, 5, 9, 9, 4, 5, 9]	[4, 5, 4, 5, 9, 9, 4, 5, 9]	OK	
fix45([5, 5, 4, 1, 4, 1]) → [1, 1, 4, 5, 4, 5]	[5, 5, 4, 5, 4, 5]	X	
fix45([4, 2, 2, 5]) → [4, 5, 2, 2]	[4, 5, 2, 2]	OK	
fix45([4, 2, 4, 2, 5, 5]) → [4, 5, 4, 5, 2, 2]	[4, 5, 4, 5, 2, 2]	OK	
fix45([4, 2, 4, 5, 5]) → [4, 5, 4, 5, 2]	[4, 5, 4, 5, 2]	OK	
fix45([1, 1, 1]) → [1, 1, 1]	[1, 1, 1]	OK	
fix45([4, 5]) → [4, 5]	[4, 5]	OK	
fix45([5, 4, 1]) → [1, 4, 5]	[5, 4, 5]	X	
fix45([]) → []	[]	OK	
fix45([5, 4, 5, 4, 1]) → [1, 4, 5, 4, 5]	[5, 4, 5, 4, 5]	X	
fix45([4, 5, 4, 1, 5]) → [4, 5, 4, 5, 1]	[4, 5, 4, 5, 1]	OK	
fix45([3, 4, 5]) → [3, 4, 5]	[3, 4, 5]	OK	
fix45([4, 1, 5]) → [4, 5, 1]	[4, 5, 1]	OK	
fix45([5, 4, 1]) → [1, 4, 5]	[5, 4, 5]	X	
fix45([2, 4, 2, 5]) → [2, 4, 5, 2]	[2, 4, 5, 2]	OK	
other tests

Fix45 challenge

Java is a platform-independent, object-oriented programming language and run-time environment, designed to have as few implementation dependencies as possible such that developers can write one set of code across all platforms using libraries. Most devices will not run Java natively, and require a run-time component to be installed in order to execute a Java program.

Java

Java Enterprise Edition (Java EE) is a specification defining a collection of Java-based server and client technologies and how they interoperate. Java EE specifies server and client architectures and uses profiles to define technology sets targeted at specific classes of applications. All Java EE profiles share a set of common features, such as naming and resource injection, packaging rules and security requirements.

Java EE

Programming includes both the specifics of the language you’re using, like Visual Basic, .NET, Java and others, but also the best practices in user experience and interfaces and the management of projects, version control and development. Other programming topics are related to web and cloud development and system and hardware programming.

Programming

Programming theory deals with the design, implementation, analysis, characterization, and classification of programming languages and their individual features, along with introductory programming concepts like program structure, variable declaration and conditional and looping constructs. Sub-disciplines include the formal semantics of programming languages, type theory, program analysis and transformation, comparative programming language analysis, metaprogramming, domain-specific languages, compiler construction and run-time systems.

Programming Theory

Game programming is the software development of video games. Game programming requires substantial skill in software engineering as well as specialization in simulation, computer graphics, artificial intelligence, physics, audio programming, and input. Like other software, game development programs are generated from source code to the actual program by a compiler. Source code can be developed with almost any text editor, but most professional game programmers use a full integrated development environment (IDE).