To see all resources in your AWS Account, not just the ones for the region you’re currently in, Go to the AWS Console, and then choose:
NOTE: If you have multiple accounts, and haven’t set up a billing account that’s got everything in it, you’ll have to do this for each account.
I’m studying for the AWS…
Last week, in another failed attempt to get my email cleaned out, I unsubscribed from a bunch of emails. Most of them display screens saying you’ve been unsubscribed. Some ask you why. Some give you options for reducing or changing what you’re subscribed to, just in case you don’t want out of ALL of their emails. One even tried to make me login to unsubscribe. What?
This one, though. I didn’t see this one until today, when I was fishing NON-spam things out of my Spam folder…Who did this?
You know how you get all down into a file path somewhere, and then you have to go back up, and then back down some other file path, and then back up?
.bash_aliases is your friend, at least for going back UP the hierarchy.
I put this in my .bash_aliases file, in my home directory:
alias cd2='cd ../../'
alias cd3='cd ../../../'
alias cd4='cd ../../../../'
alias cd5='cd ../../../../../'
alias cd6='cd ../../../../../../'alias cd10='echo "Do you REALLY need this many directory levels!?" && cd ../../../../../../../../../'
After you add this, don’t forget to:
That’s how it is today…tomorrow, or the next day or the next day (../../../), I’ll change the .bash_aliases file to accept an integer for the number of directories to cd back to, so I don’t have multiple lines of hard-coded aliases to do this.
…and before the waiting period was over
Let’s Encrypt is “A nonprofit Certificate Authority providing TLS certificates to 225 million websites.
Unbeknownst to ME until yesterday, Let’s Encrypt has a limit of how many times you can issue a cert for a domain or set of domains per week. I didn’t know this…I didn’t even know to LOOK for this. Guess when I found out about the limit. That’s right; when I exceeded it.
TLDR; If you’ve run into the same issue, try changing the list of domains. For example, if you entered your domains as www.domainname.com and domainname.com, try…
I admit, it took me days to do this. Days. I could have typed it in a hundred plus times, in the time it took me to “automate it”.
BUT, I struggle with (edit: am bored senseless) doing things manually, when I could automate them…even when I have existential crises at multiple times along the way, KNOWING I could have just TYPED THE INFORMATION INTO THE COMMAND LINE.
Nope…I can’t make me. I’ve tried. I’m driven to automate. I justify my automation by promising myself I’ll use it again. …
Today’s Leetcode challenge was to figure out the maximum possible length a palindrome could be, given a string.
I started off by going right down a rabbit hole, and not even a CORRECT rabbit hole. I spent hours writing code to return the actual longest palindrome for the string, without changing the order of the characters in the string.
RTFI (Read the F*ing Instructions), right?
The challenge was to find the maximum POSSIBLE length, given ANY order of the given string. …
I want to give a shout-out to Leetcode, whose coding challenges I’ve been doing, and then recently, posting about. I’ve been an active member on the site for maybe 2.5 months-ish. And while I admittedly have MUCH to learn, it’s done more to escalate the pace at which I’m learning, than any other site I’ve joined or course I’ve purchased.
I just finished the July Challenge. To successfully complete the challenge, I had to code and submit a solution that passed all of the test cases, for a different problem every day. …
I’m just happy as a pig in py…..cuz my answer scored super high in speed and low memory usage today for the daily Leetcode Challenge.
Design a data structure that supports the following two operations:
search(word) can search a literal word or a regular expression string containing only letters
.means it can represent any one letter.
search("pad") -> false
search("bad") -> true
search(".ad") -> true
search("b..") -> true
You may assume that all words are consist of lowercase letters
I thought for sure today was going to be a binary tree challenge. It wasn’t. Instead…
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
Follow up: Could you solve it without loops/recursion?
Output: trueExample 2:
Here are two basic approaches with two variations each. All of them were accepted. I’ll run some benchmark timing and update this post with that.
A few things to note:
num == 1, it’s automatically
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
Note: For the purpose of this problem, we define empty string as valid palindrome.
Input: "A man, a plan, a canal: Panama"
Output: trueExample 2:
Input: "race a car"
a word, phrase, or sequence that reads the same backward as forward, e.g., madam or nurses run.
I solved this two different ways. The first way was faster than about 52% of other submissions. The second way was faster than 97.14% …
Senior Software Engineer, Inventor, Writer, Zumba Instructor, Storm and Sky Photographer, Drone Pilot, Shar Pei Lover & Owner