My journey through the Google interview process
Google Coding Interviews are one of the toughest interviews to crack. From the time I found my passion in Competitive coding, my aim was to crack Google Coding Interviews.
Here I am trying to list down the complete process that I went through…
This is a post where I am going to list down some tips and tricks on how you should design your resume to land a job at Google.
These are some problems that I practiced before my Google Interview in a span of 2 weeks.
Write an algorithm to find the kth number such that only prime factors are 3,5 and 7.
This question seems very simple but there is one interesting solution that I am going to explain below:
Let’s maintain 3 queues such that:
Q3: Has previously unseen multiples of 3
I had already mastered DS and Algo and thought to give CTCI a try. I had the opinion what is left for me to study now! Little did I know that this book is going to be one of the most insightful books I could ever read.
Inspired by Naval Ravikant
Recently, I have been reading a book called “The Almanack of Naval Ravikant”.
I came across this article that categorises the kind of luck one can have.
The first kind of luck is blind luck where one just gets lucky because something completely out of their…
Rock, Paper, Scissors
There are 2 players Alice and Bob, who are playing Rock, Paper and Scissors game. Alice can pick rock ‘a’ times, scissors ‘b’ times and paper ‘c’ times. Similarly, Bob can pick rock ‘x’ times, scissors ‘y’ times and paper ‘z’ times.
Note: The ordering…
I got an offer from Flipkart for the SDE1 post. Here I am trying to explain the question and my proposed solution for the Machine Coding Round.
The question was explained to all the interviewees together and then we had to code for 2 hours and our screens were monitored.
I interviewed with GS in January 2021 for the post of Java/Python Developer. There were 5 rounds in total.
Interview Questions Based on DS & Algo
Q2. https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/ with an explanation of the proof.