CA Karthikeyan B’s Post

GCP senario - Case Study: Using GCP's tool make a pipeline to transfer file from one GCS bucket to another 1)step up GCP project with billing enabled and appropriate access to GCS and dataflow. 2) create source and target. storage buckets. 3)create dataflow pipeline using apache beam library (an unified programming model for batch and streaming data ) below is code for this given case study written in python using apache beam library ################ import apache_beam as beam def transfer_files(bucket_from, bucket_to): p = beam.Pipeline() (p | 'Read files' >> beam.io.ReadFromText('gs://{}/input_file.txt'.format(bucket_from)) | 'Write files' >> beam.io.WriteToText('gs://{}/output_file.txt'.format(bucket_to))) result = p.run() result.wait_until_finish() if __name__ == '__main__': transfer_files('source_bucket', 'destination_bucket')

This Keyword and properties in OOPs using C# Language : Live Class | Unlock the Secrets to Better Code! #programmingtips #objectorientedprogramming #This #codingtipss #programming #javascript #csharp #python #learntocode2024 #TechTutorials #CodeNewbie #softwaredevelopment #ProgrammingBasics https://lnkd.in/grNEW9Qe

I finally fixed a long annoying issue and completed two out of four goals, great first day :) SUSE Hack Week Day 1 recap: https://lnkd.in/eFTCegim My Project: AWS CodePipeline CI plugin for pagure on code.opensuse.org (https://lnkd.in/e8WHxXdp) #SUSE #openSUSE #HackWeek #pagure #AWS #CodePipeline #AWSCodePipeline #OpenSource #Python

#Day 10 (DSA) - Increasing Triplet Subsequence Problem :- Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.   Example 1: Input: nums = [1,2,3,4,5] Output: true Explanation: Any triplet where i < j < k is valid. Example 2: Input: nums = [5,4,3,2,1] Output: false Explanation: No triplet exists. Example 3: Input: nums = [2,1,5,0,4,6] Output: true Explanation: The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6. Link :- https://lnkd.in/dk5eAJ7h LeetCode Leetcode Challenge LeetCode Ltd Java Leetcode Solutions Google Microsoft Amazon Meta LinkedIn Coding Thinker Aman Pandey #GeeksForGeeks #Microsoft #LinkedIn #Google #YouTube #LeetCodeChalleng #LeetCodeStreak #LeetCode2024 #HackerRank #LeetCodeInJava #Coding #Java #JavaDevelopers #DSAInJava #DSAChallenge #CodingThinker #OOP #DailyPractice #DailyChallenge

So Imagine that you spent months creating THE perfect ML model with 100% accuracy in detecting banking fraud!💸 And now you have decided to bless us with it and ship it to production. Only problem is that, when working with such big systems, you’ll probably want to go with some standard choice like Go/.Net/Java, etc… And chances are you don’t have millions lying around (assumption) to hire a bunch of edgy engineers to integrate something like (Jython / JPype) into your system and you are a strong believer in horizontal scaling so you want to keep things loose… The sensible approach here would be just to expose that model over a python REST API, and consume from whatever other pod/container you’d like, right? WRONG! 😁 As I told you above, in this imaginary scenario we want to squeeze out resource consumption while lowering the overall latency of your product! Maybe deploying to (Fargate or App Service)… So let’s try to switch to request between your microservices to HTTP2’s gRPC... Google is doing it, so why don’t we ? (classic FOMO, right thanx!) _______________ TLDR; taking gRPC for a spin, with a node/typescript client and a Python server. repo:

Simple solutions do exist for complex problems! Today, one of the critical Python lambda code in AWS was timing out suddenly. It is a fairly complex process that tests certain functionality and spits out metrics with test results to a spreadsheet. Couple of us took a look at it, analyzed it and tinkered with it. With multiple changes (complex over-thinking), performance tuning certain parts of code, it was as stubborn as a rock and timed out. Revisited the issue after taking some time off from it. Light bulb moment arrived !!! To account for the data growth, we increased memory & storage on the Lambda, after which it ran smooth to completion. Lessons 're-learnt': Take a break, break down the problem fully, think straight and simple for solutions.

#Day 18 (DSA) - Sqrt(x) Problem :- Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or operator. For example, do not use pow(x, 0.5) in c++ or x ** 0.5 in python.   Example 1: Input: x = 4 Output: 2 Explanation: The square root of 4 is 2, so we return 2. Example 2: Input: x = 8 Output: 2 Explanation: The square root of 8 is 2.82842..., and since we round it down to the nearest integer, 2 is returned. Link :- https://lnkd.in/d6WhmDFd LeetCode Leetcode Challenge LeetCode Ltd Java Leetcode Solutions Google Microsoft Amazon Meta LinkedIn Coding Thinker Aman Pandey #GeeksForGeeks #Microsoft #LinkedIn #Google #YouTube #LeetCodeChalleng #LeetCodeStreak #LeetCode2024 #HackerRank #LeetCodeInJava #Coding #Java #JavaDevelopers #DSAInJava #DSAChallenge #CodingThinker #OOP #DailyPractice #DailyChallenge

Hey #folks I am sharing it very late but do you know about the #1brc challenge at https://1brc.dev . Our mission is to write a program that retrieves temperature measurement values from a text file and calculates the min, mean, and max temperature per weather station. There's just one caveat: the file has 1,000,000,000 rows! That's more than 10 GB of data! Put your #DSA skills to use and calculate the time it takes finish and show the final result. You might think "Oh wait, what's the rush in this? Easy. I will use a for loop to ....". The challenge is not only about calculations only but the time it takes. Current Lowest time taken :- 01.535 seconds using #Java #GraalVM https://www.graalvm.org . Crazy right?? Experience :- It was fun to implement this solution in Rust. I had to learn a lot about the language and its ecosystem. I had to learn about the std::fs module to read the file, std::collections::HashMap to store the results and many other rust internal and unstabe features. My solution at https://lnkd.in/d6vWXD3p . I am not a competitive programmer BTW. Result :- Running in a 1.4 GB file with 100 million rows -> 3 seconds Finally, the results for 14 GB file with 1 billion rows -> 41 seconds Why don't you put our #DSA skills to use and try this challenge out !! #leetcode #DSA #google #microsoft #faang #mang #dev #interview #programming #coding #1trc #rust

Yesterday I asked #AmazonQDeveloper to generate a diagram of my project, I was quite impressed already, but... ...today I asked Q to work the other way round, and generate a new project from scratch from my diagram! I used the agent and asked "/dev can you generate application files from this mermaid diagram (I want the code of the lambdas to be written in python and the infrastructure as code with the cdk): [mermaid diagram as code here]" And a few minutes later I got all the files I needed in my folder (including the html file), generated by the #AmazonQDeveloper Agent. It's not perfect yet and I still have to do a bit of debug, but several things were working already, so that seems very promising :) For people like me, who have known multiple periods in the software industry, it is crazy that we can do that today!!! ...and we are only at the beginning. Here is a link from where you can start with the "/dev" agent for software development: https://lnkd.in/euDKysn7 Also a simple blog post I have written about this experience 👉 https://lnkd.in/egc-Fqcn

#Day 38 (DSA) - Removing Stars From a String Problem :- You are given a string s, which contains stars *. In one operation, you can: Choose a star in s. Remove the closest non-star character to its left, as well as remove the star itself. Return the string after all stars have been removed. Note: The input will be generated such that the operation is always possible. It can be shown that the resulting string will always be unique.   Example 1: Input: s = "leet**cod*e" Output: "lecoe" Explanation: Performing the removals from left to right: - The closest character to the 1st star is 't' in "leet**cod*e". s becomes "lee*cod*e". - The closest character to the 2nd star is 'e' in "lee*cod*e". s becomes "lecod*e". - The closest character to the 3rd star is 'd' in "lecod*e". s becomes "lecoe". There are no more stars, so we return "lecoe". Example 2: Input: s = "erase*****" Output: "" Explanation: The entire string is removed, so we return an empty string. Link :- https://lnkd.in/dmzrA6x8 LeetCode Leetcode Challenge LeetCode Ltd Java Leetcode Solutions Leetcode with Java Google Microsoft Amazon Meta LinkedIn Coding Thinker Aman Pandey #GeeksForGeeks #Microsoft #LinkedIn #Google #YouTube #LeetCodeChalleng #LeetCodeStreak #LeetCode2024 #HackerRank #LeetCodeInJava #Coding #Java #JavaDevelopers #DSAInJava #DSAChallenge #CodingThinker #OOP #DailyPractice #DailyChallenge