1) Move all Negative numbers to the beginning of the Array
Move all the Negative elements to the beginning of the given Array. The solution is to take two pointers slowPointer, fastPointer. SlowPointer starting at position 0 and fastPointer starting at position 1. The required condition is to have all negatives at the beginning, so keep slowPointer at beginning as long as the element is positive and move it only incase the element is negative. For the fastPointer move it as long as the number is negative and stop when the number is positive and do a comparison with the slowPointer, if slowPointer is positive and fastPointer is negative swap the elements at both the positions and move both the pointers. When the Iteration is completed all the negative elements get moved to the beginning and all the positive elements to the end.
Move all the Negative elements to the beginning of the given Array. The solution is to take two pointers slowPointer, fastPointer. SlowPointer starting at position 0 and fastPointer starting at position 1. The required condition is to have all negatives at the beginning, so keep slowPointer at beginning as long as the element is positive and move it only incase the element is negative. For the fastPointer move it as long as the number is negative and stop when the number is positive and do a comparison with the slowPointer, if slowPointer is positive and fastPointer is negative swap the elements at both the positions and move both the pointers. When the Iteration is completed all the negative elements get moved to the beginning and all the positive elements to the end.
Rotate an Image represented as a 2D matrix in place
To rotate an image represented as a 2D Matrix in place we first need to transpose the matrix(move row to column and column to row),
after the transpose is completed then reverse the positions of elements for each row which makes the complete 2D array rotation by 90 degrees.
Comments
Post a Comment