diff options
| author | mo khan <mo.khan@gmail.com> | 2020-06-28 16:02:55 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-06-28 16:02:55 -0600 |
| commit | b666decae0dbdc7716df52f8d4cdf21b3144b565 (patch) | |
| tree | c14a8ff137f80b5eabffd331a05d58b640e5da36 /unit/01/reverse.rb | |
| parent | 8c2c29ec02da11b67b77ee8cd2538edbfd540257 (diff) | |
Move src and doc
Diffstat (limited to 'unit/01/reverse.rb')
| -rw-r--r-- | unit/01/reverse.rb | 30 |
1 files changed, 0 insertions, 30 deletions
diff --git a/unit/01/reverse.rb b/unit/01/reverse.rb deleted file mode 100644 index a50f062..0000000 --- a/unit/01/reverse.rb +++ /dev/null @@ -1,30 +0,0 @@ -require 'bundler/inline' - -gemfile do - source 'https://rubygems.org' - - gem 'minitest' -end - -require 'minitest/autorun' - -=begin -Suppose you have a Stack, s, that supports only the push(x) and pop() operations. -Show how, using only a FIFO Queue, q, you can reverse the order of all elements in s. -=end - -class Example < Minitest::Test - def test_valid - s = [] - s.push('A') - s.push('B') - s.push('C') - - q = Queue.new - 3.times { q.enq(s.pop) } - - x = 3.times.map { q.deq } - - assert x == ['C', 'B', 'A'] - end -end |
