Coding
72 notes.
edge-tts won’t give you WordBoundary events until you ask
One keyword argument, keyword-only and missing from most tutorials, and then two things about ASS that cost me a lot longer than the keyword did.
Never run django.template.Template() on HTML you didn’t write
A single stored record took an endpoint down for a week. It contained valid, working markup for a different template language. Django compiled it anyway, because that is what you asked it to do.
Fix Gunicorn’s TimeoutError: [Errno 110] Connection timed out in sock.sendall()
Your view already finished. The worker got stuck handing the response over - and raising --timeout, the usual first move, makes it last longer instead of fixing it.
SwiftUI: Create a Custom Navigation Bar
In this article we create a reusable navigation bar in SwiftUI: a centred or large title, leading and trailing buttons, your own colours, and a Back button that actually pops the screen. It's applied as a modifier, so it sits where the system bar would.
How to Use msmtp with PHP’s mail() Function to Send Email
In this guide, let's explore how to set up PHP to use msmtp, a lightweight SMTP client, as its MTA.
Stripe Fee Calculator and Formula with custom rates
Stripe Fee Calculator and Formula with custom rates. To calculate Stripe fees for a transaction, you can use the following formula: Total Fee = (Transaction Amount * Fee Percentage) + Fixed Fee. To calculate the amount to ask for with the stripe fee included, you can use the following formula: Ask For = (Transaction Amount + Fixed Fee) / (1 - (Fee Percentage / 100)).
Python: Add Two or More Numbers – Linked List
Learn how to add two non-negative integers represented by linked lists in reverse order. Check out this Python code example.
Python: Two Sum Problem
Learn how to find indices of two numbers in an array that add up to a specific target using Python. Check out this code and examples.
Python: Stack with Push, Pop and seek Minimum Value with O(1)
Learn how to implement a stack with push, pop, and seekMin functions in Python 3 with a time complexity of O(1). Check out this code!
Python: Lowest Common Ancestor of a Binary Tree – Non Recursive
Python 3 code to find the Lowest Common Ancestor of a Binary Tree This is a Non Recursive solution using DFS method. 9197555006ad2407629e6f_000048 9197555006ad2407629e6f_000049 Hope it helps.
Python: Lowest Common Ancestor of a Binary Search Tree
Python 3 code to find the Lowest Common Ancestor of a Binary Search Tree 9197555006ad2407629e6f_000050 Hope it helps.
Python: Array/List Rotation – Right
Python program to rotate an array towards its right Inplace Method 9197555006ad2407629e6f_000051 Split and Merge Method 9197555006ad2407629e6f_000052 Hope this helps.