Still celebrating National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17

Solved

fix34 challenge

Posted on 2016-08-14

2 solutions

Medium Priority

235 Views

Last Modified: 2016-08-24

Hi,

I am working on below challenge

http://codingbat.com/prob/p159339

I have not understood the description properly

Array-3 > fix34
prev | next | chance
Return an array that contains exactly the same numbers as the given array, but rearranged so that every 3 is immediately followed by a 4. Do not move the 3's, but every other number may move. The array contains the same number of 3's and 4's, every 3 has a number after it that is not a 3 or 4, and a 3 appears in the array before any 4.

fix34([1, 3, 1, 4]) → [1, 3, 4, 1]
fix34([1, 3, 1, 4, 4, 3, 1]) → [1, 3, 4, 1, 1, 3, 4]
fix34([3, 2, 2, 4]) → [3, 4, 2, 2]

please advise

Comment

Question by:gudii9

[X]

Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

Help others & share knowledge
Earn cash & points
Learn & ask questions

Join The Community

9 Comments

LVL 38

Expert Comment

by:Gerwin Jansen, EE MVE

ID: 417560572016-08-15

You need to put the numbers 4 that exist in the given array after the numbers 3.

In the given array, numbers 3 are not followed by a 4.

So:

1,3,5,4 will become 1,3,4,5

LVL 7

Author Comment

by:gudii9

ID: 417564442016-08-15

how
fix34([1, 3, 1, 4, 4, 3, 1]) becomes [1, 3, 4, 1, 1, 3, 4] ?
or just move 4 next 3 without moving 3?
what happens to non 4 and non 3 numbers? where we have to move them?

LVL 38

Accepted Solution

by:Gerwin Jansen, EE MVE

Gerwin Jansen, EE MVE earned 1000 total points

ID: 417565362016-08-15

Don't move 3
Move 4 to right side of a 3
You may move other numbers

LVL 7

Author Comment

by:gudii9

ID: 417602482016-08-17

not getting idea on best approach?

LVL 38

Expert Comment

by:Gerwin Jansen, EE MVE

ID: 417608122016-08-18

don't understand what you mean, explain

LVL 40

Assisted Solution

by:noci

noci earned 1000 total points

ID: 417642582016-08-21

Moving does include exchanging numbers.... Only 3's are fixed.... and there is a hint in the question as well.
There will be a 3 before any 4 anyway..., Also for every three there will be a 4....
so it can be done in a single pass through the array.

so

fix34([1, 3, 1, 4, 4, 3, 1]) 
becomes [ 1, 3, 4, 1, 4, 3, 1]
               -----
becomes  [1, 3, 4, 1, 1, 3, 4] ?
                     --    --

Open in new window

LVL 7

Author Comment

by:gudii9

ID: 417663052016-08-22

public int[] fix34(int[] nums) {

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

Open in new window

Expected      Run
fix34([1, 3, 1, 4]) → [1, 3, 4, 1]      [1, 3, 4, 1]      OK
fix34([1, 3, 1, 4, 4, 3, 1]) → [1, 3, 4, 1, 1, 3, 4]      [1, 3, 4, 1, 1, 3, 4]      OK
fix34([3, 2, 2, 4]) → [3, 4, 2, 2]      [3, 4, 2, 2]      OK
fix34([3, 2, 3, 2, 4, 4]) → [3, 4, 3, 4, 2, 2]      [3, 4, 3, 4, 2, 2]      OK
fix34([2, 3, 2, 3, 2, 4, 4]) → [2, 3, 4, 3, 4, 2, 2]      [2, 3, 4, 3, 4, 2, 2]      OK
fix34([3, 1, 4]) → [3, 4, 1]      [3, 4, 1]      OK
fix34([3, 4, 1]) → [3, 4, 1]      [3, 4, 1]      OK
fix34([1, 1, 1]) → [1, 1, 1]      [1, 1, 1]      OK
fix34([1]) → [1]      [1]      OK
fix34([]) → []      []      OK
fix34([7, 3, 7, 7, 4]) → [7, 3, 4, 7, 7]      [7, 3, 4, 7, 7]      OK
fix34([3, 1, 4, 3, 1, 4]) → [3, 4, 1, 3, 4, 1]      [3, 4, 1, 3, 4, 1]      OK
fix34([3, 1, 1, 3, 4, 4]) → [3, 4, 1, 3, 4, 1]      [3, 4, 1, 3, 4, 1]      OK
other tests
OK

above passes all tests

package com.solution;

import java.util.Arrays;

public class Fix34 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] ar={1, 3, 1, 4, 4, 3, 1};
		System.out.println("value-->"+Arrays.toString(fix34(ar)));

	}
	
	public static int[] fix34(int[] nums) {
	    for (int z = 0; z < nums.length; z++)
	        if (nums[z] == 3) {
	            int buffer = nums[z + 1];
	            nums[z + 1] = 4;
	            for (int j = z + 2; j < nums.length; j++)
	                if (nums[j] == 4) 
	                	nums[j] = buffer;
	        }
	    return nums;
	}

}

Open in new window

value-->[1, 3, 4, 1, 1, 3, 4]

LVL 7

Author Comment

by:gudii9

ID: 417692552016-08-24

public int[] fix34(int[] nums) {
		
        int[] arr = new int[nums.length];
	    for (int z = 0; z < nums.length; z++){
	        if (nums[z] == 3) {
	          arr[z] = 3;
	          arr[z + 1] = 4;
	        }
      }
      int mark = 0;
	      for (int j = 0; j < nums.length; j++){
	        if(arr[j] == 0){
	          for (int k = mark; k < nums.length; k++){
	           if(nums[k] != 3 && nums[k] != 4){
	               arr[j] = nums[k];
	               mark = k + 1;
	               break;
	           }
	          }
	        } 
      }
	      return arr;
}

Open in new window

Expected      Run
fix34([1, 3, 1, 4]) → [1, 3, 4, 1]      [1, 3, 4, 1]      OK
fix34([1, 3, 1, 4, 4, 3, 1]) → [1, 3, 4, 1, 1, 3, 4]      [1, 3, 4, 1, 1, 3, 4]      OK
fix34([3, 2, 2, 4]) → [3, 4, 2, 2]      [3, 4, 2, 2]      OK
fix34([3, 2, 3, 2, 4, 4]) → [3, 4, 3, 4, 2, 2]      [3, 4, 3, 4, 2, 2]      OK
fix34([2, 3, 2, 3, 2, 4, 4]) → [2, 3, 4, 3, 4, 2, 2]      [2, 3, 4, 3, 4, 2, 2]      OK
fix34([3, 1, 4]) → [3, 4, 1]      [3, 4, 1]      OK
fix34([3, 4, 1]) → [3, 4, 1]      [3, 4, 1]      OK
fix34([1, 1, 1]) → [1, 1, 1]      [1, 1, 1]      OK
fix34([1]) → [1]      [1]      OK
fix34([]) → []      []      OK
fix34([7, 3, 7, 7, 4]) → [7, 3, 4, 7, 7]      [7, 3, 4, 7, 7]      OK
fix34([3, 1, 4, 3, 1, 4]) → [3, 4, 1, 3, 4, 1]      [3, 4, 1, 3, 4, 1]      OK
fix34([3, 1, 1, 3, 4, 4]) → [3, 4, 1, 3, 4, 1]      [3, 4, 1, 3, 4, 1]      OK
other tests
OK

above similar to fix45 challenge passed all tests where fill new array simply with values which seems to me more efficient and easy way

LVL 7

Author Comment

by:gudii9

ID: 417692772016-08-24

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.

Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

OOAD - Object-Oriented-Analysis and Design

Article by: Anandhi

Basic understanding on "OO- Object Orientation" is needed for designing a logical solution to solve a problem. Basic OOAD is a prerequisite for a coder to ensure that they follow the basic design of OO. This would help developers to understand the b…

C++
Java

How to Become a Web Developer

Article by: Ryan

Today, the web development industry is booming, and many people consider it to be their vocation. The question you may be asking yourself is – how do I become a web developer?

Introduction to C++: Functions - The Return Statement

Video by: Ian

The viewer will learn how to use the return statement in functions in C++. The video will also teach the user how to pass data to a function and have the function return data back for further processing.

Xpdf - PDFdetach - Command Line Utility to Detach Attachments from PDF Files

Video by: Joe

In this fifth video of the Xpdf series, we discuss and demonstrate the PDFdetach utility, which is able to list and, more importantly, extract attachments that are embedded in PDF files. It does this via a command line interface, making it suitable …