All Questions
14 questions
1
vote
1
answer
131
views
Count all possible attendance records with length n, which will be regarded as rewardable
Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer may be very large, return it after \$\mod 10^9 + 7\$.
...
- 261
5
votes
2
answers
3k
views
Java 8 Stream to produce all permutations of an array using recursion
I want to write a class that returns a Stream of permutations of an int[].
...
- 151
7
votes
1
answer
2k
views
Recursive program for generating and printing all permutations of the numbers 1, 2, ..., n for given integer number n
I've just written code for generating all permutations of the numbers from 1 to n in Java. It seems to work, but I think it's a bit more complex than it needs to be.
...
- 173
8
votes
2
answers
1k
views
Finding permutations of a word
This was a basic anagram problem. Take an input word, find all its permutations, then check a dictionary file to see what if any of those are real words.
Dictionary file
My input data:
...
- 253
3
votes
2
answers
3k
views
Non-Contiguous Substrings
Problem:
A non-contiguous substring of string \$s\$ is a sequence of \$k \geq 0\$ characters in \$s\$, in the order in which they occur in \$s\$. For instance, the set of all non-contiguous ...
- 139
6
votes
1
answer
4k
views
Permutation algorithm of N unique elements with low memory footprint
I actually had a real life need (outside work, no less) to come up with every single permutation of N elements (the N in my case being 12, so a total of ...
- 198
11
votes
2
answers
457
views
You need to diversify your strings
Challenge:
Write a program which prints all the permutations of a string in alphabetical order.
Specifications:
Your program should accept a file as its first argument.
The file contains input ...
- 9,919
4
votes
5
answers
3k
views
Permutation of n lists
I have code which gives permutations for 10 lists. The code works fine for small number of lists with small number of values.
Result : It should return all possible permutations. I have to store the ...
- 43
5
votes
1
answer
20k
views
Print all possible combinations of size r, from an array of size n
This is my working solution for the following problem: given an array of integers of size n, print all possible combinations of size r.
Before I proceed to the solution, I have the following question:...
- 861
8
votes
1
answer
2k
views
Speeding up subset sum implementation
Important fact: the number of the input is greater than 1. How do I use this fact to speed up this solution?
...
- 83
3
votes
1
answer
134
views
Better way to create samples
I've done this piece of code for creating all possible samples without repetitions, but I think that it is a so heavy algorithm because every time I call this recursive function I create a new vector ...
- 141
30
votes
3
answers
83k
views
Find all subsets of an int array whose sums equal a given target
I am trying to implement a function below:
Given a target sum, populate all subsets, whose sum is equal to the target sum, from an int array.
For example:
Target ...
- 403
6
votes
2
answers
4k
views
Permutation of given string
I am reading a book on DSA, and the author explains how to generate the permutation of strings using recursion. I want to know if there are better ways of doing the same, unless this is the best ...
2
votes
2
answers
3k
views
multi-recursive replacement function
I wrote a function for creating all possible translations of a source string, based on a multiple translation map. It works, but generates a lot of intermediate maps (see line marked with *). Is there ...
