-
Notifications
You must be signed in to change notification settings - Fork 0
/
vocab.txt
1940 lines (1940 loc) · 14.6 KB
/
vocab.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
of
number
to
a
in
the
minimum
array
maximum
with
sum
string
find
binary
tree
count
ii
and
make
k
two
all
from
longest
by
an
equal
after
numbers
smallest
largest
time
operations
strings
pairs
check
if
matrix
subarray
game
elements
list
path
valid
sorted
score
subsequence
nodes
value
difference
remove
substring
can
between
element
ways
integers
unique
grid
words
product
search
characters
integer
palindrome
that
given
substrings
subarrays
iii
for
consecutive
range
one
target
linked
cost
design
word
at
reverse
length
three
is
sort
most
each
digits
increasing
arrays
good
on
shortest
distance
or
into
node
convert
kth
points
xor
common
same
parentheses
merge
paths
delete
closest
traversal
than
queries
split
even
graph
subsequences
max
you
maximize
add
digit
partition
distinct
zero
total
divisible
order
square
minimize
average
n
groups
greater
i
row
moves
construct
odd
special
get
size
are
prefix
palindromic
duplicate
non-overlapping
circular
best
reach
permutation
replace
swaps
character
values
least
last
first
rectangle
bst
beautiful
frequency
ones
iv
sequence
be
index
absolute
group
adjacent
stone
letter
highest
jump
area
removing
function
repeating
2d
system
possible
people
divide
bitwise
positive
days
trees
rearrange
swap
right
steps
different
cells
stock
prime
query
sentence
preorder
random
water
sums
form
alternating
next
duplicates
decode
buy
students
intervals
stones
products
price
-
using
build
arithmetic
repeated
expression
column
city
occurrences
subsets
pair
position
matching
left
continuous
height
where
items
candies
sell
greatest
employee
latest
power
employees
triangle
within
indices
rank
set
rotated
balanced
print
move
triplets
dictionary
create
concatenation
letters
columns
network
missing
apply
bits
tasks
depth
lists
limit
k-th
rotate
pattern
partitioning
day
course
schedule
determine
data
ancestor
stack
who
x
reduce
times
squares
level
circle
point
less
stream
requests
frequent
top
as
vowels
similar
analysis
customer
robot
mountain
combination
subtree
bank
flips
queue
complete
balls
boxes
interval
happy
single
salary
flip
change
threshold
fibonacci
leaf
root
cards
friends
has
insert
lexicographically
contains
original
more
segments
line
second
super
have
calculate
food
table
base
probability
distribute
peak
intersection
bus
any
sequences
beauty
another
break
transform
calculator
cycle
implement
adding
box
magic
maximal
generate
no
zeroes
vowel
subset
file
full
finish
rectangles
iterator
destination
coins
covered
containing
without
removals
nesting
leaves
nth
nice
zeros
color
deletions
n-ary
lexicographical
rooms
house
servers
1
differences
equivalent
domino
competition
ranges
strictly
winner
zigzag
middle
median
image
perfect
discount
diagonal
events
reorder
orders
balloons
amount
seat
parts
permutations
multiple
lowest
exactly
candy
self
finding
sliding
spiral
lower
min
players
car
place
negative
evaluate
match
di
factorial
before
ugly
deleting
key
chessboard
visited
transactions
not
routes
m
detect
factors
fair
rows
pick
person
critical
deepest
visible
submatrices
divisors
postorder
collect
bit
colored
sorting
obtain
pieces
calendar
my
falling
validate
3sum
whose
checker
scores
colors
users
equals
date
pickup
edges
sales
department
robber
divisor
task
anagrams
shuffle
flatten
sign
neighbors
distances
inside
out
counter
richest
take
cut
temperature
side
conditions
arrangement
2
addition
pivot
meeting
1's
reformat
operation
large
island
building
reconstruct
student
tickets
needed
replacement
exists
window
genetic
vertical
5
powers
lines
teams
money
children
insertion
decrypt
their
exam
percentage
open
process
english
up
guess
there
flipping
roads
land
its
counts
capital
puzzle
through
components
perimeter
escape
phone
combinations
width
container
divisibility
knight
removed
bounded
compare
weight
multiplication
invalid
eat
alternately
occurrence
reachable
recover
increment
instructions
frog
levels
fall
type
ip
restore
removal
excel
sheet
representation
spaces
simulation
rounds
equation
keep
averages
stops
coordinate
factor
white
tiles
shapes
3d
regions
parser
cache
parity
cousins
arrive
splitting
case
majority
obtained
names
degree
smaller
delivery
immutable
hidden
covering
basic
trips
suffix
daily
based
online
hamming
manager
islands
anagram
win
company
summary
scheduling
tiling
calls
garden
rotations
replacing
segment
hand
keyboard
rising
long
scheduler
alphabet
some
video
spread
malware
cherry
connected
object
wasted
space
year
friend
rotating
3
making
non-decreasing
slices
attended
work
inorder
quality
four
nested
final
board
uncommon
team
apples
sub-arrays
edge
fraction
keys
profit
roman
strange
printer
will
encoded
room
twice
cross
coloring
bad
version
positions
sets
result
log
restaurant
burst
importance
doubled
bridge
overlap
crossing
managers
budget
store
roll
machine
per
vi
condition
visiting
message
1d
running
customers
text
higher
separate
triples
local
directed
ascending
flowers
ladder
courses
parallel
boolean
wiggle
monotone
together
spent
unequal
gap
trailing
triplet
counting
lucky
concatenated
shifting
traverse
disjoint
when
play
sequential
solving
bloom
race
cookies
stamping
oranges
vii
record
attendance
avoid
flood
shop
connection
redundant
watering
plants
n-queens
cat
mouse
decreasing
secret
changing
increments
addresses
rotation
code
polygon
stairs
climbing
walking
optimal
operators
bags
non-negative
found
fizz
buzz
only
according
tracker
sentences
magical
4sum
nearest
maze
promise
pascal's
rating
complement
memory
title
favorite
information
strong
password
required
bulb
switcher
painting
every
pass
gcd
obstacle
biggest
star
furthest
houses
filter
clone
fruits
bonus
populating
pointers
assign
elimination
fill
period
problem
skyline
connect
impossible
earliest
double
capacity
json
k-sum
memoize
earn
limited
serialize
deserialize
trapping
rain
hire
workers
relative
append
profitable
rearranging
cities
temperatures
completeness
sold
lcp
both
travellers
naming
account
deletion
spanning
pseudo-critical
rule
132
shift
dartboard
darts
bottom
streak
watch
subtracting
amounts
third
turbulent
plank
moment
ants
marking
comparisons
pile
gifts
negations
service
centre
initial
energy
handled
slashes
tromino
foobar
taps
label
sub-tree
appropriate
ages
k-increasing
entering
wraparound
deque
diff
step
equations
satisfiability
equality
poker
decoded
view
component
carpets
over
pressed
name
atoms
k-diff
mapping
uploaded
subpath
stay
stitching
referee
wealth
edits
powerful
far
trio
class
instance
clumsy
deck
kind
pyramid
transition
summing
resizing
unsorted
prison
reordered
beans
marked
composition
immediate
zero-filled
n)
pow(x,
remapping
projection
ii:
cyclically
deci-binary
communicate
even-valued
grandparent
archery
floored
01
multiply
units
ideal
restricted
egg
floors
drop
event
stacks
job
cuts
report
clock
subtraction
disconnect
safe
custom
overlapping
chunks
moving
until
appear
h-index
input
paint
getrandom
o(1)
xored
fancy
return
origin
plus
fleet
forest
cars
whether
ordered
structure
prefixes
prices
partitions
call
emails
concatenating
hands
satisfy
which
map
formed
v
quadruplets
applying
balance
performing
visit
it
great
collisions
coin
chain
division
transpose
selling
labels
bag
compression
sudoku
movie
pizza
subtrees
jumps
contiguous
your
fixed
address
objects
frogs
croaking
rearranged
bars
cream
ice
chalk
60
songs
durations
quad
cuboids
stacking
mutation
tables
combine
others
still