Target 2024 DSA

week 1  

       Day 18 jan ->complete patterns 

  

Comments

Post a Comment

Popular posts from this blog

Quick Sort Algorithm

Image
  Quick Sort Algorithm Problem Statement:   Given an array of n integers, sort the array using the  Quicksort  method. Examples: Example 1: Input: N = 5 , Arr[] = {4,1,7,9,3} Output: 1 3 4 7 9 Explanation: After sorting the array becomes 1, 3, 4, 7, 9 Example 2: Input: N = 8 , Arr[] = {4,6,2,5,7,9,1,3} Output: 1 2 3 4 5 6 7 9 Explanation: After sorting the array becomes 1, 3, 4, 7, 9 Solution Disclaimer :  Don’t jump directly to the solution, try it out yourself first.  Problem Link . Intuition: Quick Sort is a divide-and-conquer algorithm like  the Merge Sort . But unlike Merge sort, this algorithm does not use any extra array for sorting(though it uses an auxiliary stack space). So, from that perspective, Quick sort is slightly better than Merge sort. This algorithm is basically a repetition of two simple steps that are the following: Pick a pivot and place it in its correct place in the sorted array. Shift smaller elements(i.e. Smaller ...
Read more

revice easy array

Image
 Q Approach- note-> 1) we can use the outer loop for take the lenngth of indices 2) we use the [i][0] in first loop to increment the cols by making constant row 3)[i][1] use to change the row by making constant cols 2nd way->  create two boolean array for row and col with row col size  row[indices[i][0]] ^=true;  same with col using [1]  then count r and c values ; use following formulae; Q sol-> first run loop till length  after that take the sum from primary and secondary side  if length is odd then we have to - the middle element because it comes twice    Q approch 1->while(0<nums[i]) - count++  nums[i]/=10; approch2-> Math.log10(nums[i])+1;  it produce odd value for even and even for odd so we have to add 1 to it; approch3-> we set the limit like >9 && < =99 || like wise; Q ans-> Use the new 2D ans for [col][row] because if matrix size is 2*4 the after transpose it becomes 4*2 thats why we g...
Read more