!!!Interview

A LRU Cache in 10 Lines of Java

Ihadacoupleofinterviewslongagowhichaskedmetoimplementeda leastrecentlyused(LRU) cache.Acacheitselfcansimplybeimplementedusingahashtable
圣洁之子·2015-07-16 05:00

大厂前端高频面试问题与答案精选

近日，GitHub上一位名为木易杨（yygmind）的开发者，在GitHub中建了一个名为Advanced-Frontend/Daily-Interview-Question项目，该项目每天会更新一道前端大厂面试题
cpongo2·2015-07-15 23:25

【剑指Offer学习】【所有面试题汇总】

所有代码下载【https://github.com/Wang-Jun-Chao/coding-interviews】目录第01-10题【剑指Offer学习】【面试题02：实现Singleto
derrantcm·2015-07-15 07:11

【剑指Offer学习】【所有面试题汇总】

所有代码下载【https://github.com/Wang-Jun-Chao/coding-interviews】目录第01-10题【剑指Offer学习】【面试题02：实现Singleto
derrantcm·2015-07-15 07:11

[置顶] 【剑指Offer学习】【所有面试题汇总】

所有代码下载【https://github.com/Wang-Jun-Chao/coding-interviews】目录第01-10题【剑指Offer学习】【面试题02：实现Singleton模式——七种实现方
DERRANTCM·2015-07-15 07:00

Software Quality Characteristics - 软件质量特性

SoftwareQualityCharacteristics-软件质量特性题记：记得上次Interview时，boss问我对软件质量的理解。我说，对于企业级产品来说是稳定。
小南瓜酥·2015-07-11 10:44

google的面试要求（自己的标杆）

five-essential-phone-screen-questionseFiveEssentialPhone-ScreenQuestions Stevey'sDrunkenBlogRants™I'vebeenonalotofSDEinterviewloopslatelywherethecandidatefaile
gshengod·2015-07-09 15:00

大公司最喜欢问的Java集合类面试题

转载出处：http://www.codeceo.com/article/java-collection-interview.htmljava.util包中包含了一系列重要的集合类，而对于集合类，主要需要掌握的就是它的内部结构
hjw1991324·2015-07-08 11:00

How HipChat Stores And Indexes Billions Of Messages Using ElasticSearch & Redis

This article is from an interview with Zuhaib Siddique, a production engineer at HipChat, makers
dengkane·2015-07-08 09:00

互联网笔试面试专题

mod=topic&topicid=1&hmsr=csdn&hmmd=writing&h%20mpl=interview&hmkw=interview%2CBAT&hmci=
xunmeng2002·2015-07-07 17:00

[LeetCode] Implement Queue using Stacks

A classic interview question.
·2015-07-07 11:00

Node.js Interview Questions and Answers

Therearetwosidesofthetable: youeither wanttohire Node.jsdevelopers oryouwantto gethired asaNode.jsdeveloper.Thislisthelpsyounavigateabitinthisspace,givingyousomequestionstoask,andalistofquestionsyoush
萨斯辈的呼唤·2015-07-02 09:00

50 Java Interview Questions

http://robaustin.wikidot.com/50-java-interview-questions
cyper·2015-07-02 02:00

顺时针打印矩阵

   牛客网AC地址：http://www.nowcoder.com/books/coding-interviews/9b4c81a02cd34f76be2659fa0d54342a?
yiyiwudian·2015-07-01 11:00

链表中倒数第k个结点

   牛客网AC地址：http://www.nowcoder.com/books/coding-interviews/529d3ae5a407492994ad2a246518148a?
yiyiwudian·2015-06-30 10:00

从尾到头打印链表

牛客网AC地址：http://www.nowcoder.com/books/coding-interviews/d0267f7f55b3412ba93bd35cfa8e8035?
yiyiwudian·2015-06-29 20:00

反转链表

   牛客网AC地址：http://www.nowcoder.com/books/coding-interviews/75e878df47f24fdc9dc3e400ec6058ca?
yiyiwudian·2015-06-28 21:00

面试需要的基础知识-合并排序数组

解题思路从尾到头比较A1和A2中的数字，比较大的数字复制到A1数组的最后一个未替换的位置实现代码/**  *   */ package com.jason.interviewQuestions.basicKnowledge
z_jordon·2015-06-27 21:00

替换空格

牛客网AC地址：http://www.nowcoder.com/books/coding-interviews/4060ac7e3e404ad1a894ef3e17650423?
yiyiwudian·2015-06-27 11:00

interview overview

1hashmap的机制public V put(K key, V value) {         if (key == null)             return putForNullKey(value);         int hash = hash(key.hashCode());         int i = indexFor(hash, table.length);      
微妙率直·2015-06-25 23:00

Google Interview - 判断点是否在凸多边形内的O(logn)解法

补充知识：向量叉积，向量P=(x1,y1);Q=(x2,y2);P×Q=(x1*y2-x2*y1);叉积的一个非常重要性质是可以通过它的符号判断两矢量相互之间的顺逆时针关系：若P×Q>0,则P在Q的顺时针方向。若P×QPolygon,Pointtarget){ intlen=Polygon.size(); if(multiply(target,Polygon[1],Polygon[0])>0&
yuanhsh·2015-06-25 15:00

Google Interview - 判断点是否在凸多边形内的O(logn)解法

补充知识：向量叉积，向量P=(x1,y1);Q=(x2,y2);P×Q=(x1*y2-x2*y1);叉积的一个非常重要性质是可以通过它的符号判断两矢量相互之间的顺逆时针关系：若P×Q>0,则P在Q的顺时针方向。若P×QPolygon,Pointtarget){ intlen=Polygon.size(); if(multiply(target,Polygon[1],Polygon[0])>0&
yuanhsh·2015-06-25 15:00

There nothing that prevents

CompanyOfHeroes2previewandinterviewThecreatorsofWarhammer40,000:DawnOfWarreturntoWorldWarII,astheirnewrealtimestrategyfocusesonthebloodiestbattlesoftheconflict.CompanyOfHeroes2deathofcoldTheprevieweve
lluggg870·2015-06-23 13:00

［转］十个 iOS 面试问题

原文地址：http://onevcat.com/2013/04/ios-interview/ 不管对于招聘和应聘来说，面试都是很重要的一个环节，特别对于开发者来说，面试中的技术问题环节不仅是企业对应聘者技能和积累的考察
·2015-06-19 16:00

Google Interview - Integers as Sum of Squares

给一个整数，表示成n个整数的平方和，n最小，求n。10017 = 100^2 + 4^2 + 1 --> n = 3   这道题的快速解法要牵扯到数学定理了。   Lagrange's four-square theorem Every natural number can be represented as the sum of four integ
yuanhsh·2015-06-19 15:00

Google Interview - Integers as Sum of Squares

给一个整数，表示成n个整数的平方和，n最小，求n。10017 = 100^2 + 4^2 + 1 --> n = 3   这道题的快速解法要牵扯到数学定理了。   Lagrange's four-square theorem Every natural number can be represented as the sum of four integ
yuanhsh·2015-06-19 15:00

LinkedIn面试官的经验，给程序猿面试提些建议

这里也推荐一下我的新书：程序员面试白皮书(AnUltimateGuidetoCodingInterviews).问题：硅谷公司的
u012460084·2015-06-18 10:00

面试3道测试题

packageinterviewWjw; importjava.util.ArrayList; importjava.util.Iterator; importjava.util.List; importjava.util.Set
u013233097·2015-06-16 17:00

Google Interview - Valid UTF-8 Character

Write a function to validate whether the input is valid UTF-8. Input will be string or byte array, output should be true or false. UTF-8是一种变长的编码方式。它可以使用1~4个字节表示一个符号，根据不同的符号而变化字节长度。UTF-8的编码规则很简单，
yuanhsh·2015-06-16 12:00

Google Interview - Valid UTF-8 Character

Write a function to validate whether the input is valid UTF-8. Input will be string or byte array, output should be true or false. UTF-8是一种变长的编码方式。它可以使用1~4个字节表示一个符号，根据不同的符号而变化字节长度。UTF-8的编码规则很简单，
yuanhsh·2015-06-16 12:00

Google Interview - Fence Painter

Write an algorithm that counts the number of ways you can paint a fence with N posts using K colors such that no more than 2 adjacent fence posts are painted with the same color. 因为题目要求是不超过两个相邻的
yuanhsh·2015-06-16 12:00

Google Interview - Fence Painter

Write an algorithm that counts the number of ways you can paint a fence with N posts using K colors such that no more than 2 adjacent fence posts are painted with the same color. 因为题目要求是不超过两个相邻的
yuanhsh·2015-06-16 12:00

Google Interview - Second Largest Number

Find the second largest number in a given array.Return 0 if the given array has no second largest number.   public int secondLargest(int[] arr) { if(arr.length<2) return 0;
yuanhsh·2015-06-15 13:00

Google Interview - Second Largest Number

Find the second largest number in a given array.Return 0 if the given array has no second largest number.   public int secondLargest(int[] arr) { if(arr.length<2) return 0;
yuanhsh·2015-06-15 13:00

Facebook Interview - Integer to English Phrase

Given an integer between 0 and 999,999, print an English phrase that describes the integer (eg, “One Thousand, Two Hundred and Thirty Four”)   http://ideone.com/Q1AT1p vector<string> und
yuanhsh·2015-06-15 12:00

Facebook Interview - Integer to English Phrase

Given an integer between 0 and 999,999, print an English phrase that describes the integer (eg, “One Thousand, Two Hundred and Thirty Four”)   http://ideone.com/Q1AT1p vector<string> und
yuanhsh·2015-06-15 12:00

Google Interview - Flowing Water

Given a N*N matrix contains lakes, each lake is represented by an elevation. The water in each lake can flow to its neighbours which has lower or equal elevations. Suppose the left and top side
yuanhsh·2015-06-15 09:00

Google Interview - Flowing Water

Given a N*N matrix contains lakes, each lake is represented by an elevation. The water in each lake can flow to its neighbours which has lower or equal elevations. Suppose the left and top side
yuanhsh·2015-06-15 09:00

Google Interview - Kth Smallest Element in BST

Given a binary search tree and an integer K, find K-th smallest element in BST.For example: Input: 2 / \ 1 3 K = 2Output:2Note: Your solution musb be in-place without alter
yuanhsh·2015-06-15 09:00

Google Interview - Kth Smallest Element in BST

Given a binary search tree and an integer K, find K-th smallest element in BST.For example: Input: 2 / \ 1 3 K = 2Output:2Note: Your solution musb be in-place without alter
yuanhsh·2015-06-15 09:00

FaceBook Interview - Binary Tree Vertical Traversal

Given a binary tree, traverse it vertically. For example: 5 / \ 2 7 / \ / \ 1 3 6 8 \ \ 4 9   Should return as: [ [1], [2], [5, 3, 6
yuanhsh·2015-06-15 08:00

FaceBook Interview - Binary Tree Vertical Traversal

Given a binary tree, traverse it vertically. For example: 5 / \ 2 7 / \ / \ 1 3 6 8 \ \ 4 9   Should return as: [ [1], [2], [5, 3, 6
yuanhsh·2015-06-15 08:00

采访100多个开发者带来的7点感悟

转自：http://www.cocoachina.com/programmer/20150610/12079.html版权归原作者所有英文原文：7LessonsLearnedFromInterviewing100
Riven_wn·2015-06-12 16:00

【剑指offer】 面试题5： 从尾到头打印链表

importjava.util.Scanner;classNode{publicintelem;publicNodenext;}/***@authorhadoop**输入一个链表，从尾到头打印链表每个节点的值**/publicclassInterviews
java_wliang·2015-06-08 16:26

lintcode 1: Data Stream Median

DataStreamMedianNumberskeepcoming,returnthemedianofnumbersateverytimeanewnumberadded.Haveyoumetthisquestioninarealinterview
xudli·2015-06-06 15:00

#面试准备#Bug Free

【以下文字转载自JobHunting讨论区】发信人:DAOLAIAMENG(熊熊),信区:JobHunting标 题:interview心得：我是如何做到bugfree的发信站:BBS未名空间站(SatOct2516
ChiBaoNeLiuLiuNi·2015-06-05 01:00

Google Interview - Print Matrix Diagonally

Given a 2D matrix, print all elements of the given matrix in diagonal order. For example, consider the following 5 X 4 input matrix. 1 2 3 4 5 6 7 8 9 10 1
yuanhsh·2015-06-05 01:00

Google Interview - Print Matrix Diagonally

Given a 2D matrix, print all elements of the given matrix in diagonal order. For example, consider the following 5 X 4 input matrix. 1 2 3 4 5 6 7 8 9 10 1
yuanhsh·2015-06-05 01:00

github上值得关注的前端项目

star:860Front-end-Interview-questions 史上最全前端开发面试问题及答案f2e-hub 包含Animation，UI，dialog，Carousels，color
usenrong·2015-06-03 17:00

github上值得关注的前端项目

star:860Front-end-Interview-questions史上最全前端开发面试问题及答案f2e-hub包含Animation，UI，dialog，Carousels，color，image
kongjiea·2015-06-03 10:04
上一页 86 87 88 89 90 91 92 93 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他