一亩三分地 标签 标签 careercup 相关帖子

标签:
careercup (#careercup)

318个主题 | 4192个回复 | 最后更新: 2023-5-27 03:23

相关帖子

版块 回复/查看 最后发表
【第三轮】6.30-7.6 CareerCup 2.7

2.7 Implement a function to check if a linked list is a palindrome.回复解法可以按照以下格式来Notice:1、记得在程序注释中表明自己算法的时间、空间 ...

刷题 25 3486 sanguine 2015-1-1 07:28
【第三轮】6.23-6.29 CareerCup 2.6

2.6Given a circular linked list, implement an algorithm which returns the node at the beginning of the loop.DEFINITIONCircular linked list: A (corrupt) li ...

刷题 28 3944 sanguine 2015-1-1 06:02
【第三轮】6.23-6.29 CareerCup 2.5

2.5You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the Ts digit ...

刷题 29 3815 sanguine 2014-12-30 06:24
【第三轮】6.23-6.29 CareerCup 2.4

2.4 Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x.回复解法可以按 ...

刷题 28 3331 sanguine 2014-12-29 08:34
【第三轮】6.23-6.29 CareerCup 2.3

2.3Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.EXAMPLEInput: the node c from the linked ...

刷题 32 4151 sanguine 2014-12-26 12:15
【第三轮】6.23-6.29 CareerCup 2.2

2.2 Implement an algorithm to find the kth to last element of a singly linked list.回复解法可以按照以下格式来Notice:1、记得在程序注释中表明自己算法 ...

刷题 31 3911 sanguine 2014-12-25 12:14
【第三轮】6.23-6.29 CareerCup 2.1

2.1 Write code to remove duplicates from an unsorted linked list.FOLLOW UPHow would you solve this problem if a temporary buffer is not allowed?回复解 ...

刷题 36 5200 sanguine 2014-12-23 13:52
【第三轮】7.7-7.13 CareerCup 4.1

4.1 Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights ...

刷题 17 2651 heycinderella 2014-10-23 03:17
【第三轮】6.30-7.6 CareerCup 3.2

3.2 How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push, pop and min should all ope ...

刷题 24 3578 TonyJang 2014-9-26 20:37
【第三轮】6.23-6.29 CareerCup 1.8

1.8 Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, s1 and s2, write code to check if s2 is a rotati ...

刷题 44 5314 sanguine 2014-9-8 00:23
【第三轮】6.16-6.22 CareerCup 1.7

1.7 Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.回复解法可以按照以下格式来Notice:1、 ...

刷题 42 5778 jby1797 2014-8-26 12:15
【第三轮】6.30-7.6 CareerCup 3.1

3.1 Describe how you could use a single array to implement three stacks.回复解法可以按照以下格式来Notice:1、记得在程序注释中表明自己算法的时间、 ...

刷题 25 3757 daisyang 2014-8-17 11:12
【第三轮】7.7-7.13 CareerCup 4.4

4.4 Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D,you'll have D lin ...

刷题 16 2864 jason51122 2014-7-27 12:02
【第三轮】7.7-7.13 CareerCup 4.3

4.3 Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.回复解法可以 ...

刷题 18 2933 tonygxxx1212 2014-7-19 22:20
【第三轮】7.7-7.13 CareerCup 4.2

4.2 Given a directed graph, design an algorithm to find out whether there is a route between two nodes.回复解法可以按照以下格式来Notice:1、记得在程 ...

attach_img
刷题 19 2697 tonygxxx1212 2014-7-19 22:12
【第三轮】7.7-7.13 CareerCup 3.7

3.7 An animal shelter holds only dogs and cats, and operates on a strictly "first in, first out" basis. People must adopt either the "oldest" (based on arrival ...

刷题 16 2841 renli3000 2014-7-14 04:17
【第三轮】6.30-7.6 CareerCup 3.6

3.6 Write a program to sort a stack in ascending order (with biggest items on top). You may use at most one additional stack to hold items, but you may not copy ...

attach_img
刷题 25 4070 renli3000 2014-7-14 03:17
【第三轮】6.30-7.6 CareerCup 3.5

3.5 Implement a MyQueue class which implements a queue using two stacks.回复解法可以按照以下格式来Notice:1、记得在程序注释中表明自己算法的时间、 ...

刷题 27 3721 renli3000 2014-7-14 02:09
【第三轮】6.30-7.6 CareerCup 3.4

3.4 In the classic problem of the Towers of Hanoi, you have 3 towers and Ndisks of different sizes which can slide onto any tower.The puzzle starts with disks s ...

刷题 23 3564 renli3000 2014-7-14 01:09
【第三轮】6.30-7.6 CareerCup 3.3

3.3 Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previo ...

刷题 20 3754 renli3000 2014-7-13 12:47
>
返回顶部