ketankr9/leetcode-solutions

Folders and files

Repository files navigation

leetcode-solutions

Solutions to leetcode problems.

Below is the helper functions/aliases used by me to seamlessly fetch new questions, code it in atom, test and submit solution.

cat .env.sh

#!/bin/bash
LLANG="java"
EDITOR="sublime-text.subl"
LEETCODE='/home/user/.local/bin/leetcode'
_yargs_completions()
{
 local cur_word args type_list
 cur_word="${COMP_WORDS[COMP_CWORD]}"
 args=("${COMP_WORDS[@]}")
 # ask yargs to generate completions.
 type_list=$(../.local/bin/leetcode --get-yargs-completions "${args[@]}")
 COMPREPLY=( $(compgen -W "${type_list}" -- ${cur_word}) )
 # if no match was found, fall back to filename completion
 if [ ${#COMPREPLY[@]} -eq 0 ]; then
 COMPREPLY=( $(compgen -f -- "${cur_word}" ) )
 fi
 return 0
}
complete -F _yargs_completions leetcode
###-end-leetcode-completions-###
alias lee="$LEETCODE"
alias leetcode="$LEETCODE"
alias list='$LEETCODE list'
#alias submit='leetcode submit'
#alias commit='leetcode submit'
#alias show='leetcode show'
alias view='$LEETCODE view'
#alias star='leetcode star'
alias stat='$LEETCODE stat'
function show {
 "$LEETCODE" show "$@";
 ls -t | head -n1 > .lastAttempt;
}
function run {
	ls -t | head -n1 > .lastAttempt;
	echo "$(cat .lastAttempt)";
	if [ -z "1ドル" ];then
		"$LEETCODE" run "$(cat .lastAttempt | tr -d '\n')";
	else
		"$LEETCODE" run "$(cat .lastAttempt | tr -d '\n')" -t "$@";
	fi
}
function commit {
	ls -t | head -n1 > .lastAttempt;
	echo "$(cat .lastAttempt)";
	"$LEETCODE" submit "$(cat .lastAttempt | tr -d '\n')";
}
function star {
 Q="$(cat .lastAttempt | tr -d '\n')";
	if [ -z "1ドル" ]; then
		"$LEETCODE" star $(echo -n "${Q%%.*}");
	elif [ "1ドル" = "del" ]; then
		"$LEETCODE" star $(echo -n "${Q%%.*}") -d;
 else
 "$LEETCODE" star "$@";
	fi
}
function fetch {
 if [ -z "1ドル" ]; then
 Q="$(cat .lastAttempt | tr -d '\n')";
		"$LEETCODE" submission $(echo -n "${Q%%.*}");
	else
 out=$("$LEETCODE" submission "1ドル");
 echo "$out";
 if [ "$(echo -n $out | awk '{ print $NF }')" != "submissions?" ]; then
 $($EDITOR "$(echo -n $out | awk '{ print $NF }')");
 fi
	fi
}
function solution {
	Q="$(cat .lastAttempt | tr -d '\n')";
 echo "######## Java ########";
 "$LEETCODE" show $(echo -n "${Q%%.*}") --solution -l java;
 echo "######## cpp ########";
 "$LEETCODE" show $(echo -n "${Q%%.*}") --solution -l cpp;
}
function resume {
 Q="$(cat .lastAttempt | tr -d '\n')";
 "$LEETCODE" show $(echo -n "${Q%%.*}");
 $($EDITOR "$(cat .lastAttempt | tr -d '\n')");
}
alias startt="xterm -geometry 45x21-0+0 termdown &";
function restartTimer {
 pkill -f termdown
 xterm -geometry 48x27-0+0 termdown &
 # pkill -f leetimer
 # ./.leetimer.sh &
}
function solve {
 if [ -z "1ドル" ]; then
 resume;
 elif [ -z "2ドル" ] && [ ! -z "$(ls | grep -i "^1ドル\.")" ]; then
 "$EDITOR" "$(ls | grep -i "^1ドル\." | head -n1)";
 else
 "$LEETCODE" show "1ドル" -gx -e "${EDITOR}" -q D -l ${LLANG};
 fi
 restartTimer;
}
export -f run
export -f commit
alias submit='commit'
export -f show
export -f star
export -f solution
export -f resume
export -f solve
alias up='ls -t | head -n1 > .lastAttempt'

About

Solutions to leetcode problems, only accepted answers are commited.

Releases

No releases published

Packages

No packages published

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

ketankr9/leetcode-solutions

Folders and files

Latest commit

History

Repository files navigation

leetcode-solutions

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 748 Commits
misc		misc
1.two-sum.191611980.ac.cpp		1.two-sum.191611980.ac.cpp
10.regular-expression-matching.cpp		10.regular-expression-matching.cpp
100.same-tree.java		100.same-tree.java
1008.construct-binary-search-tree-from-preorder-traversal.java		1008.construct-binary-search-tree-from-preorder-traversal.java
1010.pairs-of-songs-with-total-durations-divisible-by-60.cpp		1010.pairs-of-songs-with-total-durations-divisible-by-60.cpp
1011.capacity-to-ship-packages-within-d-days.cpp		1011.capacity-to-ship-packages-within-d-days.cpp
1013.partition-array-into-three-parts-with-equal-sum.cpp		1013.partition-array-into-three-parts-with-equal-sum.cpp
1015.smallest-integer-divisible-by-k.cpp		1015.smallest-integer-divisible-by-k.cpp
1016.binary-string-with-substrings-representing-1-to-n.cpp		1016.binary-string-with-substrings-representing-1-to-n.cpp
1017.convert-to-base-2.cpp		1017.convert-to-base-2.cpp
1018.binary-prefix-divisible-by-5.cpp		1018.binary-prefix-divisible-by-5.cpp
1019.next-greater-node-in-linked-list.cpp		1019.next-greater-node-in-linked-list.cpp
1020.number-of-enclaves.cpp		1020.number-of-enclaves.cpp
1022.sum-of-root-to-leaf-binary-numbers.java		1022.sum-of-root-to-leaf-binary-numbers.java
1024.video-stitching.cpp		1024.video-stitching.cpp
1025.divisor-game.0.cpp		1025.divisor-game.0.cpp
1025.divisor-game.cpp		1025.divisor-game.cpp
1026.maximum-difference-between-node-and-ancestor.cpp		1026.maximum-difference-between-node-and-ancestor.cpp
1027.longest-arithmetic-sequence.cpp		1027.longest-arithmetic-sequence.cpp
1030.matrix-cells-in-distance-order.java		1030.matrix-cells-in-distance-order.java
1031.maximum-sum-of-two-non-overlapping-subarrays.java		1031.maximum-sum-of-two-non-overlapping-subarrays.java
1033.moving-stones-until-consecutive.cpp		1033.moving-stones-until-consecutive.cpp
1034.coloring-a-border.cpp		1034.coloring-a-border.cpp
1038.binary-search-tree-to-greater-sum-tree.cpp		1038.binary-search-tree-to-greater-sum-tree.cpp
1039.minimum-score-triangulation-of-polygon.cpp		1039.minimum-score-triangulation-of-polygon.cpp
1041.robot-bounded-in-circle.cpp		1041.robot-bounded-in-circle.cpp
1043.partition-array-for-maximum-sum.0.cpp		1043.partition-array-for-maximum-sum.0.cpp
1043.partition-array-for-maximum-sum.cpp		1043.partition-array-for-maximum-sum.cpp
106.construct-binary-tree-from-inorder-and-postorder-traversal.cpp		106.construct-binary-tree-from-inorder-and-postorder-traversal.cpp
1073.adding-two-negabinary-numbers.cpp		1073.adding-two-negabinary-numbers.cpp
1073.adding-two-negabinary-numbers.java		1073.adding-two-negabinary-numbers.java
1074.number-of-submatrices-that-sum-to-target.cpp		1074.number-of-submatrices-that-sum-to-target.cpp
108.convert-sorted-array-to-binary-search-tree.cpp		108.convert-sorted-array-to-binary-search-tree.cpp
109.convert-sorted-list-to-binary-search-tree.cpp		109.convert-sorted-list-to-binary-search-tree.cpp
1092.shortest-common-supersequence.cpp		1092.shortest-common-supersequence.cpp
11.container-with-most-water.cpp		11.container-with-most-water.cpp
110.balanced-binary-tree.cpp		110.balanced-binary-tree.cpp
1105.filling-bookcase-shelves.java		1105.filling-bookcase-shelves.java
1109.corporate-flight-bookings.cpp		1109.corporate-flight-bookings.cpp
111.minimum-depth-of-binary-tree.cpp		111.minimum-depth-of-binary-tree.cpp
112.path-sum.cpp		112.path-sum.cpp
113.path-sum-ii.cpp		113.path-sum-ii.cpp
1130.minimum-cost-tree-from-leaf-values.cpp		1130.minimum-cost-tree-from-leaf-values.cpp
1131.maximum-of-absolute-value-expression.cpp		1131.maximum-of-absolute-value-expression.cpp
1143.longest-common-subsequence.cpp		1143.longest-common-subsequence.cpp
1157.online-majority-element-in-subarray.cpp		1157.online-majority-element-in-subarray.cpp
1162.as-far-from-land-as-possible.0.cpp		1162.as-far-from-land-as-possible.0.cpp
1162.as-far-from-land-as-possible.cpp		1162.as-far-from-land-as-possible.cpp
1163.last-substring-in-lexicographical-order.cpp		1163.last-substring-in-lexicographical-order.cpp
117.populating-next-right-pointers-in-each-node-ii.cpp		117.populating-next-right-pointers-in-each-node-ii.cpp
1186.maximum-subarray-sum-with-one-deletion.cpp		1186.maximum-subarray-sum-with-one-deletion.cpp
119.pascals-triangle-ii.cpp		119.pascals-triangle-ii.cpp
12.integer-to-roman.cpp		12.integer-to-roman.cpp
120.triangle.cpp		120.triangle.cpp
1201.ugly-number-iii.cpp		1201.ugly-number-iii.cpp
1202.smallest-string-with-swaps.cpp		1202.smallest-string-with-swaps.cpp
121.best-time-to-buy-and-sell-stock.cpp		121.best-time-to-buy-and-sell-stock.cpp
123.best-time-to-buy-and-sell-stock-iii.cpp		123.best-time-to-buy-and-sell-stock-iii.cpp
1234.replace-the-substring-for-balanced-string.cpp		1234.replace-the-substring-for-balanced-string.cpp
1235.maximum-profit-in-job-scheduling.cpp		1235.maximum-profit-in-job-scheduling.cpp
124.binary-tree-maximum-path-sum.cpp		124.binary-tree-maximum-path-sum.cpp
125.valid-palindrome.cpp		125.valid-palindrome.cpp
1261.find-elements-in-a-contaminated-binary-tree.java		1261.find-elements-in-a-contaminated-binary-tree.java
1266.minimum-time-visiting-all-points.cpp		1266.minimum-time-visiting-all-points.cpp
1267.count-servers-that-communicate.cpp		1267.count-servers-that-communicate.cpp
1268.search-suggestions-system.0.cpp		1268.search-suggestions-system.0.cpp
1268.search-suggestions-system.cpp		1268.search-suggestions-system.cpp
127.word-ladder.cpp		127.word-ladder.cpp
129.sum-root-to-leaf-numbers.cpp		129.sum-root-to-leaf-numbers.cpp
1290.convert-binary-number-in-a-linked-list-to-integer.java		1290.convert-binary-number-in-a-linked-list-to-integer.java
13.roman-to-integer.cpp		13.roman-to-integer.cpp
130.surrounded-regions.cpp		130.surrounded-regions.cpp
131.palindrome-partitioning.cpp		131.palindrome-partitioning.cpp
1311.get-watched-videos-by-your-friends.cpp		1311.get-watched-videos-by-your-friends.cpp
1311.get-watched-videos-by-your-friends.java		1311.get-watched-videos-by-your-friends.java
1312.minimum-insertion-steps-to-make-a-string-palindrome.java		1312.minimum-insertion-steps-to-make-a-string-palindrome.java
132.palindrome-partitioning-ii.cpp		132.palindrome-partitioning-ii.cpp
1320.minimum-distance-to-type-a-word-using-two-fingers.cpp		1320.minimum-distance-to-type-a-word-using-two-fingers.cpp
1325.delete-leaves-with-a-given-value.java		1325.delete-leaves-with-a-given-value.java
1326.minimum-number-of-taps-to-open-to-water-a-garden.java		1326.minimum-number-of-taps-to-open-to-water-a-garden.java
1328.break-a-palindrome.java		1328.break-a-palindrome.java
1329.sort-the-matrix-diagonally.java		1329.sort-the-matrix-diagonally.java
133.clone-graph.cpp		133.clone-graph.cpp
1331.rank-transform-of-an-array.cpp		1331.rank-transform-of-an-array.cpp
1332.remove-palindromic-subsequences.java		1332.remove-palindromic-subsequences.java
1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.java		1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.java
1337.the-k-weakest-rows-in-a-matrix.java		1337.the-k-weakest-rows-in-a-matrix.java
134.gas-station.cpp		134.gas-station.cpp
1342.number-of-steps-to-reduce-a-number-to-zero.cpp		1342.number-of-steps-to-reduce-a-number-to-zero.cpp
135.candy.cpp		135.candy.cpp
1359.count-all-valid-pickup-and-delivery-options.cpp		1359.count-all-valid-pickup-and-delivery-options.cpp
1361.validate-binary-tree-nodes.cpp		1361.validate-binary-tree-nodes.cpp
1362.closest-divisors.cpp		1362.closest-divisors.cpp
1363.largest-multiple-of-three.cpp		1363.largest-multiple-of-three.cpp
1365.how-many-numbers-are-smaller-than-the-current-number.cpp		1365.how-many-numbers-are-smaller-than-the-current-number.cpp
1366.rank-teams-by-votes.cpp		1366.rank-teams-by-votes.cpp
1367.linked-list-in-binary-tree.cpp		1367.linked-list-in-binary-tree.cpp
137.single-number-ii.cpp		137.single-number-ii.cpp
1373.maximum-sum-bst-in-binary-tree.cpp		1373.maximum-sum-bst-in-binary-tree.cpp

ketankr9/leetcode-solutions

Folders and files

Latest commit

History

Repository files navigation

leetcode-solutions

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages