Microsoft

If you are wondering how I ended up at Microsoft, well, it’s a long story and if you have got some time, you can read it here:

Journey of a boy from small town to Microsoft – An untold story Part 1

If you like to read about dreams and goals, you might like my journey. I won’t claim it to be inspiring and motivating. Neither would I claim it to be struggling and unique. I will leave it for you to decide. But everyone has a journey and a story to tell. And this my friend, is my journey.

July 15, 2013

Each year when I wake up in the morning and find Facebook reminding me of this very date, I can’t stop myself to feel happy and grateful. I thank god who has graced my life with all the opportunities & happiness and given me an ability to be good at what I do.

4 years it’s been since I joined Microsoft and it feels like it were only yesterday when I wandered the corridors of the humongous campus for the first time. Days bled off into years. I have seen people come. I have seen people leave. Life moves on. Everyone is replaceable.

Continue reading Life of a Microsoft Engineer

Read more

If you haven’t read previous part, it’s right here –  US Diaries Part 1

US is a country of dreams. I could see it shining right through everyone’s eyes. I met one person in taxi who played piano and released his own music album. The other guy Chad writes pilots for TV series and is a good photographer. There was another guy who had done some coding. He knew what python and C++ is. He wanted to work at Amazon or Microsoft. Another guy was a lead manager in an MNC and drove Uber just for fun. They don’t care much about the social status. They do what they love to do.

A really nice country where people greet you and don’t expect anything in return. Everyone you meet is so much open to talk without holding any grudge. Believe me, I had some of the best conversations in just a span of 30 minutes or so.

Redmond = Microsoft

I had heard that Microsoft has humongous office in its headquarters, Redmond. Well, it was true. I was amazed by seeing the area in which it was spread. If I say Redmond is Microsoft, it won’t be wrong. 135 buildings.

Microsoft, US culture

Unlike India where people tend to stay late in offices, Redmond is just the opposite. People come early and leave early. You would hardly find anyone staring at work monitor after 6. People are punctual and highly efficient. Well, I could see where that efficiency comes from. They don’t talk much and confine their conversation to mainly professional stuffs. The hours they put in work are really productive. The culture is so well defined that if you stay late, you would have a feeling that you are working in a zombie village. I, personally liked this culture and I easily embraced it. I had free evenings where I could catch some friends over dinner in classy sounding restaurants.

The world is small

It really is a small world we live in. It is not very unusual that while dining or taking a walk in busy streets, I stumble upon someone who happens to know me. Well, it has happened many times in India. But when you face the same in US, you start thinking that the world is really small. I met an old friend while crossing a street in Redmond, stumbled upon another known face in Seattle while dining with a college friend and had a short chit chat with a guy on shuttle, I used to see in dance classes in Hyderabad.

Seattle diaries

One of the exciting thing about Seattle is incessant rains. Rainy season is something people either love or hate. You will hardly find anyone being neutral on it.

Space Needle

If you’re a Windows user, you must have noticed the tall tower with a big circular head on lock screen. What if I tell you, it is much more beautiful when you look it closely? Well, it is a marvelous piece of human architecture. Standing tall at a height of 184 meters, you can see the whole Seattle view from the top. I could manage to get some pics from my DSLR even though it was freezing cold. My finger nails had turned bluish.

The head of tower

The Seattle view point

Standing on the top of Space Needle and experiencing this view was a treat to eyes.

I always wanted to dine at Skycity Space Needle restaurant. Well, who won’t? After all, dining at such a height has a unique magical feeling. You are sitting and eating exquisite food while the restaurant rotates to show you every angle of the city. Sadly, I couldn’t get a booking. It had 2 weeks waiting time.

Chihuly garden and glass

You can’t miss Chihuly garden and glass if you love art while being in Seattle. This place is mainly famous for its exceptional glass arch, mostly attracted by photographers. I met many photographers there and got a chance to flaunt my skills. Visiting Chihuly wasn’t easy due to shortage of time. The place opens at 11 in the morning and I had return flight on the same day at 5. On the top of that, it was raining like crazy. Well then it’s Seattle. Rains are not supposed to crash the fun. Thanks to Hotel Marriott for making special arrangements.

This picture has its own story. Chihuly Garden and Glass attracts a lot of tourists due to its marvelous, eye popping glass arch. I had a chance to interact with many photographers there and it was fun discussing about various aspects of photography. I wanted to capture whole 25 feet long arch in one frame and for this, I had to wait 30 minutes to capture this due to the huge crowd. Funny to say, due to my corporate ID hanging out of my pocket, few of the tourists asked me if I worked there.

1/50s at f/5.6, 18mm, ISO 1000

North-Bend

Situated at a distance of 30 miles from Redmond, North-Bend is a bliss to eyes. No matter if you are a nature and mountains lover or love long driving on beautiful roads or a shopping spree, North-Bend has got a charm in its own. Built near mountains which are covered with snow in winter, there are many shops where you can enjoy buying stuffs.

The cheese mountain.
I clicked this amazing shot in North Bend, US. Seattle is a beautiful city. Incessant rains, chilly wind, snowy mountain and golden sunshine. A serene heaven for photographers.
It was a sudden plan. The moment I arrived there, the sun was about to set and its dusky golden rays falling on the snow over the top of mountain was giving a perception of molten golden cheese all around.

I am quite fond of keeping a collection of perfumes. When I saw Perfumania shop at the North-Bend, I got a chance to try out all the perfumes I had been researching for years. At the end, I got one of my favorites, one what everyone in US uses, and one which was the choice of the woman who sold me all this.

Heroes of my wardrobe  Recently I have got an urge to keep a collection of perfumes.

From left to right:
Caroline, Armani Gio, Invictus, Playboy, Calvin Klein

Chocolates

A trip to US is not complete until you get chocolates for your loved ones.

To be continued…

In the next part, I would be writing about my trip to Los Angeles and San Diego. Please stay tuned.

Copyright © 2017, Aashish Barnwal,  All rights reserved.
Read more

I am a CSE Graduate from KIIT University. I joined Microsoft straight out of college. Usually, Microsoft doesn’t visit there, but that year I got lucky.

2 written tests + 3 F2F technical interviews + 1 Skype technical interview

 

Written test 1 (Objective), 30 minutes

First written test was conducted by some third party company. It consisted of 15 objective questions from C, Sorting, Data Structures, Big O, compiler and state machine. We were given 30 minutes. Cut off was 12 out of 15 questions. 77 out of 400 students made it.

Written test 2 (Coding), 60 minutes

Three problems to be solved in 60 minutes with no use of compiler. One problem on Linked List, second on heap and third on array. I coded all problems from scratch including main method. I also wrote flexible methods that could work on any kind of inputs (instead of deleting nodes from 4 to 6, it would delete nodes between ‘M’ and ‘N’ ) and handle all corner cases. The result was announced after 20 days. 30 out of 77 made it.

F2F Interview #1, 60 minutes

We were interviewed in groups of 6. Each one of us in a group was given same problem to solve. I couldn’t code the perfect solution in an hour. All I had discussed 6 different ways to solve the problem. I was afraid that I might be rejected in first round. The interview lasted for 60 minutes.

14 out of 30 were selected.

Continue reading My interview experience at Microsoft

Read more

My contribution on Quora on cracking technical interviews:

 

  1. What should I do in the next 6 months to get into a company like Amazon/Google?
  2. How do I go about preparing for interviews on GeeksforGeeks?
  3. What are the top 20 websites for interview preparation?
  4. What are some useful websites for a CS student?
  5. How does one become good at problem solving?
  6. Career Cup or GeeksforGeeks?
  7. Should I do competitive programming or learn GeeksforGeeks, from a placement point of view?
  8. Which is the best book to start learning algorithms?
  9. Which books should I refer for data structures in C?
  10. I suck in competitive programming but I wish to make a mark there. I’m improving my skills by practicing on GeeksforGeeks. Is this the right approach?
  11. Should I learn algorithms and data structures in my vacation or learn any other thing? See details.
  12. How many academic projects should be mentioned in the resume while appearing for big companies like Amazon, MS, Adobe by a fresher?
  13. What are your reviews of Data structures and Algorithm made easy by Narasimha Karumanchi? Should it be used and when?
  14. Is it neccessary to put subjects of interest in our resume, we dont get good job at big tech companies if not added?
  15. Do we have to mention our Data structures skills in our resume in subjects of interest part ?
  16. Does the bloggers get paid when they write article on geeksforgeeks?
  17. How can one contribute to GeeksforGeeks and become one of the moderators?
  18. Studying Algorithms and data structures cover similar topics in c,c++ and Java languages?
  19. What is the difference between dynamic programming and recursion?
  20. What is easiest approach to tackle Dynamic programming problems?
  21. How should I explain dynamic programming to a 4-year-old?

Copyright © 2017, Aashish Barnwal,  All rights reserved.

Read more

My interview with GeeksforGeeks: Geek on the top – Aashish Barnwal

My contribution on GeeksforGeeks over the years:

  1. How to prepare for top MNCs?
  2. Implementing Iterator pattern of a single Linked List
  3. Curiously recurring template pattern (CRTP)
  4. Opaque pointer
  5. Factory design pattern
  6. K Dimensional Tree | Set 1 (Search and Insert)
  7. Design an efficient data structure for given operations
  8. Ternary Search Tree
  9. Print unique rows in a given boolean matrix
  10. Implement LRU Cache
  11. Sort numbers stored on different machines
  12. Find the k most frequent words from a file
  13. Given a sequence of words, print all anagrams together | Set 1
  14. Given a sequence of words, print all anagrams together | Set 2
  15. Generate integer from 1 to 7 with equal probability
  16. Graph and its representations
  17. Median of two sorted arrays of different sizes
  18. Iterative Quick Sort
  19. Magic Square
  20. Comparator function of qsort() in C
  21. Copy elision in C++
  22. Playing with Destructors in C++
  23. Casting operators in C++ | Set 1 (const_cast)
  24. DFA based division
  25. Counting Sort
  26. Space and time efficient Binomial Coefficient
  27. Efficient program to calculate e^x
  28. Greedy Algorithms | Set 2 (Kruskal’s Minimum Spanning Tree Algorithm)
  29. Greedy Algorithms | Set 3 (Huffman Coding) – GeeksforGeeks
  30. Greedy Algorithms | Set 4 (Efficient Huffman Coding for Sorted Input)
  31. Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation)
  32. Dynamic Programming | Set 27 (Maximum sum rectangle in a 2D matrix)
  33. Dynamic Programming | Set 28 (Minimum insertions to form a palindrome)
  34. Dynamic Programming | Set 30 (Dice Throw)
  35. Dynamic Programming | Set 31 (Optimal Strategy for a Game)
  36. Dynamic Programming | Set 34 (Assembly Line Scheduling)
  37. Find minimum elements after considering all possible transformations – GeeksforGeeks
  38. Check whether a given graph is Bipartite or not
  39. Maximum of all subarrays of size k (Added a O(n) method)
  40. Linked complete binary tree & its creation
  41. Print all permutations in sorted (lexicographic) order
  42. Lexicographic rank of a string
  43. Union-Find Algorithm | Set 1 (Detect Cycle in a an Undirected Graph)
  44. Measure one litre using two vessels and infinite water supply
  45. Random number generator in arbitrary probability distribution fashion
  46. Iterative Postorder Traversal | Set 1 (Using Two Stacks)
  47. Iterative Postorder Traversal | Set 2 (Using One Stack)
  48. Boundary Traversal of binary tree
  49. An in-place algorithm for String Transformation
  50. Morris traversal for Preorder
  51. Construct Full Binary Tree from given preorder and postorder traversals
  52. Two nodes of a BST are swapped, correct the BST
  53. Check if each internal node of a BST has exactly one child
  54. Largest subarray with equal number of 0s and 1s
  55. Check if a number is Palindrome
  56. Given a number, find the next smallest palindrome
  57. Construct BST from given preorder traversal | Set 1
  58. Construct BST from given preorder traversal | Set 2
  59. Flattening a Linked List
  60. Find the largest multiple of 3
  61. Count numbers that don’t contain 3
  62. Check divisibility by 7
  63. To find sum of two numbers without using any operator
  64. Find a pair with the given difference
  65. Add two numbers represented by linked lists | Set 2
  66. Longest Palindromic Substring | Set 1
  67. Longest Palindromic Substring | Set 2
  68. Count the number of possible triangles
  69. Find the number of islands
  70. Pascal’s Triangle
  71. Stack | Set 1 (Introduction)
  72. Heap Sort

Copyright © 2017, Aashish Barnwal,  All rights reserved.

Read more
Social media & sharing icons powered by UltimatelySocial
Facebook
LinkedIn
SOCIALICON
Instagram
YouTube