summaryrefslogtreecommitdiff
path: root/python/problems/dictionaries/freq_following_word/sl.py
diff options
context:
space:
mode:
authorMartin Možina <martin.mozina@fri.uni-lj.si>2016-08-24 15:32:22 +0200
committerMartin Možina <martin.mozina@fri.uni-lj.si>2016-08-24 15:32:22 +0200
commit12378810ee9207536bfa0c264c1bf2a2b0296171 (patch)
tree902e226e249a5369928e3fbc7e85739e14448b46 /python/problems/dictionaries/freq_following_word/sl.py
parentc2e782122d52acea0e69f8a5a92b40bbbb7072e5 (diff)
Added several new exercises for Python (related to dictionaries and sets).
Diffstat (limited to 'python/problems/dictionaries/freq_following_word/sl.py')
-rw-r--r--python/problems/dictionaries/freq_following_word/sl.py30
1 files changed, 30 insertions, 0 deletions
diff --git a/python/problems/dictionaries/freq_following_word/sl.py b/python/problems/dictionaries/freq_following_word/sl.py
new file mode 100644
index 0000000..eb12456
--- /dev/null
+++ b/python/problems/dictionaries/freq_following_word/sl.py
@@ -0,0 +1,30 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20611
+name = 'Najpogostejša sledeča beseda'
+
+description = '''\
+<p>
+Napišite funkcijo <code>freq_following_word(txt)</code>, ki za vsako besedo <code>b</code>
+v nizu <code>txt</code> zapiše v slovarju najpogostejšo besedo, ki
+sledi besedi <code>b</code>. Če je več takih besed, vzami prvo po abecedi.
+Nekaj primerov:
+<pre>
+>>> freq_following_word('in in in in')
+{'in': 'in'}
+>>> freq_following_word('in to in ono in to smo mi')
+{'smo': 'mi', 'to': 'in' , 'ono': 'in', 'in': 'to']}
+</pre>
+</p>
+'''
+
+plan = []
+
+hint = {
+ 'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}