Skip to content

Latest commit

 

History

History
46 lines (33 loc) · 2.52 KB

readme.md

File metadata and controls

46 lines (33 loc) · 2.52 KB
Raw

Very few people have solved any of these problems. I've solved several.

This repo is for some of the advanced problems that I've solved on hackerrank

Order of my percieved difficulty

  1. Sum of Maximums
  2. Spies, Revised
  3. Determining DNA Health
  4. Circular Palindromes

Interesting information for each problem.

Problem name My Percentile My rank Number of people who attempted* Number of lines in my solution**
Sum of Maximums top 11% 68th 920 504
Spies, Revised top 3% 83rd 3,120 279
Determining DNA Health top 6% 357th 7,000 424
Circular Palindromes top 12% 217th 1,900 255

* I've solved all problems. My rank reflects the number of people who solved it before me.

* * The number of lines includes spaces and code that I used in development

Descriptions of each problem

Sum of the Maximums - top 11% - my code
Given a long array and many queries, preprocess the array and create an efficient search algorithm.

Spies, Revised - top 3% - my code
Harder variation of the (NP-Hard) N-Queens Problem. Use a heuristic algorithm to quickly find a solution.

Determining DNA Health - top 6% - my code
Given scores for a set of "genes", build a data structure that can efficiently compute scores for strings and varying subsets of the genes.

Circular Palindromes - top 12% - my code
Efficiently compute data on transformations of the same input.