Usually when you buy something, you're asked whether your credit card number, phone number or answer to your most secret question is still correct. However, since someone could look over your shoulder, you don't want that shown on your screen. Instead, we mask it.

Your task is to write a function maskify, which changes all but the last four characters into '#'.


Examples:

maskify("4556364607935616") == "############5616"
maskify(     "64607935616") ==      "#######5616"
maskify(               "1") ==                "1"
maskify(                "") ==                 ""

# "What was the name of your first pet?"
maskify("Skippy")                                   == "##ippy"
maskify("Nananananananananananananananana Batman!") == "####################################man!"

#python #maskify

# return masked string
def maskify(cc):
  return len(cc[:-4]) * '#' + cc[-4:]

#python #maskify #solution

# How to sort a Python dict by value
# (== get a representation sorted by value)

>>> xs = {'a': 4, 'b': 3, 'c': 2, 'd': 1}

>>> sorted(xs.items(), key=lambda x: x[1])
[('d', 1), ('c', 2), ('b', 3), ('a', 4)]

# Or:

>>> import operator
>>> sorted(xs.items(), key=operator.itemgetter(1))
[('d', 1), ('c', 2), ('b', 3), ('a', 4)]

#python

https://projects.lukehaas.me/css-loaders/

#css #loaders #loading #animation

Python dictionary:

# The get() method on dicts
# and its "default" argument

name_for_userid = {
    382: "Alice",
    590: "Bob",
    951: "Dilbert",
}

def greeting(userid):
    return "Hi %s!" % name_for_userid.get(userid, "there")

>>> greeting(382)
"Hi Alice!"

>>> greeting(333333)
"Hi there!"

#pytricks

https://workplace.stackexchange.com/questions/125610/is-it-okay-to-refuse-entirely-to-answer-desired-salary-question

#workplace #salary

Complete the method/function so that it converts dash/underscore delimited words into camel casing. The first word within the output should be capitalized only if the original word was capitalized.

Examples:

to_camel_case("the-stealth-warrior") # returns "theStealthWarrior"
 to_camel_case("The_Stealth_Warrior") # returns "TheStealthWarrior"

#python #codewars

name = 'Is-this-a-tough_question?'
 name[0] + name.title().translate(None, '-_')[1:]

OR:

name = 'Is-this-a-tough_question?'
 name.title().replace('-', '').replace('_', '')

#python #solution

Write a function, which takes a non-negative integer (seconds) as input and returns the time in a human-readable format (HH:MM:SS)

HH = hours, padded to 2 digits, range: 00 - 99
 MM = minutes, padded to 2 digits, range: 00 - 59
 SS = seconds, padded to 2 digits, range: 00 - 59

#python #codewars #datetime

راه حل دوست خوبمون Mehrshad:

toh = lambda n: "{}:{}:{}".format(str(n//3600).zfill(2), str((n%3600)//60).zfill(2), str((n%3600)%60))

نکته ای که هست میشود با string formatter بجای zfill پیش رفت:

return '{:02}:{:02}:{:02}'.format(s / 3600, s / 60 % 60, s % 60)

#python #solution

If you forget to pull your projects from git in a regular interval and many users working on the same projects, then there is a solution for you!

Create a bash script file as follow and make it executable by chmod +x puller.sh:

puller.sh file content:

#!/bin/bash

 echo 'Iterating over folders...'
 for dir in *
 do
   test -d "$dir" && {
       cd ${dir}
       echo "git pull $dir"
       git pull
       cd ".."
   } || {
       echo "------> $dir is not a directory <-------"
   }
 done

NOTE: this file should reside in your folder's project root. In my case it is in /Your/Projects/Folder.

Now as a final step, put it in your crontab:

10 * * * * bash -c "cd /Your/Projects/Folder; bash puller.sh >> /var/log/git_pull_output.log"

#linux #git #pull #cronjob #crontab #cron #bash

Count the number of Duplicates

Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits.

Example:

"abcde" -> 0 # no characters repeats more than once
"aabbcde" -> 2 # 'a' and 'b'
"aabBcde" -> 2 # 'a' occurs twice and 'b' twice (`b` and `B`)
"indivisibility" -> 1 # 'i' occurs six times
"Indivisibilities" -> 2 # 'i' occurs seven times and 's' occurs twice
"aA11" -> 2 # 'a' and '1'
"ABBA" -> 2 # 'A' and 'B' each occur twice

What is your solution?

#python #codewars

from itertools import groupby

def duplicate_count(a):
    return len([1 for k, i in groupby(sorted(a.lower())) if len(list(i)) > 1])

#python #solution

We have talked before about how to get current month using the below line of code:

echo $(date +%m)

It prints out 01, 02, etc.

As per the GNU date manpage:

By default, date pads numeric fields with zeroes. The following
    optional flags may follow '%':
    - (hyphen) do not pad the field

So you can remove leading zero by hyphen as below:

echo $(date +%-m)

It prints out 1, 2, etc.

#linux #bash #date

As an alternative to the pprint module:

# The standard string repr for dicts is hard to read:
>>> my_mapping = {'a': 23, 'b': 42, 'c': 0xc0ffee}
>>> my_mapping
{'b': 42, 'c': 12648430. 'a': 23}  # 😞


# The "json" module can do a much better job:
>>> import json
>>> print(json.dumps(my_mapping, indent=4, sort_keys=True))
{
    "a": 23,
    "b": 42,
    "c": 12648430
}

# Note this only works with dicts containing
# primitive types (check out the "pprint" module):
>>> json.dumps({all: 'yup'})
TypeError: keys must be a string

#python #pprint #json #dumps

A Narcissistic Number is a number which is the sum of its own digits, each raised to the power of the number of digits in a given base. Here we will restrict ourselves to decimal (base 10).

For example, take 153 (3 digits):

1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153

and 1634 (4 digits):

1^4 + 6^4 + 3^4 + 4^4 = 1 + 1296 + 81 + 256 = 1634

The Challenge:

Your code must return true or false depending upon whether the given number is a Narcissistic number in base 10.

NOTE: Error checking for text strings or other invalid inputs is not required, only valid integers will be passed into the function.

#python #question #codewars

from math import pow

def narcissistic(value):
    digits = map(int, list(str(value)))
    power = len(digits)
    final_res = 0
    for digit in digits:
        final_res += pow(digit, power)
    return int(value) == int(final_res)

#python #solution

def narcissistic(value):
    return value == sum(int(x) ** len(str(value)) for x in str(value))

#python #solution

The maximum sum subarray problem consists in finding the maximum sum of a contiguous subsequence in an array or list of integers:

maxSequence([-2, 1, -3, 4, -1, 2, 1, -5, 4])
 # should be 6: [4, -1, 2, 1]

Easy case is when the list is made up of only positive numbers and the maximum sum is the sum of the whole array. If the list is made up of only negative numbers, return 0 instead.

Empty list is considered to have zero greatest sum. Note that the empty list or array is also a valid sublist/subarray.


#python #codewars