We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Almost Sorted
  5. Discussions

Almost Sorted

  • tangjiaqing
     + 0 comments
    1. Scan sequence of number from the beginning.
    2. Identify whether the scanned sequence is swappable or reversable or not.
    3. After scanning, find out whether the sequence can be arranged by swap or reverse.
    4. It doesn't need to actually swap or reverse any elements. Maintaining the points is enough.

    https://github.com/jiaqing123/HackerRankApp/blob/master/HackerRankApp/Problems/AlmostSorted.cs