<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Abhinav Srivastava</title>
    <description>The latest articles on DEV Community by Abhinav Srivastava (@abhinavsri360).</description>
    <link>https://dev.to/abhinavsri360</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F239977%2F65c8a595-c8c2-497a-a9d5-6e92aa055553.jpg</url>
      <title>DEV Community: Abhinav Srivastava</title>
      <link>https://dev.to/abhinavsri360</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/abhinavsri360"/>
    <language>en</language>
    <item>
      <title>Interview experience @amzn</title>
      <dc:creator>Abhinav Srivastava</dc:creator>
      <pubDate>Fri, 01 Jul 2022 19:16:27 +0000</pubDate>
      <link>https://dev.to/abhinavsri360/interview-experience-amzn-26bf</link>
      <guid>https://dev.to/abhinavsri360/interview-experience-amzn-26bf</guid>
      <description>&lt;p&gt;&lt;em&gt;The followed interview experience is for SDE 1 profile at Amazon India which happened on-campus.&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;Amazon came to my campus i.e., JIIT, Noida in the month of July.&lt;br&gt;
Round 1 was scheduled on the 8th of August which was conducted on a web portal provided by the company itself. The test duration was of 145 minutes wherein each and every section was timed.&lt;br&gt;
This round had 4 sections:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Debugging(20 minutes): It is expected to fix the bug with minimum changes in the stub code and little description provided and make it work for a given number of test cases.&lt;/li&gt;
&lt;li&gt;Coding(70 minutes): There were 2 questions, first was of easy difficulty which required a hashmap implementation with some tweaks as per the question. The second question was based on the 'sieve of Eratosthenes this was of hard difficulty. It was only expected to code out the implementation function. Both the questions have a bunch of test cases some were hidden, and some were available to figure out the problem.&lt;/li&gt;
&lt;li&gt;Workstyles assessment(20 minutes): This section was majorly based on the leadership principles of Amazon which had loads of situational questions.&lt;/li&gt;
&lt;li&gt;Reasoning ability(35 minutes): This section is comprised of general aptitude questions. Not much to describe.
At the end of the test, a feedback form occurred which was supposed to be submitted to complete the test.&lt;/li&gt;
&lt;/ol&gt;




&lt;blockquote&gt;
&lt;p&gt;I was pretty confident after this test as I did 100% and completed the round in around 60 minutes. Even though I was anxious until the results came out which came out on the 20th of September.&lt;/p&gt;

&lt;p&gt;We were given 2 days time to get ready for the interviews which were supposed to start on the 22nd. I received an invite for my interview which was scheduled for the 23rd.&lt;/p&gt;


&lt;/blockquote&gt;




&lt;p&gt;&lt;strong&gt;Interviews&lt;/strong&gt;:&lt;br&gt;
&lt;strong&gt;Round 1(60 minutes)&lt;/strong&gt;: The interview started with my introduction, wherein I mentioned everything about myself, my internships, all the community work I did, and an overview of my projects. Therefore, I was asked about a point wherein I faced difficulty and how was I able to resolve it, I gave an in-depth explanation of the problem I was facing in my most recent project using the STAR(situation, task, action, result) principles.&lt;br&gt;
After the introductory discussion which lasted for 15 minutes, I received my first question on Data structures and Algorithms, this was supposed to be coded out on a different platform altogether.&lt;br&gt;
The question which I received was to Populate the next right pointers in each node. Thereafter, the experience I had from all the blogs which I read was to &lt;code&gt;discuss the approach first&lt;/code&gt;. Therefore, I started to tell my approach using the level order traversal, and then I eventually moved to a BFS(breadth-first search) approach. Post explaining my approach, I was asked how will I cover the edge case of not to link the nodes present at different levels. I gave an explanation of storing the level number in the queue itself and the interviewer was pretty satisfied post this explanation and I was asked to code my approach.&lt;br&gt;
The link to the problem can be found &lt;a href="https://leetcode.com/problems/populating-next-right-pointers-in-each-node/"&gt;here&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;I coded my approach and it was done. we had about 10 minutes left, and I was given a second question.&lt;br&gt;
The second question was to find the minimum in a rotated sorted array, I already had the solution in my mind, but as the people with experience say, "Tell the brute force approach first.". Therefore, I went ahead and explained the solution with a non-optimised approach. I was told to optimise the same. Quickly I optimised the solution, and the time limit of 60 minutes was up which was a plus I believe.&lt;br&gt;
The link to the problem can be found &lt;a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/"&gt;here&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Therefore, I was asked if I had any questions, I asked two questions which went like this:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Do people at Amazon team up and participate in hackathons?&lt;/li&gt;
&lt;li&gt;Is Amazon planning to bring in web3 at any point? 👀&lt;/li&gt;
&lt;/ol&gt;




&lt;blockquote&gt;
&lt;p&gt;I was pretty anxious after this, wasn't able to sleep completely post this and woke up at 5 the very next day, which turned out to be fruitful as well, guess what? I had the results of Round 1 at 7 AM and my Round 2 was scheduled at 11 AM, I was damn excited and thought to give my 200% no matter what.&lt;/p&gt;


&lt;/blockquote&gt;




&lt;p&gt;&lt;strong&gt;Round 2(60 minutes)&lt;/strong&gt;: I got 2 interviewers this time, both had 10+ years of experience in tech. I was asked to introduce myself, and I mentioned image compression which I did in my recent internship and then I was asked to explain everything about &lt;code&gt;image compression&lt;/code&gt; which I did, I again used the STAR methodology to answer this question and the introductory round lasted for around 25 minutes.&lt;br&gt;
Thereafter, I received the question which was to find the maximum of all distances to the nearest 1 cell from any 0 cells in a binary matrix.&lt;br&gt;
I had never seen the problem, I started off telling approaches, the very first approach which I told was a DFS one(Depth-first search) which I discussed was taking extra space of 2 matrices, and then I was told to reduce it, eventually, it boiled down to O(1) space complexity. Thereafter, I coded down my approach and I was asked about the time and space complexity of the solution discussed.&lt;br&gt;
The link to the problem can be found &lt;a href="https://www.geeksforgeeks.org/find-the-maximum-of-all-distances-to-the-nearest-1-cell-from-any-0-cell-in-a-binary-matrix/"&gt;here&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Post this question, I had 5 minutes left and I was asked if I had any questions.&lt;br&gt;
Here, I had this little thing in my head that if we are able to solve 2 questions in the round the round is considered clear. So, I asked, &lt;code&gt;Is there a second question?&lt;/code&gt;(Pretty bad idea I guess.)&lt;/p&gt;




&lt;p&gt;I thanked both of the interviewers and it ended.&lt;/p&gt;

&lt;p&gt;I was in vain for like 4 days and the results came out on the 28th of September wherein I was offered an internship. ❤️&lt;/p&gt;

&lt;p&gt;A huge shoutout to &lt;code&gt;Tushar Roy(Coding made simple)&lt;/code&gt; he explains dp like God, anyone can equip themselves with dp if they go through his problem-solving videos.&lt;br&gt;
Shoutout to &lt;code&gt;Leetcode&lt;/code&gt; as well, Leetcode is an amazing platform, everything init is surreal. You get to the next level if you consistently do the leetcode grind.&lt;/p&gt;

&lt;p&gt;I do not intend to promote, but, these platforms and people helped me a lot, so maybe it's helpful to you as well. Find the links below. :)&lt;br&gt;
&lt;a href="https://www.youtube.com/channel/UCZLJf_R2sWyUtXSKiKlyvAw&amp;lt;br&amp;gt;%0ALeetcode:%20https://leetcode.com/"&gt;Tushar Roy&lt;/a&gt;&lt;br&gt;
A few links from leetcode that I found helpful:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;&lt;a href="https://leetcode.com/study-plan/"&gt;Study Plan&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://leetcode.com/assessment/"&gt;Assessment&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;That would be all I guess, drop your thoughts as comments if any. I just hope this helped 😄!&lt;br&gt;
Feel free to connect with me on &lt;a href="https://www.linkedin.com/in/abhinavsri360/"&gt;Linkedin&lt;/a&gt; in case of any questions.&lt;/p&gt;

</description>
      <category>interview</category>
      <category>programming</category>
      <category>amazon</category>
    </item>
    <item>
      <title>Test title</title>
      <dc:creator>Abhinav Srivastava</dc:creator>
      <pubDate>Wed, 20 Oct 2021 08:16:02 +0000</pubDate>
      <link>https://dev.to/abhinavsri360/test-title-3pkk</link>
      <guid>https://dev.to/abhinavsri360/test-title-3pkk</guid>
      <description>&lt;p&gt;Hello World&lt;/p&gt;
&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;br&gt;
&lt;tr&gt;
&lt;br&gt;
&lt;td&gt;Hello World&lt;/td&gt;
&lt;br&gt;
&lt;td&gt;Hello World&lt;/td&gt;
&lt;br&gt;
&lt;/tr&gt;
&lt;br&gt;
&lt;tr&gt;
&lt;br&gt;
&lt;td&gt;Hello World&lt;/td&gt;
&lt;br&gt;
&lt;td&gt;Hello World&lt;/td&gt;
&lt;br&gt;
&lt;/tr&gt;
&lt;br&gt;
&lt;/table&gt;&lt;/div&gt;
&lt;ol&gt;
&lt;li&gt;Hello World 1&lt;/li&gt;
&lt;li&gt;Hello World 2
&lt;/li&gt;
&lt;li&gt;Hello World 3&lt;/li&gt;
&lt;/ol&gt;
&lt;h2&gt;Heading&lt;/h2&gt;

</description>
    </item>
    <item>
      <title>Allcodes_codeWar</title>
      <dc:creator>Abhinav Srivastava</dc:creator>
      <pubDate>Thu, 16 Jul 2020 14:06:00 +0000</pubDate>
      <link>https://dev.to/abhinavsri360/allcodescodewar-3en8</link>
      <guid>https://dev.to/abhinavsri360/allcodescodewar-3en8</guid>
      <description>&lt;h1&gt;
  
  
  Allcodes_codeWar
&lt;/h1&gt;

&lt;p&gt;To all the codes I've written before...P.S. I still write them...&lt;/p&gt;

&lt;p&gt;Please take a moment to appreciate and get connected with me for updates on codes for each and every platform. You may open an issue if there is any code you want. I will be happy to code. Do fork and star the repository for updates. 😄&lt;/p&gt;

&lt;p&gt;My GitHub profile: &lt;a href="https://github.com/abhinavsri360"&gt;https://github.com/abhinavsri360&lt;/a&gt;&lt;br&gt;
My repository link: &lt;a href="https://github.com/abhinavsri360/Allcodes_codeWar"&gt;https://github.com/abhinavsri360/Allcodes_codeWar&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;below I describe to what each directory are meant for:&lt;/p&gt;

&lt;h2&gt;
  
  
  JCode
&lt;/h2&gt;

&lt;h3&gt;
  
  
  Must have a JDK installed to run the code. P.S. One of these codes contain the code to photoshop ;)
&lt;/h3&gt;

&lt;p&gt;All Java ⚔️&lt;br&gt;&lt;br&gt;
Compilation: javac-introcs filename.java&lt;br&gt;&lt;br&gt;
Run: java-introcs filename&lt;/p&gt;

&lt;h2&gt;
  
  
  cpac
&lt;/h2&gt;

&lt;p&gt;All C/C++ 😄&lt;br&gt;&lt;br&gt;
Crafted in Sublime Text&lt;/p&gt;

&lt;h2&gt;
  
  
  py
&lt;/h2&gt;

&lt;p&gt;All Python 🐍&lt;br&gt;&lt;br&gt;
Crafted and curated in Pycharm ;)&lt;/p&gt;

&lt;h2&gt;
  
  
  Algorithmic Toolbox
&lt;/h2&gt;

&lt;p&gt;Algorithmic Toolbox course present on Coursera&lt;/p&gt;

&lt;h2&gt;
  
  
  Foobar
&lt;/h2&gt;

&lt;p&gt;Google Foobar&lt;/p&gt;

&lt;h1&gt;
  
  
  Highlights
&lt;/h1&gt;

&lt;h2&gt;
  
  
  Solutions to some popular codes present on:
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Google Foobar&lt;/li&gt;
&lt;li&gt;University of California San Diego{Algorithmic Toolbox} Coursera&lt;/li&gt;
&lt;li&gt;Codechef&lt;/li&gt;
&lt;li&gt;Codeforces&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Thank you so much for visiting this repository It'll be huge if you ⭐ or 🍴 this repository.&lt;br&gt;
❤️ Liked this? ⭐ Want to Contribute? 🍴&lt;/p&gt;

&lt;p&gt;Contribution to this can be a huge step to Open-Source and a great help to many developers/coders out here 😄&lt;/p&gt;

&lt;h4&gt;
  
  
  Coded with ❤️ by &lt;a href="https://github.com/abhinavsri360"&gt;abhinavsri360&lt;/a&gt;
&lt;/h4&gt;

&lt;p&gt;&lt;a href="https://github.com/abhinavsri360"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--TAyKJLRX--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://forthebadge.com/images/badges/cc-0.svg" alt="forthebadge"&gt;&lt;/a&gt;&lt;br&gt;
&lt;a href="https://github.com/abhinavsri360"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--_JRTgHzH--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://forthebadge.com/images/badges/check-it-out.svg" alt="forthebadge"&gt;&lt;/a&gt;&lt;br&gt;
&lt;a href="https://github.com/abhinavsri360"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--Hm23TM4o--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://forthebadge.com/images/badges/no-ragrets.svg" alt="forthebadge"&gt;&lt;/a&gt;&lt;br&gt;
&lt;a href="https://github.com/abhinavsri360"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--2ESwFj-S--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://forthebadge.com/images/badges/made-with-crayons.svg" alt="forthebadge"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>career</category>
      <category>codenewbie</category>
      <category>java</category>
      <category>coding</category>
    </item>
    <item>
      <title>Day 0 of Development</title>
      <dc:creator>Abhinav Srivastava</dc:creator>
      <pubDate>Wed, 15 Jul 2020 09:58:50 +0000</pubDate>
      <link>https://dev.to/abhinavsri360/day-0-of-development-5c5</link>
      <guid>https://dev.to/abhinavsri360/day-0-of-development-5c5</guid>
      <description>&lt;h1&gt;
  
  
  Hello Dev community
&lt;/h1&gt;

&lt;p&gt;Instead of jumping straight away to my introduction, I would, first of all, tell the reason why am I writing this post. It is so that I have been doing too much of development since the &lt;strong&gt;pandemic began&lt;/strong&gt; though we cannot do anything about it other than doing nothing. So, being home I utilized my ample amount of time in development-related stuff for the betterment of open-source or maybe for my own and &lt;em&gt;on my own&lt;/em&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  Hello,
&lt;/h2&gt;

&lt;p&gt;This is Abhinav, I develop mostly web apps and mobile applications on a small scale as of now but will definitely scale out my potential to create something more attractive and elegant. I am a learned MERN stack developer and Flutter enthusiast so far. That's all from my technical side.&lt;/p&gt;

&lt;p&gt;The very big reason why I am posting my introduction is as the title suggests day0 of development. It's been long since that day I have learned in an enormous amount and would like to share my knowledge gained one by one to this community as and when required.&lt;/p&gt;

&lt;p&gt;I would like to thank the Dev community for providing a platform to share my knowledge.&lt;/p&gt;

&lt;p&gt;Last but not the least do get connected to me on Dev and Github link to my profiles are mentioned below. Please do take a moment to appreciate this post and get connected to me such that the knowledge I share can be distributed and be available for any newbie, professional, or anyone from the development community. &lt;em&gt;Kudos to open-source&lt;/em&gt;.&lt;/p&gt;

&lt;p&gt;GitHub: &lt;a href="https://github.com/abhinavsri360"&gt;abhinavsri360&lt;/a&gt;&lt;br&gt;
Dev: &lt;a href="https://dev.to/abhinavsri360"&gt;abhinavsri360&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;{Spoiler alert}&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;Thank you so much for reading this, I'll begin some code talks soon.&lt;/p&gt;
&lt;/blockquote&gt;

</description>
      <category>beginners</category>
      <category>codenewbie</category>
      <category>opensource</category>
      <category>github</category>
    </item>
  </channel>
</rss>
