Vikneshwar GK

Technical Content Writer @ IncludeHelp

Vikneshwar GK
Name Vikneshwar GK
Course B.E Computer Science
College Rajalakshmi Engineering College, Thandalam
DOB 01st September
Technical Skills Data Science, Machine Learning, Python, Mobile App Development
Languages Known Python, C, C++, JAVA, Javascript, Flutter & Dart
Interests Writing, Sports, Music

His submissions

Data Structure

  1. Alternative Sorting
  2. Sort a Nearly Sorted Array (K Sorted Array)
  3. Print all distinct elements of a given integer array
  4. Product of maximum in the first array and minimum in second
  5. Sort an array according to the absolute difference of the given value
  6. Sort an array that contains 1 to N elements
  7. Sort an array that contains only 0's and 1's
  8. Two elements whose sum is closest to zero
  9. Sort an array in waveform
  10. Merge an array of size n into another array of size m+n
  11. Sort 1 to N by swapping adjacent elements
  12. Sort elements by frequency (Solution 2)
  13. Union and Intersection of Two Sorted Arrays
  14. Union and Intersection of Two Unsorted Arrays
  15. Shortest Un-ordered Subarray
  16. Sort an Array of 0s, 1s and 2s
  17. Find the minimum length unsorted subarray, sorting which makes the complete array sorted
  18. Median in a stream of integers (running integers)
  19. Count the number of possible triangles
  20. Find the number of pairs(x, y) in an array such that x^y > y^x
  21. Construct an array from its pair-sum array
  22. Count all distinct pairs with difference equal to k
  23. Program for array rotation
  24. Reversal Algorithm of Array Rotation
  25. Block Swap Algorithm for Array Rotation
  26. Program to Cyclically Rotate an Array by One
  27. Search an element in a sorted and rotated array
  28. Given a sorted and rotated array, find if there is a pair with a given sum
  29. Find maximum value of Sum( i*array[i] ) with only rotations on given array allowed
  30. Find the rotation count in rotated sorted array
  31. Quickly find multiple left rotations of an array
  32. Find the minimum element in a sorted and rotated array
  33. Reversal algorithm for right rotation of an array
  34. Queries on Left and Right Circular Shift on the Array
  35. Print left rotation of array in O(n) time and O(1) space
  36. Find element at given index after a number of rotations
  37. Rearrange the element such that array[i] = i
  38. Write a program to reverse an array
  39. Move all zeroes to the end of the array
  40. Minimum swaps required to bring all elements less than or equal to k together
  41. Rearrange the array such that the even positioned are greater than odd
  42. Rearrange the array in order - smallest, largest, 2nd smallest, 2nd largest, so on
  43. Double the first element and move zero to end
  44. Reorder an array according to given indexes
  45. Rearrange the array such that arr[i]>=arr[j] if i is even and arr[i]<=arr[j] if i is odd and j<i
  46. Arrange given numbers to form the biggest number
  47. Rearrange an array in maximum minimum form
  48. Rearrange an Array in maximum minimum form with O(1) extra space
  49. Move all negative elements to end in order with extra space allowed
  50. Rearrange the array such that even index elements are smaller and the odd index elements are greater
  51. Replace every array element by multiplication of previous and next
  52. Rearrange positive and negative elements in O(n) time and O(1) extra space
  53. Shuffle a given array using Fisher-Yates shuffle Algorithm
  54. Segregate odd and even numbers using Lomuto's Partition scheme

Comments and Discussions!

Load comments ↻

Copyright © 2024 All rights reserved.