I have finally finished creating my first real project, It's just a simple music player that can provides the user with the latest music from any site (as long as it contains mp3 files) he provides in the settings file .. It can play it, download it and has an simple settings file from which the ...
I'm studying Ruby GUI and I'm wondering if there's no tutorial or code examples in the net - beyond those for just beginners, or, if I'm not knowing how to do the proper search...?!
I'd appreciate very much any hint or sites. Thanks.
I'm studying Ruby GUI and I'm wondering if there's no tutorial or code examples in the net - beyond those for just beginners, or, if I'm not knowing how to do the proper search...?!
I'd appreciate very much any hint or sites. Thanks.
Please come back when you've managed to do something working in Ruby though and we can help you to improve, I personally find Code Review a very good way of learning. — Simon André Forsberg14 secs ago
@SimonAndréForsberg Thanks for the addendum there, I was actually not 100% sure enough to pit that in, however I knew for 99% it would be offtopic on any SE site
I want to use some code someone else wrote in a small project of mine, but the code's been licenced under the PSF License, so I looked that license up to see if there were any special rules about using that code. Apparently the license is only supposed to be used for the Python standard library? And if you license your own code with it you're doing it wrong?
It's a 137-line Python game, I shouldn't have to try to decipher this legalese :c
\0
/ \
a b-a-t-s
/|\
m s t
which contains [am, as, at, bat, bats]
the goal I'm trying to reach is to iterate through the trie to find if there's a next word or not, then if so get that word.
I would like to know your opinion on my approach.
// the goal for this is that, at any point...
Please treat this as a interview at a top tech firm, and share your thoughts on how you think I did. Be honest, and leave no stone unturned.
Problem:
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:
Only one let...
I'm wondering what the best way of initializing variables so that I don't over use the garbage collector with a for-loop. Assuming the variable is only used inside the for-loop. Is it better to declare the variable outside of the for-loop?
public void foo() {
String tempName;
for (Pers...
Style Guides
The Perl community does not have a single universal style – there is more than one way to do it. But sometimes, consistency isn't a bad thing either. Here are the three important cornerstones of Perl style:
A perlstyle manpage exists which explains a sensible core of a style guide...
Write a function that takes two parameters:
a String representing a text document
an integer providing the number of items to return
Implement the function such that it returns a list of Strings ordered
by word frequency, the most frequently occurring word first.
Runti...
This is a little yet unfinished RPG I made with C#. It runs well but I'm wondering if there are things I could improve to make it more clear or optimal. I'm basically asking for some feedback and suggestions.
The program is obviously not finished but I'm asking now before I move on so I know if...
From the command line, I can easily find the path to rubygems.rb
$ gem which rubygems
/usr/lib/ruby/1.9.1/rubygems.rb
and from a Ruby script I can also do this
require 'rubygems/commands/which_command'
wc = Gem::Commands::WhichCommand.new
puts wc.find_paths 'rubygems', $LOAD_PATH
However is...
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the
factorial of their digits.
Note: as 1! = 1 and 2! = 2 are not sums they are not included.
I can't figure out a fair way to optimize the upper bound from th...
I'm studying Ruby GUI and I'm wondering if there's no tutorial or code examples in the net - beyond those for just beginners, or, if I'm not knowing how to do the proper search...?!
I'd appreciate very much any hint or sites. Thanks.
\0
/ \
a b-a-t-s
/|\
m s t
which contains [am, as, at, bat, bats]
the goal I'm trying to reach is to iterate through the trie to find if there's a next word or not, then if so get that word.
I would like to know your opinion on my approach.
// the goal for this is that, at any point...
Please treat this as a interview at a top tech firm, and share your thoughts on how you think I did. Be honest, and leave no stone unturned.
Problem:
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:
Only one let...
I'm wondering what the best way of initializing variables so that I don't over use the garbage collector with a for-loop. Assuming the variable is only used inside the for-loop. Is it better to declare the variable outside of the for-loop?
public void foo() {
String tempName;
for (Pers...
Style Guides
The Perl community does not have a single universal style – there is more than one way to do it. But sometimes, consistency isn't a bad thing either. Here are the three important cornerstones of Perl style:
A perlstyle manpage exists which explains a sensible core of a style guide...
Write a function that takes two parameters:
a String representing a text document
an integer providing the number of items to return
Implement the function such that it returns a list of Strings ordered
by word frequency, the most frequently occurring word first.
Runti...
This is a little yet unfinished RPG I made with C#. It runs well but I'm wondering if there are things I could improve to make it more clear or optimal. I'm basically asking for some feedback and suggestions.
The program is obviously not finished but I'm asking now before I move on so I know if...
From the command line, I can easily find the path to rubygems.rb
$ gem which rubygems
/usr/lib/ruby/1.9.1/rubygems.rb
and from a Ruby script I can also do this
require 'rubygems/commands/which_command'
wc = Gem::Commands::WhichCommand.new
puts wc.find_paths 'rubygems', $LOAD_PATH
However is...
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the
factorial of their digits.
Note: as 1! = 1 and 2! = 2 are not sums they are not included.
I can't figure out a fair way to optimize the upper bound from th...
