LATEST POSTS

CareerCup-4.1

Implement a function to check if a tree is balanced For the purposes of this question.

CareerCup-3.5

Implement a MyQueue class which implements a queue using two stacks.

CareerCup-3.3

Implement a function popAt(int index) which performs a pop operation on a specific sub-stack.

CareerCup-3.2

栈中最小元素。微软实习生一面就遇到了这个问题。

CareerCup-3.1

Describe how you could use a single array to implement three stacks.

CareerCup-2.5

Given a circular linked list, implement an algorithm which returns node at the beginning of the loop.

CareerCup-2.4

Write a function that adds the two numbers and returns the sum as a linked list.

CareerCup-2.3

Implement an algorithm to delete a node in the middle of a single linked, given only access to that node.

CareerCup-2.2

Implement an algorithm to find the nth to last element of a singly linked list

CareerCup-1.8

Assume you have a method isSubstring which checks if one word is a substring of another.

CareerCup-1.7

Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0.

CareerCup-1.6

Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees Can you do this in place?

CareerCup-1.3

Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer.