In a Matrix, there is a total of n/2 squares in n*n matrix and we can process each square one at a time using nested loop. In each square elements are moving in a cycle of 4 elements. we swap the elements involved in an anticlockwise direction for each cycleElement at position (n-1-j, i) will go to position(i, j)Element at position (i, j) will go to position(j, n-1-i)Element at position (j, n-1-i) will go to position(n-1-i, n-1-j)Element at position (n-1-i, n-1-j) will go to position(n-1-j, i)Example Live Demousing System; using System.Text; namespace ConsoleApplication{    public class Matrix{       public ... Read More

We can simply start from the first element and repeatedly call for all the elements reachable from first element. The minimum number of jumps to reach end from first can be calculated using minimum number of jumps needed to reach end from the elements reachable from first.Array == {1, 3, 6, 3, 2, 3, 6, 8, 9, 5};Number of steps required is 4Example Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public int MinJumps(int[] arr, int l, int h){          if (h == l)             return 0;          if (arr[l] == 0)             return int.MaxValue;          int min = int.MaxValue;          for (int i = l + 1; i

To find the missing numberCreate a new array and traverse through the entire array and make the number true in the new array if the number is found Traverse through the entire array and return the first false element as the missing element.To find the repeating elementThe first true element from the new array will be the repeated element.Example Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public void MissingNumberAndRepeatedNumber(int[] arr){          bool[] tempArray = new bool[arr.Length + 1];          int missingelement = -1;          int repeatingelement = ... Read More

There are three methods as written below −In the first methodUse the formula n(n+1)/2 that counts the number of elements and then need to subtract from the elements in the array.In the second methodCreate a new array and traverse through the entire array and make the number false whichever is found.In the third methodUse Xor operation. which gives the missing number.Example Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public int MissingNumber1(int[] arr){          int totalcount = 0;          for (int i = 0; i < arr.Length; i++){       ... Read More

Create an empty new array of length 256, traverse through the entire string character by character and increment the value in the new array. At the end traverse the entire array and return the first character that has value 1.Example 1aabccd -→2 1 2 1 → Return the first character which is having count 1. That is b by subtracting with the ascii values.Example 2 Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public char ReturnCharacterOfFirstUniqueCharachter(string s){          int index = -1;          int[] arrayValues = new int[256];       ... Read More

Create an empty new array of length 256, traverse through the entire string character by character and increment the value in the new array. At the end traverse the entire array and return the first character that has value 1.Example 1aabccd -→2 1 2 1 → Return the first character which is having count 1. That is b.Example 2 Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public int ReturnIndexOfFirstUniqueCharachter(string s){          int index = -1;          int[] arrayValues = new int[256];          for (int i = 0; ... Read More

Create a method reverse Words that takes char array as an input and for each and every character until the empty space is not reached reverse the word. At the last step reverse the entire string from length 0 to n-1 length. In the first step the string “This is my book” will be turned into “koob ym si siht”. At the end of the second step the string words will be reversed to “book my is This”Time complexity − O(N)Example Live Demousing System; namespace ConsoleApplication{    public class Arrays{       static void reverse(char[] str, int start, int end){ ... Read More

The array is already sorted, we can keep two pointers ii and jj, where ii is the slow-runner while jj is the fast-runner. As long as nums[i] = nums[j]nums[i]=nums[j], we increment jj to skip the duplicate.When we encounter nums[j] != nums[i] the duplicate run has ended so we must copy its value to nums[i + 1]nums[i+1]. ii is then incremented and we repeat the same process again until jj reaches the end of array.Create an new array copy all the elements from the filtered array till the index and return the new array.Time complexity − O(N)Example Live Demousing System; namespace ConsoleApplication{ ... Read More

The array is already sorted, we can keep two pointers ii and jj, where ii is the slow-runner while jj is the fast-runner. As long as nums[i] = nums[j]nums[i]=nums[j], we increment jj to skip the duplicate.When we encounter nums[j] != nums[i] the duplicate run has ended so we must copy its value to nums[i + 1]nums[i+1]. ii is then incremented and we repeat the same process again until jj reaches the end of array.Time complexity − O(N)Example Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public int RemoveDuplicatesFromSortedArrayAndReturnLength(int[] arr){          int index = 1; ... Read More

Given an array and number k, the problem states that we have to rotate the array k times.If the given number is 3 then the array must be rotated 3 times.Create a function reverse which takes the array, start and end as a parameter.In the 1st step call reverse method from 0 to array length.In the 2nd step call the reverse method from 0 to k-1.In the 3rd step call the reverse method from k+1 to array length.Example Live Demousing System; namespace ConsoleApplication{    public class Arrays{       public void ReverseArrayKTimes(int[] arr, int k){          Reverse(arr, ... Read More