🥑
Codding Problems Solutions
  • Introduction
  • CodeWars ⚔️
    • 🌝Beta
      • Count vowels
      • Who am I?
    • 🎒8 Kyu
      • Get the mean of an array
      • Multiply
      • SQL Basics: Mod
    • 🎁7 Kyu
      • 80's Kids #2: Help ALF Find His Spaceship
      • Complementary DNA
      • GROCERY STORE: Inventory
      • Get the Middle Character
      • Growth of a Population
      • Highest and Lowest
      • Indexed capitalization
      • Jaden Casing Strings
      • Moves in squared strings (I)
      • SQL with Harry Potter: Sorting Hat Comparators
      • SQL: Regex String to Table
      • Shortest Word
      • Sorted? yes? no? how?
      • String ends with?
      • Sum of odd numbers
      • Sum of the first nth term of Series
      • Two to One
      • What time is it?
    • 🎩6 Kyu
      • Are they the "same"?
      • Backspaces in string
      • Banker's Plan
      • Bouncing Balls
      • Count the smiley faces!
      • Counting Duplicates
      • Delete occurrences of an element if it occurs more than n times
      • Dubstep
      • Framed Reflection
      • Is a number prime?
      • Linked Lists - Length & Count
      • Lottery Ticket
      • Maze Runner
      • Mexican Wave
      • Number Format
      • Persistent Bugger.
      • Playing with digits
      • Replace With Alphabet Position
      • SQL Basics: Simple EXISTS
      • SQL Basics: Simple HAVING
      • SQL Basics: Simple IN
      • Statistics for an Athletic Association
      • The Deaf Rats of Hamelin
      • Tortoise racing
      • Unique In Order
      • Who likes it?
    • 🎯5 Kyu
      • Double Cola
      • Integers: Recreation One
      • Maximum subarray sum
      • Moving Zeros To The End
      • Pete, the baker
      • Pick peaks
      • Product of consecutive Fib numbers
      • Rot13
      • The Hunger Games - Zoo Disaster!
      • Using Window Functions To Get Top N per Group
      • Variadic Parameter Pack Count
    • 💍4 Kyu
      • Matrix Determinant
      • Memoized Log Cutting
      • Range Extraction
      • Roman Numerals Helper
      • Simple Fun #159: Middle Permutation
      • Strip Comments
      • Sum of Intervals
      • The observed PIN
      • Tuple sum
  • LeetCode 🍃
    • 👌Easy
      • Backspace String Compare
      • Binary Search
      • Binary Tree Tilt
      • Check If N and Its Double Exist
      • Climbing Stairs
      • Complement of Base 10 Integer
      • Consecutive Characters
      • Contains Duplicate
      • Convert Binary Number in a Linked List to Integer
      • Count and Say
      • Defanging an IP Address
      • Delete Node in a Linked List
      • Duplicate Zeros
      • Excel Sheet Column Number
      • Fibonacci Number
      • Find All Numbers Disappeared in an Array
      • Find Numbers with Even Number of Digits
      • Find the Difference
      • First Unique Character in a String
      • Fizz Buzz
      • Goat Latin
      • Height Checker
      • Implement strStr()
      • Intersection of Two Arrays II
      • Invert Binary Tree
      • Jewels and Stones
      • Kids With the Greatest Number of Candies
      • Length of Last Word
      • Longest Common Prefix
      • Longest Word in Dictionary
      • Max Consecutive Ones
      • Maximum Depth of Binary Tree
      • Merge Sorted Array
      • Merge Two Sorted Lists
      • Middle of the Linked List
      • Minimum Depth of Binary Tree
      • Move Zeroes
      • N-th Tribonacci Number
      • Number of 1 Bits
      • Number of Good Pairs
      • Number of Recent Calls
      • Palindrome Number
      • Pascal's Triangle II
      • Path Sum
      • Plus One
      • Power of Four
      • Power of Two
      • Remove Duplicates from Sorted Array
      • Remove Element
      • Replace Elements with Greatest Element on Right Side
      • Reverse Bits
      • Reverse Integer
      • Reverse String
      • Roman to Integer
      • Running Sum of 1d Array
      • Shuffle the Array
      • Single Number
      • Sort Array By Parity
      • Squares of a Sorted Array
      • Sum of Left Leaves
      • Sum of Root To Leaf Binary Numbers
      • Symmetric Tree
      • Tenth Line
      • Third Maximum Number
      • Transpose Matrix
      • Two Sum
      • Valid Anagram
      • Valid Mountain Array
      • Valid Parentheses
      • Word Pattern
      • XOR Operation in an Array
    • 👊Medium
      • All Elements in Two Binary Search Trees
      • Asteroid Collision
      • Binary Tree Inorder Traversal
      • Binary Tree Level Order Traversal
      • Binary Tree Postorder Traversal
      • Binary Tree Preorder Traversal
      • Bulls and Cows
      • Car Pooling
      • Combination Sum
      • Combination Sum III
      • Compare Version Numbers
      • Counting Bits
      • Course Schedule II
      • Design Linked List
      • Gas Station
      • House Robber
      • Image Overlap
      • Insert Interval
      • Insert into a Binary Search Tree
      • Insertion Sort List
      • K-diff Pairs in an Array
      • Kth Largest Element in an Array
      • Longest Substring Without Repeating Characters
      • Lowest Common Ancestor of a Binary Tree
      • Majority Element II
      • Maximum Difference Between Node and Ancestor
      • Maximum Product Subarray
      • Minimum Domino Rotations For Equal Row
      • Minimum Number of Arrows to Burst Balloons
      • Random Point in Non-overlapping Rectangles
      • Remove Covered Intervals
      • Rotate Array
      • Rotate Image
      • Rotate List
      • Rotting Oranges
      • Serialize and Deserialize BST
      • Sort List
      • String to Integer (atoi)
      • Teemo Attacking
      • Top K Frequent Elements
      • Valid Sudoku
    • 💪Hard
      • Median of Two Sorted Arrays
      • Parsing A Boolean Expression
      • Recover Binary Search Tree
      • Stone Game IV
Powered by GitBook
On this page
  • Range Extraction
  • Solutions
  • 🧠 C++

Was this helpful?

  1. CodeWars ⚔️
  2. 4 Kyu

Range Extraction

PreviousMemoized Log CuttingNextRoman Numerals Helper

Last updated 4 years ago

Was this helpful?

A format for expressing an ordered list of integers is to use a comma separated list of either

  • individual integers

  • or a range of integers denoted by the starting integer separated from the end integer in the range by a dash, '-'. The range includes all integers in the interval including both endpoints. It is not considered a range unless it spans at least 3 numbers. For example ("12, 13, 15-17")

Complete the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.

Example:

solution([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]);
// returns "-6,-3-1,3-5,7-11,14,15,17-20"
solution([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20])
# returns "-6,-3-1,3-5,7-11,14,15,17-20"
solution([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20])
# returns "-6,-3-1,3-5,7-11,14,15,17-20"
solution([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20])
# returns "-6,-3-1,3-5,7-11,14,15,17-20"
Solution.rangeExtraction(new int[] {-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20})
# returns "-6,-3-1,3-5,7-11,14,15,17-20"
RangeExtraction.Extract(new[] {-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20});
# returns "-6,-3-1,3-5,7-11,14,15,17-20"
range_extraction({-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20});
// returns "-6,-3-1,3-5,7-11,14,15,17-20"
range_extraction((const []){-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}, 20);
/* returns "-6,-3-1,3-5,7-11,14,15,17-20" */
nums:  dd  -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20

mov rdi, nums
mov rsi, 20
call range_extraction
; RAX <- `-6,-3-1,3-5,7-11,14,15,17-20\0`
rangeextraction([-6 -3 -2 -1 0 1 3 4 5 7 8 9 10 11 14 15 17 18 19 20])
# returns "-6,-3-1,3-5,7-11,14,15,17-20"
solution(List(-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20))
// "-6,-3-1,3-5,7-11,14,15,17-20"
(solution '(-6 -3 -2 -1 0 1 3 4 5 7 8 9 10 11 14 15 17 18 19 20))
; returns "-6,-3-1,3-5,7-11,14,15,17-20"

Courtesy of rosettacode.org

Solutions

🧠 C++

#include <string>
#include <vector>
using std::to_string;

std::string range_extraction(std::vector<int> args)
{
  std::string res = to_string(args[0]);
  bool is_range = false;

  for (int i = 1, prev = args[0], range_len = 0;
       i < args.size(); prev = args[i++])
  {
    int fi = i == args.size()-1;
    if (args[i] == prev+1)
    {
      is_range = true;
      range_len++;
    }
    if (fi) //special logic for the last element
    {
     if (range_len > 1 && args[i] == prev+1)
        res+='-'+ to_string(args[i]);
      else if (range_len > 1) // but last element is not part of the seq
        res+='-'+ to_string(args[i-1])+','+to_string(args[i]);
      else if (range_len == 1 &&  args[i] != prev+1)
        res+=',' + to_string(args[i-1]) +','+to_string(args[i]);
      else
        res+=',' + to_string(args[i]);

      break;
    }
    else if(args[i] != prev+1) // non sequence logic
    {
      if(range_len) //we got here every time when sequence ends
      {
        if (range_len > 1)
          res+='-'+ to_string(args[i-1]);
        else if (range_len == 1)
          res+=',' + to_string(args[i-1]);

        range_len = 0;
        is_range = false;
      }
      res+=',' + to_string(args[i]);
    }

  }

  return res;
}
💍
Range Extraction