27
61%

Ran 19 Mar 2018 06:00AM UTC

Jobs 2

Files 23

Run time 12s

Badge

Embed ▾

pending completion

Build # 27

Build Type

push

travis-ci

Committed by

dpaukov

Commit Message

Solution for the majority element problem.

Given an array of size n, find the majority element. The majority element
is the element that appears more than ⌊n/2⌋ times. You may assume that the array
is non-empty and the majority element always exist in the array.

https://leetcode.com/problems/majority-element/

Run Details

435 of 627 relevant lines covered (69.38%)

122.59 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	27.1	19 Mar 2018 06:00AM UTC	0	67.79	Travis Job 27.1
2	27.2	19 Mar 2018 06:00AM UTC	0	69.38	Travis Job 27.2

Source Files on build 27

Detailed source file information is not available for this build.

dpaukov / classic-cherries / 27
61%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 27

dpaukov / classic-cherries / 27 61%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 27

dpaukov / classic-cherries / 27
61%

README BADGES
x