Goldman Sachs | OA 2020 | Meandering array & Reach Points
Anonymous User
6319

Goldman Sachs Online Assemement Questions.
Position: Technology Analyst
Test Platform: HackerRank
Test Pattern: 2 Coding Problems.
Test Duration : 120 Minutes

  1. Meandering array : Given a sorted array of positive integers. Your task is to rearrange the array elements alternatively i.e first element should be max value, second should be min value, third should be second max, fourth should be second min and so on.
    Constraints:
    Array Contains Duplicate Values.
  2. Reach Points: https://leetcode.com/problems/reaching-points/
Comments (6)