Questions tagged [programming-challenge]
Programming challenges are off-site challenges meant to offer programmers educational experiences while testing their abilities.
161
questions with no upvoted or accepted answers
6
votes
0answers
925 views
Codewars: N-dimensional Von Neumann Neighborhood in a matrix
Task:
For creating this challenge on Codewars I need a very performant
function that calculates Von Neumann Neighborhood in a N-dimensional
array. This function will be called about 2000 times
The ...
6
votes
0answers
456 views
Kattis problem Amanda Lounges
I wrote this solution to Kattis problem Amanda Lounges in Scala. TL;DR: It's a graph theory problem where I read in a list of edges from stdin and try to compute the minimum number of nodes that ...
5
votes
0answers
255 views
Palindrome insertion challenge
Here is my solution to the following Daily Coding Problem challenge
Given a string, find the palindrome that can be made by inserting the
fewest number of characters as possible anywhere in the ...
4
votes
1answer
63 views
Minimum number of copies of an application a company needs to purchase
Some applications from vendors are allowed to be installed on multiple computers per user with specific
restrictions. In our scenario, each copy of the application (ID 374) allows the user to install ...
4
votes
0answers
68 views
C++ - Longest Common Subsequence
Link to the Problem
Here is my code to compute the length of the longest common subsequence of two integer arrays arr[] and brr[]...
4
votes
0answers
48 views
Finding cheapest route (turn costs 500, going straight costs 100)
Story
Original link written in korean
Jordi, the architect of a construction company, received a request from a customer for an estimate for the construction of a raceway.
According to the raceway ...
4
votes
0answers
71 views
Extracting cycles from directed graph with max degree 1 and then performing set cover on cycles
I'm trying to solve P1243E in an efficient manner. The problem in simple words is:
Given \$k\$ boxes, \$i\$-th box with \$n_i\$ numbers. All numbers are distinct. We need to select one number from ...
4
votes
1answer
170 views
Project Euler # 53 Combinatoric selections in Python
There are exactly ten ways of selecting three from five, 12345:
123, 124, 125, 134, 135, 145, 234, 235, 245, and 345
In combinatorics, we use the notation, 5C3=10.
In general, nCr = n! / r! (n−r)!, ...
4
votes
0answers
152 views
Two solutions to leetcode 127.wordLadder
I am working on Word Ladder - LeetCode
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such ...
4
votes
0answers
2k views
Design an object oriented parking lot
I solved this system design interview question.
The problem description
Design a parking lot
Constraints and assumptions
What types of vehicles should we support?
Motorcycle, ...
4
votes
0answers
46 views
Texplode KotH controller
I am creating a KotH (King of the Hill) challenge for Programming Puzzles and Code Golf. Other site users will write programs that play Texplode (a version of this game on a square grid). The program ...
4
votes
1answer
2k views
Hackerrank: Sherlock and anagram
Problem statement
Given a string \$S\$, find the number of "unordered anagrammatic pairs" of substrings.
Input Format
First line contains \$T\$, the number of testcases. Each testcase ...
4
votes
0answers
287 views
Advent Of Code 2016 Day 9 Part 1 Solution
This code gives the solution to Part 1 of this question:
http://adventofcode.com/2016/day/9
Summary: You have to find the length of the input string after using the markers to duplicate parts of it. ...
4
votes
0answers
438 views
Time Limit Exceeded with shortest path algorithm
The problem:
SHPATH
You are given a list of cities. Each direct connection between two
cities has its transportation cost (an integer bigger than 0). The
goal is to find the paths of minimum cost ...
4
votes
0answers
123 views
Project Euler #14 in Clojure (finding long Collatz sequence chain)
I'm working on a Clojure implementation for Project Euler #14, which asks for the initial element, under 106, that produces the longest collatz-sequence chain. I'm trying to make use of every ...
4
votes
0answers
98 views
Project Euler #2 in Go
I just learned Go (yesterday in fact) and today I made this solution to Project Euler #2. The problem is to sum the even Fibonacci numbers. My program uses the matrix representation of the linear ...
3
votes
0answers
131 views
LeetCode: Stone Game C#
https://leetcode.com/problems/stone-game/
Alex and Lee play a game with piles of stones. There are an even
number of piles arranged in a row, and each pile has a positive
integer number of stones ...
3
votes
0answers
56 views
Performance issue regarding Project Euler #60 in Scheme
I solved Project Euler #60:
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 ...
3
votes
0answers
52 views
Graph: A backcountry explorer
Would you help me? I want to make this code efficient and simple.
Original Link
Frodo, a backcountry explorer, came to explore an underground cave with n rooms during his expedition. All rooms are ...
3
votes
0answers
364 views
Largest rectangle areas after drawing boundaries
I was asked the following question while trying to get a Hackerrank certificate. I couldn't solve on time but I now completed the solution. Can you please check if my solution seems good? Suggestions ...
3
votes
0answers
76 views
Smashing two heaviest stones until at most one stone is left - counting number of stone comparisions
Based on this question:
Heaviest Stone algorithm time complexity
Problem:
We have a collection of stones, each stone has a positive integer weight.
Each turn, we choose the two heaviest stones and ...
3
votes
0answers
73 views
LeetCode 1263: Minimum Moves to Move a Box to Their Target Location ||
I'm posting a follow-up code on this question, which seems to be a version of Sokoban.
If you'd like to review, please do so. Thank you for your time!
Problem
Storekeeper is a game in which the ...
3
votes
0answers
75 views
Count unique subsequences
I came across this question in a coding competition (Java-restricted) and I got a time-length-exceeded. I am unable to provide a link as the contest is closed now. Can I know how can I optimise this?
...
3
votes
1answer
137 views
Given an integer array A and a range, find a subarray within the range with a minimum sum
Problem
HackerRank Range query:
You are given an array A of n integers. You have to perform ...
3
votes
0answers
89 views
Longest palindrome code in C# takes time out on LeetCode
I like to request a review of the code below, which is my attempt at answering the question here on LeetCode site. The code passes 43 tests, but it times out on the next one. I copied and ran the test ...
3
votes
1answer
2k views
Merge Two Sorted Lists in JavaScript
The task is taken from LeetCode
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two
lists.
Example 1:
...
3
votes
0answers
135 views
Find the starting indices of all occurrences of the pattern in the string - KMP algorithm follow-up
The task
was initially solved here, but was too buggy:
Given a string and a pattern, find the starting indices of all
occurrences of the pattern in the string. For example, given the
string "...
3
votes
0answers
478 views
Kadane's algorithms to leetcode “121 Best Time to Buy and Sell Stock”
I employed the conventional Kadane's algorithms to solve a maximum subarray problem in leetcode Best Time to Buy and Sell Stock - LeetCode
Description
Best Time to Buy and Sell Stock
...
3
votes
0answers
91 views
Writing Go object code that respects Go guidelines
I'm learning Go and I wrote this for a programming challenge. It is working (building and running) but I feel the code is not what Go code should be:
Am I using the ...
3
votes
0answers
2k views
Deepest pit of an array
Following is based on a problem description from a Codility test, as a task in an interview.
DeepestPit - problem description
A non-empty zero-indexed array B ...
3
votes
0answers
146 views
Kattis Ants challenge
I am trying to learn Haskell doing some contest problems. I have worked a bit with the language but still have a very long way ahead.
Right now I am working with a problem called Ants:
An army of ...
3
votes
0answers
689 views
Given an input string and a pattern, implement wildcard pattern matching
I have been trying to solve "Wildcard Matching" on leetcode. I know there are more "manual" ways to solve this without using the RE library. But I would like to know if passing the time limit is ...
3
votes
0answers
81 views
Solutions for counting trapped water on islands
There are some exercises about islands and water. I have seen other solutions in Java, but they are developed in procedural style in one-two methods. I tried to develop an object-oriented solution ...
3
votes
0answers
101 views
Advent of Code 2017 Day 3 (part 1) in Functional Programming (FP)
I wanted to practice functional programming (FP) without using any library but using vanilla JS only. So I took a problem from Advent of Code.
https://adventofcode.com/2017/day/3
You come across ...
3
votes
0answers
90 views
SPOJ Fast Matching challenge
I wrote a solution to the MATCHING challenge on SPOJ:
FJ has N (1 ≤ N ≤ 50,000) cows and M (1 ≤ M ≤ 50,000) bulls. Given a list of P (1 ≤ P ≤ 150,000) potential matches between a cow and a bull, ...
3
votes
0answers
342 views
Python2.7 Some xor fun
After doing the Cryptopals challanges, which I found scrolling through codereview, and finally being able to solve set1 challenge 6. I decided to have a little xor fun, and make an automated xor ...
3
votes
0answers
161 views
Codingame: Great Escape bot in Ruby - Follow-up
This is a follow-up to Codingame: Great Escape bot in Ruby.
As mentioned there, my first reasonably sized Ruby project is a bot for CodinGame's Great Escape contest (here is a sample gameplay video).
...
3
votes
0answers
570 views
Hackerrank: Sherlock and anagram (optimal time complexity)
Problem statement
Given a string \$S\$, find the number of "unordered anagrammatic pairs" of substrings.
Input Format
First line contains \$T\$, the number of testcases. Each testcase ...
3
votes
0answers
150 views
Finding the maximal bottleneck in a 2D matrix from source to destination
I recently started solving programming challenges and this one is causing me performance trouble. The problem statement is the following:
You are given a 2d matrix where each cell contains an ...
3
votes
0answers
599 views
Hackerearth Simple Function - Follow-up
Problem statement
Let us first describe a SimpleFunction:
...
3
votes
0answers
1k views
Solving the Mining algorithm from HackerRank
I was working on this problem for a few hours last night and finally came up with a brute-force solution. The task is to report the minimum work necessary (sum of weight × distance) to relocate gold ...
3
votes
0answers
346 views
CodeEval - Lucky Tickets challenge
This a solution to the CodeEval's challenge "Lucky Tickets".
After a failed attempt with brute-force calculations (no surprise here), I have tried to implement an algorithm that I found on ...
3
votes
0answers
162 views
ACM-ICPC HackerRank challenge in C++
I was doing a programming question in C++ at HackerRank. Given a set of up to 500 bitstrings, each up to 500 bits long, the task is to find the pair a and b such that the bitwise OR contains the most ...
3
votes
0answers
69 views
Optimizing a problem that test all permutations of 1 array with other fixed array
I'm trying to solve this question on a contest programming judge.
Description of the problem:
There are N birds in a forest, each in their respective tree. There are N tired crows in this forest, ...
2
votes
0answers
41 views
Cron expression parser
Problem
Write a command line application or script which parses a cron string and expands each field
to show the times at which it will run.
~$ your-program "*/15 0 1,15 * 1-5 /usr/bin/find"...
2
votes
0answers
64 views
Partial Function composability in Haskell
Below is my solution for the CTFP chapter 4 challenges which essentially involves composing partial functions (that don't have defined outputs for all possible inputs i.e. returning a Maybe).
The ...
2
votes
0answers
29 views
Cave explorer: using stack
Story
Original Link written in korean
Frodo, a backcountry explorer, came to explore an underground cave with n rooms during his expedition. All rooms are numbered 0 through n-1. There are many, the ...
2
votes
0answers
913 views
Better performance in solution for the Dole Out Cadbury challenge
Dole Out Cadbury
Problem Description
You are a teacher in reputed school. During Celebration Day you were assigned a task to distribute Cadbury such that maximum children get the chocolate. You have ...
2
votes
0answers
35 views
Benchmarking multiple implementations of a Code Kata: queue for the self-checkout tills at the supermarket
I was reading this question:
Why is my function timing out when run with a larger data set?
And although I couldn't quite grasp the OP's implementation and so didn't feel like answering.
I did some ...
2
votes
0answers
105 views
Performance challenge: Box operations (HackerRank) (C, Python)
Recently I've been doing some challenges on HackerRank and came across this one. First, I tried with Python, and then C. Both of my codes failed due to timeout restrictions.
It would be very helpful, ...
