Pramp - mock interview experience   February 23, 2016 Read the article today from hackerRank blog on facebook: http://venturebeat.com/2016/02/18/how-i-landed-a-google-internship-in-6-months/?utm_content=buffer5c137&utm_medium=social&utm_source=fac…

March 16, 2016 Problem statement:Given a 2D array (matrix) named M, print all items of M in a spiral order, clockwise.For example: M  =  1   2   3   4   5       6   7   8   9  10      11  12  13  14  15      16  17  18  19  20 The clockwise spiral pr…

leetcode & Mock Interview https://leetcode.com/interview/ xgqfrms 2012-2020 www.cnblogs.com 发布文章使用:只允许注册用户才可以访问!…

Given an array with integers. Find two non-overlapping subarrays A and B, which |SUM(A) - SUM(B)| is the largest. Return the largest difference. 1,-2,3,-1 1,3 A -1 B 7 public int maxDiffSubArrays(int[] nums) { // write your code here } Solution: publ…

Landing a job interview is incredibly exciting –- and often terrifying. But fear not. There are clever ways to transform your angst into nerves of steel. After all, a good interview should feel like a conversation, not an interrogation. Here are five…

UNIT3-1 Harvey Mackay, who runs his own company, often interviews applicants for jobs. Here he lets us into the secret of what qualities an employer is looking for, and gives four tips on what can help you to stand out from the crowd. 自己经营公司的哈维·麦凯经常对…

https://biginterview.com/blog/2011/09/tell-me-about-yourself.html There are some job interview questions that are guaranteed to come up in most (if not all) of your job interviews — regardless of your industry, your experience level, and job type. At…

The geometric median of a discrete set of sample points in a Euclidean space is the point minimizing the sum of distances to the sample points. This generalizes the median, which has the property of minimizing the sum of distances for one-dimensional…

Code practice: Leetcode: www.leetcode.com HackerRank: www.hackerrank.com Topcoder: https://www.topcoder.com/ Interview experience share: GeeksforGeeks Interview Corner: http://www.geeksforgeeks.org/about/interview-corner/ Selective Coding Blog (in C+…

2014-05-08 23:45 题目链接 原题: How would you use Dijkstra's algorithm to solve travel salesman problem, which is to find a shortest path from a starting node back to the starting node and visits all other node exactly once. 题目:如何用Dijkstra算法来解决TSP问题?(谁会出这种…