I have LocalStack in my local machine for resolving AWS service dependencies. I am trying to test my application which connects to the LocalStack SQS. I have deployed my application as a docker container. The problem is when I am accessing SQS getQueueUrl from my application container, it is giving me localhost as AWS endpoint. … Read more
For doing dev testing of my application, I use LocalStack. It is really helpful in creating AWS cloud stack locally. That cuts cost for local development & testing. Also it is easier for developers to remove any DevOps dependency for credentials & IAM accounts while developing. Once LocalStack is successfully installed, we can access AWS … Read more
I am no SEO expert. But what I read online, I understood that having https connection for your website helps. Google prefers content over secured connection than similar content with normal http connection. I was checking if there is an option to get a free SSL certificate & install it for this domain using Blogger. … Read more
Nowadays almost all email services require your phone number to verify identity & then only you can sign up. It is the case with Gmail or Yahoo Mail. Most of the time we are fine with sharing our phone number with email service providers. But sometimes, we may have a case where we want to … Read more
Given a binary matrix, find max rectangle with all 1’s. A : [ 1 1 1 0 0 1 1 0 1 1 1 0 ]Output : 6 Dynamic programming can help us here. For this, we can use maximum size rectangle in a histogram as a sub-problem. The idea is for each row we … Read more
Given a string A and a dictionary of words B, find out if A can be segmented into a space-separated sequence of dictionary words. Input: A = “myinterviewtrainer”, B = [“trainer”, “my”, “interview”]Output: 1 (“myinterviewtrainer” can be segmented as “my interview trainer”) Input: A = “cc” B = [“ccc”]Output: 0 (“cc” can’t be segmented as … Read more
Problem: We need to find first and last positions of an element in a sorted array. In case element is not present, we need to return [-1, -1]. Input: A = [5, 7, 7, 8, 8, 10] B = 8Output: [3, 4] This is an interview question which is asked in companies like Google & … Read more
Inverting a binary tree is common interview question. Input: 1 / 2 3 / / 4 5 6 7 Output: 1 / 3 2 / / 7 6 5 4 We can use recursion to swap left & right sub-trees. Time complexity would be O(n) as we will be doing a full traversal of the … Read more
Median of two sorted arrays is a common problem which is asked in companies like Amazon, Google, Microsoft & Goldman Sachs. You can find the question in InterviewBit or LeetCode. Problem: We have two sorted arrays A and B of size m and n respectively. We need to find the median of these two sorted … Read more
Shortest Unique Prefix is an interview question which you can find in websites like GeeksForGeeks & InterviewBit. It is asked in Google interviews. Basically we need to find shortest unique prefix to represent each word in the list. Input: [zebra, dog, duck, dove]Unique Prefix of each word is as below:zebra = zdog = dogduck = … Read more