Search for a command to run...
Articles tagged with #interview
public static int[] rotateArray(int[] arr, int k) { int n = arr.length; // If k is greater than n, take the modulus to get the actual rotation amount k = k % n; // Reverse the last k elements reverseArray(arr, n - k, n - 1); /...
Here's an example Java code for generating all permutations of an array using recursion: public class ArrayPermutations { public static void main(String[] args) { int[] arr = {1, 2, 3}; generatePermutations(arr, 0, arr.length - ...
To find the first repeating element in an array of integers, we can iterate through the array and use a HashMap to keep track of the frequency of each element. The first element that has a frequency greater than 1 is the first repeating element. Here...
One algorithm that can be used to count the number of occurrences (or frequency) of each element in a sorted array is called the "Two Pointers" algorithm. Here's how it works: Initialize two pointers, i and j, to the first element of the array. Com...
A local minimum in an array is a value that is smaller than its neighbors. To find local minima in an array, you can iterate through the array and compare each element to its neighbors. Here's an example of how you can implement this in Java: int fin...
One way to sort an array containing zeroes, ones, and twos in O(n) time complexity is by using a variation of the counting sort algorithm. The idea is to count the number of zeroes, ones, and twos in the array, and then use that information to recons...