<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[DemuxAcademy - Medium]]></title>
        <description><![CDATA[Demux Academy is an incubator for underprivileged college students who lack opportunities, accessibility, and visibility in Industrial workforce space. - Medium]]></description>
        <link>https://medium.com/demuxacademy?source=rss----e470ca7a2b6a---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>DemuxAcademy - Medium</title>
            <link>https://medium.com/demuxacademy?source=rss----e470ca7a2b6a---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 10:55:31 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/demuxacademy" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Microsoft Internship experience (On-Campus Internship)]]></title>
            <link>https://medium.com/demuxacademy/microsoft-internship-experience-on-campus-internship-9bfdd21be67c?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/9bfdd21be67c</guid>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Anmol Sahu]]></dc:creator>
            <pubDate>Tue, 27 Aug 2019 16:22:11 GMT</pubDate>
            <atom:updated>2019-08-24T13:51:37.761Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/730/1*VinGV3E1OrBqCxEn02PfXw.jpeg" /></figure><p><strong>Coding round-</strong></p><p>In coding round we had 3 questions to be done in 90 mins. It was on mettl.</p><p>Q1 was parenthesis balancing question.</p><p>Q2 involved sorting along with greedy approach.</p><p>Q3 was also some brute force question..</p><p>I did 2 of them and 3rd question partial.</p><p>Bits/stdc++ library was not working.</p><p><strong>Group fly round-</strong></p><p>We were divided into groups of 6–7 people randomly and asked one question. 45 mins was time limit.</p><p>The question was, given two large linked list which contains decimal numbers each, and you had to either add/subtract them depending on their sign. We had to take care of decimal point and the question involved many corner cases depending on fact that both number can be +ve/-ve.</p><p>We were asked to write code on paper and explain our approach to the mentor of group.</p><p><strong>Technical round 1:</strong></p><p>He gave me a question on tree where root node, a random node, and a distance ‘d’ is given. You have to find all the nodes at distance d from random node.</p><p>I tried giving him some naive solution to which he wanted something better solution. (You can do it by converting that tree to graph and doing dfs)</p><p>The other question was basically count sort which i did by hashing and wrote full code on paper. He was satisfied with my code.</p><p><strong>Technical Round 2:</strong></p><p>The interviewer started by discussing the projects which I did and asked me about the process and everything.</p><p>Later he was asking me to write some client based application to send emails to customers on daily/hourly basis. I was clueless and i said him that I didn’t work on all of these stuff.</p><p>Then he asked me depth of a tree to which I gave recursive solution. He was okay and asked me to write iterative solution. I wrote level order using queue and he satisfied happy with my code.</p><p>This round was again checking code along with project discussion.</p><p><strong>Technical + HR round:</strong></p><p>He asked me if i was satisfied with my cgpa and responsibilities of CR (as i was class representative last year). Then he asked me my favorite data structure, i said hashing, and then he started discussing everything on hashing from hash function to collision and probing techniques..</p><p>Then he asked me why you want to work at Microsoft and later, do you have any questions. I asked him how Azure team ensures that there is no data leakage and how does people of different skills work together in internship..</p><p>That was all.</p><p>Microsoft was focused more on how good we are able to explain the code, and how much efficient and clean code we wrote in interviews and group fly rounds.</p><p>I would like to thank everyone at <a href="https://medium.com/u/fe36d60e0d3d">Team Demux</a>. ❤ Considering me as the person who was average at coding and wanted to enjoy in summer holidays and do other activities, Demux academy helped me a lot by making me spend 3 hours in front of laptop and improving my patience and thinking skills.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9bfdd21be67c" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/microsoft-internship-experience-on-campus-internship-9bfdd21be67c">Microsoft Internship experience (On-Campus Internship)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Amazon SDE Intern (On-campus interview experience)]]></title>
            <link>https://medium.com/demuxacademy/amazon-sde-intern-on-campus-interview-experience-af16e52058ef?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/af16e52058ef</guid>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[internships]]></category>
            <category><![CDATA[amazon-interview]]></category>
            <category><![CDATA[nitk]]></category>
            <category><![CDATA[demux-academy]]></category>
            <dc:creator><![CDATA[Aditya J Karia]]></dc:creator>
            <pubDate>Fri, 23 Aug 2019 20:30:38 GMT</pubDate>
            <atom:updated>2019-08-23T19:25:13.559Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*xwMKIep4AUCj0mUlIL8f4Q.png" /></figure><h3><strong>Introduction</strong></h3><blockquote>Introducing myself, I am a third year B.Tech student pursuing my major in Information Technology at National Institute of Technology (NITK), Surathkal.</blockquote><p>Like many prominent colleges across the country, we had companies visiting our campus to pick students for FTE and internship positions at the beginning of the semester and I got offered an SDE intern position at Amazon during the same. Here, I will be sharing my experience through the course of the internship interviews season and also about how Demux helped me achieve this.</p><p>Coming to the structure of the selection process, we had just 2 rounds for Interns, the first being an online test, followed by an interview.</p><h3><strong>Online Round</strong></h3><p>The online round was conducted on the “AMCAT Aspiring minds” platform and was scheduled for a total duration of a maximum of 90 minutes. It was split into three sections, namely:</p><ol><li><strong>Debugging:</strong></li></ol><ul><li>Given small snippets of code or functions (in any language of my preference, I had to find the bugs/logical errors/syntax errors in the code that prevented it from returning the expected output. Input and expected output were provided.)</li><li>The questions were not too difficult and having some practice of reading code accurately and quickly helps.</li></ul><p><strong>2. Aptitude Questions:</strong></p><ul><li>Here, the questions asked were mainly based on probability, mathematical puzzles, age-related problems, work and time problems etc.</li><li>They were challenging and had a tight time bound, so being quick was essential.</li><li>A tip for such questions would be to not waste too much time on a single difficult question, but instead try to solve more questions and come back to the difficult ones if you have time left.</li></ul><p><strong>3. Coding Questions</strong></p><ul><li>We had 50 minutes to solve two questions in a language of our preference (I picked C++)</li><li>The questions were different for different candidates and from the word of mouth, they were mainly based on concepts of DFS/BFS, Binary Search, Job Scheduling, HashMaps etc.</li><li>I got one question on finding an element in a 2D array when the columns were sorted but the rows were not (there was a long story behind the question which was largely to make figuring the solution difficult)</li><li>Another question was based on having a 2D matrix where a person wants to reach a point A=(x,y) from B=(0,0), but had obstacles placed in the matrix. We had to return if it is possible to reach the point A from B avoiding all obstacles and if yes, return the minimum possible length of the path. It was fairly simple using modified BFS/DFS once I trimmed out the unnecessary details in the story revolving around the question.</li></ul><p>The online round was not very difficult, but had a tight time constraint for all sections, thus we had to be quick to solve anything.</p><h3>Interview</h3><p>The shortlist came out around 2 days post the online test, and we were called for interviews. Before that, one of the company representatives interacted with us, and tried to clear all doubts we had about the company beforehand. He also shared some very interesting experiences of his, but that of-course, is beyond the intention of this article.</p><figure><img alt="Interview Representation" src="https://cdn-images-1.medium.com/max/1024/1*XrzryFRyynnAygR3BvNXJA.jpeg" /></figure><p>There was a long wait before the interviews commenced. My interviewer first asked me how I was doing and asked me to talk a bit about myself. He was very sweet and the questions initially were mostly to make me comfortable. I talked about my background, about what domains I have worked on, my experience with corporates, projects, hobbies, etc. I felt I had made a strong first impression, and he confirmed that with a positive comment.</p><p>Then, in the technical section, these were the questions asked:</p><ul><li><strong>Theoretical:</strong></li></ul><ol><li>Which are the common data structures I have used? Explain hash-maps in detail.</li><li>Explain threads, processes, deadlock, semaphores and mutex.</li><li>Explain the different graph traversals and the differences between them</li><li>Some questions on basic OOPS concepts</li></ol><ul><li><strong>Practical:</strong></li></ul><ol><li>Write down the C++ code for any tree traversal in paper</li><li>Basic C++ syntax and implementation questions</li><li>Design an OOPS based system for making a web app to display details about the whole interview process (He was expecting an in-detail format drawn on paper with UML diagrams)</li><li>Convert the above OOPS System to a DBMS database. How would you modify pointers to fit a RDBMS?</li><li>Find the (n-k)’th node in a Binary Search tree, given k&lt;=n</li></ol><p>I had answered all questions well and without many hints and was happy with way the interview ran its course.</p><blockquote>One thing I noticed was that the interviewer was trying to extract some keywords (mostly, technical terms) from me, and when he did, he was happy that I knew my theory well and could solve problems on it.</blockquote><p>The results were announce after around 5 hours on their Telegram channel, and I was so glad to see my name there :)</p><p>To wrap up, it was a great selection process experience with Amazon, and the representatives were very nice. My interviewer was very supportive and spent almost an hour interviewing me.</p><p>For any aspiring candidates reading this, having a strong foundation about DSA, OS and OOPS (what is taught in our curriculum is mostly enough) and having continuous practice in coding in them (without using smart IDEs) should suffice. It helps to practice coding on paper beforehand.</p><p>They also try to look for genuineness in your work, the projects you have done and specially the ones mentioned on your resume. Try to be honest with the interviewer and stay positive. (I went into my interviewer’s room with the biggest smile ever and that set the atmosphere well!)</p><h3>The Demux experience</h3><figure><img alt="Demux Logo" src="https://cdn-images-1.medium.com/max/425/1*KZ92xsqN-SFdSo40ATG8_g.png" /></figure><p>Talking about Demux, it was an extremely enriching experience learning from the brilliant minds behind this initiative, as they spent a lot of time trying to teach us well. Also they were always available and ready to help</p><blockquote>I remember having a resume review with Varun sir at <strong>3:30 AM</strong> one day because I needed some help urgently, and he was most happy to review and suggest!</blockquote><p>For me, Demux helped me revise some basic concepts that I had forgotten from the courses in college, and also get practice solving some challenging questions on these concepts. Plus, we often had coding contests among the student members.</p><p>I sincerely thank the Demux team for all the efforts they have taken, and wish them the best for the future!</p><p><em>(For more information on Demux, click </em><a href="https://demux.in/"><em>here</em></a><em>)</em></p><h3>Some general tips for anyone appearing for internship interviews:</h3><ol><li>Initial rejections may hurt, but don’t give up.</li><li>Luck plays a big role, so just hope it plays in your favour too!</li><li>Some of the online round platforms are not very convenient to use. Practice well enough to debug code without being given compilation logs or test cases. Many don’t display anything other than whether your submission is “successful” or not.</li><li>It’s more about the number of test cases you pass in a question, than the quality/efficiency/complexity of code you write (in online rounds)</li><li>Practice pen &amp; paper coding during the summer. It’s not the same as coding in an IDE!</li><li>Treat the interviews like technical discussions with your seniors, not as a test.</li><li>Take adequate rest and food, stay healthy during the interview season.</li><li>Learn from your mistakes in previous tests, and stay focused.</li></ol><p>Good Luck!</p><blockquote><strong>Coming back to the internship, I’m still waiting for my official offer letter, but I can’t wait to start the internship and see what’s in store!</strong></blockquote><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=af16e52058ef" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/amazon-sde-intern-on-campus-interview-experience-af16e52058ef">Amazon SDE Intern (On-campus interview experience)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[My first Interview Experience with Media.net]]></title>
            <link>https://medium.com/demuxacademy/my-first-interview-experience-with-media-net-7d50399fddbc?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/7d50399fddbc</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[demux-academy]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[medianet]]></category>
            <category><![CDATA[internships]]></category>
            <dc:creator><![CDATA[Arshdeep Singh]]></dc:creator>
            <pubDate>Fri, 23 Aug 2019 19:26:39 GMT</pubDate>
            <atom:updated>2019-08-20T20:07:20.133Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/700/1*litPOO2cJGB0F_2Wjl86FQ.jpeg" /></figure><p>Today I am going to share my first Interview Experience with Media.net for Summer Internship. Media.net visited our campus in the first week of August, 2019 for Internship and Placements. There were total four rounds, two coding tests of 1.5 hours each, 1 Technical Interview of 1 hour and 1 HR+Technical of 50 minutes. A total of more than 150 prefinal year students registered for Media.net and finally 6 got selected.</p><h3>Round 1 (Coding Round, 1.5 hours):</h3><p><strong>Question-1: </strong><br>N strings of varying lengths are given. Each character used in the strings has some value. The value of a string is the sum of all characters used in that string. Given a length L, we have to use a subset of the given strings so that the total length of the strings used is L and the sum of values of all strings is maximised.<br>Hint: Knapsack</p><p><strong>Question-2:<br></strong>There are N ships, each with some seats S[i] (1≤i≤N). There are M passengers who want to buy the tickets for ships standing in a queue. The price of the ticket for a particular ship is always equal to the vacant seats in the ship. We have to find the maximum and minimum costs possible if all M passengers buy tickets.<br>Hint: Sorting</p><p><strong>Question-3:<br></strong>There are N nodes in a graph. They are connected using directed edges. For each vertex i (1≤i≤N), we have to determine whether there exists a path such that starting from vertex i, we reach vertex i again.<br>Hint: Topological Sort, O(N)</p><h3>Round 2 (Coding Round, 1.5 hours):</h3><p><strong>Question-1: </strong><br>Given a 2D array of size N*M, we have to return the maximum area from the array such that the elements in that area increase as we go right in the row and down the column.<br>Hint: DP, Stacks, O(max(M,N)²)</p><p><strong>Question-2:<br></strong>There is a dictionary which contains some words. We are given a start word A and an end word B, both belonging to the dictionary. We are to determine the minimum number of moves so that we reach B starting from A, provided the intermediate words are all in the dictionary. Allowed operations are insertion of a character, deletion of a character, modification of a character.<br>Hint: BFS</p><p><strong>Question-3:<br></strong>A vehicle has to reach x = D starting from x = 0. The vehicle can store infinite amount of petrol. The vehicle has P_initial units of petrol initially. 1 unit distance can be travelled using 1 unit of petrol in 1 min, or by dragging the vehicle in 5 min. There are N petrol pumps in between the source and destination. The amount of petrol at station i is P[i] (1≤i≤N). Filling the vehicle’s petrol tank takes K mins. Find the minimum time in which we can reach B.<br>Hint: 2D DP</p><p>After the coding rounds, 20 students were selected for Interviews.</p><h3>Round 3 (Technical Interview, 1 hour):</h3><p>The first question that interviewer asked me was “Tell me about yourself?”. Then he took a look at my resume and asked a question related to a project. Then he gave me a puzzle.</p><p><strong>Puzzle:<br>You are in a 100 floors building. There is a special floor below which if we drop an egg, it will not break otherwise it will break. You have 2 eggs. Answer the minimum number of throws to get the value of required floor.</strong></p><p><strong>Question:<br>Given n floors and k eggs, find the minimum number of steps to find the floor below which if egg is dropped it will not break otherwise it will break.</strong></p><p>Initially I didn’t knew the approach and progressively reached the solution and optimized it after which I was told to write the code on paper.<br>Here is the solution: <br> <a href="https://www.geeksforgeeks.org/egg-dropping-puzzle-dp-11/">https://www.geeksforgeeks.org/egg-dropping-puzzle-dp-11/</a></p><p>After this I was asked to explain my solutions for the coding round tests.</p><h3>Round 4 (HR + Technical Interview, 50 minutes):</h3><p>The interview started with the interviewer asking me some HR questions such as “Tell me about yourself?” and “Tell me about a problem that you faced and how you fixed it?”. After this I was asked a question related to my previous Work Experience. Then the interviewer went into details regarding a project and asked me questions such as “What is the difference between normal CNNs, 3-D CNNs and FNNs?” and other Deep Learning related questions.</p><p>Then, I was asked two question:<br><strong>Question 1:<br></strong>A <em>rank</em> array is made from an array <em>arr</em> which is a permutation of 1 to N in such a way that <em>rank[i]</em> denotes the count of numbers smaller than <em>arr[i] </em>in the left the array from position <em>i. You are given the rank array and you have to find the original array from it.</em></p><p><strong>Question 2:<br></strong>You are given a big array of size 100 gb and the main memory in your computer is 4 gb and the page size is 4 mb. You have to sort the array. How will you do it?</p><p>After answering both of these questions, I was asked if I had any questions.</p><p>And that was it! After some time, I was congratulated by the HR that I have been hired as a summer intern in Media.net. A total of 6 students from our batch got selected for internship at Media.net.</p><p>I would like to thanks Team Demux, my friends and Family for their guidance and support throughout the prepration and internship process.</p><p>If you have any doubts, you can ask me in the comments.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7d50399fddbc" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/my-first-interview-experience-with-media-net-7d50399fddbc">My first Interview Experience with Media.net</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Flipkart Interview Experience (For 2020 Summer Intern On-Campus)]]></title>
            <link>https://medium.com/demuxacademy/flipkart-interview-experience-for-2020-summer-intern-on-campus-e41f610ec3bb?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/e41f610ec3bb</guid>
            <category><![CDATA[flipkart]]></category>
            <category><![CDATA[demux-academy]]></category>
            <category><![CDATA[interview]]></category>
            <dc:creator><![CDATA[Rituraj Roy]]></dc:creator>
            <pubDate>Tue, 20 Aug 2019 08:54:08 GMT</pubDate>
            <atom:updated>2019-08-14T12:23:27.782Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*SggGD9OSy7xjBciSgyGjwg.png" /></figure><p><strong>Round 1-Coding Round</strong></p><p>Three questions were asked in the coding round and was conducted on hackerrank.</p><p><strong>Question 1-</strong></p><p>The first question was very simple based on permutations and combinations. We had to tell the number of groups of three people in which we can divide m men and n women.</p><p><strong>Question 2</strong>-</p><p>The second question tested concepts related to string handling. We had to find the maximum substring starting with a suffix and ending with a prefix,the string prefix and suffix were given as inputs.</p><p><strong>Question 3-</strong></p><p>The third question was based on the application of Disjoint Set Union(DSU) on graphs. We had to divide the nodes into groups depending on the edges.</p><p>I was able to solve the first two questions completely and the last one partially.</p><p><strong>Round 2-Technical Interview 1</strong></p><p>A total of three questions all based on DSA were asked.</p><p><strong>Question 1-</strong></p><p>The first question was to merge overlapping intervals which can be solved by applying sorting on a vector of pairs.</p><p><strong>Question 2-</strong></p><p>The second question was the snake ladder problem which can be solved by the application of breadth first search(bfs).</p><p><strong>Question 3-</strong></p><p>The last question was based on sorting and hashing. We were given n inputs each input consisted of name,contact no and email address we had to link all the inputs with same email id,same name and same contact no together.</p><p><strong>Round 3-Technical Interview 2</strong></p><p>Even in this round three questions based on DSA were asked.</p><p>Question 1-Given n ropes,the cost of merging two ropes is their lengths,we had to merge all the ropes in such a way that the cost was minimum.My initial solution was based on sorting but the time complexity was O(n²logn).The interview asked me to optimize the code which i did and the time complexity reduced to O(nlogn).</p><p><strong>Question 2-</strong></p><p>The second question was based on graphs.Given n pairs of political parties where each party in a pair hates the other is it possible to divide all the parties into two groups such that no two parties in the same group hate each other.I solved this question by two methods-coloring a bipartite graph and Disjoint Set Union(DSU) on graphs.</p><p><strong>Question 3-</strong></p><p>The last question was again based on graphs in which we were given a starting combination and we had to reach a target combination in minimum number of steps.I solved this question with bfs and the interviewer was satisfied.</p><p>The interviewers gave hints while i was solving the problems and helped me come up with the best solution in each case.Overall it was a great experience where i learnt to use the information and hints given by the interviewer to improve my solution.</p><p><strong>Demux Academy Experience-</strong></p><p>Demux Bootcamp played a pivotal role in helping me prepare for the internships and ultimately bagging an internship at flipkart. The mentors were dedicated and helped each and every student to reach their maximum potential. The mentors were too kind to guide and teach us for free for 4–5 hours each day despite having full time jobs.They kept sessions interactive in which every student can put forward their solution which improved our thinking capacity. DPPs were provided regularly which improved the concepts we learnt in class. In my opinion every aspirant looking to get an internship should attend the bootcamp.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=e41f610ec3bb" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/flipkart-interview-experience-for-2020-summer-intern-on-campus-e41f610ec3bb">Flipkart Interview Experience (For 2020 Summer Intern On-Campus)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Flipkart SDE Intern Interview Experience]]></title>
            <link>https://medium.com/demuxacademy/flipkart-sde-intern-interview-experience-70285c1f02d6?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/70285c1f02d6</guid>
            <category><![CDATA[competitive-programming]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[flipkart]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[interview-preparation]]></category>
            <dc:creator><![CDATA[Kartik Bhatia]]></dc:creator>
            <pubDate>Thu, 15 Aug 2019 17:30:12 GMT</pubDate>
            <atom:updated>2019-08-15T15:11:19.741Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*uWLbNGJBiyzSrxPCchdrTw.png" /></figure><h3>Round 1: Coding Test</h3><p>3 questions, 1.5 hours on Hackerrank</p><p>Q1. Basic combinatorics problem. The question was something on the lines of: out of n men and m women, teams of 3 need to be selected. The answer was the number of ways to form teams such that each group had at least 1 woman. Expected time to solve: 2–5 mins.</p><p>Q2. Implementation problem on strings. 3 strings were given: text, prefix and suffix. Print out the lexicographically smallest string with the maximum length starting with the longest substring in the prefix string and ending with the longest substring in the suffix string. Knowledge of STL and string functions like substr and find needed. Expected time to solve: 30–45 mins due to the question statement being confusing.</p><p>Q3. Good implementation problem on DSU. Pairs of people are given united by some candy. Suppose a and b like candy 1, b and c like candy 1, e and f like candy 1 and j and k like candy 2. 3 groups are formed, on the basis of candy and overlapping. Group 1: a,b,c for candy 1. Group 2: e,f for candy 1. Group 3: j,k for candy 2. Print out the maximum product of any two elements in the largest group. The largest group, in this case, is Group 1 so the answer would be maximum of (axb, bxc, axc) or in other words, the product of the two maximum elements of that group. Expected time to solve: 30–45 minutes.</p><p>The cutoff to clear this round was about 2.5 problems and 24 people were shortlisted for interviews.</p><h3>Round 2: Technical Interview 1 (DS/PS Round)</h3><p>Candidates were called in order of their ranking in the coding round. Relatively easier questions were asked to the first batch.</p><p>After a basic introduction, the interviewer moved straight to the questions.</p><p>Q1. Merge overlapping intervals. I don’t think anything needs to be said about this very standard problem. I was asked to write the pseudo code and mention the space and time complexities.</p><p>Q2. Snakes &amp; Ladders. Again, standard BFS problem. Given a nxn grid with some snakes and ladders, print out the minimum number of dice rolls required to reach the finish. Pseudo code required with space and time complexities.</p><p>I was one of the few who were only asked two problems in this round. Most of the people were asked three.</p><p>8 students were shortlisted for the final interview.</p><h3>Round 3: Technical Interview 2 (DS/PS Round)</h3><p>Turned out to be the most challenging and interesting round out of all the interviews I had given.</p><p>Q1. Given a binary tree, remove all the nodes which have only 1 child, so that only leaf nodes and ‘full’ nodes remain. Gave a clean, recursive solution with pseudo code in under 15 mins.</p><p>Q2. Consider an old Nokia style T9 keyboard, with button 2 having abc, 3 having def and so on. Implement a predictive typing feature where the user presses a sequence of digits and the system should give a list of all possible words defined in a given dictionary of using that sequence. Example, let the user sequence be 2255. The system should output all words such as ball, call etc. (Each digits contributes to a character, i.e don’t worry about 2 quick presses giving the second character).</p><p>The dictionary had already been defined and consider a function is available which gives out whether a string is a present in the dictionary or not. The question was intentionally left open-ended as to make the candidate think of all possible solutions. Initially I thought of checking all possible strings which could be formed from the sequence. Would’ve been an O(3ⁿ) solution where n was the length of the sequence.</p><p>The interviewer then helped me through to think of it as a trie. Communication was the key as I wasn’t very experienced with tries. But I still managed to collect his hints and worked through the rest of the solution by myself and defined a preprocessing and search function. He was really satisfied with the approach and went to the next problem. Wrote the pseudo code for the preprocessing function.</p><p>Q3. Given an array of digits with all digits repeating twice except one digit, print that digit. Again, standard xor problem. More challenging was the follow-up question where all digits repeated thrice. Gave him a bitset approach and he was again satisfied.</p><p>Finally, results were announced after 30 minutes and I was one of the 6 people selected.</p><p>Demux Bootcamp really helped me brush up all DSA concepts and fill in all the conceptual doubts. Regular practice and belief even after being rejected from 2 interviews was the deciding factor I believe. I hope this helps all the future candidates!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=70285c1f02d6" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/flipkart-sde-intern-interview-experience-70285c1f02d6">Flipkart SDE Intern Interview Experience</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Oracle Interview Experience (2020 Summer Internship)]]></title>
            <link>https://medium.com/demuxacademy/oracle-interview-experience-2020-summer-internship-b544ba784a1b?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/b544ba784a1b</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[internships]]></category>
            <category><![CDATA[demux-academy]]></category>
            <dc:creator><![CDATA[Akshit Sharma]]></dc:creator>
            <pubDate>Thu, 15 Aug 2019 16:17:54 GMT</pubDate>
            <atom:updated>2019-08-15T14:44:56.145Z</atom:updated>
            <content:encoded><![CDATA[<h3>Oracle Interview Experience (2020 Summer Internship on -Campus)</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/698/1*nb1zLOKh6tFMZruQVEsVog.jpeg" /></figure><p>I was selected as a software engineering intern at Oracle India from BITS-PILANI ,Goa (through on-campus recruitment process).I had appeared for many technical interviews before in companies like D.E. Shaw and Flipkart.But I finally got selected for Oracle India, Server Technology group, Bangalore.</p><h3><strong>First Round : Online Round</strong></h3><p>The online test was same for both full time hires and summer interns in our college . It had a lot of logical reasoning, math problems and puzzles.The coding section had MCQs on java implementation of tries - how to search in a trie , insertion in a trie and deletion in a trie and what are the ways you can impement all these functions (multiple correct answers). It had questions on mirroring of height balanced BSTs when they are represented as arrays and we had to comment on their inorder traversal. There were problems on Operating Systems(which I had no idea about) , DBMS(simple 2PL protocols) and OOP(some basic polymorphism based output problems). The test was of 2 hours.</p><h3><strong>Second Round : Technical Interview</strong></h3><p>The interviewer started off slow by asking my favourite topic which was DSA. He started with how would I implement a data structure that can act as both queue and stack. I said a deque or a bidirectional linked list could be used with a head and a tail. He wanted a solution more basic than this and he didn’t care about the complexity, to which I suggested array shifting. He asked me to find the height of a tree inductively. I proved it to log(n) for height balanced BST, and worst case O(n) for a skew BST using induction. height(n)=max(height(n-&gt;left), height(n-&gt;right)) + 1 .</p><p>He then asked me when would I prefer C and when would I prefer C++. I said that since we can’t implement OOP principles in C so we would go for C++ to represent natural entities . And we would prefer C when we have to write a simple descriptive procedure. I told him that C is more closer to hardware to which he told me that both of them are same in terms of abstractness and closeness to hardware.Finally I think he was more or less satisfied by the arguments.</p><p>The third problem was on DBMS on locking protocols and which protocol has which advantage and which would I prefer. I started off with defining locks (S and X lock) and stated problems like dirty read, deadlock and cascading roll-backs. I started with simple 2 phase locking protocols and then went on rigorous 2-PL, strict 2-PL and conservative 2-PL and how each of them went on to correct problems like deadlock , serializability and recoverability. And the problem of cascading roll-backs which can be solved by graph based protocols.Even he asked the negative points about them like extra work of unlocking which has to be done. He also asked about indexing for which I suggested B trees or hashmaps.</p><p>He later asked me about what should be preferred as a key value to which I luckily had an answer as I was asked the same question in in D.E. Shaw second round .I said that since we use range based searching most of the time so we should use a B+ tree , as these k-ary trees support O(height) searching. He later asked a few OOP concepts like what all you know about encapsulation, abstraction and run-time polymorphism.</p><h3><strong>Third Round : Technical Round 2</strong></h3><p>She asked me about my projects.First about my bootstrap project and whether I want to do an M.S. or not. Then she asked me to design a text editor which supports insertion, deletion, undo and redo. We do it with 2 stacks storing undo and redo respectively. The value in the stack should hold the value and the iterator to the last undo or redo. We have to think through all corner cases like insertion in middle of text ,deletion at random locations , then undo ,and lets say then redo.</p><p>Then she asked me a puzzle: burning a thread needs 60 minutes and how would you use the infinite supply of these threads to check for 45 minutes , if the thread burns non-uniformly across its length and we are not allowed to fold or cut the thread at any position. We burn one thread from both ends and another thread from one end. First thread burns in 30 minutes and at this very moment we burn the other end of the already burning thread and it takes 15 minutes more.</p><p>She at last asked me about my Deep learning Research project which I completely explained it to her.</p><h3><strong>Fourth Round : HR round</strong></h3><p>It was as late as 9:00pm (12+ hours of grinding) as the full time hirings was also done concurrently. We were all asked to sit together in a row in a lecture theatre and asked if we had any doubts on the position offered. They later shortlisted students on GPA and chose only 8 out of 14 who attended HR round.</p><p>Overall I think it was <a href="https://medium.com/u/fe36d60e0d3d">Team Demux</a> which transformed me into someone who can fight all odds like, gender preference, extreme pressure of failure and what not.They nurtured us throughout our summer holidays and every topic taught was covered inside out.The project which we completed as part of Demux was a major positive point in my resume.</p><p>So I would suggest anyone who wants to get an IT job to go for DEMUX as early as you can and get the best out of it.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b544ba784a1b" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/oracle-interview-experience-2020-summer-internship-b544ba784a1b">Oracle Interview Experience (2020 Summer Internship)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Adobe Interview Experience(For 2020 Summer Intern On-Campus)]]></title>
            <link>https://medium.com/demuxacademy/adobe-interview-experience-for-2020-summer-intern-on-campus-1f62ef5d9804?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/1f62ef5d9804</guid>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[demux]]></category>
            <category><![CDATA[intern]]></category>
            <dc:creator><![CDATA[Pawan Gupta]]></dc:creator>
            <pubDate>Thu, 15 Aug 2019 12:14:44 GMT</pubDate>
            <atom:updated>2019-08-15T09:39:46.290Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*rutYEVseW8fcEs-VrD6oFg.png" /></figure><p><strong>Interview</strong> <strong>Experience</strong></p><p><em>Round</em> <em>1</em>:<em>Coding</em> <em>Round</em></p><p>The coding round was conducted on Hackerrank. There were 18 questions in total. 10 questions were on aptitude and probability(medium level). 5 questions based on matrices concepts which I have studied in my +2(like eigen values,eigen vectors,idempotant matrix,and some properties of matrix).16th question was based on sorting algorithm, we have to write its pseudo code only(easy level).17th question was a hard problem from leetcode, follow the link for the ques(<a href="https://leetcode.com/problems/cherry-pickup/">https://leetcode.com/problems/cherry-pickup/</a>). In the last question we were asked to write a start-up,and about a current ongoing famous startup(any) which is going to fail in future.</p><p><em>Round</em> <em>2</em>: <em>Telephonic</em> <em>Interview</em></p><p>The interview lasts for about 1:15 hour. I was first asked about basic c++ concepts-: copy constructor,friend function,friend class and their uses,static function and static variables. Then the interviewer checked my knowledge on pointers,he asked me various questions on pointers like what is the significance of const keyword in different position while declaring a pointer(Tip: do study pointers in deep because they are not very difficult to study and are very beneficial for interviews).Then he asked me about various OOPS concepts. After that he asked me that how many sorting algorithm do i know ,i listed 10,then he asked me to explain my favorite sorting algorithm , i explained him quicksort , then he asked me to reduce its worst time complexity(which is O(n2)), then i told him randomized quicksort and how it works. Next he asked me about stack data structure, its properties,different types of operation of stack,application of stack. Then he asked me to explain both bfs and dfs. after that he asked me two coding question on strings Ques1. you have to find first non repeating character in a string(<a href="https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/">https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/</a>)(the string does not contain alphabets only, it may contain japanese ,chinese and various other characters so it can be very long). First i have told a map based solution then he asked me to reduced space complexity to O(1), then i told him bit-manipulation approach(works only for alphabets). Ques2. Reverse words in a given string(<a href="https://www.geeksforgeeks.org/reverse-words-in-a-given-string/">https://www.geeksforgeeks.org/reverse-words-in-a-given-string/</a>). i have told a O(n) time and O(1) space solution. In the end he asked me to explain my project for 5–10 minutes,then he asked me some questions on that.</p><p>Basically when you are giving interview on phone , you have to be very clear on your voice as well as on your words, the interviewer main concern was how i am explaining the things and how i am approching a question.Overall it was a great experience.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1f62ef5d9804" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/adobe-interview-experience-for-2020-summer-intern-on-campus-1f62ef5d9804">Adobe Interview Experience(For 2020 Summer Intern On-Campus)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Uber Interview Experience (For 2020 Summer Intern On-Campus) and Journey with Demux Academy]]></title>
            <link>https://medium.com/demuxacademy/uber-interview-experience-for-2020-summer-intern-on-campus-and-journey-with-demux-acadeny-c6491813fb8e?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/c6491813fb8e</guid>
            <category><![CDATA[uber]]></category>
            <category><![CDATA[demux]]></category>
            <category><![CDATA[my-experience]]></category>
            <category><![CDATA[technical-interview]]></category>
            <dc:creator><![CDATA[Shruti Aggarwal]]></dc:creator>
            <pubDate>Sat, 10 Aug 2019 06:31:42 GMT</pubDate>
            <atom:updated>2019-08-09T21:48:09.692Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*mvyWq8N8mhLojJi5.png" /></figure><p><em>3rd-year B.Tech Information Technology student at Delhi Technological University.</em></p><h3>My Uber Interview Experience:</h3><p>I recently got selected as an SDE Intern at Uber, so here I am sharing my interview experience with y’all.</p><p>This was my first interview with a company and I was a bit nervous but the experience turned out to be awesome. I was expecting something like a very difficult interview but it ended up being like a discussion with the interviewers.</p><p>I had a total of three interview rounds, and all ended up being technical, I was very glad. :)</p><p><em>TECHNICAL INTERVIEW 1:</em></p><p>The first interviewer asked me about finding the nth root of a real positive number and asked me to code it.</p><p>I explained a binary search based O((log n)²) solution and the interviewer was also convinced with it. He asked me to code, which I did easily and then was immediately called for my next interview.</p><p><em>TECHNICAL INTERVIEW 2:</em></p><p>The second interviewer asked me the following question:-</p><p>If there are n people and they want to go to a haunted place in a group, and a person will go with at least L more people and atmost H more people (for every person L, H are given), find the maximum size of the group that can go to the haunted place.</p><p>He also gave me a test case and asked me to find the answer for it, to make sure that I was able to understand the question correctly. Moving forward with the example really helped me to build my approach and I gave him an O(n²) solution, which I further optimized to O(n) using a hashtable. He seemed to be satisfied with my approach. In fact, while solving the question I always made sure if I was going in the right direction or not by asking the interview whenever needed.</p><p><em>TECHNICAL INTERVIEW 3:</em></p><p>For some of my fellow interviewees, the last round was HR round, though it was not the case with me. It actually depended on the interviewer — what he/she was more interested in asking.</p><p>So for me, it was totally based on data structures. The interviewer asked me about various data structures and discussed the insert, delete and lookup time complexities for each. He asked me about the implementation of hashtables in detail. He also asked me about various possibilities to create a min function for the hashtable and then gave me the condition to create the function in such a way that I can only take a hit on the insert function. I came up with several approaches and ended up using a linked list along with the data structure used to implement the hashtable like an array. The interviewer seemed to be happy with my approaches/thinking process as I could interpret from his response and the interview ended on a very positive note. He was a great interviewer, I must say.</p><p>I was extremely happy after the overall interview experience. It was an amazing day.</p><p>On my way back, when the results got announced, a total of 5 students were selected and I was extremely happy to be one of them. I am really excited and looking forward to working with my dream company.</p><p><em>But all this could not have been possible without the help of Demux Academy.</em></p><h3>My Journey with Demux Academy:</h3><p>I am grateful to all the mentors at Demux for taking out time to take regular online live sessions on data structures and algorithms despite their own jobs and hectic schedules to help students like me land our dream companies, and all that without even a penny (absolutely free of cost).</p><p>The sessions by them had helped me a lot to clarify all my concepts in DSA and ultimately be able to clear my coding tests and interviews.</p><p>I would say, Demux is the best place to prepare for technical interviews.</p><p>Thank you for reading my Uber interview experience and journey with Demux.</p><p>I hope it helps you!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c6491813fb8e" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/uber-interview-experience-for-2020-summer-intern-on-campus-and-journey-with-demux-acadeny-c6491813fb8e">Uber Interview Experience (For 2020 Summer Intern On-Campus) and Journey with Demux Academy</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Uber Interview Experience (For 2020 Summer Intern On-Campus)]]></title>
            <link>https://medium.com/demuxacademy/uber-interview-experience-for-2020-summer-intern-on-campus-821dbbfa4a36?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/821dbbfa4a36</guid>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[demux]]></category>
            <category><![CDATA[uber]]></category>
            <dc:creator><![CDATA[Keerthana Srikanth]]></dc:creator>
            <pubDate>Thu, 08 Aug 2019 19:07:24 GMT</pubDate>
            <atom:updated>2019-08-08T19:07:24.754Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*UnRUrL_16xKoChBccT-bDQ.png" /></figure><p><em>3rd year B.E.(Hons.) Computer Science student at BITS Pilani, K. K. Birla Goa Campus.</em></p><p><strong>Interview Experience</strong></p><p><em>Round 1: Coding Round</em></p><p>The coding round was conducted on Hackerrank. There were 3 questions- 1 based on DP, 1 based on graphs (MST) and 1 based on bitmasking. I was able to solve 2 questions partially. The questions were quite challenging and were of a good level.</p><p><em>Round 2: Technical Interview 1</em></p><p>I was asked a single DS &amp; Algo question. The question was fairly straight forward, involving sorting and heaps. I explained the brute force solution first which was O(n²) and then optimized it to an O(nlogn) solution. I went through the possible corner cases and then was asked to write the pseudocode for it.</p><p><em>Round 3: Technical Interview 2</em></p><p>I was asked a question which tested my understanding of strings and string functions. I explained my solution and why it could not be optimized further due to the immutability of strings. The question itself was quite direct and I feel I was tested on my ability to build up the solution logically and how I identified and handled corner cases. I was asked to write the code for this question. I did my best to make the code modular and used relevant and clear identifiers.</p><p><em>Round 4: Technical Interview 3 + HR</em></p><p>This round was a combination of HR and technical questions.</p><p>Technical questions:</p><p>I was asked to design a voting system. The focus was on the data structures I used. I made use of unordered hash maps and explained the reasons for doing so.</p><p>I was asked how I would design the Hackerrank testing platform. This was a challenge for me, but I tried to think logically and build up the solution incrementally.</p><p>HR questions:</p><p>I was asked questions about why I wanted to work at Uber, how I would deal with conflict with my colleagues (how I had dealt with it in the past), how I would approach a situation in which I disagreed with my manager, etc.</p><p>In the all the technical interviews, the interviewers were not focused on whether I got the perfect solution straight off the bat. They gently gave suggestions and observed how I adapted to the new information.</p><p>Overall, it was a great interview experience.</p><p><strong>My journey with Demux Academy:</strong></p><p>The Demux Bootcamp was a wonderful experience and it was definitely helpful in landing this internship. I commend the mentors at Demux for their dedication to helping us students by conducting online sessions at night while still working full-time jobs. That they did this for free speaks to their commitment and kindness. I am very grateful to all the mentors for their support and guidance.</p><p>The bootcamp was intense but never overwhelming. Most of us had internship work during the day and attended the sessions at night through video conferencing. The mentors ensured that we received adequate breaks and that we were continuously engaged. The content was logically designed and covered all the important topics. The theory was covered and then we discussed a few questions of varying difficulty.</p><p>The most helpful part of the bootcamp for me was the mock interviews. I had two mock interviews, and the tips and feedback given to me after them were really useful for answering questions in the actual interview.</p><p>All in all, my experience with Demux was a great one. It kept me motivated through the summer and helped me prepare in a better way. I thank all the mentors for their time, effort, patience and support.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=821dbbfa4a36" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/uber-interview-experience-for-2020-summer-intern-on-campus-821dbbfa4a36">Uber Interview Experience (For 2020 Summer Intern On-Campus)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Amazon Interview Experience (For 2020 Summer Intern On-Campus)]]></title>
            <link>https://medium.com/demuxacademy/amazon-interview-experience-for-2020-summer-intern-on-campus-8ecad89a8443?source=rss----e470ca7a2b6a---4</link>
            <guid isPermaLink="false">https://medium.com/p/8ecad89a8443</guid>
            <dc:creator><![CDATA[Ishan Arora]]></dc:creator>
            <pubDate>Mon, 29 Jul 2019 07:22:28 GMT</pubDate>
            <atom:updated>2019-07-29T17:54:17.553Z</atom:updated>
            <content:encoded><![CDATA[<p>Amazon Interview Experience (For 2020 Summer Intern On-Campus)</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*tSl7XVQ5n-8w7B0emfL7eQ.jpeg" /></figure><p>Coding Round:<br>The coding round was an easy one where everyone got a set of 2 random questions along with 25 aptitude questions and 7 debugging questions which were pretty easy!<br>My first question was about a 2D matrix consisting of 0s and 1s and we needed to find wether there exists a path to a specified cell or not.Here 0 signified an obstacle while 1 signified a path!<br>The second question included a 2D matrix where the rows and columns were sorted and we needed to search for a particular element from that!<br>Some of my friends got a program to implement round robin and calculate the waiting time which was a bit tricky and was not fully accepted by any of them! Do see its implementation from gfg as the ques might repeat! Search for roundrobin with given arrival times.</p><p>Technical Round:<br>In the technical round he first asked me this problem:<br>https://www.interviewbit.com/problems/black-shapes/<br>I was required to first explain him the logic and then write the entire code on paper.<br>Following this he asked me some questions on differences between class,abstract class and interface and discussed about all the technical terms i used in my answer!<br>Then he asked me to implement k stacks in a single array.<br>I was able to explain a naive approach but was unable to think of the efficient one! Check gfg for that! This code also was required to be written on paper!</p><p>The results came out after 4 hours and I was selected :)</p><p>Thanks to Team Demux for all the valuable sessions and resources!! Team Demux together with Gfg, Interviewbit and hardwork is a perfect blend to crack any of the interviews!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8ecad89a8443" width="1" height="1" alt=""><hr><p><a href="https://medium.com/demuxacademy/amazon-interview-experience-for-2020-summer-intern-on-campus-8ecad89a8443">Amazon Interview Experience (For 2020 Summer Intern On-Campus)</a> was originally published in <a href="https://medium.com/demuxacademy">DemuxAcademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>