<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:blogger='http://schemas.google.com/blogger/2008' xmlns:georss='http://www.georss.org/georss' xmlns:gd="http://schemas.google.com/g/2005" xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-3870158851469033693</id><updated>2024-10-07T09:31:20.830+05:30</updated><category term="Interview"/><category term="MetaData"/><category term="D E Shaw"/><category term="Microsoft"/><category term="Amazon"/><category term="Google"/><category term="LimeSpot"/><category term="ST Microelectronics"/><title type='text'>Code Boat</title><subtitle type='html'>Ride on a boat to programming interview questions asked by Google, Microsoft, Adobe, Amazon and other companies.</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default?redirect=false'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>12</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-1128682809502530045</id><published>2008-10-02T22:31:00.004+05:30</published><updated>2008-10-02T23:02:55.637+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><category scheme="http://www.blogger.com/atom/ns#" term="Microsoft"/><title type='text'>[Microsoft] Find Top 3 Racing Horses from 25 Horses on 5 Tracks !!</title><summary type="text">BackgroundThis is the most interesting puzzle I&#39;ve seen till date and It was asked in campus interview of NIT Kurukshetra by Microsoft India Development Center.  Luckily my friend could solve it and get into Microsoft.Problem DefinitionThere are 5 Racing Tracks in a Ranch and you are given 25 horses.  You have to find 3 fastest horses (considering there is no tie between any two horses) by </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/1128682809502530045/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/1128682809502530045' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/1128682809502530045'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/1128682809502530045'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/10/microsoft-find-top-3-racing-horses-from.html' title='[Microsoft] Find Top 3 Racing Horses from 25 Horses on 5 Tracks !!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-8489025219514693883</id><published>2008-09-30T18:11:00.002+05:30</published><updated>2008-09-30T18:51:16.529+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><category scheme="http://www.blogger.com/atom/ns#" term="ST Microelectronics"/><title type='text'>[ST Microelectronics] Code to find if a Machine is Little Endian or Big Endian.</title><summary type="text">BackgroundOne of my junior who is working with ST Microelectronics, Noida was asked this question in her interview.  I am describing my approach to solve this question.Fundamentals First&quot;Computer architecture supports two different memory storage techniques based on order of bytes in which data is stored in memory&quot;.  e.g.  In a two byte number 0xC06E&#39;C0&#39; is Most Significant Byte (MSB) of this </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/8489025219514693883/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/8489025219514693883' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/8489025219514693883'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/8489025219514693883'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/st-microelectronics-code-to-find-if.html' title='[ST Microelectronics] Code to find if a Machine is Little Endian or Big Endian.'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-9136327467294987174</id><published>2008-09-28T10:42:00.015+05:30</published><updated>2008-09-28T12:22:46.149+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><title type='text'>[Adobe] Define a macro for Intersecting Rectangles or Overlapping Rectangles</title><summary type="text">BackgroundThis question is a frequently asked question in written tests conducted by Adobe. This question was sent to me by two of my close friends, one of them could easily make it to Adobe and is working with Adobe Noida now.Problem DefinitionIn a Plane, If you are given co-ordinates of upper left corner and lower right corner of two rectangles, you need to write a #define macro which returns </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/9136327467294987174/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/9136327467294987174' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/9136327467294987174'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/9136327467294987174'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/adobe-define-macro-for-intersecting.html' title='[Adobe] Define a macro for Intersecting Rectangles or Overlapping Rectangles'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiTrVK2nl0b_4kp5HprInA1L20RJ15omyxo3nQ2A-2wagpY7bzhD-TtmeG0m66JScybnc-dnicwOflQfWohDvHRDr8AIMC8x_T_yBRYxHT8j7IgJ_s54g6baL45jXntSd8jmKVm7RNVTAU/s72-c/adobe_rect.png" height="72" width="72"/><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-9074668031577013233</id><published>2008-09-27T11:54:00.005+05:30</published><updated>2008-09-30T11:00:20.752+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Google"/><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><title type='text'>[Google] Reverse A Given String without reversing Words in It!!</title><summary type="text">BackgroundGone are the days when Software companies used to ask questions like - write a function to reverse a given string.  With increasing number of websites like this, providing solution to every other question asked in interviews, Companies are always going on step ahead in phrasing their questions to the candidate facing the interview.  This one is a nice example of the same and was asked </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/9074668031577013233/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/9074668031577013233' title='3 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/9074668031577013233'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/9074668031577013233'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/google-reverse-given-string-without.html' title='[Google] Reverse A Given String without reversing Words in It!!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>3</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-50594415625154909</id><published>2008-09-27T11:15:00.008+05:30</published><updated>2008-09-30T10:59:03.297+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="D E Shaw"/><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><title type='text'>[D E Shaw] Difference between GET And POST!!</title><summary type="text">BackgroundThis seems to be a very popular question for any web development interview to judge the basic knowledge of the candidate. To my surprise, when I was having my face to face interviews with D E Shaw, Hyderabad, I faced three different interviewers that day and this question was asked by all three of them. I was not very comfortable in answering this question and when I came back, Google </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/50594415625154909/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/50594415625154909' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/50594415625154909'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/50594415625154909'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/d-e-shaw-difference-between-get-and.html' title='[D E Shaw] Difference between GET And POST!!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-7044792268454568094</id><published>2008-09-27T01:38:00.003+05:30</published><updated>2008-09-30T10:59:43.877+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Amazon"/><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><title type='text'>[Amazon] Cycle in a Linked List!!</title><summary type="text">BackgroundOne of my subordinates applied for a job at Amazon, Hyderabad and he got a call for telephonic interview. According to him, Telephonic interview of Amazon is quiet easy where they do not look for depth in a particular technology. They rather cover Operating Systems, Databases, Web Technologies, OOPs and see the breadth of knowledge a candidate has. He requested me to allow him to give </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/7044792268454568094/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/7044792268454568094' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/7044792268454568094'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/7044792268454568094'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/amazon-cycle-in-singly-linked-list.html' title='[Amazon] Cycle in a Linked List!!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-2304110745379152996</id><published>2008-09-26T20:09:00.000+05:30</published><updated>2008-09-30T10:59:18.619+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="D E Shaw"/><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><title type='text'>[D E Shaw] One to One Mapping of wrestlers!!</title><summary type="text">BackgroundI attended an interview at D E Shaw last year and during face-to-face interview they usually have a puzzles round where they give you a puzzle and ask you to device an algorithm for solving it. I could not solve this particular problem during my interview but later on i kept thinking about it and now, I feel I&#39;ve got a solution to this problem.Problem DefinitionThere are two groups of </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/2304110745379152996/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/2304110745379152996' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/2304110745379152996'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/2304110745379152996'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/d-e-shaw-one-to-one-mapping-of.html' title='[D E Shaw] One to One Mapping of wrestlers!!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-3284517697685862925</id><published>2008-09-25T19:52:00.001+05:30</published><updated>2008-09-30T11:00:10.959+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><category scheme="http://www.blogger.com/atom/ns#" term="LimeSpot"/><title type='text'>[Lime Spot Technology] Telephonic Interview</title><summary type="text">Recently, I attended telephonic interview with LimeSpot Technology India Pvt. Ltd. (Noida). This was an hour long interview and below is the list of questions asked.There was no introduction round.Straight away I was asked following questions in given order:[Interviewer]: Briefly explain the projects you have mentioned in your resume!![ME]: I was not having my resume with me so just honestly told</summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/3284517697685862925/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/3284517697685862925' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/3284517697685862925'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/3284517697685862925'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/telephonic-interview-with-lime-spot.html' title='[Lime Spot Technology] Telephonic Interview'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-2876585998206398411</id><published>2008-09-24T22:39:00.000+05:30</published><updated>2008-09-30T11:00:38.542+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Interview"/><category scheme="http://www.blogger.com/atom/ns#" term="Microsoft"/><title type='text'>[Microsoft] First non repeated character in a string!</title><summary type="text">Background This is a question which usually gets asked in many programming interviews.  One of my friends was asked this question in his Microsoft Interview and he answered it.  Here is his experience in my words.Tip!!  When you face such question in interview, never hesitate to mention the solution that seems obvious to you.Obvious SolutionStarting with first character of string, keep comparing </summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/2876585998206398411/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/2876585998206398411' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/2876585998206398411'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/2876585998206398411'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/interview-program-to-find-first-non.html' title='[Microsoft] First non repeated character in a string!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-3901612010109098873</id><published>2007-10-24T11:37:00.000+05:30</published><updated>2008-09-30T11:38:05.363+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="MetaData"/><title type='text'>All Interview Questions Archive !!</title><summary type="text"></summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/3901612010109098873/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/3901612010109098873' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/3901612010109098873'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/3901612010109098873'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2007/10/all-interview-questions-archive.html' title='All Interview Questions Archive !!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-1800867983914342745</id><published>2007-10-24T10:43:00.000+05:30</published><updated>2008-09-30T11:10:14.481+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="MetaData"/><title type='text'>Submit A Question !!</title><summary type="text">&lt;!-- Place this code in your web sites HTML --&gt;</summary><link rel='replies' type='application/atom+xml' href='http://codeboat.blogspot.com/feeds/1800867983914342745/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment/fullpage/post/3870158851469033693/1800867983914342745' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/1800867983914342745'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/1800867983914342745'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/submit-question.html' title='Submit A Question !!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3870158851469033693.post-1117405137630259948</id><published>2007-10-24T10:33:00.000+05:30</published><updated>2008-09-30T11:11:02.064+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="MetaData"/><title type='text'>Your Question Has Been Submitted!!</title><summary type="text">Your Question from &quot;Submit A Question&quot; section has been successfully submitted.  We appreciate your interest in CodeBoat and we are thankful to you for submitting your question.   are committed to provide best possible solutions in quickest possible time.Stay Tuned !!CodeBoat.Goto HomePage &gt;&gt;</summary><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/1117405137630259948'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3870158851469033693/posts/default/1117405137630259948'/><link rel='alternate' type='text/html' href='http://codeboat.blogspot.com/2008/09/thanks-for-submitting-question.html' title='Your Question Has Been Submitted!!'/><author><name>CodeBoat</name><uri>http://www.blogger.com/profile/05935543425444001284</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author></entry></feed>