Nth to Last Node in List
Problem
Find the nth to last element of a singly linked list.
The minimum number of nodes in list is n.
Example
Given a List 3->2->1->5->null and n = 2, return node whose value is 1.
Interview
Sponsored: Coursera
Problems
3sum-closest
3sum
4sum
acm-icpc-team
add-binary
add-digits
add-two-numbers
alternating-characters
anagrams
angry-children
backpack-ii
backpack
balanced-binary-tree
balanced-lineup
best-time-to-buy-and-sell-stock-ii
best-time-to-buy-and-sell-stock-iii
best-time-to-buy-and-sell-stock
binary-representation
binary-search-tree-iterator
binary-tree-inorder-traversal
binary-tree-level-order-traversal-ii
binary-tree-level-order-traversal
binary-tree-maximum-path-sum
binary-tree-path-sum
binary-tree-paths
binary-tree-postorder-traversal
binary-tree-preorder-traversal
binary-tree-zigzag-level-order-traversal
candy
chocolate-feast
circular-array-rotation
climbing-stairs
clone-binary-tree
clone-graph
coins-in-a-line
combination-sum-ii
combination-sum-iv
combination-sum
combinations
compare-strings
construct-binary-tree-from-inorder-and-postorder-traversal
construct-binary-tree-from-preorder-and-inorder-traversal
container-with-most-water
continuous-subarray-sum
convert-binary-search-tree-to-sorted-doubly-linked-list
convert-sorted-array-to-binary-search-tree-with-minimal-height
convert-sorted-list-to-balanced-bst
copy-list-with-random-pointer
cosine-similarity
count-1-in-binary
count-and-say
data-stream-median
decode-ways
delete-digits
delete-node-in-the-middle-of-singly-linked-list
design-add-and-search-words-data-structure
distinct-subsequences
edit-distance
evaluate-reverse-polish-notation
fast-power
fibonacci
filling-jars
find-digits
find-minimum-in-rotated-sorted-array-ii
find-minimum-in-rotated-sorted-array
find-peak-element
find-the-missing-number
first-bad-version
first-missing-positive
first-position-of-target
fizz-buzz
flatten-binary-tree-to-linked-list
flatten-list
flip-bits
flipping-bits
game-of-thrones
gas-station
generate-parentheses
graph-valid-tree
gray-code
halloween-party
happy-number
hash-function
heapify
house-robber-ii
house-robber-iii
house-robber
implement-queue-by-two-stacks
implement-strstr
implement-trie-prefix-tree
insert-interval
insert-node-in-a-binary-search-tree
insertion-sort-list
integer-to-roman
interleaving-positive-and-negative-numbers
interleaving-string
intersection-of-two-arrays-ii
intersection-of-two-arrays
intersection-of-two-linked-lists
interval-minimum-number
interval-sum
invert-binary-tree
is-fibo
jump-game-ii
jump-game
kth-largest-element
kth-smallest-number-in-sorted-matrix
largest-number
left-pad
length-of-last-word
letter-combinations-of-a-phone-number
linked-list-cycle-ii
linked-list-cycle
lonely-integer
longest-common-prefix
longest-common-subsequence
longest-common-substring
longest-consecutive-sequence
longest-increasing-continuous-subsequence
longest-increasing-subsequence
longest-palindromic-substring
longest-substring-without-repeating-characters
longest-words
lowest-common-ancestor-of-a-binary-tree
lru-cache
manasa-and-stones
majority-number
majority-number-ii
majority-number-iii
matrix-zigzag-traversal
max-points-on-a-line
maximizing-xor
maximum-depth-of-binary-tree
maximum-product-subarray
maximum-subarray-difference
maximum-subarray-ii
maximum-subarray
median
merge-intervals
merge-k-sorted-lists
merge-sorted-array
merge-two-sorted-arrays
merge-two-sorted-lists
min-stack
minimum-adjustment-cost
minimum-depth-of-binary-tree
minimum-path-sum
minimum-size-subarray-sum
minimum-subarray
mock-hanoi-tower-by-stacks
move-zeroes
n-queens-ii
n-queens
next-permutation
nth-to-last-node-in-list
number-of-airplanes-in-the-sky
number-of-islands
o1-check-power-of-2
paint-fence
paint-house
palindrome-linked-list
palindrome-partitioning
partition-array-by-odd-and-even
partition-array
partition-list
patching-array
permutation-index
permutation-sequence
permutations-ii
permutations
plus-one
powx-n
previous-permutation
print-numbers-by-recursion
product-of-array-exclude-itself
recover-rotated-sorted-array
rehashing
remove-duplicates-from-sorted-array-ii
remove-duplicates-from-sorted-array
remove-duplicates-from-sorted-list-ii
remove-duplicates-from-sorted-list
remove-element
remove-linked-list-elements
remove-node-in-binary-search-tree
remove-nth-node-from-end-of-list
reorder-list
repeated-dna-sequences
restore-ip-addresses
reverse-integer
reverse-linked-list-ii
reverse-linked-list
reverse-nodes-in-k-group
reverse-pairs
reverse-words-in-a-string
roman-to-integer
rotate-array
rotate-image
rotate-list
rotate-string
route-between-two-nodes-in-graph
same-tree
search-a-2d-matrix-ii
search-a-2d-matrix
search-for-a-range
search-in-rotated-sorted-array-ii
search-in-rotated-sorted-array
search-insert-position
search-range-in-binary-search-tree
segment-tree-build-ii
segment-tree-build
segment-tree-modify
segment-tree-query-ii
segment-tree-query
serialize-and-deserialize-binary-tree
set-matrix-zeroes
shape-factory
sherlock-and-gcd
sherlock-and-permutations
sherlock-and-squares
sherlock-and-the-beast
shortest-unique-prefix
simplify-path
single-number-ii
single-number-iii
single-number
singleton
sort-colors-ii
sort-colors
sort-integers-ii
sort-integers
sort-letters-by-case
sort-list
space-replacement
spiral-matrix-ii
spiral-matrix
sqrtx
string-permutation
subarray-sum
subsets-ii
subsets
subtree
sum-of-two-integers
super-ugly-number
surrounded-regions
swap-nodes-in-pairs
swap-two-nodes-in-linked-list
symmetric-tree
the-love-letter-mystery
the-quickest-way-up
the-skyline-problem
the-smallest-difference
topological-sorting
toy-factory
trailing-zeros
trapping-rain-water
triangle
two-strings-are-anagrams
two-sum
ugly-number-ii
ugly-number
unbounded-knapsack
unique-binary-search-trees-ii
unique-binary-search-trees
unique-characters
unique-paths-ii
unique-paths
update-bits
utopian-tree
valid-palindrome
valid-parentheses
valid-sudoku
validate-binary-search-tree
wiggle-sort
wood-cut
word-break-ii
word-break
word-count-map-reduce
word-ladder-ii
word-ladder
word-search