Search Results

I am doing this Codility problem You are given N counters, initially set to 0, and you have two possible operations on them: increase(X) − counter X is increased by 1, max counter − all …

I was doing this HackerRank problem which basically boils down to counting overlapping substrings in a string. I used this solution from StackOverflow to build this program - def overlapping_occurre …

I was trying to solve the Longest Common Subsequence problem on a HackerRank exercise. It's quite simple and straightforward, just print out the length of the LCS. I submitted this code: s1 = raw_in …

I'm doing this HackerRank problem: Given \$N\$ integers, count the number of pairs of integers whose difference is \$K\$. So far, I've ended up with this code: def countPairs(ar, n, k): ar. …

Okay, so I solved the problem. It seemed like the while loop DID have O(n^2) complexity. I changed the function countPairs() to this: def countPairs(ar, n, k): ar.sort() i = 1 j = 0 c …

I'm doing this HackerRank problem: Consider two sets of positive integers, \$A=\{a_0, a_1, \ldots, a_{n-1}\}\$ and \$B=\{b_0, b_1, \ldots, b_{m-1}\}\$. We say that a positive integer, \$x\$, is be …

It turns out my count function was inefficient. Going through the discussion forms on the site, I found this which passed all the test cases - def count(l, g): count = 0 for i in xrange(l, g …

I am writing a program to count only the partitions of a number with distinct parts. I am using a bottom-up approach to dynamic programming to generate partition lists from previously obtained partiti …

I have been trying to solve this HackerRank problem: We're going to make our own Contacts application! The application must perform two types of operations: add name, where is a string denoting a c …