A simple demonstration of containerizing a react app
- Node.js
- NGINX
import json | |
import boto3 | |
comprehend = boto3.client("comprehend") | |
def check_validity(event): | |
"""Check if the event has the required fields""" | |
try: | |
if "text" not in event or "lang_code" not in event: |
version: 0.2 | |
phases: | |
install: | |
runtime-versions: | |
nodejs: 20.x | |
commands: | |
- echo "Install Phase" | |
- npm install --global yarn | |
- yarn |
In the fast-paced world of e-commerce, a robust and scalable order processing system is crucial for success. Serverless architectures on AWS provide the power and flexibility to handle fluctuating demands while minimizing operational overhead. In this post, we'll explore how to design a serverless fan-out architecture using SNS, SQS, and Lambda to achieve efficient e-commerce order handling.
The fan-out pattern allows a single event or message to be processed by multiple downstream services simultaneously. For order processing, this is a potent strategy. When an order is placed, parallel processes need to occur:
In today's digital landscape, building robust and scalable applications is crucial. For my latest project, I opted for a 3-tier architecture on AWS, and I'm excited to share the details with you! This architecture offers a clean separation of concerns, making the application easier to maintain, secure, and ultimately, more efficient. ###What is a 3-Tier Architecture? Imagine a well-oiled machine with three distinct parts working together seamlessly. That's the essence of a 3-tier architecture. Here's a breakdown of the tiers in my AWS implementation:
Link for the app: https://partyrock.aws/u/abjkrsna/8hoiG7w8h/Sentiment-Analyzer
Steps for Sentiment Analysis:
class Participant: | |
def __init__(self, name): | |
self.name = name | |
self.points = 0 | |
self.choice = "" | |
def choose(self): | |
self.choice = input("{name}, select rock, paper or scissor: ".format(name= self.name)) | |
print("{name} selects {choice}".format(name=self.name, choice = self.choice)) |
""" | |
Maximum Sum BST | |
Given a binary tree root, the task is to return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST). | |
Input Format: | |
The first and only line of input contains data of the nodes of the tree in level order form. The order is: data for root node, data for left child to root node, data for right child to root node and so on and so forth for each node. The data of the nodes of the tree is separated by space. Data -1 denotes that the node doesn't exist. | |
Output Format: | |
Print the maximum sum | |
Sample Input 1: | |
1 4 3 2 4 2 5 ## Write your code here | |
-1 -1 -1 -1 -1 -1 4 6 -1 -1 -1 -1 |