SerenaJing

BOCExchange

bubble-sort

Select the maximum and minimum value

Climbing-Stairs

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

create-list

Each element in the positive integer sequence Q is at least divisible by one of the positive integers a and b

find-number

Find the value in an array of ordered lists.

Maximum-Depth-of-Binary-Tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children.

modify-string

There is a string of uppercase and lower need to modify

NoRepeat

It is applied on 2D array by JS lanaguage .

pythonExam

考试

random-number

Given a function that randomly generates integers 1 to 5, write a function that randomly generates integers 1 to 7

SerenaJing/BOCExchange

SerenaJing/bubble-sort

Select the maximum and minimum value

SerenaJing/Climbing-Stairs

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

SerenaJing/create-list

Each element in the positive integer sequence Q is at least divisible by one of the positive integers a and b

SerenaJing/find-number

Find the value in an array of ordered lists.

SerenaJing/Maximum-Depth-of-Binary-Tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children.

SerenaJing/modify-string

There is a string of uppercase and lower need to modify

SerenaJing/NoRepeat

It is applied on 2D array by JS lanaguage .

SerenaJing/pythonExam

考试

SerenaJing/random-number

Given a function that randomly generates integers 1 to 5, write a function that randomly generates integers 1 to 7

SerenaJing/Same-Tree

Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

SerenaJing/Single-Number

Given a non-empty array of integers, every element appears twice except for one. Find that single one.

SerenaJing/sort-string

There is a string of uppercase and lower need to modify

SerenaJing/Symmetric-Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following [1,2,2,null,3,null,3] is not: 1 / \ 2 2 \ \ 3 3 Note: Bonus points if you could solve it both recursively and iteratively.

SerenaJing/WebStudy