sclochan.wordpress.com
Authors who I like.. – The Times They Are a Changin'
https://sclochan.wordpress.com/2010/12/21/authors-who-i-like
The Times They Are a Changin'. Not to be confused for sanity. F1, Football (1). Follow The Times They Are a Changin' on WordPress.com. On Captain America 2- Winter…. On Captain America 2- Winter…. Laurel L. Avery. On The Spirit of Mumbai. On Ah welll. kolaveri di. On Authors who I like. Authors who I like. December 21, 2010. Gabriel Garcia Marquez read the translations. Want to learn Spanish to read the originals some day some day. I shall do it. in a hundred years of solitude. Authors who I like. Fill i...
arvind-mohan.blogspot.com
Tech World: December 2011
http://arvind-mohan.blogspot.com/2011_12_01_archive.html
Codes, I met. A question A day. Blog # 60 : Thief's Proposal! So how does the first thief distribute gold to get maximum and to not get killed also? To see the solution. Ps - For Remarks please hit the given link once. For Hint, hit it twice and for the solution, hit it thrice. First of all try to understand the problem. Hit again for hints. Think first for small numbers and then generalize the pattern. For 2 thieves, the proposal would be (500, 0) as even if second disagrees, it does not matter. The col...
arvind-mohan.blogspot.com
Tech World: Blog # 91 : Microsoft Interview Qusetions 2013 Batch
http://arvind-mohan.blogspot.com/2012/08/microsoft-interview-qusetions-2013-batch.html
Codes, I met. A question A day. Blog # 91 : Microsoft Interview Qusetions 2013 Batch. Ent in stri n. Cde” s 2. S all t h. If a b in. Tech World: Blog # 91 : Microsoft Interview Qusetions 2013 Batch - Blog # 91 : Microsoft Interview Qusetions 2013 Batch. Friday, August 31, 2012 at 1:31 PM. Please go through the label section in the sidebar and find the desired topic. In case you can't find one, inform me; I'll try to arrange the material in that concern. Mail me [at] mohan.arvind964@gmail.com. Blog # 88 :...
arvind-mohan.blogspot.com
Tech World: February 2012
http://arvind-mohan.blogspot.com/2012_02_01_archive.html
Codes, I met. A question A day. Blog # 77 : The Lonely Element. Given an array of integers with size 2N 1 such that N elements appear twice in arbitrary positions and 1 element appears only once. Devise an algorithm to find the lonely element. Ex : {1 2 4 5 1 4 2}. Courtesy: Syed Wali Hamza. To see the solution. Ps - For Remarks please hit the given link once. For Hint, hit it twice and for the solution, hit it thrice. No remarks. Hit again for hints. Note the properties of XOR :. 3 A (B C) = (A B) C.
arvind-mohan.blogspot.com
Tech World: Blog # 88 : Adobe Interview Questions 2013 Batch
http://arvind-mohan.blogspot.com/2012/08/adobe-interview-questions-2013-batch.html
Codes, I met. A question A day. Blog # 88 : Adobe Interview Questions 2013 Batch. 1 How will you implement a stack using a priority queue. Push and pop should be in O(1). 2 3 mislabeled jars problem. 1 How does stack look in function calls? Given a recursive function call, how will the stack look like? 2 When does stack(process stack) overflow? What are the remedies? 3 What are balanced BST's. Then he randomly gave me various numbers and asked me to create a BST. And the balance it. Lock = 1;. Lock = 0;.
arvind-mohan.blogspot.com
Tech World: August 2011
http://arvind-mohan.blogspot.com/2011_08_01_archive.html
Codes, I met. A question A day. Blog # 28 : How to reverse a stack in place. Reverse a stack, using just push(), pop(), top() operations, in its place itself. You can not assign any known memory address. Simple methodology for this problem is, take last element from the stack i.e. you need to empty the stack [do it recursively, keeping other elements in memory]. Push the last element in the stack again. Now while pushing each of earlier elements, first empty whole stack and then push them. 1)merge two he...
arvind-mohan.blogspot.com
Tech World: August 2012
http://arvind-mohan.blogspot.com/2012_08_01_archive.html
Codes, I met. A question A day. Blog # 93 : Amazon Interview Questions 2013 Batch (1). Tech World: August 2012 - Blog # 93 : Amazon Interview Questions 2013 Batch (1). Friday, August 31, 2012 at 3:08 PM - 0 Comments. Blog # 92 : Pritam Das : Microsoft. Tech World: August 2012 - Blog # 92 : Pritam Das : Microsoft. At 1:33 PM - 0 Comments. Blog # 91 : Microsoft Interview Qusetions 2013 Batch. Ent in stri n. Cde” s 2. S all t h. If a b in. At 1:31 PM - 0 Comments. 1 There is code like. PS This is very impor...
arvind-mohan.blogspot.com
Tech World: Blog # 93 : Amazon Interview Questions 2013 Batch (1)
http://arvind-mohan.blogspot.com/2012/08/amazon-interview-questions-2013-batch-1.html
Codes, I met. A question A day. Blog # 93 : Amazon Interview Questions 2013 Batch (1). Tech World: Blog # 93 : Amazon Interview Questions 2013 Batch (1) - Blog # 93 : Amazon Interview Questions 2013 Batch (1). Friday, August 31, 2012 at 3:08 PM. Please go through the label section in the sidebar and find the desired topic. In case you can't find one, inform me; I'll try to arrange the material in that concern. Also if you want to share some useful information with all the guys,. How to view the solution?
arvind-mohan.blogspot.com
Tech World: September 2012
http://arvind-mohan.blogspot.com/2012_09_01_archive.html
Codes, I met. A question A day. Blog # 94 : Amazon Interview Questions 2013 Batch (2). 1 BST to DLL conversion. 2 Given a linked list you have to delete all nodes for which there is a node with higher value on right side. For eg. 41 1 6 4 8 34 3 5 9. Output 41 34 9. N 2 solution is obvious. Do this in O(n). I forgot questions from this round. 1 question I remember is. 1 Normal HR questions. MoveLeft - moves the person 1 unit left/1 unit time. MoveRight - moves the person 1 unit right/1 unit time. The blo...
arvind-mohan.blogspot.com
Tech World: March 2011
http://arvind-mohan.blogspot.com/2011_03_01_archive.html
Codes, I met. A question A day. Blog # 07 : 8-puzzle Solver. A Java Program to solve 8-Puzzle Problem. Import java.util.HashMap;. Import java.util.LinkedList;. Import java.util.Map;. Import java.util.Queue;. Queue String agenda = new LinkedList String (); / Use of Queue Implemented using LinkedList for Storing All the Nodes in BFS. Map String,Integer stateDepth = new HashMap String, Integer (); / HashMap is used to ignore repeated nodes. Public static void main(String args[]){. After that the new string ...
SOCIAL ENGAGEMENT