This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/env python | |
| # makekey.py - A key making tool | |
| # This program will accept a pin configuration for a Schalge 5 Pin lock and produce GCode to mill out the corresponding key. | |
| # | |
| # For example, this will produce a bump key: | |
| # $ ./makekey.py 99999 | |
| # | |
| # This could produce a key to something else: | |
| # $ ./makekey.py 38457 | |
| # |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| default['sshd']['sshd_config']['AuthenticationMethods'] = 'publickey,keyboard-interactive:pam' | |
| default['sshd']['sshd_config']['ChallengeResponseAuthentication'] = 'yes' | |
| default['sshd']['sshd_config']['PasswordAuthentication'] = 'no' |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| from concurrent.futures import ProcessPoolExecutor | |
| import time | |
| def wait_function(x, y): | |
| print('Task(', x,'multiply', y, ') started') | |
| time.sleep(2) | |
| print('Task(', x,'multiply', y, ') completed') | |
| return x * y | |
| def callback_function(future): |
DSA is no longer about solving random sheets or memorizing solutions. It’s about a clear, structured, and realistic approach from absolute beginner to interview-ready Candidate.
- How to start DSA from zero (even if you don’t know coding)
- When to focus on language basics vs DSA
- A 3-phase preparation strategy used by serious engineers
- Exact timelines for topics, patterns, and problem counts
- Why 300–400 problems ≠ success (and what actually matters)