วีดีโอ

@JamieT

IMPORTANT CORRECTION: Please check the correct answer below for this question. The correct answer is A. Apologies for the earlier mistake! You are running a web application deployed to a Compute Engine managed instance group. Ops Agent is installed on all instances. You recently noticed suspicious activity from a specific IP address. You need to configure Cloud Monitoring to view the number of requests from that specific IP address with minimal operational overhead. What should you do? ANSWER : A.Configure the Ops Agent with a logging receiver. Create a logs-based metric.

Excellent, Thank you for your efforts.

Excellent, Thank you for your efforts.

So sad that these kind of good videos get lost in tons and tons of crap.. Questions are great..

I only see my same instance t3a.small, I don't see any more instances to choose from

Package for 3 years exp?

For the problem "check if two strings are anagrams" you shouldn't sort the arrays (this is O(n lg n)) instead use a dictionary to keep track of the frequency of each letter and compare as such, this gives you an O(n) runtime. i.e. replace if sorted(str1) == sorted(str2) with if Counter(str1) == Counter(str2). For the problem "merge two sorted lists" this only works because of the specific implementation of sorted. pythons sorted uses timsort and thus interprets your input as 2 natural runs and takes O(n) time to run, otherwise it would take O(n lg n) time since sorting is O(n lg n) in general. For the problem "find the second largest number in a list", again you should not sort, this is O(n lg n), if instead you use a max heap you can solve this problem optimally and in general, here is my solution for reference: import heapq def kthLargest(arr, k): heapq._heapify_max(arr) # O(n) while k>1: # O k lg k heapq._heappop_max(arr) k-=1 return heapq._heappop_max(arr) or even just find the second largest directly by first finding the largest, then removing it from the list, and then finding the next largest, either solution will give you O(n) runtime for k = 2 and O(n+ k lg k) runtime in general. (note: in my solution I mutate the array/sequence of numbers, if this is an issue for this particular problem you can easily fix it by creating a copy of the array arr and working on that copied array, this would incur an O(n) space complexity cost but sorted already has an O(n) space complexity cost, to reduce the space complexity cost you can find the 2nd largest value using the direct method I outlined above, but instead of removing the largest you keep track of where it is so that in your second search through the array you act like its not there, this solution when generalised gives O(k) space complexity but has O(nk) time complexity which is substantially worse than the heap approach). For the problem "check if a number is prime" this is a good solution but because of the implicit floating point conversion on line 6 it will break for sufficiently large primes, thus you should replace it with math.isqrt(n).

Hi , How many rounds for this role and also coding questions in this interview?

please provide answers also it will be helpful for the people who are trying for jobs search

Nice

thx my friend，ur video provides a good example for my assignment

❤

I need answer for red flag green flag in techgig code gladiators semi final

Nice Content

If you provide answers also that would be more helpful

'Promo SM'

can i get answers for these questions please?

It’s very helpful

From where you got these questions?

What was the role you are applying for it's look like a data engineer role or most companies except python developers to have experience in data science tools like pyspark and etc 😅. I am a fresher with experience in python 1.5 years but I have never used it with pyspark should I also look into that. Just wanted to know that.

Great and informative as well, but if you could create a video that answers these questions might help ppl get a better idea how to tackle these questions and if done using a use case or user story will help learners a lot.

#infinix

Nice, instead of just questions could u pls also include some discussions on what a good answer would look like

P R O M O S M

Task 4 | In Sort you can change to desc/Asc as per task Task 2 | =COUNTIF(tlc_yellow_trips_2022!airport_fee,">0") Task 5 | =IF(fare_amount>0, tolls_amount/fare_amount*100, 0)