Commits

Branch selector

 master

User selector

All users

Datepicker

All time

Commit History

Commits on Jun 10, 2025

• Update AddBinary.java

  nandadong

  authored
  0bb57d1

  Copy full SHA for 0bb57d1

Commits on Nov 14, 2016

• Decent solution

  nandadong

  committed
  15e089c

  Copy full SHA for 15e089c

Commits on Sep 16, 2016

• mark, thinking of in and out degrees

  nandadong

  committed
  d7546c8

  Copy full SHA for d7546c8

Commits on Sep 15, 2016

• In place, O(n)

  nandadong

  committed
  0bf09f0

  Copy full SHA for 0bf09f0

• mark, think of the next number to be added, three conditions

  nandadong

  committed
  c86b55d

  Copy full SHA for c86b55d

• mark, clear thought of recursion

  nandadong

  committed
  43fe530

  Copy full SHA for 43fe530

Commits on Sep 14, 2016

• Recursive solution, trivial

  nandadong

  committed
  75f7aee

  Copy full SHA for 75f7aee

Commits on Sep 13, 2016

• without bit manipulation, need to redo

  nandadong

  committed
  ab8c56d

  Copy full SHA for ab8c56d

Commits on Sep 11, 2016

• Decode String, recursive solution, attention to different scenarios

  nandadong

  committed
  1610b2d

  Copy full SHA for 1610b2d

Commits on Sep 9, 2016

• two pointers, O(n)

  nandadong

  committed
  284bd5f

  Copy full SHA for 284bd5f

Commits on Sep 5, 2016

• mark, DP, bottom up same thought as fibonacci

  nandadong

  committed
  8d2b313

  Copy full SHA for 8d2b313

• Attention to duplicate elements, especially in the beginning

  nandadong

  committed
  de75643

  Copy full SHA for de75643

• Binary search to achieve O(logn)

  nandadong

  committed
  8eecedd

  Copy full SHA for 8eecedd

• mark, top-down then bottom up

  nandadong

  committed
  298a3c1

  Copy full SHA for 298a3c1

Commits on Sep 4, 2016

• Need to improve time complexity.

  nandadong

  committed
  37b73d4

  Copy full SHA for 37b73d4

Commits on Sep 2, 2016

• mark, use peekedElement to store next value

  nandadong

  committed
  c874d78

  Copy full SHA for c874d78

• O(m + n), similar thought as previous problem

  nandadong

  committed
  3044635

  Copy full SHA for 3044635

Commits on Sep 1, 2016

• mark, DP, use array to store partial values

  nandadong

  committed
  42c2b23

  Copy full SHA for 42c2b23

• mark, DP problem, move the low bar each time

  nandadong

  committed
  f6b42e9

  Copy full SHA for f6b42e9

• mark, understand the tree structure

  nandadong

  committed
  83ca4fa

  Copy full SHA for 83ca4fa

Commits on Aug 31, 2016

• Sort colors, two passes

  nandadong

  committed
  eceb3fc

  Copy full SHA for eceb3fc

• Use 2 bits to store next state on current position. Bit manipulation to realize in-place

  nandadong

  committed
  853aab4

  Copy full SHA for 853aab4

• In place method, transpose then flip

  nandadong

  committed
  4cd2400

  Copy full SHA for 4cd2400

• mark, DP, O(n^2) solution, further improve to O(nlogn) using binary search

  nandadong

  committed
  fcff450

  Copy full SHA for fcff450

Commits on Aug 30, 2016

• mark, similar to Ugly Number II, use an array to record current index of each prime number in ugly array, O(kn)

  nandadong

  committed
  c06e89e

  Copy full SHA for c06e89e

• mark, unclear with the problem description

  nandadong

  committed
  e6e6b3b

  Copy full SHA for e6e6b3b

Commits on Aug 28, 2016

• bit manipulation, xor

  nandadong

  committed
  f40ac64

  Copy full SHA for f40ac64

• mark, record using two integers, trick of if-else, attention to ==

  nandadong

  committed
  a556389

  Copy full SHA for a556389

Commits on Aug 27, 2016

• O(m+n), starting point matters

  nandadong

  committed
  7865a5f

  Copy full SHA for 7865a5f

• Recursive solution implementing combination

  nandadong

  committed
  0ab84e0

  Copy full SHA for 0ab84e0

• Spiral Matrix II, make clear of different conditions

  nandadong

  committed
  b6faccb

  Copy full SHA for b6faccb

Commits on Aug 26, 2016

• Valid perfect square without using sqrt()

  nandadong

  committed
  4526f20

  Copy full SHA for 4526f20

• Use stack to implement O(h) space

  nandadong

  committed
  6120466

  Copy full SHA for 6120466

• Recursive solution better than using queue to implement level order traversal. Think about priority.

  nandadong

  committed
  87125d4

  Copy full SHA for 87125d4

• mark, thought of level order traversal

  nandadong

  committed
  2ce8460

  Copy full SHA for 2ce8460

Pagination

Previous

Next