dnovais

Solved that problem running these first:

sudo apt update sudo apt install git zsh -y Then the curl:

sh -c "$(curl -fsSL https://raw.githubusercontent.com/ohmyzsh/ohmyzsh/master/tools/install.sh)"

dnovais

def binary_search(list, item)

end

dnovais

list = [1, 2, 3, 4, 5, 6, 7, 30, 32, 12, 21, 22, 56, 70, 62]

list = list.sort

find = 21

list.each do |item|
  puts "The number #{find} is here!" if item == find
end

dnovais

class CrystalDSL
  attr_reader :code

  def initialize(&block)
    @code = ''
    instance_eval(&block) if block_given?
  end

  def generate(&block)
    instance_eval(&block) if block_given?

dnovais

def generate_crystal_code(class_name, method_name, parameter_type, parameter_name)
  code = <<~CRYSTAL
    # Generated Crystal code
    module MyModule
      class #{class_name}
        def initialize(#{parameter_name} : #{parameter_type})
          @#{parameter_name} = #{parameter_name}
        end
      
        def #{method_name}

dnovais

####################################
# Pilares da Orientação a Objetos: #
####################################

# 👍 Abstração.     | >
# 👍 Encapsulamento | > > Composição 🙌
# 👍 Polimorfismo   | >

# 👎 Herança

dnovais

Installing Postgres via Brew

Pre-Reqs

Brew Package Manager

In your command-line run the following commands:

1. brew doctor
2. brew update

dnovais

Matchstick factory Challenge

A matchstick factory has to put n matchsticks in boxes. The factory has the following three types of boxes:

A big box holds 50 matchsticks A medium box holds 20 matchsticks A small box holds five 5 matchsticks The boxes can’t have fewer matchsticks than they can hold; they must be full.

Implement the boxes/1 function in the MatchstickFactory module. The boxes/1 function returns the number of boxes of each size needed to accommodate all the matchsticks and the number of remaining matchsticks as a map (The map is included in the started code). It should work like this:

dnovais

Print 'Hello world!' 50 times without a loop

Usando recursividade

def print(times: 1, msg:)
  puts msg
  times += 1
  print(times: times, msg: msg) unless times > 50
end

dnovais

O problema

Dado um conjunto de caracteres, você precisará extrair os "diamantes" ( <>) e as "areias" ( . ) da expressão e no final exibir a quantidade de diamantes extraídos

Expressão: <<.<<..>><>><.>.>.<<.>.<.>>>><>><>>

• Extrair os diamantes e areias da expressão até que não haja mais o que ser extraído;
• Exibir a quantidade de diamantes extraídos;;

A solução proposta pelo RDSM (@das_rm)