Files

Graphs
alien-dictionary
all-nodes-distance-k-in-binary-tree
all-paths-from-source-to-target
angle-between-hands-of-a-clock
asteroid-collision
balanced-binary-tree
basic-calculator-ii
best-time-to-buy-and-sell-stock
binary-tree-maximum-path-sum
binary-tree-right-side-view
binary-tree-vertical-order-traversal
binary-tree-zigzag-level-order-traversal
boundary-of-binary-tree
buildings-with-an-ocean-view
candy
capacity-to-ship-packages-within-d-days
climbing-stairs
clone-binary-tree-with-random-pointer
coin-change-2
coin-change
combination-sum
concatenated-words
construct-binary-tree-from-preorder-and-inorder-traversal
contains-duplicate
continuous-subarray-sum
copy-list-with-random-pointer
course-schedule-ii
course-schedule
daily-temperatures
decode-ways
diameter-of-binary-tree
divide-chocolate
edit-distance
factorial-trailing-zeroes
fibonacci-number
find-all-anagrams-in-a-string
find-distance-in-a-binary-tree
find-first-and-last-position-of-element-in-sorted-array
find-nearest-right-node-in-binary-tree
find-the-celebrity
first-bad-version
flatten-binary-tree-to-linked-list
gas-station
graph-valid-tree
group-anagrams
group-shifted-strings
h-index
house-robber-iii
insert-delete-getrandom-o1
insert-into-a-sorted-circular-linked-list
intersection-of-two-linked-lists
is-graph-bipartite
k-closest-points-to-origin
k-concatenation-maximum-sum
kth-missing-positive-number
kth-smallest-element-in-a-bst
letter-combinations-of-a-phone-number
logger-rate-limiter
longest-common-subsequence
longest-increasing-subsequence
longest-palindromic-subsequence
longest-substring-with-at-most-k-distinct-characters
longest-substring-with-at-most-two-distinct-characters
longest-substring-without-repeating-characters
lowest-common-ancestor-of-a-binary-search-tree
lru-cache
max-consecutive-ones-iii
maximum-difference-between-node-and-ancestor
maximum-length-of-repeated-subarray
maximum-subarray
meeting-rooms-ii
merge-two-sorted-lists
min-cost-climbing-stairs
minimum-add-to-make-parentheses-valid
minimum-height-trees
minimum-path-sum
n-th-tribonacci-number
number-of-islands
number-of-longest-increasing-subsequence
odd-even-linked-list
partition-labels
path-sum-ii
path-sum-iii
path-sum
path-with-minimum-effort
permutations
populating-next-right-pointers-in-each-node-ii
populating-next-right-pointers-in-each-node
pseudo-palindromic-paths-in-a-binary-tree
queue-reconstruction-by-height
range-sum-of-bst
range-sum-query-mutable
remove-nth-node-from-end-of-list
- README.md
- remove-nth-node-from-end-of-list.cpp
reverse-linked-list
reverse-nodes-in-k-group
robot-bounded-in-circle
rotate-image
rotting-oranges
search-in-rotated-sorted-array
search-insert-position
search-suggestions-system
serialize-and-deserialize-binary-tree
serialize-and-deserialize-n-ary-tree
set-matrix-zeroes
single-element-in-a-sorted-array
sliding-window-maximum
sort-list
sort-transformed-array
split-array-largest-sum
stepping-numbers
strobogrammatic-number-ii
students-with-invalid-departments
subsets
sudoku-solver
sum-root-to-leaf-numbers
the-maze
trapping-rain-water
valid-sudoku
validate-binary-search-tree
word-break
word-search-ii
132-pattern.cpp
README.md
alien-dictionary.cpp
asteroid-collision.cpp
best-time-to-buy-and-sell-stock-ii.cpp
best-time-to-buy-and-sell-stock-iii.cpp
best-time-to-buy-and-sell-stock-iv.cpp
best-time-to-buy-and-sell-stock-with-transaction-fee.cpp
best-time-to-buy-and-sell-stock.cpp
binary-search-tree-to-greater-sum-tree.cpp
binary-tree-right-side-view.cpp
boundary-of-binary-tree.cpp
convert-sorted-array-to-binary-search-tree.cpp
daily-temperatures.cpp
design-add-and-search-words-data-structure.cpp
diameter-of-binary-tree.cpp
find-all-anagrams-in-a-string.cpp
find-median-from-data-stream.cpp
first-unique-number.cpp
flatten-a-multilevel-doubly-linked-list.cpp
gas-station.cpp
implement-trie-prefix-tree.cpp
is-graph-bipartite.cpp
jump-game-ii.cpp
jump-game.cpp
kth-ancestor-of-a-tree-node.cpp
kth-largest-element-in-an-array.cpp
kth-smallest-element-in-a-sorted-matrix.cpp
largest-rectangle-in-histogram.cpp
lfu-cache.cpp
lru-cache.cpp
maximum-xor-of-two-numbers-in-an-array.cpp
minimum-cost-to-connect-sticks.cpp
minimum-swaps-to-group-all-1s-together.cpp
next-permutation.cpp
online-stock-span.cpp
remove-all-adjacent-duplicates-in-string-ii.cpp
reverse-linked-list.cpp
search-in-rotated-sorted-array.cpp
single-element-in-a-sorted-array.cpp
sliding-window-maximum.cpp
trapping-rain-water.cpp
walls-and-gates.cpp
word-break.cpp
word-search.cpp

remove-nth-node-from-end-of-list

Dec 16, 2020

8406542 · Dec 16, 2020

Name	Name	Last commit message	Last commit date
parent directory ..
README.md	README.md	Create README - LeetHub	Dec 16, 2020
remove-nth-node-from-end-of-list.cpp	remove-nth-node-from-end-of-list.cpp	working commit - Created using LeetHub	Dec 6, 2020

README.md

19. Remove Nth Node From End of List

Medium

Given the head of a linked list, remove the n^th node from the end of the list and return its head.

Follow up: Could you do this in one pass?

Example 1:

Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]

Example 2:

Input: head = [1], n = 1
Output: []

Example 3:

Input: head = [1,2], n = 1
Output: [1]

Constraints:

The number of nodes in the list is sz.
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

remove-nth-node-from-end-of-list

remove-nth-node-from-end-of-list

README.md

19. Remove Nth Node From End of List

Medium

Files

remove-nth-node-from-end-of-list

Directory actions

More options

Directory actions

More options

Latest commit

History

remove-nth-node-from-end-of-list

Folders and files

parent directory

README.md

19. Remove Nth Node From End of List

Medium