Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Serbian pangrams #93

Open
oggy22 opened this issue May 20, 2020 · 0 comments
Open

Serbian pangrams #93

oggy22 opened this issue May 20, 2020 · 0 comments

Comments

@oggy22
Copy link
Owner

oggy22 commented May 20, 2020

Implement this command argument:
-pangram:SR

Algorithm:

  1. Have zero initialized 2^30 bit array where each element represents subset of Serbian alphabet
  2. Iterate through word forms in each iteration:
  • For each bit in the array (alphabet subset) if it complements the word, set the bit of the union
  • If the full set is acheived, the pangram is possible. Back-track, somehow, to reconstruct the pangram
  • If the full set is not achieved, keep track the bigget subset and backtrack it instead
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@oggy22