{"request":{"endpoint":"https://exercism.org/api/v2/tracks/ruby/exercises/dominoes/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"6448cb423c114eea9b29fa7b7429866f","snippet":"class Dominoes def self.chain?(dominoes) return true if dominoes.empty? valid?([dominoes.shift], dominoes) end def self.valid?(chain, remaining) head = chain.first.first tail = chain.last.last ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":5,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-22T15:03:29.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"evanwhalen"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/evanwhalen","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"1729449228634873ae25669759e03d5d","snippet":"module Dominoes def self.chain?(dominoes) dominoes.empty? || dominoes.permutation.any? do |part| part.each_cons(2).all? { |a, b| a[1] == b[0] || a[1] == b.reverse![0] } && part[0][0] == part[-1][-1] end end end","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-20T20:03:20.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"thekaranchauhan"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/thekaranchauhan","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"57377a81077049fcbb05e3a8e3741e6c","snippet":"class Dominoes Domino = Struct.new(:a, :b, :used) def self.chain?(dominoes) return true if dominoes.empty? return dominoes.first[0] == dominoes.first[1] if dominoes.size == 1 dominoes.map! { |(a, b)| Domino.new(a, b, false) } generate_chain(dominoes, []) end ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-15T17:41:11.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"akermabon"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/akermabon","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"a10d9bfae6744fe099b07e4567fe6a5e","snippet":"class Dominoes private def initialize(dominos) self.chain = dominos.empty? ? true : build_chain([], dominos) end attr_writer :chain ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-08-13T18:03:54.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"Eggman"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/Eggman","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"f0a331fb92eb4b28926f8038df547346","snippet":"class Dominoes def initialize(dominoes) @dominoes = dominoes end def self.chain?(dominoes) return true if dominoes.empty? variants = 1 << dominoes.count 0.upto(variants) do |variant| ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-09T18:48:18.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"unused"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/unused","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"18cf83e5064c4c8d9fe881d9d051abcf","snippet":"class Dominoes def self.chain?(stones) return true if stones.empty? stones.permutation.any? do |part| part.each_cons(2).all?{ |a, b| a[1] == b[0] || a[1] == b.reverse![0] } && part[0][0] == part[-1][-1] end end end","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-01T20:24:53.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"mdzine"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/mdzine","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"bf6c619746954331b0b4725fcc19b8e6","snippet":"Domino = Struct.new(:a, :b, :used) class Dominoes def self.chain?(dominoes) return true if dominoes.empty? return dominoes.first[0] == dominoes.first[1] if dominoes.size == 1 dominoes.map! { |(a, b)| Domino.new(a, b, false) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-01T17:56:31.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"pmareke"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/pmareke","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"5413d9e816bb4d299d51be2ebc277389","snippet":"class Dominoes private def self.chain? (tiles)= new(tiles).chain? attr_reader :tiles def initialize (tiles)= @tiles = tiles ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-23T16:01:55.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"voxEko"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/voxEko","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"37de4c6ebaa64c62821c868a97aa7655","snippet":"class Dominoes def self.chain?(dominoes) # No dominoes counts as a chain return true if dominoes.length == 0 # If odd number of domino values, impossible to create a chain return false if domino_values(dominoes).any? { |k, v| v.odd? } # If dominoes not all connected, impossible to create a chain return false unless all_dominoes_connected?(dominoes) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":40,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-04T11:17:40.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"Ayrt-n"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/Ayrt-n","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"f1b14255211449c29b8fd183d584bc07","snippet":"module Dominoes def self.chain?(dominoes) dominoes.empty? || any_valid_chain?([dominoes.first], dominoes.drop(1)) end def self.any_valid_chain?(chain, remaining) return chain.first.first == chain.last.last if remaining.empty? remaining.each do |dominoe| if dominoe.first == chain.last.last ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-14T21:23:06.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"djspinmonkey"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/djspinmonkey","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"4a1ff9c9c8fd4d1dbf02c7537508798a","snippet":"module Dominoes def self.chain?(pieces) pieces.empty? ? true : go([], pieces) end def self.go(chain, remaining) return chain[0][0] == chain[-1][1] if remaining.empty? last = chain[-1] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-17T18:11:20.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"JakubSarnik"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/JakubSarnik","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"0e05b0dad3474a41ac2fa1fecbb6a8fc","snippet":"module Dominoes def self.chain?(dominoes) dominoes = dominoes.map { Dominoe.new(_1) } return true if dominoes.empty? dominoes .sum([]) { starting_chains(_1, dominoes) } .any? { _1.first.first == _1.last.last } end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":45,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-04T13:06:14.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"claviustales"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/claviustales","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"8aeac1a8429c428cb60ebaaeca307ce1","snippet":"class Array def reject_one(element) dup.tap { |elements| elements.delete_at(index(element)) } end end class Dominoes def self.chain?(dominoes) new.can_chain?(dominoes) end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":6,"num_loc":38,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-04T15:07:40.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"kewlar"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/kewlar","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"fa751fee6f1e4302add7bce7b720b294","snippet":"class Dominoes class << self # @param dominoes [Array>] set of dominoes # @return [Boolean] if there is a way to order a given set of dominoes # in such a way that they form a correct domino chain (the dots on one # half of a stone match the dots on the neighbouring half of an adjacent # stone) and that dots on the halves of the stones which don't have # a neighbour (the first and last stone) match each other def chain?(dominoes) return true if dominoes.empty? ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-12T13:42:32.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"artkirienko"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/artkirienko","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"afaa6589b4e549479c25e8478ce09d01","snippet":"class Dominoes def self.chain?(stones) return true if stones.length.zero? # create the pile of Stone objects remaining_stones = stones.map {|left, right| Stone.new(left, right)} # init chain using the first stone, and remove it from the pile current_chain = [ remaining_stones.shift ] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":44,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-11T03:21:09.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"cc1129"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/cc1129","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"f85225be9883471e9cd92d8126b91031","snippet":"class Game def initialize(dominoes) @dominoes = dominoes.map { Domino.new(_1) } @chain = [] @duds = [] end def play @dominoes.each { lay(_1) } end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":61,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-02-10T22:07:51.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"christhesoul"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/christhesoul","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"c002dbdecf514b108ae21e1875090094","snippet":"class Dominoes class << self def chain?(stones) stones.empty? ? true : do_chain?(stones[0][1], stones.shift[0], stones) end private def do_chain?(left, right, stones) return true if stones.empty? && left == right ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-05-28T07:35:42.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"laszpio"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/laszpio","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"be316c7645864a77a44f65d1ea52e12e","snippet":"module Dominoes def self.chain?(dominoes, previous = nil) @start, previous = dominoes.shift if previous.nil? return @start == previous if dominoes.empty? dominoes.select { |d| d.any? previous }&.uniq&.each do |d| sans_d = dominoes.clone sans_d.delete_at sans_d.index d return true if chain?(sans_d, d[1 - d.index(previous)]) end ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-24T08:17:35.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"4t2"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/4t2","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"ed43d343fd6a43dca7e29a1f9100708f","snippet":"class Dominoes def self.chain?(dominoes) return true if dominoes.empty? if dominoes.size == 1 return dominoes.first.first == dominoes.first.last end remaining_dominoes = dominoes.map(&:sort) ","num_views":0,"num_stars":1,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2018-12-26T07:26:25.000Z","is_out_of_date":true,"language":"ruby","author":{"handle":"DeepspaceFreelancer"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/DeepspaceFreelancer","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"59c992e3e1b640d3abc477b0906fed2e","snippet":"module Dominoes def self.chain?(dominoes) if dominoes.empty? return true end if dominoes.one? return dominoes[0][0] == dominoes[0][1] end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-09T18:03:20.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"asterite"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/asterite","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"61e6e6c049a449958dd98c0b59ac33e6","snippet":"module Dominoes module_function def chain?(dominoes) return true if dominoes.empty? eulerian_cycle?(dominoes) && connected_graph?(dominoes) end # https://en.wikipedia.org/wiki/Eulerian_path ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-29T03:14:09.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"paulfioravanti"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/paulfioravanti","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"597a2c9541cc45c58d2d2d544584983d","snippet":"class Dominoes def self.chain?(dominoes) new(dominoes).chain? end def initialize(dominoes) @dominoes = dominoes end attr_reader :dominoes, :first, :last ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-22T11:40:57.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"lvoisin"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/lvoisin","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"0de253489add49a59e39e65a734bc82e","snippet":"class Dominoes def self.chain?(dominoes) if dominoes.empty? return dominoes end if dominoes.size == 1 tile = Tile.new(dominoes.first[0], dominoes.first[1]) if tile.left == tile.right return true ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":64,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-11T03:38:26.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"Westflame"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/Westflame","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}},{"uuid":"bc26f351ced8425c9ac6869f3aa9e3ef","snippet":"module Dominoes # :nodoc: all class SolutionFound < StandardError; end class << self def chain?(dominoes) backtrack(dominoes, 0, []) false rescue SolutionFound true end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-15T08:02:53.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"bigbob1256"},"exercise":{"title":"डोमिनोज़","icon_url":"https://assets.exercism.org/exercises/dominoes.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/solutions/bigbob1256","private_iterations_url":"https://exercism.org/hi/tracks/ruby/exercises/dominoes/iterations"}}],"meta":{"current_page":1,"total_count":109,"total_pages":5,"unscoped_total":109}}}}}

भाषा ट्रैक

Jiki के साथ कोड करना सीखिए

आपकी यात्रा

आपके पसंदीदानया

Exercism के खास फायदे

कम्युनिटी वीडियो

संक्षिप्त परिचय शृंखला

इंटरव्यू और कहानियाँ

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स