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
We will solve LeetCode problem “85. Maximal Rectangle” here. The problem states that: Given a rows x cols binary matrix filled with 0‘s and 1‘s, find the largest rectangle containing only 1‘s and return its area. Input: [ 1 1 1 0 0 1 1 0 1 1 1 0 ] Output: 6 Does the … Read more
We will solve LeetCode problem “139. Word Break” here. The problem statement is as below: Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the dictionary may be reused multiple times … Read more
Here we will solve LeetCode problem “34. Find First and Last Position of Element in Sorted Array“. The problem statement is as below: Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. … Read more
Inverting a binary tree or mirroring a binary tree is a common interview question. We will solve LeetCode “226. Invert Binary Tree” problem here. The problem statement is as follows: Given the root of a binary tree, invert the tree, and return its root. Input: [1, 2, 3, 4, 5, 6, 7] Output: [1, 3, … Read more
We will solve Median of two sorted arrays problem here. It is a common problem solving question which is asked in interview rounds of companies like Amazon, Google, Microsoft & Goldman Sachs. We will use LeetCode problem “4. Median of Two Sorted Arrays” as example here. The problem states that: Given two sorted arrays nums1 … Read more
Shortest Unique Prefix is an interview question which you can find in websites like GeeksForGeeks & InterviewBit. It is asked in Google interviews. The problem is as follows: 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
We will be solving LeetCode problem “406. Queue Reconstruction by Height” here. The problem states that: You are given an array of people, “people“, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or … Read more