niquepa

Introduction to the problem
 
You are free to implement any mechanism for feeding input into your solution. You should provide sufficient evidence with unit tests that your solution is complete. As a minimum, please use the provided test data to indicate that the solution works correctly. Any programming language can be used to solve the problem.
 
Drawing tool
 
You're given the task of writing a simple console version of a drawing program. At this time, the functionality of the program is quite limited but this might change in the future. In a nutshell, the program should work as follows:
 
Create a new canvas
Start drawing on the canvas by issuing various commands

niquepa

  def youtube_id(youtube_url)
    regex = /(?:youtube(?:-nocookie)?\.com\/(?:[^\/\n\s]+\/\S+\/|(?:v|e(?:mbed)?)\/|\S*?[?&]v=)|youtu\.be\/)([a-zA-Z0-9_-]{11})/
    match = regex.match(youtube_url)
    if match && !match[1].blank?
      match[1]
    else
      nil
    end
  end
  

niquepa

#!/bin/ruby

n = gets.strip.to_i
bin = n.to_s(2)
#puts bin
state = nil
max = 0
count = 0
bin.each_char do |char|
  if state == char

niquepa

# Enter your code here. Read input from STDIN. Print output to STDOUT
n = gets.to_i
arr = gets.split(" ")
arr.map! { |i| i.to_i }
#puts arr
arr = arr.permutation(3).to_a.sort.uniq
work = Array.new
arr.each do |perm|
  #puts "PERM => #{perm.sort}"
  work.push(perm.sort)

niquepa

class Solution
  # Write your code here
  def initialize
    @stack = Array.new
    @queue = Array.new
  end
  
  def pushCharacter(c)
    @stack.push(c)
  end

niquepa

#!/bin/ruby

n = gets.strip.to_i
a = gets.strip
a = a.split(' ').map(&:to_i)
#puts a

endPos = a.count-1
swapCont = 0
#puts "ENDPOS=#{endPos}"

niquepa

Bienvenido, de una serie de aplicantes tu y algunos candidatos más pasaron a la fase de entrevista. El objetivo de esta prueba es simplemente conocer tu estilo de programar y analizar tu creatividad para desarrollar algo cuando tienes poca información. Esto sucede todo el tiempo en Play Business y tenemos una cultura tatuada de MVPs para probar nuestros conceptos, prueba los tuyos con estos drills.

Algo de calentamiento!!

1.- Imagina que tienes un arreglo de 1,000 valores (del 1, 2, 3,.. 1,000). Sin embargo, al analizar el tamaño del arreglo te das cuenta que faltan dos valores, no sabes cuales son. Escribe un método que permita saber los valores faltantes y dime por qué decidiste hacerlo de esa manera, ¿Cual es la ventaja?

Fácil hasta ahora verdad? Ok...

2.- Construye Pinterest.

##BONUS. Algo de Git. 3.-El equipo de desarrollo está implementando una serie de features importantes, por lo que tenemos las branches: feature1, feature2 y feature3, a demás de Master. Surgió un pendiente y se tiene que

niquepa

INTERVIEW QUESTIONS

• continous integration's tools
• WorkFlow to promote code to production, GitFlow, Releases?
• Tell us more about your experience with GIS
• Tools for Performance Tests (Selenium)
• Tools for code review and best practices
• Ldap/oAuth integrations - SingleSignOn
• Experience migrating data from legacy systems
• What are gems and name your favorites

niquepa

# Signal catching
def shut_down
  puts "\nShutting down gracefully..."
  sleep 1
end

puts "I have PID #{Process.pid}"

# Trap ^C 
Signal.trap("INT") { 

niquepa

-- show running queries (pre 9.2)
SELECT procpid, age(query_start, clock_timestamp()), usename, current_query 
FROM pg_stat_activity 
WHERE current_query != '<IDLE>' AND current_query NOT ILIKE '%pg_stat_activity%' 
ORDER BY query_start desc;

-- show running queries (9.2)
SELECT pid, age(query_start, clock_timestamp()), usename, query 
FROM pg_stat_activity 
WHERE query != '<IDLE>' AND query NOT ILIKE '%pg_stat_activity%'