├── .idea ├── codeStyles │ └── codeStyleConfig.xml ├── hacker-rank.iml ├── modules.xml ├── vcs.xml └── workspace.xml ├── 2DArray-DS ├── 2darray.py ├── Screen Shot 2019-02-11 at 10.31.21.png └── readme.md ├── Alterra ├── max_dif.py └── subString.py ├── Birthday Chocolate └── BirthdayChocolate.py ├── BonAppetit ├── bonApp.py └── readme.md ├── CatsAndMouses ├── CatMouse.py └── readme.md ├── CountingValleys ├── countingValleys.py └── readme.md ├── Diamond form └── text_allignment.py ├── DrawingBook └── drawBook.py ├── Duplicated_Products ├── DuplicatedProducts.js ├── DuplicatedProducts.py └── readme.md ├── ElectronicShop ├── ElecShop.py └── readme.md ├── EqualizeTheArray ├── EqArr.py └── readme.md ├── IOLightningForm ├── IO lightning pattern.png ├── IOLight.py └── readme.md ├── Idemia ├── contested.py ├── divers.py ├── input.txt ├── input_puz.txt ├── inputc.txt ├── permut.py ├── test.txt ├── testx.txt └── word_puz.py ├── Javascript ├── count_items_loop_in_array.js └── remove_duplicates_in_array.js ├── JumpingOnTheCloud ├── jumpCloud.py └── readme.md ├── LeftRotation ├── leftRot.py └── readme.md ├── MinimumSwaps ├── minSwaps.py └── readme.md ├── NewYearChaos ├── NewYearChaos.py └── readme.md ├── Pallindrome ├── pallindrome.py └── readme.md ├── PythonCertified ├── EncryptMsg │ ├── chiper.py │ └── readme.md ├── Sudoku │ ├── readme.md │ └── sudoku.py ├── anagrams │ ├── anagrams.py │ └── readme.md ├── err_exc.py ├── file │ ├── fdata.py │ └── tes.txt └── led │ ├── led.py │ └── readme.md ├── README.md ├── RepeatedString ├── RepStr.py └── readme.md ├── RollTheStrings ├── readme.md └── rollStrings.py ├── SockMerchant ├── SockMerchant.py ├── readme.md └── sockMerchant.js ├── TuringTest ├── exam.py ├── listmax.js ├── listmax.py ├── max_num.py ├── pallindrom.js └── pallindrom.py ├── UtopianTree ├── readme.md └── utopTree.py ├── array-left-rotation ├── array-left-rotation-English.pdf └── array-left-rotation.js ├── itemku ├── README.md ├── q1_chat.js ├── q2_moba.js └── q3_key.js └── k-Difference ├── kDiff.py └── readme.md /.idea/codeStyles/codeStyleConfig.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 5 | -------------------------------------------------------------------------------- /.idea/hacker-rank.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /.idea/modules.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /.idea/vcs.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /.idea/workspace.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 10 | 11 | 13 | 14 | 15 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 1603094814523 30 | 35 | 36 | 37 | 38 | 40 | -------------------------------------------------------------------------------- /2DArray-DS/2darray.py: -------------------------------------------------------------------------------- 1 | def hourglassSum(arr): 2 | x = [] 3 | y = [] 4 | z = [] 5 | r = [] 6 | for _ in range(4): 7 | for a in range(4): 8 | x.append([arr[_][a], arr[_][a+1], arr[_][a+2]]) 9 | y.append(arr[_+1][a+1]) 10 | z.append([arr[_+2][a], arr[_+2][a+1], arr[_+2][a+2]]) 11 | 12 | for a, b, c in zip(x, y, z): 13 | r.append(sum(a)+b+sum(c)) 14 | 15 | mh = r.index(max(r)) 16 | 17 | ## print the hourglass form, the highest sum will marked with red color 18 | print('\nThe hourglass form (the red mark is the highest sum of hourglass value):') 19 | for _ in range(4): 20 | n = 4 * (_+1) 21 | for _ in range((n-4), n): 22 | if _ == mh: 23 | print('\033[1;37;41m' + str(x[_][0]), x[_][1], x[_][2], end='\t') 24 | else: 25 | print('\033[0;37;40m' + str(x[_][0]), x[_][1], x[_][2], end='\t') 26 | print('') 27 | for _ in range((n-4), n): 28 | if _ == mh: 29 | print('\033[1;37;41m' + ' ', y[_], ' ', end='\t') 30 | else: 31 | print('\033[0;37;40m' + ' ', y[_], ' ', end='\t') 32 | print('') 33 | for _ in range((n-4), n): 34 | if _ == mh: 35 | print('\033[1;37;41m' + str(z[_][0]), z[_][1], z[_][2], end='\t') 36 | else: 37 | print('\033[0;37;40m' + str(z[_][0]), z[_][1], z[_][2], end='\t') 38 | print('\n') 39 | 40 | ## print the number of the largest hourglass sum 41 | print('\nthe largest (maximum) hourglass sum :', max(r)) 42 | 43 | 44 | 45 | ## test 46 | arr = [[1, 1, 1, 0, 0, 0], 47 | [0, 1, 0, 0, 0, 0], 48 | [1, 1, 1, 0, 0, 0], 49 | [0, 0, 2, 4, 4, 0], 50 | [0, 0, 0, 2, 0, 0], 51 | [0, 0, 1, 2, 4, 0]] 52 | hourglassSum(arr) -------------------------------------------------------------------------------- /2DArray-DS/Screen Shot 2019-02-11 at 10.31.21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/michaelwp/hacker-rank/c94cf418376f0ad04b8c1f531e089bb84bf7453d/2DArray-DS/Screen Shot 2019-02-11 at 10.31.21.png -------------------------------------------------------------------------------- /2DArray-DS/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | Given a *6 X 6* 2D Array, *arr*: 3 | ``` 4 | 1 1 1 0 0 0 5 | 0 1 0 0 0 0 6 | 1 1 1 0 0 0 7 | 0 0 0 0 0 0 8 | 0 0 0 0 0 0 9 | 0 0 0 0 0 0 10 | ``` 11 | We define an hourglass in *A* to be a subset of values with indices falling in this pattern in *arr*'s graphical representation: 12 | ``` 13 | a b c 14 | d 15 | e f g 16 | ``` 17 | There are *16* hourglasses in *arr*, and an hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in *arr*, then print the maximum hourglass sum. 18 | For example, given the 2D array: 19 | ``` 20 | arr = [[1, 1, 1, 0, 0, 0], 21 | [0, 1, 0, 0, 0, 0], 22 | [1, 1, 1, 0, 0, 0], 23 | [0, 0, 2, 4, 4, 0], 24 | [0, 0, 0, 2, 0, 0], 25 | [0, 0, 1, 2, 4, 0]] 26 | ``` 27 | The hourglass form be like this: 28 | ``` 29 | 1 1 1 1 1 0 1 0 0 0 0 0 30 | 1 0 0 0 31 | 1 1 1 1 1 0 1 0 0 0 0 0 32 | 33 | 0 1 0 1 0 0 0 0 0 0 0 0 34 | 1 1 0 0 35 | 0 0 2 0 2 4 2 4 4 4 4 0 36 | 37 | 1 1 1 1 1 0 1 0 0 0 0 0 38 | 0 2 4 4 39 | 0 0 0 0 0 2 0 2 0 2 0 0 40 | 41 | 0 0 2 0 2 4 2 4 4 4 4 0 42 | 0 0 2 0 43 | 0 0 1 0 1 2 1 2 4 2 4 0 44 | ``` 45 | We sum each the *16* hourglass values: 46 | ``` 47 | [7, 4, 2, 0, 48 | 4, 8, 10, 8, 49 | 3, 6, 7, 6, 50 | 3, 9, 19, 14] 51 | ``` 52 | *19* is the highest sum of hourglass values, which is the *15th* hourgless: 53 | ``` 54 | 2 4 4 55 | 2 56 | 1 2 4 57 | ``` 58 | ## Input Format 59 | Each of the *6* lines of inputs *arr[i]* contains *6* space-separated integers *arr[i][j]*. 60 | 61 | ## Output Format 62 | Print the largest (maximum) hourglass sum found in *arr*. 63 | 64 | ![2Darray ss output](https://github.com/kei-001/practice/blob/master/2DArray-DS/Screen%20Shot%202019-02-11%20at%2010.31.21.png) -------------------------------------------------------------------------------- /Alterra/max_dif.py: -------------------------------------------------------------------------------- 1 | def maxDifference(a): 2 | x = [] 3 | for _ in range(len(a)): 4 | for n in range(_): 5 | if (a[_] > a[n]) and (a[n] < 0): 6 | x.append(a[_] + a[n]) 7 | elif (a[_] > a[n]): 8 | x.append(a[_] - a[n]) 9 | else: 10 | x.append(-1) 11 | 12 | return(max(x)) 13 | 14 | a = [10, 0, 9, 6, 5] 15 | print(maxDifference(a)) -------------------------------------------------------------------------------- /Alterra/subString.py: -------------------------------------------------------------------------------- 1 | def substringCalculator(s): 2 | r = [] 3 | for _ in range(len(s)): 4 | for a in range(len(s)): 5 | x = s[_:len(s)-a] 6 | if x == '' or x in r: 7 | continue 8 | r.append(x) 9 | 10 | return(len(r)) 11 | 12 | print(substringCalculator('kincenvizh')); -------------------------------------------------------------------------------- /Birthday Chocolate/BirthdayChocolate.py: -------------------------------------------------------------------------------- 1 | def birthday(s, d, m): 2 | x = 0 3 | r = len(s)-(m-1) 4 | 5 | for _ in range(r): 6 | if (sum(s[_:m+_])) == d : 7 | x += 1 8 | return x 9 | 10 | 11 | d = 18 12 | s = [2, 5, 1, 3, 4, 4, 3, 5, 1, 1, 2, 1, 4, 1, 3, 3, 4, 2, 1] 13 | m = 7 14 | print (birthday(s, d, m)) -------------------------------------------------------------------------------- /BonAppetit/bonApp.py: -------------------------------------------------------------------------------- 1 | def bonAppetit(bill, k, b): 2 | blx = 0 3 | for _ in bill: 4 | blx += _ 5 | 6 | an = ((blx - bill[k])/2) 7 | r = (b - an) 8 | 9 | if r > 0: 10 | print(round(r)) 11 | else: 12 | print('Bon Appetit') 13 | 14 | 15 | ## test 16 | bill = [3, 10, 2, 9] 17 | k = 1 18 | b = 12 19 | bonAppetit(bill, k, b) -------------------------------------------------------------------------------- /BonAppetit/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | Anna and Brian are sharing a meal at a restuarant and they agree to split the bill equally. Brian wants to order something that Anna is allergic to though, and they agree that Anna won't pay for that item. Brian gets the check and calculates Anna's portion. You must determine if his calculation is correct. 3 | For example, assume the bill has the following prices: *bill = [2, 4, 6]*. Anna declines to eat item *k = bill[2]* which costs *6*. If Brian calculates the bill correctly, Anna will pay *(2 + 4) / 2) = 3*. If he includes the cost of *bill[2]*, he will calculate *(2 + 4 + 6) / 2) = 6*. In the second case, he should refund *3* to Anna. 4 | 5 | ## Output Description 6 | It should print Bon Appetit if the bill is fairly split. Otherwise, it should print the integer amount of money that Brian owes Anna. 7 | bonAppetit has the following parameter(s): 8 | - bill: an array of integers representing the cost of each item ordered 9 | - k: an integer representing the zero-based index of the item Anna doesn't eat 10 | - b: the amount of money that Anna contributed to the bill 11 | 12 | -------------------------------------------------------------------------------- /CatsAndMouses/CatMouse.py: -------------------------------------------------------------------------------- 1 | import random 2 | def catAndMouse(x, y, z): 3 | a = abs(z - x) 4 | b = abs(z - y) 5 | if a < b : 6 | return('Cat A') 7 | elif b < a: 8 | return('Cat B') 9 | elif a == b: 10 | return('Mouse C') 11 | 12 | ##test 13 | q = random.randint(1, 100) 14 | for _ in range(q): 15 | x, y, z = random.randint(1,100), random.randint(1,100), random.randint(1,100) 16 | print(catAndMouse(x, y, z)) -------------------------------------------------------------------------------- /CatsAndMouses/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | Two cats and a mouse are at various positions on a line. You will be given their starting positions. Your task is to determine which cat will reach the mouse first, assuming the mouse doesn't move and the cats travel at equal speed. If the cats arrive at the same time, the mouse will be allowed to move and it will escape while they fight. 3 | You are given *q* queries in the form of *x*, *y*, and *z* representing the respective positions for cats *A* and *B*, and for mouse *C*. 4 | 5 | - If cat *A* catches the mouse first, print **Cat A**. 6 | - If cat *B* catches the mouse first, print **Cat B**. 7 | - If both cats reach the mouse at the same time, print **Mouse C** as the two cats fight and mouse escapes. 8 | 9 | For example, cat *A* is at position *x = 2* and cat *B* is at *y = 5*. If mouse *C* is at position *z = 4*, it is *2* units from cat *A* and *1* unit from cat *B*. Cat *B* will catch the mouse. 10 | 11 | ## Input 12 | - x: an integer, Cat A's position 13 | - y: an integer, Cat B's position 14 | - z: an integer, Mouse C's position 15 | 16 | ## Output 17 | For each query, return Cat A if cat *A* catches the mouse first, Cat B if cat *B* catches the mouse first, or Mouse C if the mouse escapes. 18 | 19 | ## Sample 1 20 | ``` 21 | x, y, z = [1, 2, 3] 22 | ``` 23 | ## Output 24 | ``` 25 | Cat B 26 | ``` 27 | ## Explanation 28 | ``` 29 | [ Cat A ] -> [ Cat B ] -> [ Mouse C ] 30 | [ 1 ] -> [ 2 ] -> [ 3 ] 31 | 32 | Cat B is Closest to Mouse C, so Cat B will catch the Mouse C 33 | ``` 34 | 35 | ## Sample 2 36 | ``` 37 | x, y, z = [1, 3, 2] 38 | ``` 39 | ## Output 40 | ``` 41 | Mouse C 42 | ``` 43 | ## Explanation 44 | ``` 45 | [ Cat A ] -> [ Mouse C ] -> [ Cat B ] 46 | [ 1 ] -> [ 2 ] -> [ 3 ] 47 | 48 | Both Cat A and Cat B is close to the Mouse C, so they will fight to over the Mouse C, then the Mouse C will escape. 49 | ``` -------------------------------------------------------------------------------- /CountingValleys/countingValleys.py: -------------------------------------------------------------------------------- 1 | def countingValleys(n, s): 2 | sN = [0] 3 | vN = [] 4 | for _ in s: 5 | if _ == 'D': 6 | sN.append(-1) 7 | else: 8 | sN.append(1) 9 | 10 | x = sN[0] 11 | for _ in range(len(sN)-1): 12 | x += sN[_+1] 13 | vN.append(x) 14 | 15 | vP = 0 16 | for _ in range(len(vN)-1): 17 | if (vN[_] < 0) and (vN[_+1] == 0): 18 | vP += 1 19 | 20 | print(str(sN) + '\n' + str(vN)) 21 | return(vP) 22 | 23 | 24 | ## test 25 | n = 10 26 | s = "DUDDDUUDUU" 27 | print(countingValleys(n, s)) -------------------------------------------------------------------------------- /CountingValleys/readme.md: -------------------------------------------------------------------------------- 1 | ## Problems 2 | > Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly n steps. For every step he took, he noted if it was an uphill U, , or a downhill D, step. Gary's hikes start and end at sea level and each step up or down represents a 1 unit change in altitude. We define the following terms: 3 | 4 | 1. A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to sea level. 5 | 2. A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea level. 6 | 7 | > Given Gary's sequence of up and down steps during his last hike, find and print the number of valleys he walked through. 8 | 9 | > For example, if Gary's path is s = [DDUUUUDD], he first enters a valley 2 units deep. Then he climbs out an up onto a mountain 2 units high. Finally, he returns to sea level and ends his hike. 10 | 11 | ### Output Format 12 | > Print a single integer that denotes the number of valleys Gary walked through during his hike. 13 | -------------------------------------------------------------------------------- /Diamond form/text_allignment.py: -------------------------------------------------------------------------------- 1 | class t_all: 2 | def __init__(self, tx1, tx2, xcount): 3 | self.tx1 = tx1 4 | self.tx2 = tx2 5 | self.xcount = xcount 6 | 7 | def diamond(self): 8 | for _ in range(self.xcount): 9 | print ((self.tx1 * (1+(2*_))).center((x*2)-1)) 10 | 11 | for _ in reversed(range(x)): 12 | print ((self.tx2 * (1+(2*_))).center((x*2)-1)) 13 | 14 | def parallelogram(self): 15 | for _ in range(self.xcount): 16 | print ((self.tx1 * (1+(2*_))).center((x*2)-1)) 17 | 18 | for _ in reversed(range(x)): 19 | print ((self.tx2 * (1+(2*_))).center((x*2)-1)) 20 | 21 | def frm(self, c): 22 | return { 23 | 1: self.diamond(), 24 | 2: self.parallelogram() 25 | }[c] 26 | 27 | x = int(input("Please Input x count value (1 - n), default(1) : ") or "1") 28 | tx1 = input("Please Input text 1, default('0') : ") or "0" 29 | tx2 = input("Please Input text 2, default('1') : ") or "1" 30 | 31 | txt_all = t_all(tx1, tx2, x) 32 | 33 | frm = int(input("Please choose the from (1. diamond, 2. parallelogram), default(1) : ") or "1") 34 | 35 | txt_all.frm(frm) 36 | 37 | -------------------------------------------------------------------------------- /DrawingBook/drawBook.py: -------------------------------------------------------------------------------- 1 | #import math 2 | def pageCount(n, p): 3 | px = round(p /2) 4 | nx = round(n /2) 5 | rx = (nx - px) 6 | return(min(px, rx)) 7 | 8 | ## test 9 | n = 37455 10 | p = 29835 11 | print(pageCount(n, p)) -------------------------------------------------------------------------------- /Duplicated_Products/DuplicatedProducts.js: -------------------------------------------------------------------------------- 1 | function numDuplicates(names, prices, weights) { 2 | x = []; 3 | for (i in names){ 4 | x.push(names[i]+String(prices[i])+String(weights[i])); 5 | } 6 | res = []; 7 | d = 0; 8 | r = 0; 9 | x.forEach(ye => { 10 | x.forEach(xe => { 11 | if (xe === ye){ 12 | d++; 13 | } 14 | }); 15 | if (d > 1){ 16 | res[ye]=d; 17 | } 18 | d=0; 19 | }); 20 | for (e in res){ 21 | r = r + (res[e]); 22 | } 23 | return r; 24 | } 25 | 26 | //Test 27 | n = ['ball','ball','mango','coconut','mango','mango']; 28 | p = [1,1,2,3,2,2]; 29 | w = [1,1,3,2,3,3]; 30 | console.log(numDuplicates(n, p, w)); -------------------------------------------------------------------------------- /Duplicated_Products/DuplicatedProducts.py: -------------------------------------------------------------------------------- 1 | def numDuplicates(names, prices, weights): 2 | x = [] 3 | for i in range(len(names)): 4 | x.append(names[i]+str(prices[i])+str(weights[i])) 5 | 6 | res = {} 7 | d = 0 8 | r = 0 9 | for ye in x: 10 | for xe in x: 11 | if (xe == ye): 12 | d+=1 13 | if (d > 1): 14 | res[ye] = d 15 | d = 0 16 | 17 | for e in res: 18 | r = r + (res[e]) 19 | 20 | return r 21 | 22 | ## Test 23 | n = ['ball','ball','mango','coconut','mango','mango'] 24 | p = [1, 1, 2, 3, 2, 2] 25 | w = [1, 1, 3, 2, 3, 3] 26 | print(numDuplicates(n, p, w)) -------------------------------------------------------------------------------- /Duplicated_Products/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | > Given n complex products, each with name, price and weight, find out how many duplicates of the original product are present within the products. Here, a duplicate is a product with all parameters, i.e. name, price and weight, equal to some other product. -------------------------------------------------------------------------------- /ElectronicShop/ElecShop.py: -------------------------------------------------------------------------------- 1 | def getMoneySpent(keyboards, drives, b): 2 | r = [] 3 | for rk in keyboards: 4 | for rd in drives: 5 | dk = (int(rd) + int(rk)) 6 | if dk <= b: 7 | r.append(dk) 8 | if len(r) > 0: 9 | return(max(r)) 10 | else: 11 | return(-1) 12 | 13 | 14 | ##test 15 | k = [40, 50, 60] 16 | d = [5, 8, 12] 17 | b = 60 18 | print(getMoneySpent(k, d, b)) -------------------------------------------------------------------------------- /ElectronicShop/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | Monica wants to buy a keyboard and a USB drive from her favorite electronics store. The store has several models of each. Monica wants to spend as much as possible for the *2* items, given her budget. 3 | Given the price lists for the store's keyboards and USB drives, and Monica's budget, find and print the amount of money Monica will spend. If she doesn't have enough money to both a keyboard and a USB drive, print -1 instead. She will buy only the two required items. 4 | For example, suppose she has *b = 60* to spend. Three types of keyboards cost *keyboards = [40, 50, 60]*. Two USB drives cost *drives = [5, 8, 12]*. She could purchase a *40 keyboard + 12 USB drive = 52*, or a *50 Keyboard + 8 USB drive = 58*. She chooses the latter. She can't buy more than *2* items so she can't spend exactly *60*. 5 | 6 | ## Input 7 | - keyboards: an array of integers representing keyboard prices 8 | - drives: an array of integers representing drive prices 9 | - b: the units of currency in Monica's budget 10 | 11 | ## Output 12 | Print a single integer denoting the amount of money Monica will spend. If she doesn't have enough money to buy one keyboard and one USB drive, print -1 instead. 13 | 14 | 15 | ## Sample Input 1 16 | ``` 17 | b = 10 18 | keyboards = [3, 1] 19 | drives = [5, 2, 8] 20 | ``` 21 | ## Sample Output 1 22 | ``` 23 | 9 24 | ``` 25 | ## Explanation 26 | She can buy the *2nd = 1* keyboard and the *3rd = 8* USB drive for a total cost of *1 + 8 = 9*. 27 | 28 | ## Sample Input 2 29 | ``` 30 | b = 5 31 | keyboard = 4 32 | drive = 5 33 | ``` 34 | ## Sample Output 2 35 | ``` 36 | -1 37 | ``` 38 | ## Explanation 39 | There is no way to buy one keyboard and one USB drive because total price *drives + keyboards > b (5 + 4 = 9) > 5*, so we print *-1* . -------------------------------------------------------------------------------- /EqualizeTheArray/EqArr.py: -------------------------------------------------------------------------------- 1 | def equalizeArray(arr): 2 | arr = arr.split(' ') 3 | x = {} 4 | for _ in arr: 5 | x[_] = arr.count(_) 6 | 7 | y = [] 8 | for _ in x: 9 | y.append(x[_]) 10 | r = 0 11 | 12 | mz = min(y) 13 | my = max(y) 14 | 15 | cy = (y.count(my)-1)*my 16 | 17 | if mz != my: 18 | for _ in y: 19 | if _ != my: 20 | r += _ 21 | return(r + cy) 22 | else: 23 | return(sum(y) - mz) 24 | 25 | 26 | 27 | ## Test 28 | # arr = '3 3 2 1 3' 29 | #arr = '1 2 3 1 2 3 3 3' 30 | #arr = '37 32 97 35 76 62' 31 | arr = '10 27 9 10 100 38 30 32 45 29 27 29 32 38 32 38 14 38 29 30 63 29 63 91 54 10 63' 32 | #arr = '24 29 70 43 12 27 29 24 41 12 41 43 24 70 24 100 41 43 43 100 29 70 100 43 41 27 70 70 59 41 24 24 29 43 24 27 70 24 27 70 24 70 27 24 43 27 100 41 12 70 43 70 62 12 59 29 62 41 100 43 43 59 59 70 12 27 43 43 27 27 27 24 43 43 62 43 70 29' 33 | print(equalizeArray(arr)) -------------------------------------------------------------------------------- /EqualizeTheArray/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | Karl has an array of integers. He wants to reduce the array until all remaining elements are equal. Determine the minimum number of elements to delete to reach his goal. 3 | For example, if his array is *arr = [1, 2, 3, 3]*, we see that he can delete the *2* elements *1* and *3* leaving *arr = [2, 2]*. He could also delete both twos and either the *1* or the *3*, but that would take *3* deletions. The minimum number of deletions is *2*. 4 | 5 | ## Input Format 6 | The first line contains an integer *n*, the number of elements in *arr*. 7 | The next line contains *n* space-separated integers *arr[i]*. 8 | 9 | ## Output Format 10 | Print a single integer that denotes the minimum number of elements Karl must delete for all elements in the array to be equal. 11 | 12 | ## Sample Input 13 | ``` 14 | 3 3 2 1 3 15 | ``` 16 | 17 | ## Sample Output 18 | ``` 19 | 2 20 | ``` 21 | 22 | ## Explanation 23 | Array *arr = [3, 3, 2, 1, 3]*. If we delete *arr[2] = 2* and *arr[3] = 1*, all of the elements in the resulting array, *arr = [3, 3, 3]*, will be equal. Deleting these *2* elements is minimal. Our only other options would be to delete *4* elements to get an array of either *[1]* or *[2]*. -------------------------------------------------------------------------------- /IOLightningForm/IO lightning pattern.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/michaelwp/hacker-rank/c94cf418376f0ad04b8c1f531e089bb84bf7453d/IOLightningForm/IO lightning pattern.png -------------------------------------------------------------------------------- /IOLightningForm/IOLight.py: -------------------------------------------------------------------------------- 1 | n = int(input('Masukkan nilai n : ')) 2 | s = ' ' 3 | x = '1' 4 | o = '0' 5 | 6 | if n == 1: 7 | print(1) 8 | pass 9 | 10 | i = 1 11 | xs = '' 12 | j = 0 13 | while i <= (n-1): 14 | while j < (i): 15 | if j & 1: 16 | xs += o 17 | else: 18 | xs += x 19 | print((s * (n-1)) + xs) 20 | j += 1 21 | i += 1 22 | 23 | ys = '' 24 | for _ in range((n*2)-1): 25 | if _ & 1: 26 | ys += o 27 | else: 28 | ys += x 29 | print(ys) 30 | 31 | k = (n -1) 32 | while k > 0: 33 | zs = '' 34 | for _ in range(k): 35 | if _ & 1: 36 | zs += o 37 | else: 38 | zs += x 39 | print((s * (n-k)) + zs) 40 | k-=1 -------------------------------------------------------------------------------- /IOLightningForm/readme.md: -------------------------------------------------------------------------------- 1 | Simple print IO Ligthning Pattern 2 | ![IO LIghtning Pattern](https://github.com/kei-001/practice/blob/master/IOLightningForm/IO%20lightning%20pattern.png) 3 | -------------------------------------------------------------------------------- /Idemia/contested.py: -------------------------------------------------------------------------------- 1 | class map(): 2 | abj = 'abcdefghijklmnopqrstuvwxyz' 3 | 4 | def __init__(self, x): 5 | self.x = x 6 | self.coo = [] 7 | self.arm = 0 8 | 9 | def mat(self): 10 | arm = [] 11 | coo = [] 12 | for _ in range(len(self.x)): 13 | for q in range(len(self.x[_])): 14 | if (self.x[_][q]) in map.abj: 15 | self.arm.append(self.x[_][q]) 16 | self.coo.append([q, _]) 17 | 18 | def pos(self): 19 | 20 | 21 | x = ['###########....', 22 | '#.......c.###..', 23 | '####......#.#..', 24 | '.#.########.#..', 25 | '##...#..b#..#..', 26 | '#.a.#...#...###', 27 | '####.#.#d###..#', 28 | '......#...e#xx#', 29 | '.#....#########', 30 | '.#.x..#..#.....', 31 | '.######.c#.....', 32 | '......####.....'] 33 | #x = ['.#', '#a'] 34 | """ 35 | x = ['.s#q#####..#.#..', 36 | 'd##y..sua#.##..#', 37 | '###h#..x#.......', 38 | '##..#.##.....##.', 39 | '.#.mb#n#..##..#.', 40 | '..#.lr#..#.#..#.', 41 | '..#.o.#..#.#...#', 42 | '.#####...#.....#', 43 | '#h#......#..#.##', 44 | '.##..##..###.#.#', 45 | '....#...#.......', 46 | '...##...##.#.##.', 47 | '..#qu##.....##.#', 48 | '..##.#o##.#....#', 49 | '...###p#..##..#.', 50 | '..#.l.#...#n#.#.', 51 | '...#y.#.#..#..#.', 52 | '#..###...###....', 53 | '..#.#..#.#.....#'] 54 | """ 55 | mapc = map(x) 56 | mapc.hor() 57 | #mapc.conts() 58 | #mapc.res() 59 | 60 | """ 61 | f = open('inputc.txt','r') 62 | j = [] 63 | w = [] 64 | for _ in f: 65 | _ = _.replace('\n','') 66 | t = _.isdigit() 67 | if t != True: 68 | j.append(_) 69 | else: 70 | if j != []: 71 | w.append(j) 72 | j = [] 73 | for x in w: 74 | print("Case " + str(w.index(x)+1) + ":") 75 | mapc = map(x) 76 | mapc.rep() 77 | mapc.conts() 78 | mapc.res() 79 | """ -------------------------------------------------------------------------------- /Idemia/divers.py: -------------------------------------------------------------------------------- 1 | def dev(A, B, K): 2 | i = 0 3 | x = A 4 | while x <= B: 5 | if (x % K == 0): 6 | i += 1 7 | x += 1 8 | return str(i) 9 | 10 | f = open("input.txt", "r") 11 | line = f.readlines() 12 | n = [] 13 | for _ in line: 14 | x = _.replace('\n','') 15 | n.append(x) 16 | 17 | a = [] 18 | b = [] 19 | for _ in range(0, len(n), 3): 20 | b = (n[_], n[_+1], n[_+2]) 21 | a.append(b) 22 | 23 | i = 0 24 | for _ in a: 25 | i += 1 26 | a = int(_[0]) 27 | b = int(_[1]) 28 | k = int(_[2]) 29 | print("Case " + str(i) + ": " + (dev(a, b, k))) -------------------------------------------------------------------------------- /Idemia/input.txt: -------------------------------------------------------------------------------- 1 | 3 2 | 3 3 | 4 4 | catt 5 | aata 6 | tatc 7 | cat 8 | 5 9 | 5 10 | gogog 11 | ooooo 12 | godog 13 | ooooo 14 | gogog 15 | dog 16 | 2 17 | 8 18 | bananana 19 | kalibrrr 20 | nana -------------------------------------------------------------------------------- /Idemia/permut.py: -------------------------------------------------------------------------------- 1 | def permutations(): 2 | global running 3 | global characters 4 | global bitmask 5 | if len(running) == len(characters): 6 | a = (''.join(running)) 7 | print(''.join(running)) 8 | j.write(a + '\n') 9 | else: 10 | for i in xrange(len(characters)): 11 | if characters[i] not in running: 12 | #if ((bitmask>>i)&1) == 0: 13 | #bitmask |= 1 << i 14 | running.append(characters[i]) 15 | permutations() 16 | running.pop() 17 | 18 | x = [] 19 | f = open('testx.txt','r') 20 | for _ in f: 21 | x.append(_.replace('\n', '')) 22 | 23 | j = open('test.txt','w') 24 | 25 | for _ in x: 26 | raw = _ #raw_input() 27 | characters = list(raw) 28 | running = [] 29 | bitmask = 0 30 | permutations() -------------------------------------------------------------------------------- /Idemia/test.txt: -------------------------------------------------------------------------------- 1 | dfgiksy 2 | dfgikys 3 | dfgisky 4 | dfgisyk 5 | dfgiyks 6 | dfgiysk 7 | dfgkisy 8 | dfgkiys 9 | dfgksiy 10 | dfgksyi 11 | dfgkyis 12 | dfgkysi 13 | dfgsiky 14 | dfgsiyk 15 | dfgskiy 16 | dfgskyi 17 | dfgsyik 18 | dfgsyki 19 | dfgyiks 20 | dfgyisk 21 | dfgykis 22 | dfgyksi 23 | dfgysik 24 | dfgyski 25 | dfigksy 26 | dfigkys 27 | dfigsky 28 | dfigsyk 29 | dfigyks 30 | dfigysk 31 | dfikgsy 32 | dfikgys 33 | dfiksgy 34 | dfiksyg 35 | dfikygs 36 | dfikysg 37 | dfisgky 38 | dfisgyk 39 | dfiskgy 40 | dfiskyg 41 | dfisygk 42 | dfisykg 43 | dfiygks 44 | dfiygsk 45 | dfiykgs 46 | dfiyksg 47 | dfiysgk 48 | dfiyskg 49 | dfkgisy 50 | dfkgiys 51 | dfkgsiy 52 | dfkgsyi 53 | dfkgyis 54 | dfkgysi 55 | dfkigsy 56 | dfkigys 57 | dfkisgy 58 | dfkisyg 59 | dfkiygs 60 | dfkiysg 61 | dfksgiy 62 | dfksgyi 63 | dfksigy 64 | dfksiyg 65 | dfksygi 66 | dfksyig 67 | dfkygis 68 | dfkygsi 69 | dfkyigs 70 | dfkyisg 71 | dfkysgi 72 | dfkysig 73 | dfsgiky 74 | dfsgiyk 75 | dfsgkiy 76 | dfsgkyi 77 | dfsgyik 78 | dfsgyki 79 | dfsigky 80 | dfsigyk 81 | dfsikgy 82 | dfsikyg 83 | dfsiygk 84 | dfsiykg 85 | dfskgiy 86 | dfskgyi 87 | dfskigy 88 | dfskiyg 89 | dfskygi 90 | dfskyig 91 | dfsygik 92 | dfsygki 93 | dfsyigk 94 | dfsyikg 95 | dfsykgi 96 | dfsykig 97 | dfygiks 98 | dfygisk 99 | dfygkis 100 | dfygksi 101 | dfygsik 102 | dfygski 103 | dfyigks 104 | dfyigsk 105 | dfyikgs 106 | dfyiksg 107 | dfyisgk 108 | dfyiskg 109 | dfykgis 110 | dfykgsi 111 | dfykigs 112 | dfykisg 113 | dfyksgi 114 | dfyksig 115 | dfysgik 116 | dfysgki 117 | dfysigk 118 | dfysikg 119 | dfyskgi 120 | dfyskig 121 | dgfiksy 122 | dgfikys 123 | dgfisky 124 | dgfisyk 125 | dgfiyks 126 | dgfiysk 127 | dgfkisy 128 | dgfkiys 129 | dgfksiy 130 | dgfksyi 131 | dgfkyis 132 | dgfkysi 133 | dgfsiky 134 | dgfsiyk 135 | dgfskiy 136 | dgfskyi 137 | dgfsyik 138 | dgfsyki 139 | dgfyiks 140 | dgfyisk 141 | dgfykis 142 | dgfyksi 143 | dgfysik 144 | dgfyski 145 | dgifksy 146 | dgifkys 147 | dgifsky 148 | dgifsyk 149 | dgifyks 150 | dgifysk 151 | dgikfsy 152 | dgikfys 153 | dgiksfy 154 | dgiksyf 155 | dgikyfs 156 | dgikysf 157 | dgisfky 158 | dgisfyk 159 | dgiskfy 160 | dgiskyf 161 | dgisyfk 162 | dgisykf 163 | dgiyfks 164 | dgiyfsk 165 | dgiykfs 166 | dgiyksf 167 | dgiysfk 168 | dgiyskf 169 | dgkfisy 170 | dgkfiys 171 | dgkfsiy 172 | dgkfsyi 173 | dgkfyis 174 | dgkfysi 175 | dgkifsy 176 | dgkifys 177 | dgkisfy 178 | dgkisyf 179 | dgkiyfs 180 | dgkiysf 181 | dgksfiy 182 | dgksfyi 183 | dgksify 184 | dgksiyf 185 | dgksyfi 186 | dgksyif 187 | dgkyfis 188 | dgkyfsi 189 | dgkyifs 190 | dgkyisf 191 | dgkysfi 192 | dgkysif 193 | dgsfiky 194 | dgsfiyk 195 | dgsfkiy 196 | dgsfkyi 197 | dgsfyik 198 | dgsfyki 199 | dgsifky 200 | dgsifyk 201 | dgsikfy 202 | dgsikyf 203 | dgsiyfk 204 | dgsiykf 205 | dgskfiy 206 | dgskfyi 207 | dgskify 208 | dgskiyf 209 | dgskyfi 210 | dgskyif 211 | dgsyfik 212 | dgsyfki 213 | dgsyifk 214 | dgsyikf 215 | dgsykfi 216 | dgsykif 217 | dgyfiks 218 | dgyfisk 219 | dgyfkis 220 | dgyfksi 221 | dgyfsik 222 | dgyfski 223 | dgyifks 224 | dgyifsk 225 | dgyikfs 226 | dgyiksf 227 | dgyisfk 228 | dgyiskf 229 | dgykfis 230 | dgykfsi 231 | dgykifs 232 | dgykisf 233 | dgyksfi 234 | dgyksif 235 | dgysfik 236 | dgysfki 237 | dgysifk 238 | dgysikf 239 | dgyskfi 240 | dgyskif 241 | difgksy 242 | difgkys 243 | difgsky 244 | difgsyk 245 | difgyks 246 | difgysk 247 | difkgsy 248 | difkgys 249 | difksgy 250 | difksyg 251 | difkygs 252 | difkysg 253 | difsgky 254 | difsgyk 255 | difskgy 256 | difskyg 257 | difsygk 258 | difsykg 259 | difygks 260 | difygsk 261 | difykgs 262 | difyksg 263 | difysgk 264 | difyskg 265 | digfksy 266 | digfkys 267 | digfsky 268 | digfsyk 269 | digfyks 270 | digfysk 271 | digkfsy 272 | digkfys 273 | digksfy 274 | digksyf 275 | digkyfs 276 | digkysf 277 | digsfky 278 | digsfyk 279 | digskfy 280 | digskyf 281 | digsyfk 282 | digsykf 283 | digyfks 284 | digyfsk 285 | digykfs 286 | digyksf 287 | digysfk 288 | digyskf 289 | dikfgsy 290 | dikfgys 291 | dikfsgy 292 | dikfsyg 293 | dikfygs 294 | dikfysg 295 | dikgfsy 296 | dikgfys 297 | dikgsfy 298 | dikgsyf 299 | dikgyfs 300 | dikgysf 301 | diksfgy 302 | diksfyg 303 | diksgfy 304 | diksgyf 305 | diksyfg 306 | diksygf 307 | dikyfgs 308 | dikyfsg 309 | dikygfs 310 | dikygsf 311 | dikysfg 312 | dikysgf 313 | disfgky 314 | disfgyk 315 | disfkgy 316 | disfkyg 317 | disfygk 318 | disfykg 319 | disgfky 320 | disgfyk 321 | disgkfy 322 | disgkyf 323 | disgyfk 324 | disgykf 325 | diskfgy 326 | diskfyg 327 | diskgfy 328 | diskgyf 329 | diskyfg 330 | diskygf 331 | disyfgk 332 | disyfkg 333 | disygfk 334 | disygkf 335 | disykfg 336 | disykgf 337 | diyfgks 338 | diyfgsk 339 | diyfkgs 340 | diyfksg 341 | diyfsgk 342 | diyfskg 343 | diygfks 344 | diygfsk 345 | diygkfs 346 | diygksf 347 | diygsfk 348 | diygskf 349 | diykfgs 350 | diykfsg 351 | diykgfs 352 | diykgsf 353 | diyksfg 354 | diyksgf 355 | diysfgk 356 | diysfkg 357 | diysgfk 358 | diysgkf 359 | diyskfg 360 | diyskgf 361 | dkfgisy 362 | dkfgiys 363 | dkfgsiy 364 | dkfgsyi 365 | dkfgyis 366 | dkfgysi 367 | dkfigsy 368 | dkfigys 369 | dkfisgy 370 | dkfisyg 371 | dkfiygs 372 | dkfiysg 373 | dkfsgiy 374 | dkfsgyi 375 | dkfsigy 376 | dkfsiyg 377 | dkfsygi 378 | dkfsyig 379 | dkfygis 380 | dkfygsi 381 | dkfyigs 382 | dkfyisg 383 | dkfysgi 384 | dkfysig 385 | dkgfisy 386 | dkgfiys 387 | dkgfsiy 388 | dkgfsyi 389 | dkgfyis 390 | dkgfysi 391 | dkgifsy 392 | dkgifys 393 | dkgisfy 394 | dkgisyf 395 | dkgiyfs 396 | dkgiysf 397 | dkgsfiy 398 | dkgsfyi 399 | dkgsify 400 | dkgsiyf 401 | dkgsyfi 402 | dkgsyif 403 | dkgyfis 404 | dkgyfsi 405 | dkgyifs 406 | dkgyisf 407 | dkgysfi 408 | dkgysif 409 | dkifgsy 410 | dkifgys 411 | dkifsgy 412 | dkifsyg 413 | dkifygs 414 | dkifysg 415 | dkigfsy 416 | dkigfys 417 | dkigsfy 418 | dkigsyf 419 | dkigyfs 420 | dkigysf 421 | dkisfgy 422 | dkisfyg 423 | dkisgfy 424 | dkisgyf 425 | dkisyfg 426 | dkisygf 427 | dkiyfgs 428 | dkiyfsg 429 | dkiygfs 430 | dkiygsf 431 | dkiysfg 432 | dkiysgf 433 | dksfgiy 434 | dksfgyi 435 | dksfigy 436 | dksfiyg 437 | dksfygi 438 | dksfyig 439 | dksgfiy 440 | dksgfyi 441 | dksgify 442 | dksgiyf 443 | dksgyfi 444 | dksgyif 445 | dksifgy 446 | dksifyg 447 | dksigfy 448 | dksigyf 449 | dksiyfg 450 | dksiygf 451 | dksyfgi 452 | dksyfig 453 | dksygfi 454 | dksygif 455 | dksyifg 456 | dksyigf 457 | dkyfgis 458 | dkyfgsi 459 | dkyfigs 460 | dkyfisg 461 | dkyfsgi 462 | dkyfsig 463 | dkygfis 464 | dkygfsi 465 | dkygifs 466 | dkygisf 467 | dkygsfi 468 | dkygsif 469 | dkyifgs 470 | dkyifsg 471 | dkyigfs 472 | dkyigsf 473 | dkyisfg 474 | dkyisgf 475 | dkysfgi 476 | dkysfig 477 | dkysgfi 478 | dkysgif 479 | dkysifg 480 | dkysigf 481 | dsfgiky 482 | dsfgiyk 483 | dsfgkiy 484 | dsfgkyi 485 | dsfgyik 486 | dsfgyki 487 | dsfigky 488 | dsfigyk 489 | dsfikgy 490 | dsfikyg 491 | dsfiygk 492 | dsfiykg 493 | dsfkgiy 494 | dsfkgyi 495 | dsfkigy 496 | dsfkiyg 497 | dsfkygi 498 | dsfkyig 499 | dsfygik 500 | dsfygki 501 | dsfyigk 502 | dsfyikg 503 | dsfykgi 504 | dsfykig 505 | dsgfiky 506 | dsgfiyk 507 | dsgfkiy 508 | dsgfkyi 509 | dsgfyik 510 | dsgfyki 511 | dsgifky 512 | dsgifyk 513 | dsgikfy 514 | dsgikyf 515 | dsgiyfk 516 | dsgiykf 517 | dsgkfiy 518 | dsgkfyi 519 | dsgkify 520 | dsgkiyf 521 | dsgkyfi 522 | dsgkyif 523 | dsgyfik 524 | dsgyfki 525 | dsgyifk 526 | dsgyikf 527 | dsgykfi 528 | dsgykif 529 | dsifgky 530 | dsifgyk 531 | dsifkgy 532 | dsifkyg 533 | dsifygk 534 | dsifykg 535 | dsigfky 536 | dsigfyk 537 | dsigkfy 538 | dsigkyf 539 | dsigyfk 540 | dsigykf 541 | dsikfgy 542 | dsikfyg 543 | dsikgfy 544 | dsikgyf 545 | dsikyfg 546 | dsikygf 547 | dsiyfgk 548 | dsiyfkg 549 | dsiygfk 550 | dsiygkf 551 | dsiykfg 552 | dsiykgf 553 | dskfgiy 554 | dskfgyi 555 | dskfigy 556 | dskfiyg 557 | dskfygi 558 | dskfyig 559 | dskgfiy 560 | dskgfyi 561 | dskgify 562 | dskgiyf 563 | dskgyfi 564 | dskgyif 565 | dskifgy 566 | dskifyg 567 | dskigfy 568 | dskigyf 569 | dskiyfg 570 | dskiygf 571 | dskyfgi 572 | dskyfig 573 | dskygfi 574 | dskygif 575 | dskyifg 576 | dskyigf 577 | dsyfgik 578 | dsyfgki 579 | dsyfigk 580 | dsyfikg 581 | dsyfkgi 582 | dsyfkig 583 | dsygfik 584 | dsygfki 585 | dsygifk 586 | dsygikf 587 | dsygkfi 588 | dsygkif 589 | dsyifgk 590 | dsyifkg 591 | dsyigfk 592 | dsyigkf 593 | dsyikfg 594 | dsyikgf 595 | dsykfgi 596 | dsykfig 597 | dsykgfi 598 | dsykgif 599 | dsykifg 600 | dsykigf 601 | dyfgiks 602 | dyfgisk 603 | dyfgkis 604 | dyfgksi 605 | dyfgsik 606 | dyfgski 607 | dyfigks 608 | dyfigsk 609 | dyfikgs 610 | dyfiksg 611 | dyfisgk 612 | dyfiskg 613 | dyfkgis 614 | dyfkgsi 615 | dyfkigs 616 | dyfkisg 617 | dyfksgi 618 | dyfksig 619 | dyfsgik 620 | dyfsgki 621 | dyfsigk 622 | dyfsikg 623 | dyfskgi 624 | dyfskig 625 | dygfiks 626 | dygfisk 627 | dygfkis 628 | dygfksi 629 | dygfsik 630 | dygfski 631 | dygifks 632 | dygifsk 633 | dygikfs 634 | dygiksf 635 | dygisfk 636 | dygiskf 637 | dygkfis 638 | dygkfsi 639 | dygkifs 640 | dygkisf 641 | dygksfi 642 | dygksif 643 | dygsfik 644 | dygsfki 645 | dygsifk 646 | dygsikf 647 | dygskfi 648 | dygskif 649 | dyifgks 650 | dyifgsk 651 | dyifkgs 652 | dyifksg 653 | dyifsgk 654 | dyifskg 655 | dyigfks 656 | dyigfsk 657 | dyigkfs 658 | dyigksf 659 | dyigsfk 660 | dyigskf 661 | dyikfgs 662 | dyikfsg 663 | dyikgfs 664 | dyikgsf 665 | dyiksfg 666 | dyiksgf 667 | dyisfgk 668 | dyisfkg 669 | dyisgfk 670 | dyisgkf 671 | dyiskfg 672 | dyiskgf 673 | dykfgis 674 | dykfgsi 675 | dykfigs 676 | dykfisg 677 | dykfsgi 678 | dykfsig 679 | dykgfis 680 | dykgfsi 681 | dykgifs 682 | dykgisf 683 | dykgsfi 684 | dykgsif 685 | dykifgs 686 | dykifsg 687 | dykigfs 688 | dykigsf 689 | dykisfg 690 | dykisgf 691 | dyksfgi 692 | dyksfig 693 | dyksgfi 694 | dyksgif 695 | dyksifg 696 | dyksigf 697 | dysfgik 698 | dysfgki 699 | dysfigk 700 | dysfikg 701 | dysfkgi 702 | dysfkig 703 | dysgfik 704 | dysgfki 705 | dysgifk 706 | dysgikf 707 | dysgkfi 708 | dysgkif 709 | dysifgk 710 | dysifkg 711 | dysigfk 712 | dysigkf 713 | dysikfg 714 | dysikgf 715 | dyskfgi 716 | dyskfig 717 | dyskgfi 718 | dyskgif 719 | dyskifg 720 | dyskigf 721 | fdgiksy 722 | fdgikys 723 | fdgisky 724 | fdgisyk 725 | fdgiyks 726 | fdgiysk 727 | fdgkisy 728 | fdgkiys 729 | fdgksiy 730 | fdgksyi 731 | fdgkyis 732 | fdgkysi 733 | fdgsiky 734 | fdgsiyk 735 | fdgskiy 736 | fdgskyi 737 | fdgsyik 738 | fdgsyki 739 | fdgyiks 740 | fdgyisk 741 | fdgykis 742 | fdgyksi 743 | fdgysik 744 | fdgyski 745 | fdigksy 746 | fdigkys 747 | fdigsky 748 | fdigsyk 749 | fdigyks 750 | fdigysk 751 | fdikgsy 752 | fdikgys 753 | fdiksgy 754 | fdiksyg 755 | fdikygs 756 | fdikysg 757 | fdisgky 758 | fdisgyk 759 | fdiskgy 760 | fdiskyg 761 | fdisygk 762 | fdisykg 763 | fdiygks 764 | fdiygsk 765 | fdiykgs 766 | fdiyksg 767 | fdiysgk 768 | fdiyskg 769 | fdkgisy 770 | fdkgiys 771 | fdkgsiy 772 | fdkgsyi 773 | fdkgyis 774 | fdkgysi 775 | fdkigsy 776 | fdkigys 777 | fdkisgy 778 | fdkisyg 779 | fdkiygs 780 | fdkiysg 781 | fdksgiy 782 | fdksgyi 783 | fdksigy 784 | fdksiyg 785 | fdksygi 786 | fdksyig 787 | fdkygis 788 | fdkygsi 789 | fdkyigs 790 | fdkyisg 791 | fdkysgi 792 | fdkysig 793 | fdsgiky 794 | fdsgiyk 795 | fdsgkiy 796 | fdsgkyi 797 | fdsgyik 798 | fdsgyki 799 | fdsigky 800 | fdsigyk 801 | fdsikgy 802 | fdsikyg 803 | fdsiygk 804 | fdsiykg 805 | fdskgiy 806 | fdskgyi 807 | fdskigy 808 | fdskiyg 809 | fdskygi 810 | fdskyig 811 | fdsygik 812 | fdsygki 813 | fdsyigk 814 | fdsyikg 815 | fdsykgi 816 | fdsykig 817 | fdygiks 818 | fdygisk 819 | fdygkis 820 | fdygksi 821 | fdygsik 822 | fdygski 823 | fdyigks 824 | fdyigsk 825 | fdyikgs 826 | fdyiksg 827 | fdyisgk 828 | fdyiskg 829 | fdykgis 830 | fdykgsi 831 | fdykigs 832 | fdykisg 833 | fdyksgi 834 | fdyksig 835 | fdysgik 836 | fdysgki 837 | fdysigk 838 | fdysikg 839 | fdyskgi 840 | fdyskig 841 | fgdiksy 842 | fgdikys 843 | fgdisky 844 | fgdisyk 845 | fgdiyks 846 | fgdiysk 847 | fgdkisy 848 | fgdkiys 849 | fgdksiy 850 | fgdksyi 851 | fgdkyis 852 | fgdkysi 853 | fgdsiky 854 | fgdsiyk 855 | fgdskiy 856 | fgdskyi 857 | fgdsyik 858 | fgdsyki 859 | fgdyiks 860 | fgdyisk 861 | fgdykis 862 | fgdyksi 863 | fgdysik 864 | fgdyski 865 | fgidksy 866 | fgidkys 867 | fgidsky 868 | fgidsyk 869 | fgidyks 870 | fgidysk 871 | fgikdsy 872 | fgikdys 873 | fgiksdy 874 | fgiksyd 875 | fgikyds 876 | fgikysd 877 | fgisdky 878 | fgisdyk 879 | fgiskdy 880 | fgiskyd 881 | fgisydk 882 | fgisykd 883 | fgiydks 884 | fgiydsk 885 | fgiykds 886 | fgiyksd 887 | fgiysdk 888 | fgiyskd 889 | fgkdisy 890 | fgkdiys 891 | fgkdsiy 892 | fgkdsyi 893 | fgkdyis 894 | fgkdysi 895 | fgkidsy 896 | fgkidys 897 | fgkisdy 898 | fgkisyd 899 | fgkiyds 900 | fgkiysd 901 | fgksdiy 902 | fgksdyi 903 | fgksidy 904 | fgksiyd 905 | fgksydi 906 | fgksyid 907 | fgkydis 908 | fgkydsi 909 | fgkyids 910 | fgkyisd 911 | fgkysdi 912 | fgkysid 913 | fgsdiky 914 | fgsdiyk 915 | fgsdkiy 916 | fgsdkyi 917 | fgsdyik 918 | fgsdyki 919 | fgsidky 920 | fgsidyk 921 | fgsikdy 922 | fgsikyd 923 | fgsiydk 924 | fgsiykd 925 | fgskdiy 926 | fgskdyi 927 | fgskidy 928 | fgskiyd 929 | fgskydi 930 | fgskyid 931 | fgsydik 932 | fgsydki 933 | fgsyidk 934 | fgsyikd 935 | fgsykdi 936 | fgsykid 937 | fgydiks 938 | fgydisk 939 | fgydkis 940 | fgydksi 941 | fgydsik 942 | fgydski 943 | fgyidks 944 | fgyidsk 945 | fgyikds 946 | fgyiksd 947 | fgyisdk 948 | fgyiskd 949 | fgykdis 950 | fgykdsi 951 | fgykids 952 | fgykisd 953 | fgyksdi 954 | fgyksid 955 | fgysdik 956 | fgysdki 957 | fgysidk 958 | fgysikd 959 | fgyskdi 960 | fgyskid 961 | fidgksy 962 | fidgkys 963 | fidgsky 964 | fidgsyk 965 | fidgyks 966 | fidgysk 967 | fidkgsy 968 | fidkgys 969 | fidksgy 970 | fidksyg 971 | fidkygs 972 | fidkysg 973 | fidsgky 974 | fidsgyk 975 | fidskgy 976 | fidskyg 977 | fidsygk 978 | fidsykg 979 | fidygks 980 | fidygsk 981 | fidykgs 982 | fidyksg 983 | fidysgk 984 | fidyskg 985 | figdksy 986 | figdkys 987 | figdsky 988 | figdsyk 989 | figdyks 990 | figdysk 991 | figkdsy 992 | figkdys 993 | figksdy 994 | figksyd 995 | figkyds 996 | figkysd 997 | figsdky 998 | figsdyk 999 | figskdy 1000 | figskyd 1001 | figsydk 1002 | figsykd 1003 | figydks 1004 | figydsk 1005 | figykds 1006 | figyksd 1007 | figysdk 1008 | figyskd 1009 | fikdgsy 1010 | fikdgys 1011 | fikdsgy 1012 | fikdsyg 1013 | fikdygs 1014 | fikdysg 1015 | fikgdsy 1016 | fikgdys 1017 | fikgsdy 1018 | fikgsyd 1019 | fikgyds 1020 | fikgysd 1021 | fiksdgy 1022 | fiksdyg 1023 | fiksgdy 1024 | fiksgyd 1025 | fiksydg 1026 | fiksygd 1027 | fikydgs 1028 | fikydsg 1029 | fikygds 1030 | fikygsd 1031 | fikysdg 1032 | fikysgd 1033 | fisdgky 1034 | fisdgyk 1035 | fisdkgy 1036 | fisdkyg 1037 | fisdygk 1038 | fisdykg 1039 | fisgdky 1040 | fisgdyk 1041 | fisgkdy 1042 | fisgkyd 1043 | fisgydk 1044 | fisgykd 1045 | fiskdgy 1046 | fiskdyg 1047 | fiskgdy 1048 | fiskgyd 1049 | fiskydg 1050 | fiskygd 1051 | fisydgk 1052 | fisydkg 1053 | fisygdk 1054 | fisygkd 1055 | fisykdg 1056 | fisykgd 1057 | fiydgks 1058 | fiydgsk 1059 | fiydkgs 1060 | fiydksg 1061 | fiydsgk 1062 | fiydskg 1063 | fiygdks 1064 | fiygdsk 1065 | fiygkds 1066 | fiygksd 1067 | fiygsdk 1068 | fiygskd 1069 | fiykdgs 1070 | fiykdsg 1071 | fiykgds 1072 | fiykgsd 1073 | fiyksdg 1074 | fiyksgd 1075 | fiysdgk 1076 | fiysdkg 1077 | fiysgdk 1078 | fiysgkd 1079 | fiyskdg 1080 | fiyskgd 1081 | fkdgisy 1082 | fkdgiys 1083 | fkdgsiy 1084 | fkdgsyi 1085 | fkdgyis 1086 | fkdgysi 1087 | fkdigsy 1088 | fkdigys 1089 | fkdisgy 1090 | fkdisyg 1091 | fkdiygs 1092 | fkdiysg 1093 | fkdsgiy 1094 | fkdsgyi 1095 | fkdsigy 1096 | fkdsiyg 1097 | fkdsygi 1098 | fkdsyig 1099 | fkdygis 1100 | fkdygsi 1101 | fkdyigs 1102 | fkdyisg 1103 | fkdysgi 1104 | fkdysig 1105 | fkgdisy 1106 | fkgdiys 1107 | fkgdsiy 1108 | fkgdsyi 1109 | fkgdyis 1110 | fkgdysi 1111 | fkgidsy 1112 | fkgidys 1113 | fkgisdy 1114 | fkgisyd 1115 | fkgiyds 1116 | fkgiysd 1117 | fkgsdiy 1118 | fkgsdyi 1119 | fkgsidy 1120 | fkgsiyd 1121 | fkgsydi 1122 | fkgsyid 1123 | fkgydis 1124 | fkgydsi 1125 | fkgyids 1126 | fkgyisd 1127 | fkgysdi 1128 | fkgysid 1129 | fkidgsy 1130 | fkidgys 1131 | fkidsgy 1132 | fkidsyg 1133 | fkidygs 1134 | fkidysg 1135 | fkigdsy 1136 | fkigdys 1137 | fkigsdy 1138 | fkigsyd 1139 | fkigyds 1140 | fkigysd 1141 | fkisdgy 1142 | fkisdyg 1143 | fkisgdy 1144 | fkisgyd 1145 | fkisydg 1146 | fkisygd 1147 | fkiydgs 1148 | fkiydsg 1149 | fkiygds 1150 | fkiygsd 1151 | fkiysdg 1152 | fkiysgd 1153 | fksdgiy 1154 | fksdgyi 1155 | fksdigy 1156 | fksdiyg 1157 | fksdygi 1158 | fksdyig 1159 | fksgdiy 1160 | fksgdyi 1161 | fksgidy 1162 | fksgiyd 1163 | fksgydi 1164 | fksgyid 1165 | fksidgy 1166 | fksidyg 1167 | fksigdy 1168 | fksigyd 1169 | fksiydg 1170 | fksiygd 1171 | fksydgi 1172 | fksydig 1173 | fksygdi 1174 | fksygid 1175 | fksyidg 1176 | fksyigd 1177 | fkydgis 1178 | fkydgsi 1179 | fkydigs 1180 | fkydisg 1181 | fkydsgi 1182 | fkydsig 1183 | fkygdis 1184 | fkygdsi 1185 | fkygids 1186 | fkygisd 1187 | fkygsdi 1188 | fkygsid 1189 | fkyidgs 1190 | fkyidsg 1191 | fkyigds 1192 | fkyigsd 1193 | fkyisdg 1194 | fkyisgd 1195 | fkysdgi 1196 | fkysdig 1197 | fkysgdi 1198 | fkysgid 1199 | fkysidg 1200 | fkysigd 1201 | fsdgiky 1202 | fsdgiyk 1203 | fsdgkiy 1204 | fsdgkyi 1205 | fsdgyik 1206 | fsdgyki 1207 | fsdigky 1208 | fsdigyk 1209 | fsdikgy 1210 | fsdikyg 1211 | fsdiygk 1212 | fsdiykg 1213 | fsdkgiy 1214 | fsdkgyi 1215 | fsdkigy 1216 | fsdkiyg 1217 | fsdkygi 1218 | fsdkyig 1219 | fsdygik 1220 | fsdygki 1221 | fsdyigk 1222 | fsdyikg 1223 | fsdykgi 1224 | fsdykig 1225 | fsgdiky 1226 | fsgdiyk 1227 | fsgdkiy 1228 | fsgdkyi 1229 | fsgdyik 1230 | fsgdyki 1231 | fsgidky 1232 | fsgidyk 1233 | fsgikdy 1234 | fsgikyd 1235 | fsgiydk 1236 | fsgiykd 1237 | fsgkdiy 1238 | fsgkdyi 1239 | fsgkidy 1240 | fsgkiyd 1241 | fsgkydi 1242 | fsgkyid 1243 | fsgydik 1244 | fsgydki 1245 | fsgyidk 1246 | fsgyikd 1247 | fsgykdi 1248 | fsgykid 1249 | fsidgky 1250 | fsidgyk 1251 | fsidkgy 1252 | fsidkyg 1253 | fsidygk 1254 | fsidykg 1255 | fsigdky 1256 | fsigdyk 1257 | fsigkdy 1258 | fsigkyd 1259 | fsigydk 1260 | fsigykd 1261 | fsikdgy 1262 | fsikdyg 1263 | fsikgdy 1264 | fsikgyd 1265 | fsikydg 1266 | fsikygd 1267 | fsiydgk 1268 | fsiydkg 1269 | fsiygdk 1270 | fsiygkd 1271 | fsiykdg 1272 | fsiykgd 1273 | fskdgiy 1274 | fskdgyi 1275 | fskdigy 1276 | fskdiyg 1277 | fskdygi 1278 | fskdyig 1279 | fskgdiy 1280 | fskgdyi 1281 | fskgidy 1282 | fskgiyd 1283 | fskgydi 1284 | fskgyid 1285 | fskidgy 1286 | fskidyg 1287 | fskigdy 1288 | fskigyd 1289 | fskiydg 1290 | fskiygd 1291 | fskydgi 1292 | fskydig 1293 | fskygdi 1294 | fskygid 1295 | fskyidg 1296 | fskyigd 1297 | fsydgik 1298 | fsydgki 1299 | fsydigk 1300 | fsydikg 1301 | fsydkgi 1302 | fsydkig 1303 | fsygdik 1304 | fsygdki 1305 | fsygidk 1306 | fsygikd 1307 | fsygkdi 1308 | fsygkid 1309 | fsyidgk 1310 | fsyidkg 1311 | fsyigdk 1312 | fsyigkd 1313 | fsyikdg 1314 | fsyikgd 1315 | fsykdgi 1316 | fsykdig 1317 | fsykgdi 1318 | fsykgid 1319 | fsykidg 1320 | fsykigd 1321 | fydgiks 1322 | fydgisk 1323 | fydgkis 1324 | fydgksi 1325 | fydgsik 1326 | fydgski 1327 | fydigks 1328 | fydigsk 1329 | fydikgs 1330 | fydiksg 1331 | fydisgk 1332 | fydiskg 1333 | fydkgis 1334 | fydkgsi 1335 | fydkigs 1336 | fydkisg 1337 | fydksgi 1338 | fydksig 1339 | fydsgik 1340 | fydsgki 1341 | fydsigk 1342 | fydsikg 1343 | fydskgi 1344 | fydskig 1345 | fygdiks 1346 | fygdisk 1347 | fygdkis 1348 | fygdksi 1349 | fygdsik 1350 | fygdski 1351 | fygidks 1352 | fygidsk 1353 | fygikds 1354 | fygiksd 1355 | fygisdk 1356 | fygiskd 1357 | fygkdis 1358 | fygkdsi 1359 | fygkids 1360 | fygkisd 1361 | fygksdi 1362 | fygksid 1363 | fygsdik 1364 | fygsdki 1365 | fygsidk 1366 | fygsikd 1367 | fygskdi 1368 | fygskid 1369 | fyidgks 1370 | fyidgsk 1371 | fyidkgs 1372 | fyidksg 1373 | fyidsgk 1374 | fyidskg 1375 | fyigdks 1376 | fyigdsk 1377 | fyigkds 1378 | fyigksd 1379 | fyigsdk 1380 | fyigskd 1381 | fyikdgs 1382 | fyikdsg 1383 | fyikgds 1384 | fyikgsd 1385 | fyiksdg 1386 | fyiksgd 1387 | fyisdgk 1388 | fyisdkg 1389 | fyisgdk 1390 | fyisgkd 1391 | fyiskdg 1392 | fyiskgd 1393 | fykdgis 1394 | fykdgsi 1395 | fykdigs 1396 | fykdisg 1397 | fykdsgi 1398 | fykdsig 1399 | fykgdis 1400 | fykgdsi 1401 | fykgids 1402 | fykgisd 1403 | fykgsdi 1404 | fykgsid 1405 | fykidgs 1406 | fykidsg 1407 | fykigds 1408 | fykigsd 1409 | fykisdg 1410 | fykisgd 1411 | fyksdgi 1412 | fyksdig 1413 | fyksgdi 1414 | fyksgid 1415 | fyksidg 1416 | fyksigd 1417 | fysdgik 1418 | fysdgki 1419 | fysdigk 1420 | fysdikg 1421 | fysdkgi 1422 | fysdkig 1423 | fysgdik 1424 | fysgdki 1425 | fysgidk 1426 | fysgikd 1427 | fysgkdi 1428 | fysgkid 1429 | fysidgk 1430 | fysidkg 1431 | fysigdk 1432 | fysigkd 1433 | fysikdg 1434 | fysikgd 1435 | fyskdgi 1436 | fyskdig 1437 | fyskgdi 1438 | fyskgid 1439 | fyskidg 1440 | fyskigd 1441 | gdfiksy 1442 | gdfikys 1443 | gdfisky 1444 | gdfisyk 1445 | gdfiyks 1446 | gdfiysk 1447 | gdfkisy 1448 | gdfkiys 1449 | gdfksiy 1450 | gdfksyi 1451 | gdfkyis 1452 | gdfkysi 1453 | gdfsiky 1454 | gdfsiyk 1455 | gdfskiy 1456 | gdfskyi 1457 | gdfsyik 1458 | gdfsyki 1459 | gdfyiks 1460 | gdfyisk 1461 | gdfykis 1462 | gdfyksi 1463 | gdfysik 1464 | gdfyski 1465 | gdifksy 1466 | gdifkys 1467 | gdifsky 1468 | gdifsyk 1469 | gdifyks 1470 | gdifysk 1471 | gdikfsy 1472 | gdikfys 1473 | gdiksfy 1474 | gdiksyf 1475 | gdikyfs 1476 | gdikysf 1477 | gdisfky 1478 | gdisfyk 1479 | gdiskfy 1480 | gdiskyf 1481 | gdisyfk 1482 | gdisykf 1483 | gdiyfks 1484 | gdiyfsk 1485 | gdiykfs 1486 | gdiyksf 1487 | gdiysfk 1488 | gdiyskf 1489 | gdkfisy 1490 | gdkfiys 1491 | gdkfsiy 1492 | gdkfsyi 1493 | gdkfyis 1494 | gdkfysi 1495 | gdkifsy 1496 | gdkifys 1497 | gdkisfy 1498 | gdkisyf 1499 | gdkiyfs 1500 | gdkiysf 1501 | gdksfiy 1502 | gdksfyi 1503 | gdksify 1504 | gdksiyf 1505 | gdksyfi 1506 | gdksyif 1507 | gdkyfis 1508 | gdkyfsi 1509 | gdkyifs 1510 | gdkyisf 1511 | gdkysfi 1512 | gdkysif 1513 | gdsfiky 1514 | gdsfiyk 1515 | gdsfkiy 1516 | gdsfkyi 1517 | gdsfyik 1518 | gdsfyki 1519 | gdsifky 1520 | gdsifyk 1521 | gdsikfy 1522 | gdsikyf 1523 | gdsiyfk 1524 | gdsiykf 1525 | gdskfiy 1526 | gdskfyi 1527 | gdskify 1528 | gdskiyf 1529 | gdskyfi 1530 | gdskyif 1531 | gdsyfik 1532 | gdsyfki 1533 | gdsyifk 1534 | gdsyikf 1535 | gdsykfi 1536 | gdsykif 1537 | gdyfiks 1538 | gdyfisk 1539 | gdyfkis 1540 | gdyfksi 1541 | gdyfsik 1542 | gdyfski 1543 | gdyifks 1544 | gdyifsk 1545 | gdyikfs 1546 | gdyiksf 1547 | gdyisfk 1548 | gdyiskf 1549 | gdykfis 1550 | gdykfsi 1551 | gdykifs 1552 | gdykisf 1553 | gdyksfi 1554 | gdyksif 1555 | gdysfik 1556 | gdysfki 1557 | gdysifk 1558 | gdysikf 1559 | gdyskfi 1560 | gdyskif 1561 | gfdiksy 1562 | gfdikys 1563 | gfdisky 1564 | gfdisyk 1565 | gfdiyks 1566 | gfdiysk 1567 | gfdkisy 1568 | gfdkiys 1569 | gfdksiy 1570 | gfdksyi 1571 | gfdkyis 1572 | gfdkysi 1573 | gfdsiky 1574 | gfdsiyk 1575 | gfdskiy 1576 | gfdskyi 1577 | gfdsyik 1578 | gfdsyki 1579 | gfdyiks 1580 | gfdyisk 1581 | gfdykis 1582 | gfdyksi 1583 | gfdysik 1584 | gfdyski 1585 | gfidksy 1586 | gfidkys 1587 | gfidsky 1588 | gfidsyk 1589 | gfidyks 1590 | gfidysk 1591 | gfikdsy 1592 | gfikdys 1593 | gfiksdy 1594 | gfiksyd 1595 | gfikyds 1596 | gfikysd 1597 | gfisdky 1598 | gfisdyk 1599 | gfiskdy 1600 | gfiskyd 1601 | gfisydk 1602 | gfisykd 1603 | gfiydks 1604 | gfiydsk 1605 | gfiykds 1606 | gfiyksd 1607 | gfiysdk 1608 | gfiyskd 1609 | gfkdisy 1610 | gfkdiys 1611 | gfkdsiy 1612 | gfkdsyi 1613 | gfkdyis 1614 | gfkdysi 1615 | gfkidsy 1616 | gfkidys 1617 | gfkisdy 1618 | gfkisyd 1619 | gfkiyds 1620 | gfkiysd 1621 | gfksdiy 1622 | gfksdyi 1623 | gfksidy 1624 | gfksiyd 1625 | gfksydi 1626 | gfksyid 1627 | gfkydis 1628 | gfkydsi 1629 | gfkyids 1630 | gfkyisd 1631 | gfkysdi 1632 | gfkysid 1633 | gfsdiky 1634 | gfsdiyk 1635 | gfsdkiy 1636 | gfsdkyi 1637 | gfsdyik 1638 | gfsdyki 1639 | gfsidky 1640 | gfsidyk 1641 | gfsikdy 1642 | gfsikyd 1643 | gfsiydk 1644 | gfsiykd 1645 | gfskdiy 1646 | gfskdyi 1647 | gfskidy 1648 | gfskiyd 1649 | gfskydi 1650 | gfskyid 1651 | gfsydik 1652 | gfsydki 1653 | gfsyidk 1654 | gfsyikd 1655 | gfsykdi 1656 | gfsykid 1657 | gfydiks 1658 | gfydisk 1659 | gfydkis 1660 | gfydksi 1661 | gfydsik 1662 | gfydski 1663 | gfyidks 1664 | gfyidsk 1665 | gfyikds 1666 | gfyiksd 1667 | gfyisdk 1668 | gfyiskd 1669 | gfykdis 1670 | gfykdsi 1671 | gfykids 1672 | gfykisd 1673 | gfyksdi 1674 | gfyksid 1675 | gfysdik 1676 | gfysdki 1677 | gfysidk 1678 | gfysikd 1679 | gfyskdi 1680 | gfyskid 1681 | gidfksy 1682 | gidfkys 1683 | gidfsky 1684 | gidfsyk 1685 | gidfyks 1686 | gidfysk 1687 | gidkfsy 1688 | gidkfys 1689 | gidksfy 1690 | gidksyf 1691 | gidkyfs 1692 | gidkysf 1693 | gidsfky 1694 | gidsfyk 1695 | gidskfy 1696 | gidskyf 1697 | gidsyfk 1698 | gidsykf 1699 | gidyfks 1700 | gidyfsk 1701 | gidykfs 1702 | gidyksf 1703 | gidysfk 1704 | gidyskf 1705 | gifdksy 1706 | gifdkys 1707 | gifdsky 1708 | gifdsyk 1709 | gifdyks 1710 | gifdysk 1711 | gifkdsy 1712 | gifkdys 1713 | gifksdy 1714 | gifksyd 1715 | gifkyds 1716 | gifkysd 1717 | gifsdky 1718 | gifsdyk 1719 | gifskdy 1720 | gifskyd 1721 | gifsydk 1722 | gifsykd 1723 | gifydks 1724 | gifydsk 1725 | gifykds 1726 | gifyksd 1727 | gifysdk 1728 | gifyskd 1729 | gikdfsy 1730 | gikdfys 1731 | gikdsfy 1732 | gikdsyf 1733 | gikdyfs 1734 | gikdysf 1735 | gikfdsy 1736 | gikfdys 1737 | gikfsdy 1738 | gikfsyd 1739 | gikfyds 1740 | gikfysd 1741 | giksdfy 1742 | giksdyf 1743 | giksfdy 1744 | giksfyd 1745 | giksydf 1746 | giksyfd 1747 | gikydfs 1748 | gikydsf 1749 | gikyfds 1750 | gikyfsd 1751 | gikysdf 1752 | gikysfd 1753 | gisdfky 1754 | gisdfyk 1755 | gisdkfy 1756 | gisdkyf 1757 | gisdyfk 1758 | gisdykf 1759 | gisfdky 1760 | gisfdyk 1761 | gisfkdy 1762 | gisfkyd 1763 | gisfydk 1764 | gisfykd 1765 | giskdfy 1766 | giskdyf 1767 | giskfdy 1768 | giskfyd 1769 | giskydf 1770 | giskyfd 1771 | gisydfk 1772 | gisydkf 1773 | gisyfdk 1774 | gisyfkd 1775 | gisykdf 1776 | gisykfd 1777 | giydfks 1778 | giydfsk 1779 | giydkfs 1780 | giydksf 1781 | giydsfk 1782 | giydskf 1783 | giyfdks 1784 | giyfdsk 1785 | giyfkds 1786 | giyfksd 1787 | giyfsdk 1788 | giyfskd 1789 | giykdfs 1790 | giykdsf 1791 | giykfds 1792 | giykfsd 1793 | giyksdf 1794 | giyksfd 1795 | giysdfk 1796 | giysdkf 1797 | giysfdk 1798 | giysfkd 1799 | giyskdf 1800 | giyskfd 1801 | gkdfisy 1802 | gkdfiys 1803 | gkdfsiy 1804 | gkdfsyi 1805 | gkdfyis 1806 | gkdfysi 1807 | gkdifsy 1808 | gkdifys 1809 | gkdisfy 1810 | gkdisyf 1811 | gkdiyfs 1812 | gkdiysf 1813 | gkdsfiy 1814 | gkdsfyi 1815 | gkdsify 1816 | gkdsiyf 1817 | gkdsyfi 1818 | gkdsyif 1819 | gkdyfis 1820 | gkdyfsi 1821 | gkdyifs 1822 | gkdyisf 1823 | gkdysfi 1824 | gkdysif 1825 | gkfdisy 1826 | gkfdiys 1827 | gkfdsiy 1828 | gkfdsyi 1829 | gkfdyis 1830 | gkfdysi 1831 | gkfidsy 1832 | gkfidys 1833 | gkfisdy 1834 | gkfisyd 1835 | gkfiyds 1836 | gkfiysd 1837 | gkfsdiy 1838 | gkfsdyi 1839 | gkfsidy 1840 | gkfsiyd 1841 | gkfsydi 1842 | gkfsyid 1843 | gkfydis 1844 | gkfydsi 1845 | gkfyids 1846 | gkfyisd 1847 | gkfysdi 1848 | gkfysid 1849 | gkidfsy 1850 | gkidfys 1851 | gkidsfy 1852 | gkidsyf 1853 | gkidyfs 1854 | gkidysf 1855 | gkifdsy 1856 | gkifdys 1857 | gkifsdy 1858 | gkifsyd 1859 | gkifyds 1860 | gkifysd 1861 | gkisdfy 1862 | gkisdyf 1863 | gkisfdy 1864 | gkisfyd 1865 | gkisydf 1866 | gkisyfd 1867 | gkiydfs 1868 | gkiydsf 1869 | gkiyfds 1870 | gkiyfsd 1871 | gkiysdf 1872 | gkiysfd 1873 | gksdfiy 1874 | gksdfyi 1875 | gksdify 1876 | gksdiyf 1877 | gksdyfi 1878 | gksdyif 1879 | gksfdiy 1880 | gksfdyi 1881 | gksfidy 1882 | gksfiyd 1883 | gksfydi 1884 | gksfyid 1885 | gksidfy 1886 | gksidyf 1887 | gksifdy 1888 | gksifyd 1889 | gksiydf 1890 | gksiyfd 1891 | gksydfi 1892 | gksydif 1893 | gksyfdi 1894 | gksyfid 1895 | gksyidf 1896 | gksyifd 1897 | gkydfis 1898 | gkydfsi 1899 | gkydifs 1900 | gkydisf 1901 | gkydsfi 1902 | gkydsif 1903 | gkyfdis 1904 | gkyfdsi 1905 | gkyfids 1906 | gkyfisd 1907 | gkyfsdi 1908 | gkyfsid 1909 | gkyidfs 1910 | gkyidsf 1911 | gkyifds 1912 | gkyifsd 1913 | gkyisdf 1914 | gkyisfd 1915 | gkysdfi 1916 | gkysdif 1917 | gkysfdi 1918 | gkysfid 1919 | gkysidf 1920 | gkysifd 1921 | gsdfiky 1922 | gsdfiyk 1923 | gsdfkiy 1924 | gsdfkyi 1925 | gsdfyik 1926 | gsdfyki 1927 | gsdifky 1928 | gsdifyk 1929 | gsdikfy 1930 | gsdikyf 1931 | gsdiyfk 1932 | gsdiykf 1933 | gsdkfiy 1934 | gsdkfyi 1935 | gsdkify 1936 | gsdkiyf 1937 | gsdkyfi 1938 | gsdkyif 1939 | gsdyfik 1940 | gsdyfki 1941 | gsdyifk 1942 | gsdyikf 1943 | gsdykfi 1944 | gsdykif 1945 | gsfdiky 1946 | gsfdiyk 1947 | gsfdkiy 1948 | gsfdkyi 1949 | gsfdyik 1950 | gsfdyki 1951 | gsfidky 1952 | gsfidyk 1953 | gsfikdy 1954 | gsfikyd 1955 | gsfiydk 1956 | gsfiykd 1957 | gsfkdiy 1958 | gsfkdyi 1959 | gsfkidy 1960 | gsfkiyd 1961 | gsfkydi 1962 | gsfkyid 1963 | gsfydik 1964 | gsfydki 1965 | gsfyidk 1966 | gsfyikd 1967 | gsfykdi 1968 | gsfykid 1969 | gsidfky 1970 | gsidfyk 1971 | gsidkfy 1972 | gsidkyf 1973 | gsidyfk 1974 | gsidykf 1975 | gsifdky 1976 | gsifdyk 1977 | gsifkdy 1978 | gsifkyd 1979 | gsifydk 1980 | gsifykd 1981 | gsikdfy 1982 | gsikdyf 1983 | gsikfdy 1984 | gsikfyd 1985 | gsikydf 1986 | gsikyfd 1987 | gsiydfk 1988 | gsiydkf 1989 | gsiyfdk 1990 | gsiyfkd 1991 | gsiykdf 1992 | gsiykfd 1993 | gskdfiy 1994 | gskdfyi 1995 | gskdify 1996 | gskdiyf 1997 | gskdyfi 1998 | gskdyif 1999 | gskfdiy 2000 | gskfdyi 2001 | gskfidy 2002 | gskfiyd 2003 | gskfydi 2004 | gskfyid 2005 | gskidfy 2006 | gskidyf 2007 | gskifdy 2008 | gskifyd 2009 | gskiydf 2010 | gskiyfd 2011 | gskydfi 2012 | gskydif 2013 | gskyfdi 2014 | gskyfid 2015 | gskyidf 2016 | gskyifd 2017 | gsydfik 2018 | gsydfki 2019 | gsydifk 2020 | gsydikf 2021 | gsydkfi 2022 | gsydkif 2023 | gsyfdik 2024 | gsyfdki 2025 | gsyfidk 2026 | gsyfikd 2027 | gsyfkdi 2028 | gsyfkid 2029 | gsyidfk 2030 | gsyidkf 2031 | gsyifdk 2032 | gsyifkd 2033 | gsyikdf 2034 | gsyikfd 2035 | gsykdfi 2036 | gsykdif 2037 | gsykfdi 2038 | gsykfid 2039 | gsykidf 2040 | gsykifd 2041 | gydfiks 2042 | gydfisk 2043 | gydfkis 2044 | gydfksi 2045 | gydfsik 2046 | gydfski 2047 | gydifks 2048 | gydifsk 2049 | gydikfs 2050 | gydiksf 2051 | gydisfk 2052 | gydiskf 2053 | gydkfis 2054 | gydkfsi 2055 | gydkifs 2056 | gydkisf 2057 | gydksfi 2058 | gydksif 2059 | gydsfik 2060 | gydsfki 2061 | gydsifk 2062 | gydsikf 2063 | gydskfi 2064 | gydskif 2065 | gyfdiks 2066 | gyfdisk 2067 | gyfdkis 2068 | gyfdksi 2069 | gyfdsik 2070 | gyfdski 2071 | gyfidks 2072 | gyfidsk 2073 | gyfikds 2074 | gyfiksd 2075 | gyfisdk 2076 | gyfiskd 2077 | gyfkdis 2078 | gyfkdsi 2079 | gyfkids 2080 | gyfkisd 2081 | gyfksdi 2082 | gyfksid 2083 | gyfsdik 2084 | gyfsdki 2085 | gyfsidk 2086 | gyfsikd 2087 | gyfskdi 2088 | gyfskid 2089 | gyidfks 2090 | gyidfsk 2091 | gyidkfs 2092 | gyidksf 2093 | gyidsfk 2094 | gyidskf 2095 | gyifdks 2096 | gyifdsk 2097 | gyifkds 2098 | gyifksd 2099 | gyifsdk 2100 | gyifskd 2101 | gyikdfs 2102 | gyikdsf 2103 | gyikfds 2104 | gyikfsd 2105 | gyiksdf 2106 | gyiksfd 2107 | gyisdfk 2108 | gyisdkf 2109 | gyisfdk 2110 | gyisfkd 2111 | gyiskdf 2112 | gyiskfd 2113 | gykdfis 2114 | gykdfsi 2115 | gykdifs 2116 | gykdisf 2117 | gykdsfi 2118 | gykdsif 2119 | gykfdis 2120 | gykfdsi 2121 | gykfids 2122 | gykfisd 2123 | gykfsdi 2124 | gykfsid 2125 | gykidfs 2126 | gykidsf 2127 | gykifds 2128 | gykifsd 2129 | gykisdf 2130 | gykisfd 2131 | gyksdfi 2132 | gyksdif 2133 | gyksfdi 2134 | gyksfid 2135 | gyksidf 2136 | gyksifd 2137 | gysdfik 2138 | gysdfki 2139 | gysdifk 2140 | gysdikf 2141 | gysdkfi 2142 | gysdkif 2143 | gysfdik 2144 | gysfdki 2145 | gysfidk 2146 | gysfikd 2147 | gysfkdi 2148 | gysfkid 2149 | gysidfk 2150 | gysidkf 2151 | gysifdk 2152 | gysifkd 2153 | gysikdf 2154 | gysikfd 2155 | gyskdfi 2156 | gyskdif 2157 | gyskfdi 2158 | gyskfid 2159 | gyskidf 2160 | gyskifd 2161 | idfgksy 2162 | idfgkys 2163 | idfgsky 2164 | idfgsyk 2165 | idfgyks 2166 | idfgysk 2167 | idfkgsy 2168 | idfkgys 2169 | idfksgy 2170 | idfksyg 2171 | idfkygs 2172 | idfkysg 2173 | idfsgky 2174 | idfsgyk 2175 | idfskgy 2176 | idfskyg 2177 | idfsygk 2178 | idfsykg 2179 | idfygks 2180 | idfygsk 2181 | idfykgs 2182 | idfyksg 2183 | idfysgk 2184 | idfyskg 2185 | idgfksy 2186 | idgfkys 2187 | idgfsky 2188 | idgfsyk 2189 | idgfyks 2190 | idgfysk 2191 | idgkfsy 2192 | idgkfys 2193 | idgksfy 2194 | idgksyf 2195 | idgkyfs 2196 | idgkysf 2197 | idgsfky 2198 | idgsfyk 2199 | idgskfy 2200 | idgskyf 2201 | idgsyfk 2202 | idgsykf 2203 | idgyfks 2204 | idgyfsk 2205 | idgykfs 2206 | idgyksf 2207 | idgysfk 2208 | idgyskf 2209 | idkfgsy 2210 | idkfgys 2211 | idkfsgy 2212 | idkfsyg 2213 | idkfygs 2214 | idkfysg 2215 | idkgfsy 2216 | idkgfys 2217 | idkgsfy 2218 | idkgsyf 2219 | idkgyfs 2220 | idkgysf 2221 | idksfgy 2222 | idksfyg 2223 | idksgfy 2224 | idksgyf 2225 | idksyfg 2226 | idksygf 2227 | idkyfgs 2228 | idkyfsg 2229 | idkygfs 2230 | idkygsf 2231 | idkysfg 2232 | idkysgf 2233 | idsfgky 2234 | idsfgyk 2235 | idsfkgy 2236 | idsfkyg 2237 | idsfygk 2238 | idsfykg 2239 | idsgfky 2240 | idsgfyk 2241 | idsgkfy 2242 | idsgkyf 2243 | idsgyfk 2244 | idsgykf 2245 | idskfgy 2246 | idskfyg 2247 | idskgfy 2248 | idskgyf 2249 | idskyfg 2250 | idskygf 2251 | idsyfgk 2252 | idsyfkg 2253 | idsygfk 2254 | idsygkf 2255 | idsykfg 2256 | idsykgf 2257 | idyfgks 2258 | idyfgsk 2259 | idyfkgs 2260 | idyfksg 2261 | idyfsgk 2262 | idyfskg 2263 | idygfks 2264 | idygfsk 2265 | idygkfs 2266 | idygksf 2267 | idygsfk 2268 | idygskf 2269 | idykfgs 2270 | idykfsg 2271 | idykgfs 2272 | idykgsf 2273 | idyksfg 2274 | idyksgf 2275 | idysfgk 2276 | idysfkg 2277 | idysgfk 2278 | idysgkf 2279 | idyskfg 2280 | idyskgf 2281 | ifdgksy 2282 | ifdgkys 2283 | ifdgsky 2284 | ifdgsyk 2285 | ifdgyks 2286 | ifdgysk 2287 | ifdkgsy 2288 | ifdkgys 2289 | ifdksgy 2290 | ifdksyg 2291 | ifdkygs 2292 | ifdkysg 2293 | ifdsgky 2294 | ifdsgyk 2295 | ifdskgy 2296 | ifdskyg 2297 | ifdsygk 2298 | ifdsykg 2299 | ifdygks 2300 | ifdygsk 2301 | ifdykgs 2302 | ifdyksg 2303 | ifdysgk 2304 | ifdyskg 2305 | ifgdksy 2306 | ifgdkys 2307 | ifgdsky 2308 | ifgdsyk 2309 | ifgdyks 2310 | ifgdysk 2311 | ifgkdsy 2312 | ifgkdys 2313 | ifgksdy 2314 | ifgksyd 2315 | ifgkyds 2316 | ifgkysd 2317 | ifgsdky 2318 | ifgsdyk 2319 | ifgskdy 2320 | ifgskyd 2321 | ifgsydk 2322 | ifgsykd 2323 | ifgydks 2324 | ifgydsk 2325 | ifgykds 2326 | ifgyksd 2327 | ifgysdk 2328 | ifgyskd 2329 | ifkdgsy 2330 | ifkdgys 2331 | ifkdsgy 2332 | ifkdsyg 2333 | ifkdygs 2334 | ifkdysg 2335 | ifkgdsy 2336 | ifkgdys 2337 | ifkgsdy 2338 | ifkgsyd 2339 | ifkgyds 2340 | ifkgysd 2341 | ifksdgy 2342 | ifksdyg 2343 | ifksgdy 2344 | ifksgyd 2345 | ifksydg 2346 | ifksygd 2347 | ifkydgs 2348 | ifkydsg 2349 | ifkygds 2350 | ifkygsd 2351 | ifkysdg 2352 | ifkysgd 2353 | ifsdgky 2354 | ifsdgyk 2355 | ifsdkgy 2356 | ifsdkyg 2357 | ifsdygk 2358 | ifsdykg 2359 | ifsgdky 2360 | ifsgdyk 2361 | ifsgkdy 2362 | ifsgkyd 2363 | ifsgydk 2364 | ifsgykd 2365 | ifskdgy 2366 | ifskdyg 2367 | ifskgdy 2368 | ifskgyd 2369 | ifskydg 2370 | ifskygd 2371 | ifsydgk 2372 | ifsydkg 2373 | ifsygdk 2374 | ifsygkd 2375 | ifsykdg 2376 | ifsykgd 2377 | ifydgks 2378 | ifydgsk 2379 | ifydkgs 2380 | ifydksg 2381 | ifydsgk 2382 | ifydskg 2383 | ifygdks 2384 | ifygdsk 2385 | ifygkds 2386 | ifygksd 2387 | ifygsdk 2388 | ifygskd 2389 | ifykdgs 2390 | ifykdsg 2391 | ifykgds 2392 | ifykgsd 2393 | ifyksdg 2394 | ifyksgd 2395 | ifysdgk 2396 | ifysdkg 2397 | ifysgdk 2398 | ifysgkd 2399 | ifyskdg 2400 | ifyskgd 2401 | igdfksy 2402 | igdfkys 2403 | igdfsky 2404 | igdfsyk 2405 | igdfyks 2406 | igdfysk 2407 | igdkfsy 2408 | igdkfys 2409 | igdksfy 2410 | igdksyf 2411 | igdkyfs 2412 | igdkysf 2413 | igdsfky 2414 | igdsfyk 2415 | igdskfy 2416 | igdskyf 2417 | igdsyfk 2418 | igdsykf 2419 | igdyfks 2420 | igdyfsk 2421 | igdykfs 2422 | igdyksf 2423 | igdysfk 2424 | igdyskf 2425 | igfdksy 2426 | igfdkys 2427 | igfdsky 2428 | igfdsyk 2429 | igfdyks 2430 | igfdysk 2431 | igfkdsy 2432 | igfkdys 2433 | igfksdy 2434 | igfksyd 2435 | igfkyds 2436 | igfkysd 2437 | igfsdky 2438 | igfsdyk 2439 | igfskdy 2440 | igfskyd 2441 | igfsydk 2442 | igfsykd 2443 | igfydks 2444 | igfydsk 2445 | igfykds 2446 | igfyksd 2447 | igfysdk 2448 | igfyskd 2449 | igkdfsy 2450 | igkdfys 2451 | igkdsfy 2452 | igkdsyf 2453 | igkdyfs 2454 | igkdysf 2455 | igkfdsy 2456 | igkfdys 2457 | igkfsdy 2458 | igkfsyd 2459 | igkfyds 2460 | igkfysd 2461 | igksdfy 2462 | igksdyf 2463 | igksfdy 2464 | igksfyd 2465 | igksydf 2466 | igksyfd 2467 | igkydfs 2468 | igkydsf 2469 | igkyfds 2470 | igkyfsd 2471 | igkysdf 2472 | igkysfd 2473 | igsdfky 2474 | igsdfyk 2475 | igsdkfy 2476 | igsdkyf 2477 | igsdyfk 2478 | igsdykf 2479 | igsfdky 2480 | igsfdyk 2481 | igsfkdy 2482 | igsfkyd 2483 | igsfydk 2484 | igsfykd 2485 | igskdfy 2486 | igskdyf 2487 | igskfdy 2488 | igskfyd 2489 | igskydf 2490 | igskyfd 2491 | igsydfk 2492 | igsydkf 2493 | igsyfdk 2494 | igsyfkd 2495 | igsykdf 2496 | igsykfd 2497 | igydfks 2498 | igydfsk 2499 | igydkfs 2500 | igydksf 2501 | igydsfk 2502 | igydskf 2503 | igyfdks 2504 | igyfdsk 2505 | igyfkds 2506 | igyfksd 2507 | igyfsdk 2508 | igyfskd 2509 | igykdfs 2510 | igykdsf 2511 | igykfds 2512 | igykfsd 2513 | igyksdf 2514 | igyksfd 2515 | igysdfk 2516 | igysdkf 2517 | igysfdk 2518 | igysfkd 2519 | igyskdf 2520 | igyskfd 2521 | ikdfgsy 2522 | ikdfgys 2523 | ikdfsgy 2524 | ikdfsyg 2525 | ikdfygs 2526 | ikdfysg 2527 | ikdgfsy 2528 | ikdgfys 2529 | ikdgsfy 2530 | ikdgsyf 2531 | ikdgyfs 2532 | ikdgysf 2533 | ikdsfgy 2534 | ikdsfyg 2535 | ikdsgfy 2536 | ikdsgyf 2537 | ikdsyfg 2538 | ikdsygf 2539 | ikdyfgs 2540 | ikdyfsg 2541 | ikdygfs 2542 | ikdygsf 2543 | ikdysfg 2544 | ikdysgf 2545 | ikfdgsy 2546 | ikfdgys 2547 | ikfdsgy 2548 | ikfdsyg 2549 | ikfdygs 2550 | ikfdysg 2551 | ikfgdsy 2552 | ikfgdys 2553 | ikfgsdy 2554 | ikfgsyd 2555 | ikfgyds 2556 | ikfgysd 2557 | ikfsdgy 2558 | ikfsdyg 2559 | ikfsgdy 2560 | ikfsgyd 2561 | ikfsydg 2562 | ikfsygd 2563 | ikfydgs 2564 | ikfydsg 2565 | ikfygds 2566 | ikfygsd 2567 | ikfysdg 2568 | ikfysgd 2569 | ikgdfsy 2570 | ikgdfys 2571 | ikgdsfy 2572 | ikgdsyf 2573 | ikgdyfs 2574 | ikgdysf 2575 | ikgfdsy 2576 | ikgfdys 2577 | ikgfsdy 2578 | ikgfsyd 2579 | ikgfyds 2580 | ikgfysd 2581 | ikgsdfy 2582 | ikgsdyf 2583 | ikgsfdy 2584 | ikgsfyd 2585 | ikgsydf 2586 | ikgsyfd 2587 | ikgydfs 2588 | ikgydsf 2589 | ikgyfds 2590 | ikgyfsd 2591 | ikgysdf 2592 | ikgysfd 2593 | iksdfgy 2594 | iksdfyg 2595 | iksdgfy 2596 | iksdgyf 2597 | iksdyfg 2598 | iksdygf 2599 | iksfdgy 2600 | iksfdyg 2601 | iksfgdy 2602 | iksfgyd 2603 | iksfydg 2604 | iksfygd 2605 | iksgdfy 2606 | iksgdyf 2607 | iksgfdy 2608 | iksgfyd 2609 | iksgydf 2610 | iksgyfd 2611 | iksydfg 2612 | iksydgf 2613 | iksyfdg 2614 | iksyfgd 2615 | iksygdf 2616 | iksygfd 2617 | ikydfgs 2618 | ikydfsg 2619 | ikydgfs 2620 | ikydgsf 2621 | ikydsfg 2622 | ikydsgf 2623 | ikyfdgs 2624 | ikyfdsg 2625 | ikyfgds 2626 | ikyfgsd 2627 | ikyfsdg 2628 | ikyfsgd 2629 | ikygdfs 2630 | ikygdsf 2631 | ikygfds 2632 | ikygfsd 2633 | ikygsdf 2634 | ikygsfd 2635 | ikysdfg 2636 | ikysdgf 2637 | ikysfdg 2638 | ikysfgd 2639 | ikysgdf 2640 | ikysgfd 2641 | isdfgky 2642 | isdfgyk 2643 | isdfkgy 2644 | isdfkyg 2645 | isdfygk 2646 | isdfykg 2647 | isdgfky 2648 | isdgfyk 2649 | isdgkfy 2650 | isdgkyf 2651 | isdgyfk 2652 | isdgykf 2653 | isdkfgy 2654 | isdkfyg 2655 | isdkgfy 2656 | isdkgyf 2657 | isdkyfg 2658 | isdkygf 2659 | isdyfgk 2660 | isdyfkg 2661 | isdygfk 2662 | isdygkf 2663 | isdykfg 2664 | isdykgf 2665 | isfdgky 2666 | isfdgyk 2667 | isfdkgy 2668 | isfdkyg 2669 | isfdygk 2670 | isfdykg 2671 | isfgdky 2672 | isfgdyk 2673 | isfgkdy 2674 | isfgkyd 2675 | isfgydk 2676 | isfgykd 2677 | isfkdgy 2678 | isfkdyg 2679 | isfkgdy 2680 | isfkgyd 2681 | isfkydg 2682 | isfkygd 2683 | isfydgk 2684 | isfydkg 2685 | isfygdk 2686 | isfygkd 2687 | isfykdg 2688 | isfykgd 2689 | isgdfky 2690 | isgdfyk 2691 | isgdkfy 2692 | isgdkyf 2693 | isgdyfk 2694 | isgdykf 2695 | isgfdky 2696 | isgfdyk 2697 | isgfkdy 2698 | isgfkyd 2699 | isgfydk 2700 | isgfykd 2701 | isgkdfy 2702 | isgkdyf 2703 | isgkfdy 2704 | isgkfyd 2705 | isgkydf 2706 | isgkyfd 2707 | isgydfk 2708 | isgydkf 2709 | isgyfdk 2710 | isgyfkd 2711 | isgykdf 2712 | isgykfd 2713 | iskdfgy 2714 | iskdfyg 2715 | iskdgfy 2716 | iskdgyf 2717 | iskdyfg 2718 | iskdygf 2719 | iskfdgy 2720 | iskfdyg 2721 | iskfgdy 2722 | iskfgyd 2723 | iskfydg 2724 | iskfygd 2725 | iskgdfy 2726 | iskgdyf 2727 | iskgfdy 2728 | iskgfyd 2729 | iskgydf 2730 | iskgyfd 2731 | iskydfg 2732 | iskydgf 2733 | iskyfdg 2734 | iskyfgd 2735 | iskygdf 2736 | iskygfd 2737 | isydfgk 2738 | isydfkg 2739 | isydgfk 2740 | isydgkf 2741 | isydkfg 2742 | isydkgf 2743 | isyfdgk 2744 | isyfdkg 2745 | isyfgdk 2746 | isyfgkd 2747 | isyfkdg 2748 | isyfkgd 2749 | isygdfk 2750 | isygdkf 2751 | isygfdk 2752 | isygfkd 2753 | isygkdf 2754 | isygkfd 2755 | isykdfg 2756 | isykdgf 2757 | isykfdg 2758 | isykfgd 2759 | isykgdf 2760 | isykgfd 2761 | iydfgks 2762 | iydfgsk 2763 | iydfkgs 2764 | iydfksg 2765 | iydfsgk 2766 | iydfskg 2767 | iydgfks 2768 | iydgfsk 2769 | iydgkfs 2770 | iydgksf 2771 | iydgsfk 2772 | iydgskf 2773 | iydkfgs 2774 | iydkfsg 2775 | iydkgfs 2776 | iydkgsf 2777 | iydksfg 2778 | iydksgf 2779 | iydsfgk 2780 | iydsfkg 2781 | iydsgfk 2782 | iydsgkf 2783 | iydskfg 2784 | iydskgf 2785 | iyfdgks 2786 | iyfdgsk 2787 | iyfdkgs 2788 | iyfdksg 2789 | iyfdsgk 2790 | iyfdskg 2791 | iyfgdks 2792 | iyfgdsk 2793 | iyfgkds 2794 | iyfgksd 2795 | iyfgsdk 2796 | iyfgskd 2797 | iyfkdgs 2798 | iyfkdsg 2799 | iyfkgds 2800 | iyfkgsd 2801 | iyfksdg 2802 | iyfksgd 2803 | iyfsdgk 2804 | iyfsdkg 2805 | iyfsgdk 2806 | iyfsgkd 2807 | iyfskdg 2808 | iyfskgd 2809 | iygdfks 2810 | iygdfsk 2811 | iygdkfs 2812 | iygdksf 2813 | iygdsfk 2814 | iygdskf 2815 | iygfdks 2816 | iygfdsk 2817 | iygfkds 2818 | iygfksd 2819 | iygfsdk 2820 | iygfskd 2821 | iygkdfs 2822 | iygkdsf 2823 | iygkfds 2824 | iygkfsd 2825 | iygksdf 2826 | iygksfd 2827 | iygsdfk 2828 | iygsdkf 2829 | iygsfdk 2830 | iygsfkd 2831 | iygskdf 2832 | iygskfd 2833 | iykdfgs 2834 | iykdfsg 2835 | iykdgfs 2836 | iykdgsf 2837 | iykdsfg 2838 | iykdsgf 2839 | iykfdgs 2840 | iykfdsg 2841 | iykfgds 2842 | iykfgsd 2843 | iykfsdg 2844 | iykfsgd 2845 | iykgdfs 2846 | iykgdsf 2847 | iykgfds 2848 | iykgfsd 2849 | iykgsdf 2850 | iykgsfd 2851 | iyksdfg 2852 | iyksdgf 2853 | iyksfdg 2854 | iyksfgd 2855 | iyksgdf 2856 | iyksgfd 2857 | iysdfgk 2858 | iysdfkg 2859 | iysdgfk 2860 | iysdgkf 2861 | iysdkfg 2862 | iysdkgf 2863 | iysfdgk 2864 | iysfdkg 2865 | iysfgdk 2866 | iysfgkd 2867 | iysfkdg 2868 | iysfkgd 2869 | iysgdfk 2870 | iysgdkf 2871 | iysgfdk 2872 | iysgfkd 2873 | iysgkdf 2874 | iysgkfd 2875 | iyskdfg 2876 | iyskdgf 2877 | iyskfdg 2878 | iyskfgd 2879 | iyskgdf 2880 | iyskgfd 2881 | kdfgisy 2882 | kdfgiys 2883 | kdfgsiy 2884 | kdfgsyi 2885 | kdfgyis 2886 | kdfgysi 2887 | kdfigsy 2888 | kdfigys 2889 | kdfisgy 2890 | kdfisyg 2891 | kdfiygs 2892 | kdfiysg 2893 | kdfsgiy 2894 | kdfsgyi 2895 | kdfsigy 2896 | kdfsiyg 2897 | kdfsygi 2898 | kdfsyig 2899 | kdfygis 2900 | kdfygsi 2901 | kdfyigs 2902 | kdfyisg 2903 | kdfysgi 2904 | kdfysig 2905 | kdgfisy 2906 | kdgfiys 2907 | kdgfsiy 2908 | kdgfsyi 2909 | kdgfyis 2910 | kdgfysi 2911 | kdgifsy 2912 | kdgifys 2913 | kdgisfy 2914 | kdgisyf 2915 | kdgiyfs 2916 | kdgiysf 2917 | kdgsfiy 2918 | kdgsfyi 2919 | kdgsify 2920 | kdgsiyf 2921 | kdgsyfi 2922 | kdgsyif 2923 | kdgyfis 2924 | kdgyfsi 2925 | kdgyifs 2926 | kdgyisf 2927 | kdgysfi 2928 | kdgysif 2929 | kdifgsy 2930 | kdifgys 2931 | kdifsgy 2932 | kdifsyg 2933 | kdifygs 2934 | kdifysg 2935 | kdigfsy 2936 | kdigfys 2937 | kdigsfy 2938 | kdigsyf 2939 | kdigyfs 2940 | kdigysf 2941 | kdisfgy 2942 | kdisfyg 2943 | kdisgfy 2944 | kdisgyf 2945 | kdisyfg 2946 | kdisygf 2947 | kdiyfgs 2948 | kdiyfsg 2949 | kdiygfs 2950 | kdiygsf 2951 | kdiysfg 2952 | kdiysgf 2953 | kdsfgiy 2954 | kdsfgyi 2955 | kdsfigy 2956 | kdsfiyg 2957 | kdsfygi 2958 | kdsfyig 2959 | kdsgfiy 2960 | kdsgfyi 2961 | kdsgify 2962 | kdsgiyf 2963 | kdsgyfi 2964 | kdsgyif 2965 | kdsifgy 2966 | kdsifyg 2967 | kdsigfy 2968 | kdsigyf 2969 | kdsiyfg 2970 | kdsiygf 2971 | kdsyfgi 2972 | kdsyfig 2973 | kdsygfi 2974 | kdsygif 2975 | kdsyifg 2976 | kdsyigf 2977 | kdyfgis 2978 | kdyfgsi 2979 | kdyfigs 2980 | kdyfisg 2981 | kdyfsgi 2982 | kdyfsig 2983 | kdygfis 2984 | kdygfsi 2985 | kdygifs 2986 | kdygisf 2987 | kdygsfi 2988 | kdygsif 2989 | kdyifgs 2990 | kdyifsg 2991 | kdyigfs 2992 | kdyigsf 2993 | kdyisfg 2994 | kdyisgf 2995 | kdysfgi 2996 | kdysfig 2997 | kdysgfi 2998 | kdysgif 2999 | kdysifg 3000 | kdysigf 3001 | kfdgisy 3002 | kfdgiys 3003 | kfdgsiy 3004 | kfdgsyi 3005 | kfdgyis 3006 | kfdgysi 3007 | kfdigsy 3008 | kfdigys 3009 | kfdisgy 3010 | kfdisyg 3011 | kfdiygs 3012 | kfdiysg 3013 | kfdsgiy 3014 | kfdsgyi 3015 | kfdsigy 3016 | kfdsiyg 3017 | kfdsygi 3018 | kfdsyig 3019 | kfdygis 3020 | kfdygsi 3021 | kfdyigs 3022 | kfdyisg 3023 | kfdysgi 3024 | kfdysig 3025 | kfgdisy 3026 | kfgdiys 3027 | kfgdsiy 3028 | kfgdsyi 3029 | kfgdyis 3030 | kfgdysi 3031 | kfgidsy 3032 | kfgidys 3033 | kfgisdy 3034 | kfgisyd 3035 | kfgiyds 3036 | kfgiysd 3037 | kfgsdiy 3038 | kfgsdyi 3039 | kfgsidy 3040 | kfgsiyd 3041 | kfgsydi 3042 | kfgsyid 3043 | kfgydis 3044 | kfgydsi 3045 | kfgyids 3046 | kfgyisd 3047 | kfgysdi 3048 | kfgysid 3049 | kfidgsy 3050 | kfidgys 3051 | kfidsgy 3052 | kfidsyg 3053 | kfidygs 3054 | kfidysg 3055 | kfigdsy 3056 | kfigdys 3057 | kfigsdy 3058 | kfigsyd 3059 | kfigyds 3060 | kfigysd 3061 | kfisdgy 3062 | kfisdyg 3063 | kfisgdy 3064 | kfisgyd 3065 | kfisydg 3066 | kfisygd 3067 | kfiydgs 3068 | kfiydsg 3069 | kfiygds 3070 | kfiygsd 3071 | kfiysdg 3072 | kfiysgd 3073 | kfsdgiy 3074 | kfsdgyi 3075 | kfsdigy 3076 | kfsdiyg 3077 | kfsdygi 3078 | kfsdyig 3079 | kfsgdiy 3080 | kfsgdyi 3081 | kfsgidy 3082 | kfsgiyd 3083 | kfsgydi 3084 | kfsgyid 3085 | kfsidgy 3086 | kfsidyg 3087 | kfsigdy 3088 | kfsigyd 3089 | kfsiydg 3090 | kfsiygd 3091 | kfsydgi 3092 | kfsydig 3093 | kfsygdi 3094 | kfsygid 3095 | kfsyidg 3096 | kfsyigd 3097 | kfydgis 3098 | kfydgsi 3099 | kfydigs 3100 | kfydisg 3101 | kfydsgi 3102 | kfydsig 3103 | kfygdis 3104 | kfygdsi 3105 | kfygids 3106 | kfygisd 3107 | kfygsdi 3108 | kfygsid 3109 | kfyidgs 3110 | kfyidsg 3111 | kfyigds 3112 | kfyigsd 3113 | kfyisdg 3114 | kfyisgd 3115 | kfysdgi 3116 | kfysdig 3117 | kfysgdi 3118 | kfysgid 3119 | kfysidg 3120 | kfysigd 3121 | kgdfisy 3122 | kgdfiys 3123 | kgdfsiy 3124 | kgdfsyi 3125 | kgdfyis 3126 | kgdfysi 3127 | kgdifsy 3128 | kgdifys 3129 | kgdisfy 3130 | kgdisyf 3131 | kgdiyfs 3132 | kgdiysf 3133 | kgdsfiy 3134 | kgdsfyi 3135 | kgdsify 3136 | kgdsiyf 3137 | kgdsyfi 3138 | kgdsyif 3139 | kgdyfis 3140 | kgdyfsi 3141 | kgdyifs 3142 | kgdyisf 3143 | kgdysfi 3144 | kgdysif 3145 | kgfdisy 3146 | kgfdiys 3147 | kgfdsiy 3148 | kgfdsyi 3149 | kgfdyis 3150 | kgfdysi 3151 | kgfidsy 3152 | kgfidys 3153 | kgfisdy 3154 | kgfisyd 3155 | kgfiyds 3156 | kgfiysd 3157 | kgfsdiy 3158 | kgfsdyi 3159 | kgfsidy 3160 | kgfsiyd 3161 | kgfsydi 3162 | kgfsyid 3163 | kgfydis 3164 | kgfydsi 3165 | kgfyids 3166 | kgfyisd 3167 | kgfysdi 3168 | kgfysid 3169 | kgidfsy 3170 | kgidfys 3171 | kgidsfy 3172 | kgidsyf 3173 | kgidyfs 3174 | kgidysf 3175 | kgifdsy 3176 | kgifdys 3177 | kgifsdy 3178 | kgifsyd 3179 | kgifyds 3180 | kgifysd 3181 | kgisdfy 3182 | kgisdyf 3183 | kgisfdy 3184 | kgisfyd 3185 | kgisydf 3186 | kgisyfd 3187 | kgiydfs 3188 | kgiydsf 3189 | kgiyfds 3190 | kgiyfsd 3191 | kgiysdf 3192 | kgiysfd 3193 | kgsdfiy 3194 | kgsdfyi 3195 | kgsdify 3196 | kgsdiyf 3197 | kgsdyfi 3198 | kgsdyif 3199 | kgsfdiy 3200 | kgsfdyi 3201 | kgsfidy 3202 | kgsfiyd 3203 | kgsfydi 3204 | kgsfyid 3205 | kgsidfy 3206 | kgsidyf 3207 | kgsifdy 3208 | kgsifyd 3209 | kgsiydf 3210 | kgsiyfd 3211 | kgsydfi 3212 | kgsydif 3213 | kgsyfdi 3214 | kgsyfid 3215 | kgsyidf 3216 | kgsyifd 3217 | kgydfis 3218 | kgydfsi 3219 | kgydifs 3220 | kgydisf 3221 | kgydsfi 3222 | kgydsif 3223 | kgyfdis 3224 | kgyfdsi 3225 | kgyfids 3226 | kgyfisd 3227 | kgyfsdi 3228 | kgyfsid 3229 | kgyidfs 3230 | kgyidsf 3231 | kgyifds 3232 | kgyifsd 3233 | kgyisdf 3234 | kgyisfd 3235 | kgysdfi 3236 | kgysdif 3237 | kgysfdi 3238 | kgysfid 3239 | kgysidf 3240 | kgysifd 3241 | kidfgsy 3242 | kidfgys 3243 | kidfsgy 3244 | kidfsyg 3245 | kidfygs 3246 | kidfysg 3247 | kidgfsy 3248 | kidgfys 3249 | kidgsfy 3250 | kidgsyf 3251 | kidgyfs 3252 | kidgysf 3253 | kidsfgy 3254 | kidsfyg 3255 | kidsgfy 3256 | kidsgyf 3257 | kidsyfg 3258 | kidsygf 3259 | kidyfgs 3260 | kidyfsg 3261 | kidygfs 3262 | kidygsf 3263 | kidysfg 3264 | kidysgf 3265 | kifdgsy 3266 | kifdgys 3267 | kifdsgy 3268 | kifdsyg 3269 | kifdygs 3270 | kifdysg 3271 | kifgdsy 3272 | kifgdys 3273 | kifgsdy 3274 | kifgsyd 3275 | kifgyds 3276 | kifgysd 3277 | kifsdgy 3278 | kifsdyg 3279 | kifsgdy 3280 | kifsgyd 3281 | kifsydg 3282 | kifsygd 3283 | kifydgs 3284 | kifydsg 3285 | kifygds 3286 | kifygsd 3287 | kifysdg 3288 | kifysgd 3289 | kigdfsy 3290 | kigdfys 3291 | kigdsfy 3292 | kigdsyf 3293 | kigdyfs 3294 | kigdysf 3295 | kigfdsy 3296 | kigfdys 3297 | kigfsdy 3298 | kigfsyd 3299 | kigfyds 3300 | kigfysd 3301 | kigsdfy 3302 | kigsdyf 3303 | kigsfdy 3304 | kigsfyd 3305 | kigsydf 3306 | kigsyfd 3307 | kigydfs 3308 | kigydsf 3309 | kigyfds 3310 | kigyfsd 3311 | kigysdf 3312 | kigysfd 3313 | kisdfgy 3314 | kisdfyg 3315 | kisdgfy 3316 | kisdgyf 3317 | kisdyfg 3318 | kisdygf 3319 | kisfdgy 3320 | kisfdyg 3321 | kisfgdy 3322 | kisfgyd 3323 | kisfydg 3324 | kisfygd 3325 | kisgdfy 3326 | kisgdyf 3327 | kisgfdy 3328 | kisgfyd 3329 | kisgydf 3330 | kisgyfd 3331 | kisydfg 3332 | kisydgf 3333 | kisyfdg 3334 | kisyfgd 3335 | kisygdf 3336 | kisygfd 3337 | kiydfgs 3338 | kiydfsg 3339 | kiydgfs 3340 | kiydgsf 3341 | kiydsfg 3342 | kiydsgf 3343 | kiyfdgs 3344 | kiyfdsg 3345 | kiyfgds 3346 | kiyfgsd 3347 | kiyfsdg 3348 | kiyfsgd 3349 | kiygdfs 3350 | kiygdsf 3351 | kiygfds 3352 | kiygfsd 3353 | kiygsdf 3354 | kiygsfd 3355 | kiysdfg 3356 | kiysdgf 3357 | kiysfdg 3358 | kiysfgd 3359 | kiysgdf 3360 | kiysgfd 3361 | ksdfgiy 3362 | ksdfgyi 3363 | ksdfigy 3364 | ksdfiyg 3365 | ksdfygi 3366 | ksdfyig 3367 | ksdgfiy 3368 | ksdgfyi 3369 | ksdgify 3370 | ksdgiyf 3371 | ksdgyfi 3372 | ksdgyif 3373 | ksdifgy 3374 | ksdifyg 3375 | ksdigfy 3376 | ksdigyf 3377 | ksdiyfg 3378 | ksdiygf 3379 | ksdyfgi 3380 | ksdyfig 3381 | ksdygfi 3382 | ksdygif 3383 | ksdyifg 3384 | ksdyigf 3385 | ksfdgiy 3386 | ksfdgyi 3387 | ksfdigy 3388 | ksfdiyg 3389 | ksfdygi 3390 | ksfdyig 3391 | ksfgdiy 3392 | ksfgdyi 3393 | ksfgidy 3394 | ksfgiyd 3395 | ksfgydi 3396 | ksfgyid 3397 | ksfidgy 3398 | ksfidyg 3399 | ksfigdy 3400 | ksfigyd 3401 | ksfiydg 3402 | ksfiygd 3403 | ksfydgi 3404 | ksfydig 3405 | ksfygdi 3406 | ksfygid 3407 | ksfyidg 3408 | ksfyigd 3409 | ksgdfiy 3410 | ksgdfyi 3411 | ksgdify 3412 | ksgdiyf 3413 | ksgdyfi 3414 | ksgdyif 3415 | ksgfdiy 3416 | ksgfdyi 3417 | ksgfidy 3418 | ksgfiyd 3419 | ksgfydi 3420 | ksgfyid 3421 | ksgidfy 3422 | ksgidyf 3423 | ksgifdy 3424 | ksgifyd 3425 | ksgiydf 3426 | ksgiyfd 3427 | ksgydfi 3428 | ksgydif 3429 | ksgyfdi 3430 | ksgyfid 3431 | ksgyidf 3432 | ksgyifd 3433 | ksidfgy 3434 | ksidfyg 3435 | ksidgfy 3436 | ksidgyf 3437 | ksidyfg 3438 | ksidygf 3439 | ksifdgy 3440 | ksifdyg 3441 | ksifgdy 3442 | ksifgyd 3443 | ksifydg 3444 | ksifygd 3445 | ksigdfy 3446 | ksigdyf 3447 | ksigfdy 3448 | ksigfyd 3449 | ksigydf 3450 | ksigyfd 3451 | ksiydfg 3452 | ksiydgf 3453 | ksiyfdg 3454 | ksiyfgd 3455 | ksiygdf 3456 | ksiygfd 3457 | ksydfgi 3458 | ksydfig 3459 | ksydgfi 3460 | ksydgif 3461 | ksydifg 3462 | ksydigf 3463 | ksyfdgi 3464 | ksyfdig 3465 | ksyfgdi 3466 | ksyfgid 3467 | ksyfidg 3468 | ksyfigd 3469 | ksygdfi 3470 | ksygdif 3471 | ksygfdi 3472 | ksygfid 3473 | ksygidf 3474 | ksygifd 3475 | ksyidfg 3476 | ksyidgf 3477 | ksyifdg 3478 | ksyifgd 3479 | ksyigdf 3480 | ksyigfd 3481 | kydfgis 3482 | kydfgsi 3483 | kydfigs 3484 | kydfisg 3485 | kydfsgi 3486 | kydfsig 3487 | kydgfis 3488 | kydgfsi 3489 | kydgifs 3490 | kydgisf 3491 | kydgsfi 3492 | kydgsif 3493 | kydifgs 3494 | kydifsg 3495 | kydigfs 3496 | kydigsf 3497 | kydisfg 3498 | kydisgf 3499 | kydsfgi 3500 | kydsfig 3501 | kydsgfi 3502 | kydsgif 3503 | kydsifg 3504 | kydsigf 3505 | kyfdgis 3506 | kyfdgsi 3507 | kyfdigs 3508 | kyfdisg 3509 | kyfdsgi 3510 | kyfdsig 3511 | kyfgdis 3512 | kyfgdsi 3513 | kyfgids 3514 | kyfgisd 3515 | kyfgsdi 3516 | kyfgsid 3517 | kyfidgs 3518 | kyfidsg 3519 | kyfigds 3520 | kyfigsd 3521 | kyfisdg 3522 | kyfisgd 3523 | kyfsdgi 3524 | kyfsdig 3525 | kyfsgdi 3526 | kyfsgid 3527 | kyfsidg 3528 | kyfsigd 3529 | kygdfis 3530 | kygdfsi 3531 | kygdifs 3532 | kygdisf 3533 | kygdsfi 3534 | kygdsif 3535 | kygfdis 3536 | kygfdsi 3537 | kygfids 3538 | kygfisd 3539 | kygfsdi 3540 | kygfsid 3541 | kygidfs 3542 | kygidsf 3543 | kygifds 3544 | kygifsd 3545 | kygisdf 3546 | kygisfd 3547 | kygsdfi 3548 | kygsdif 3549 | kygsfdi 3550 | kygsfid 3551 | kygsidf 3552 | kygsifd 3553 | kyidfgs 3554 | kyidfsg 3555 | kyidgfs 3556 | kyidgsf 3557 | kyidsfg 3558 | kyidsgf 3559 | kyifdgs 3560 | kyifdsg 3561 | kyifgds 3562 | kyifgsd 3563 | kyifsdg 3564 | kyifsgd 3565 | kyigdfs 3566 | kyigdsf 3567 | kyigfds 3568 | kyigfsd 3569 | kyigsdf 3570 | kyigsfd 3571 | kyisdfg 3572 | kyisdgf 3573 | kyisfdg 3574 | kyisfgd 3575 | kyisgdf 3576 | kyisgfd 3577 | kysdfgi 3578 | kysdfig 3579 | kysdgfi 3580 | kysdgif 3581 | kysdifg 3582 | kysdigf 3583 | kysfdgi 3584 | kysfdig 3585 | kysfgdi 3586 | kysfgid 3587 | kysfidg 3588 | kysfigd 3589 | kysgdfi 3590 | kysgdif 3591 | kysgfdi 3592 | kysgfid 3593 | kysgidf 3594 | kysgifd 3595 | kysidfg 3596 | kysidgf 3597 | kysifdg 3598 | kysifgd 3599 | kysigdf 3600 | kysigfd 3601 | sdfgiky 3602 | sdfgiyk 3603 | sdfgkiy 3604 | sdfgkyi 3605 | sdfgyik 3606 | sdfgyki 3607 | sdfigky 3608 | sdfigyk 3609 | sdfikgy 3610 | sdfikyg 3611 | sdfiygk 3612 | sdfiykg 3613 | sdfkgiy 3614 | sdfkgyi 3615 | sdfkigy 3616 | sdfkiyg 3617 | sdfkygi 3618 | sdfkyig 3619 | sdfygik 3620 | sdfygki 3621 | sdfyigk 3622 | sdfyikg 3623 | sdfykgi 3624 | sdfykig 3625 | sdgfiky 3626 | sdgfiyk 3627 | sdgfkiy 3628 | sdgfkyi 3629 | sdgfyik 3630 | sdgfyki 3631 | sdgifky 3632 | sdgifyk 3633 | sdgikfy 3634 | sdgikyf 3635 | sdgiyfk 3636 | sdgiykf 3637 | sdgkfiy 3638 | sdgkfyi 3639 | sdgkify 3640 | sdgkiyf 3641 | sdgkyfi 3642 | sdgkyif 3643 | sdgyfik 3644 | sdgyfki 3645 | sdgyifk 3646 | sdgyikf 3647 | sdgykfi 3648 | sdgykif 3649 | sdifgky 3650 | sdifgyk 3651 | sdifkgy 3652 | sdifkyg 3653 | sdifygk 3654 | sdifykg 3655 | sdigfky 3656 | sdigfyk 3657 | sdigkfy 3658 | sdigkyf 3659 | sdigyfk 3660 | sdigykf 3661 | sdikfgy 3662 | sdikfyg 3663 | sdikgfy 3664 | sdikgyf 3665 | sdikyfg 3666 | sdikygf 3667 | sdiyfgk 3668 | sdiyfkg 3669 | sdiygfk 3670 | sdiygkf 3671 | sdiykfg 3672 | sdiykgf 3673 | sdkfgiy 3674 | sdkfgyi 3675 | sdkfigy 3676 | sdkfiyg 3677 | sdkfygi 3678 | sdkfyig 3679 | sdkgfiy 3680 | sdkgfyi 3681 | sdkgify 3682 | sdkgiyf 3683 | sdkgyfi 3684 | sdkgyif 3685 | sdkifgy 3686 | sdkifyg 3687 | sdkigfy 3688 | sdkigyf 3689 | sdkiyfg 3690 | sdkiygf 3691 | sdkyfgi 3692 | sdkyfig 3693 | sdkygfi 3694 | sdkygif 3695 | sdkyifg 3696 | sdkyigf 3697 | sdyfgik 3698 | sdyfgki 3699 | sdyfigk 3700 | sdyfikg 3701 | sdyfkgi 3702 | sdyfkig 3703 | sdygfik 3704 | sdygfki 3705 | sdygifk 3706 | sdygikf 3707 | sdygkfi 3708 | sdygkif 3709 | sdyifgk 3710 | sdyifkg 3711 | sdyigfk 3712 | sdyigkf 3713 | sdyikfg 3714 | sdyikgf 3715 | sdykfgi 3716 | sdykfig 3717 | sdykgfi 3718 | sdykgif 3719 | sdykifg 3720 | sdykigf 3721 | sfdgiky 3722 | sfdgiyk 3723 | sfdgkiy 3724 | sfdgkyi 3725 | sfdgyik 3726 | sfdgyki 3727 | sfdigky 3728 | sfdigyk 3729 | sfdikgy 3730 | sfdikyg 3731 | sfdiygk 3732 | sfdiykg 3733 | sfdkgiy 3734 | sfdkgyi 3735 | sfdkigy 3736 | sfdkiyg 3737 | sfdkygi 3738 | sfdkyig 3739 | sfdygik 3740 | sfdygki 3741 | sfdyigk 3742 | sfdyikg 3743 | sfdykgi 3744 | sfdykig 3745 | sfgdiky 3746 | sfgdiyk 3747 | sfgdkiy 3748 | sfgdkyi 3749 | sfgdyik 3750 | sfgdyki 3751 | sfgidky 3752 | sfgidyk 3753 | sfgikdy 3754 | sfgikyd 3755 | sfgiydk 3756 | sfgiykd 3757 | sfgkdiy 3758 | sfgkdyi 3759 | sfgkidy 3760 | sfgkiyd 3761 | sfgkydi 3762 | sfgkyid 3763 | sfgydik 3764 | sfgydki 3765 | sfgyidk 3766 | sfgyikd 3767 | sfgykdi 3768 | sfgykid 3769 | sfidgky 3770 | sfidgyk 3771 | sfidkgy 3772 | sfidkyg 3773 | sfidygk 3774 | sfidykg 3775 | sfigdky 3776 | sfigdyk 3777 | sfigkdy 3778 | sfigkyd 3779 | sfigydk 3780 | sfigykd 3781 | sfikdgy 3782 | sfikdyg 3783 | sfikgdy 3784 | sfikgyd 3785 | sfikydg 3786 | sfikygd 3787 | sfiydgk 3788 | sfiydkg 3789 | sfiygdk 3790 | sfiygkd 3791 | sfiykdg 3792 | sfiykgd 3793 | sfkdgiy 3794 | sfkdgyi 3795 | sfkdigy 3796 | sfkdiyg 3797 | sfkdygi 3798 | sfkdyig 3799 | sfkgdiy 3800 | sfkgdyi 3801 | sfkgidy 3802 | sfkgiyd 3803 | sfkgydi 3804 | sfkgyid 3805 | sfkidgy 3806 | sfkidyg 3807 | sfkigdy 3808 | sfkigyd 3809 | sfkiydg 3810 | sfkiygd 3811 | sfkydgi 3812 | sfkydig 3813 | sfkygdi 3814 | sfkygid 3815 | sfkyidg 3816 | sfkyigd 3817 | sfydgik 3818 | sfydgki 3819 | sfydigk 3820 | sfydikg 3821 | sfydkgi 3822 | sfydkig 3823 | sfygdik 3824 | sfygdki 3825 | sfygidk 3826 | sfygikd 3827 | sfygkdi 3828 | sfygkid 3829 | sfyidgk 3830 | sfyidkg 3831 | sfyigdk 3832 | sfyigkd 3833 | sfyikdg 3834 | sfyikgd 3835 | sfykdgi 3836 | sfykdig 3837 | sfykgdi 3838 | sfykgid 3839 | sfykidg 3840 | sfykigd 3841 | sgdfiky 3842 | sgdfiyk 3843 | sgdfkiy 3844 | sgdfkyi 3845 | sgdfyik 3846 | sgdfyki 3847 | sgdifky 3848 | sgdifyk 3849 | sgdikfy 3850 | sgdikyf 3851 | sgdiyfk 3852 | sgdiykf 3853 | sgdkfiy 3854 | sgdkfyi 3855 | sgdkify 3856 | sgdkiyf 3857 | sgdkyfi 3858 | sgdkyif 3859 | sgdyfik 3860 | sgdyfki 3861 | sgdyifk 3862 | sgdyikf 3863 | sgdykfi 3864 | sgdykif 3865 | sgfdiky 3866 | sgfdiyk 3867 | sgfdkiy 3868 | sgfdkyi 3869 | sgfdyik 3870 | sgfdyki 3871 | sgfidky 3872 | sgfidyk 3873 | sgfikdy 3874 | sgfikyd 3875 | sgfiydk 3876 | sgfiykd 3877 | sgfkdiy 3878 | sgfkdyi 3879 | sgfkidy 3880 | sgfkiyd 3881 | sgfkydi 3882 | sgfkyid 3883 | sgfydik 3884 | sgfydki 3885 | sgfyidk 3886 | sgfyikd 3887 | sgfykdi 3888 | sgfykid 3889 | sgidfky 3890 | sgidfyk 3891 | sgidkfy 3892 | sgidkyf 3893 | sgidyfk 3894 | sgidykf 3895 | sgifdky 3896 | sgifdyk 3897 | sgifkdy 3898 | sgifkyd 3899 | sgifydk 3900 | sgifykd 3901 | sgikdfy 3902 | sgikdyf 3903 | sgikfdy 3904 | sgikfyd 3905 | sgikydf 3906 | sgikyfd 3907 | sgiydfk 3908 | sgiydkf 3909 | sgiyfdk 3910 | sgiyfkd 3911 | sgiykdf 3912 | sgiykfd 3913 | sgkdfiy 3914 | sgkdfyi 3915 | sgkdify 3916 | sgkdiyf 3917 | sgkdyfi 3918 | sgkdyif 3919 | sgkfdiy 3920 | sgkfdyi 3921 | sgkfidy 3922 | sgkfiyd 3923 | sgkfydi 3924 | sgkfyid 3925 | sgkidfy 3926 | sgkidyf 3927 | sgkifdy 3928 | sgkifyd 3929 | sgkiydf 3930 | sgkiyfd 3931 | sgkydfi 3932 | sgkydif 3933 | sgkyfdi 3934 | sgkyfid 3935 | sgkyidf 3936 | sgkyifd 3937 | sgydfik 3938 | sgydfki 3939 | sgydifk 3940 | sgydikf 3941 | sgydkfi 3942 | sgydkif 3943 | sgyfdik 3944 | sgyfdki 3945 | sgyfidk 3946 | sgyfikd 3947 | sgyfkdi 3948 | sgyfkid 3949 | sgyidfk 3950 | sgyidkf 3951 | sgyifdk 3952 | sgyifkd 3953 | sgyikdf 3954 | sgyikfd 3955 | sgykdfi 3956 | sgykdif 3957 | sgykfdi 3958 | sgykfid 3959 | sgykidf 3960 | sgykifd 3961 | sidfgky 3962 | sidfgyk 3963 | sidfkgy 3964 | sidfkyg 3965 | sidfygk 3966 | sidfykg 3967 | sidgfky 3968 | sidgfyk 3969 | sidgkfy 3970 | sidgkyf 3971 | sidgyfk 3972 | sidgykf 3973 | sidkfgy 3974 | sidkfyg 3975 | sidkgfy 3976 | sidkgyf 3977 | sidkyfg 3978 | sidkygf 3979 | sidyfgk 3980 | sidyfkg 3981 | sidygfk 3982 | sidygkf 3983 | sidykfg 3984 | sidykgf 3985 | sifdgky 3986 | sifdgyk 3987 | sifdkgy 3988 | sifdkyg 3989 | sifdygk 3990 | sifdykg 3991 | sifgdky 3992 | sifgdyk 3993 | sifgkdy 3994 | sifgkyd 3995 | sifgydk 3996 | sifgykd 3997 | sifkdgy 3998 | sifkdyg 3999 | sifkgdy 4000 | sifkgyd 4001 | sifkydg 4002 | sifkygd 4003 | sifydgk 4004 | sifydkg 4005 | sifygdk 4006 | sifygkd 4007 | sifykdg 4008 | sifykgd 4009 | sigdfky 4010 | sigdfyk 4011 | sigdkfy 4012 | sigdkyf 4013 | sigdyfk 4014 | sigdykf 4015 | sigfdky 4016 | sigfdyk 4017 | sigfkdy 4018 | sigfkyd 4019 | sigfydk 4020 | sigfykd 4021 | sigkdfy 4022 | sigkdyf 4023 | sigkfdy 4024 | sigkfyd 4025 | sigkydf 4026 | sigkyfd 4027 | sigydfk 4028 | sigydkf 4029 | sigyfdk 4030 | sigyfkd 4031 | sigykdf 4032 | sigykfd 4033 | sikdfgy 4034 | sikdfyg 4035 | sikdgfy 4036 | sikdgyf 4037 | sikdyfg 4038 | sikdygf 4039 | sikfdgy 4040 | sikfdyg 4041 | sikfgdy 4042 | sikfgyd 4043 | sikfydg 4044 | sikfygd 4045 | sikgdfy 4046 | sikgdyf 4047 | sikgfdy 4048 | sikgfyd 4049 | sikgydf 4050 | sikgyfd 4051 | sikydfg 4052 | sikydgf 4053 | sikyfdg 4054 | sikyfgd 4055 | sikygdf 4056 | sikygfd 4057 | siydfgk 4058 | siydfkg 4059 | siydgfk 4060 | siydgkf 4061 | siydkfg 4062 | siydkgf 4063 | siyfdgk 4064 | siyfdkg 4065 | siyfgdk 4066 | siyfgkd 4067 | siyfkdg 4068 | siyfkgd 4069 | siygdfk 4070 | siygdkf 4071 | siygfdk 4072 | siygfkd 4073 | siygkdf 4074 | siygkfd 4075 | siykdfg 4076 | siykdgf 4077 | siykfdg 4078 | siykfgd 4079 | siykgdf 4080 | siykgfd 4081 | skdfgiy 4082 | skdfgyi 4083 | skdfigy 4084 | skdfiyg 4085 | skdfygi 4086 | skdfyig 4087 | skdgfiy 4088 | skdgfyi 4089 | skdgify 4090 | skdgiyf 4091 | skdgyfi 4092 | skdgyif 4093 | skdifgy 4094 | skdifyg 4095 | skdigfy 4096 | skdigyf 4097 | skdiyfg 4098 | skdiygf 4099 | skdyfgi 4100 | skdyfig 4101 | skdygfi 4102 | skdygif 4103 | skdyifg 4104 | skdyigf 4105 | skfdgiy 4106 | skfdgyi 4107 | skfdigy 4108 | skfdiyg 4109 | skfdygi 4110 | skfdyig 4111 | skfgdiy 4112 | skfgdyi 4113 | skfgidy 4114 | skfgiyd 4115 | skfgydi 4116 | skfgyid 4117 | skfidgy 4118 | skfidyg 4119 | skfigdy 4120 | skfigyd 4121 | skfiydg 4122 | skfiygd 4123 | skfydgi 4124 | skfydig 4125 | skfygdi 4126 | skfygid 4127 | skfyidg 4128 | skfyigd 4129 | skgdfiy 4130 | skgdfyi 4131 | skgdify 4132 | skgdiyf 4133 | skgdyfi 4134 | skgdyif 4135 | skgfdiy 4136 | skgfdyi 4137 | skgfidy 4138 | skgfiyd 4139 | skgfydi 4140 | skgfyid 4141 | skgidfy 4142 | skgidyf 4143 | skgifdy 4144 | skgifyd 4145 | skgiydf 4146 | skgiyfd 4147 | skgydfi 4148 | skgydif 4149 | skgyfdi 4150 | skgyfid 4151 | skgyidf 4152 | skgyifd 4153 | skidfgy 4154 | skidfyg 4155 | skidgfy 4156 | skidgyf 4157 | skidyfg 4158 | skidygf 4159 | skifdgy 4160 | skifdyg 4161 | skifgdy 4162 | skifgyd 4163 | skifydg 4164 | skifygd 4165 | skigdfy 4166 | skigdyf 4167 | skigfdy 4168 | skigfyd 4169 | skigydf 4170 | skigyfd 4171 | skiydfg 4172 | skiydgf 4173 | skiyfdg 4174 | skiyfgd 4175 | skiygdf 4176 | skiygfd 4177 | skydfgi 4178 | skydfig 4179 | skydgfi 4180 | skydgif 4181 | skydifg 4182 | skydigf 4183 | skyfdgi 4184 | skyfdig 4185 | skyfgdi 4186 | skyfgid 4187 | skyfidg 4188 | skyfigd 4189 | skygdfi 4190 | skygdif 4191 | skygfdi 4192 | skygfid 4193 | skygidf 4194 | skygifd 4195 | skyidfg 4196 | skyidgf 4197 | skyifdg 4198 | skyifgd 4199 | skyigdf 4200 | skyigfd 4201 | sydfgik 4202 | sydfgki 4203 | sydfigk 4204 | sydfikg 4205 | sydfkgi 4206 | sydfkig 4207 | sydgfik 4208 | sydgfki 4209 | sydgifk 4210 | sydgikf 4211 | sydgkfi 4212 | sydgkif 4213 | sydifgk 4214 | sydifkg 4215 | sydigfk 4216 | sydigkf 4217 | sydikfg 4218 | sydikgf 4219 | sydkfgi 4220 | sydkfig 4221 | sydkgfi 4222 | sydkgif 4223 | sydkifg 4224 | sydkigf 4225 | syfdgik 4226 | syfdgki 4227 | syfdigk 4228 | syfdikg 4229 | syfdkgi 4230 | syfdkig 4231 | syfgdik 4232 | syfgdki 4233 | syfgidk 4234 | syfgikd 4235 | syfgkdi 4236 | syfgkid 4237 | syfidgk 4238 | syfidkg 4239 | syfigdk 4240 | syfigkd 4241 | syfikdg 4242 | syfikgd 4243 | syfkdgi 4244 | syfkdig 4245 | syfkgdi 4246 | syfkgid 4247 | syfkidg 4248 | syfkigd 4249 | sygdfik 4250 | sygdfki 4251 | sygdifk 4252 | sygdikf 4253 | sygdkfi 4254 | sygdkif 4255 | sygfdik 4256 | sygfdki 4257 | sygfidk 4258 | sygfikd 4259 | sygfkdi 4260 | sygfkid 4261 | sygidfk 4262 | sygidkf 4263 | sygifdk 4264 | sygifkd 4265 | sygikdf 4266 | sygikfd 4267 | sygkdfi 4268 | sygkdif 4269 | sygkfdi 4270 | sygkfid 4271 | sygkidf 4272 | sygkifd 4273 | syidfgk 4274 | syidfkg 4275 | syidgfk 4276 | syidgkf 4277 | syidkfg 4278 | syidkgf 4279 | syifdgk 4280 | syifdkg 4281 | syifgdk 4282 | syifgkd 4283 | syifkdg 4284 | syifkgd 4285 | syigdfk 4286 | syigdkf 4287 | syigfdk 4288 | syigfkd 4289 | syigkdf 4290 | syigkfd 4291 | syikdfg 4292 | syikdgf 4293 | syikfdg 4294 | syikfgd 4295 | syikgdf 4296 | syikgfd 4297 | sykdfgi 4298 | sykdfig 4299 | sykdgfi 4300 | sykdgif 4301 | sykdifg 4302 | sykdigf 4303 | sykfdgi 4304 | sykfdig 4305 | sykfgdi 4306 | sykfgid 4307 | sykfidg 4308 | sykfigd 4309 | sykgdfi 4310 | sykgdif 4311 | sykgfdi 4312 | sykgfid 4313 | sykgidf 4314 | sykgifd 4315 | sykidfg 4316 | sykidgf 4317 | sykifdg 4318 | sykifgd 4319 | sykigdf 4320 | sykigfd 4321 | ydfgiks 4322 | ydfgisk 4323 | ydfgkis 4324 | ydfgksi 4325 | ydfgsik 4326 | ydfgski 4327 | ydfigks 4328 | ydfigsk 4329 | ydfikgs 4330 | ydfiksg 4331 | ydfisgk 4332 | ydfiskg 4333 | ydfkgis 4334 | ydfkgsi 4335 | ydfkigs 4336 | ydfkisg 4337 | ydfksgi 4338 | ydfksig 4339 | ydfsgik 4340 | ydfsgki 4341 | ydfsigk 4342 | ydfsikg 4343 | ydfskgi 4344 | ydfskig 4345 | ydgfiks 4346 | ydgfisk 4347 | ydgfkis 4348 | ydgfksi 4349 | ydgfsik 4350 | ydgfski 4351 | ydgifks 4352 | ydgifsk 4353 | ydgikfs 4354 | ydgiksf 4355 | ydgisfk 4356 | ydgiskf 4357 | ydgkfis 4358 | ydgkfsi 4359 | ydgkifs 4360 | ydgkisf 4361 | ydgksfi 4362 | ydgksif 4363 | ydgsfik 4364 | ydgsfki 4365 | ydgsifk 4366 | ydgsikf 4367 | ydgskfi 4368 | ydgskif 4369 | ydifgks 4370 | ydifgsk 4371 | ydifkgs 4372 | ydifksg 4373 | ydifsgk 4374 | ydifskg 4375 | ydigfks 4376 | ydigfsk 4377 | ydigkfs 4378 | ydigksf 4379 | ydigsfk 4380 | ydigskf 4381 | ydikfgs 4382 | ydikfsg 4383 | ydikgfs 4384 | ydikgsf 4385 | ydiksfg 4386 | ydiksgf 4387 | ydisfgk 4388 | ydisfkg 4389 | ydisgfk 4390 | ydisgkf 4391 | ydiskfg 4392 | ydiskgf 4393 | ydkfgis 4394 | ydkfgsi 4395 | ydkfigs 4396 | ydkfisg 4397 | ydkfsgi 4398 | ydkfsig 4399 | ydkgfis 4400 | ydkgfsi 4401 | ydkgifs 4402 | ydkgisf 4403 | ydkgsfi 4404 | ydkgsif 4405 | ydkifgs 4406 | ydkifsg 4407 | ydkigfs 4408 | ydkigsf 4409 | ydkisfg 4410 | ydkisgf 4411 | ydksfgi 4412 | ydksfig 4413 | ydksgfi 4414 | ydksgif 4415 | ydksifg 4416 | ydksigf 4417 | ydsfgik 4418 | ydsfgki 4419 | ydsfigk 4420 | ydsfikg 4421 | ydsfkgi 4422 | ydsfkig 4423 | ydsgfik 4424 | ydsgfki 4425 | ydsgifk 4426 | ydsgikf 4427 | ydsgkfi 4428 | ydsgkif 4429 | ydsifgk 4430 | ydsifkg 4431 | ydsigfk 4432 | ydsigkf 4433 | ydsikfg 4434 | ydsikgf 4435 | ydskfgi 4436 | ydskfig 4437 | ydskgfi 4438 | ydskgif 4439 | ydskifg 4440 | ydskigf 4441 | yfdgiks 4442 | yfdgisk 4443 | yfdgkis 4444 | yfdgksi 4445 | yfdgsik 4446 | yfdgski 4447 | yfdigks 4448 | yfdigsk 4449 | yfdikgs 4450 | yfdiksg 4451 | yfdisgk 4452 | yfdiskg 4453 | yfdkgis 4454 | yfdkgsi 4455 | yfdkigs 4456 | yfdkisg 4457 | yfdksgi 4458 | yfdksig 4459 | yfdsgik 4460 | yfdsgki 4461 | yfdsigk 4462 | yfdsikg 4463 | yfdskgi 4464 | yfdskig 4465 | yfgdiks 4466 | yfgdisk 4467 | yfgdkis 4468 | yfgdksi 4469 | yfgdsik 4470 | yfgdski 4471 | yfgidks 4472 | yfgidsk 4473 | yfgikds 4474 | yfgiksd 4475 | yfgisdk 4476 | yfgiskd 4477 | yfgkdis 4478 | yfgkdsi 4479 | yfgkids 4480 | yfgkisd 4481 | yfgksdi 4482 | yfgksid 4483 | yfgsdik 4484 | yfgsdki 4485 | yfgsidk 4486 | yfgsikd 4487 | yfgskdi 4488 | yfgskid 4489 | yfidgks 4490 | yfidgsk 4491 | yfidkgs 4492 | yfidksg 4493 | yfidsgk 4494 | yfidskg 4495 | yfigdks 4496 | yfigdsk 4497 | yfigkds 4498 | yfigksd 4499 | yfigsdk 4500 | yfigskd 4501 | yfikdgs 4502 | yfikdsg 4503 | yfikgds 4504 | yfikgsd 4505 | yfiksdg 4506 | yfiksgd 4507 | yfisdgk 4508 | yfisdkg 4509 | yfisgdk 4510 | yfisgkd 4511 | yfiskdg 4512 | yfiskgd 4513 | yfkdgis 4514 | yfkdgsi 4515 | yfkdigs 4516 | yfkdisg 4517 | yfkdsgi 4518 | yfkdsig 4519 | yfkgdis 4520 | yfkgdsi 4521 | yfkgids 4522 | yfkgisd 4523 | yfkgsdi 4524 | yfkgsid 4525 | yfkidgs 4526 | yfkidsg 4527 | yfkigds 4528 | yfkigsd 4529 | yfkisdg 4530 | yfkisgd 4531 | yfksdgi 4532 | yfksdig 4533 | yfksgdi 4534 | yfksgid 4535 | yfksidg 4536 | yfksigd 4537 | yfsdgik 4538 | yfsdgki 4539 | yfsdigk 4540 | yfsdikg 4541 | yfsdkgi 4542 | yfsdkig 4543 | yfsgdik 4544 | yfsgdki 4545 | yfsgidk 4546 | yfsgikd 4547 | yfsgkdi 4548 | yfsgkid 4549 | yfsidgk 4550 | yfsidkg 4551 | yfsigdk 4552 | yfsigkd 4553 | yfsikdg 4554 | yfsikgd 4555 | yfskdgi 4556 | yfskdig 4557 | yfskgdi 4558 | yfskgid 4559 | yfskidg 4560 | yfskigd 4561 | ygdfiks 4562 | ygdfisk 4563 | ygdfkis 4564 | ygdfksi 4565 | ygdfsik 4566 | ygdfski 4567 | ygdifks 4568 | ygdifsk 4569 | ygdikfs 4570 | ygdiksf 4571 | ygdisfk 4572 | ygdiskf 4573 | ygdkfis 4574 | ygdkfsi 4575 | ygdkifs 4576 | ygdkisf 4577 | ygdksfi 4578 | ygdksif 4579 | ygdsfik 4580 | ygdsfki 4581 | ygdsifk 4582 | ygdsikf 4583 | ygdskfi 4584 | ygdskif 4585 | ygfdiks 4586 | ygfdisk 4587 | ygfdkis 4588 | ygfdksi 4589 | ygfdsik 4590 | ygfdski 4591 | ygfidks 4592 | ygfidsk 4593 | ygfikds 4594 | ygfiksd 4595 | ygfisdk 4596 | ygfiskd 4597 | ygfkdis 4598 | ygfkdsi 4599 | ygfkids 4600 | ygfkisd 4601 | ygfksdi 4602 | ygfksid 4603 | ygfsdik 4604 | ygfsdki 4605 | ygfsidk 4606 | ygfsikd 4607 | ygfskdi 4608 | ygfskid 4609 | ygidfks 4610 | ygidfsk 4611 | ygidkfs 4612 | ygidksf 4613 | ygidsfk 4614 | ygidskf 4615 | ygifdks 4616 | ygifdsk 4617 | ygifkds 4618 | ygifksd 4619 | ygifsdk 4620 | ygifskd 4621 | ygikdfs 4622 | ygikdsf 4623 | ygikfds 4624 | ygikfsd 4625 | ygiksdf 4626 | ygiksfd 4627 | ygisdfk 4628 | ygisdkf 4629 | ygisfdk 4630 | ygisfkd 4631 | ygiskdf 4632 | ygiskfd 4633 | ygkdfis 4634 | ygkdfsi 4635 | ygkdifs 4636 | ygkdisf 4637 | ygkdsfi 4638 | ygkdsif 4639 | ygkfdis 4640 | ygkfdsi 4641 | ygkfids 4642 | ygkfisd 4643 | ygkfsdi 4644 | ygkfsid 4645 | ygkidfs 4646 | ygkidsf 4647 | ygkifds 4648 | ygkifsd 4649 | ygkisdf 4650 | ygkisfd 4651 | ygksdfi 4652 | ygksdif 4653 | ygksfdi 4654 | ygksfid 4655 | ygksidf 4656 | ygksifd 4657 | ygsdfik 4658 | ygsdfki 4659 | ygsdifk 4660 | ygsdikf 4661 | ygsdkfi 4662 | ygsdkif 4663 | ygsfdik 4664 | ygsfdki 4665 | ygsfidk 4666 | ygsfikd 4667 | ygsfkdi 4668 | ygsfkid 4669 | ygsidfk 4670 | ygsidkf 4671 | ygsifdk 4672 | ygsifkd 4673 | ygsikdf 4674 | ygsikfd 4675 | ygskdfi 4676 | ygskdif 4677 | ygskfdi 4678 | ygskfid 4679 | ygskidf 4680 | ygskifd 4681 | yidfgks 4682 | yidfgsk 4683 | yidfkgs 4684 | yidfksg 4685 | yidfsgk 4686 | yidfskg 4687 | yidgfks 4688 | yidgfsk 4689 | yidgkfs 4690 | yidgksf 4691 | yidgsfk 4692 | yidgskf 4693 | yidkfgs 4694 | yidkfsg 4695 | yidkgfs 4696 | yidkgsf 4697 | yidksfg 4698 | yidksgf 4699 | yidsfgk 4700 | yidsfkg 4701 | yidsgfk 4702 | yidsgkf 4703 | yidskfg 4704 | yidskgf 4705 | yifdgks 4706 | yifdgsk 4707 | yifdkgs 4708 | yifdksg 4709 | yifdsgk 4710 | yifdskg 4711 | yifgdks 4712 | yifgdsk 4713 | yifgkds 4714 | yifgksd 4715 | yifgsdk 4716 | yifgskd 4717 | yifkdgs 4718 | yifkdsg 4719 | yifkgds 4720 | yifkgsd 4721 | yifksdg 4722 | yifksgd 4723 | yifsdgk 4724 | yifsdkg 4725 | yifsgdk 4726 | yifsgkd 4727 | yifskdg 4728 | yifskgd 4729 | yigdfks 4730 | yigdfsk 4731 | yigdkfs 4732 | yigdksf 4733 | yigdsfk 4734 | yigdskf 4735 | yigfdks 4736 | yigfdsk 4737 | yigfkds 4738 | yigfksd 4739 | yigfsdk 4740 | yigfskd 4741 | yigkdfs 4742 | yigkdsf 4743 | yigkfds 4744 | yigkfsd 4745 | yigksdf 4746 | yigksfd 4747 | yigsdfk 4748 | yigsdkf 4749 | yigsfdk 4750 | yigsfkd 4751 | yigskdf 4752 | yigskfd 4753 | yikdfgs 4754 | yikdfsg 4755 | yikdgfs 4756 | yikdgsf 4757 | yikdsfg 4758 | yikdsgf 4759 | yikfdgs 4760 | yikfdsg 4761 | yikfgds 4762 | yikfgsd 4763 | yikfsdg 4764 | yikfsgd 4765 | yikgdfs 4766 | yikgdsf 4767 | yikgfds 4768 | yikgfsd 4769 | yikgsdf 4770 | yikgsfd 4771 | yiksdfg 4772 | yiksdgf 4773 | yiksfdg 4774 | yiksfgd 4775 | yiksgdf 4776 | yiksgfd 4777 | yisdfgk 4778 | yisdfkg 4779 | yisdgfk 4780 | yisdgkf 4781 | yisdkfg 4782 | yisdkgf 4783 | yisfdgk 4784 | yisfdkg 4785 | yisfgdk 4786 | yisfgkd 4787 | yisfkdg 4788 | yisfkgd 4789 | yisgdfk 4790 | yisgdkf 4791 | yisgfdk 4792 | yisgfkd 4793 | yisgkdf 4794 | yisgkfd 4795 | yiskdfg 4796 | yiskdgf 4797 | yiskfdg 4798 | yiskfgd 4799 | yiskgdf 4800 | yiskgfd 4801 | ykdfgis 4802 | ykdfgsi 4803 | ykdfigs 4804 | ykdfisg 4805 | ykdfsgi 4806 | ykdfsig 4807 | ykdgfis 4808 | ykdgfsi 4809 | ykdgifs 4810 | ykdgisf 4811 | ykdgsfi 4812 | ykdgsif 4813 | ykdifgs 4814 | ykdifsg 4815 | ykdigfs 4816 | ykdigsf 4817 | ykdisfg 4818 | ykdisgf 4819 | ykdsfgi 4820 | ykdsfig 4821 | ykdsgfi 4822 | ykdsgif 4823 | ykdsifg 4824 | ykdsigf 4825 | ykfdgis 4826 | ykfdgsi 4827 | ykfdigs 4828 | ykfdisg 4829 | ykfdsgi 4830 | ykfdsig 4831 | ykfgdis 4832 | ykfgdsi 4833 | ykfgids 4834 | ykfgisd 4835 | ykfgsdi 4836 | ykfgsid 4837 | ykfidgs 4838 | ykfidsg 4839 | ykfigds 4840 | ykfigsd 4841 | ykfisdg 4842 | ykfisgd 4843 | ykfsdgi 4844 | ykfsdig 4845 | ykfsgdi 4846 | ykfsgid 4847 | ykfsidg 4848 | ykfsigd 4849 | ykgdfis 4850 | ykgdfsi 4851 | ykgdifs 4852 | ykgdisf 4853 | ykgdsfi 4854 | ykgdsif 4855 | ykgfdis 4856 | ykgfdsi 4857 | ykgfids 4858 | ykgfisd 4859 | ykgfsdi 4860 | ykgfsid 4861 | ykgidfs 4862 | ykgidsf 4863 | ykgifds 4864 | ykgifsd 4865 | ykgisdf 4866 | ykgisfd 4867 | ykgsdfi 4868 | ykgsdif 4869 | ykgsfdi 4870 | ykgsfid 4871 | ykgsidf 4872 | ykgsifd 4873 | ykidfgs 4874 | ykidfsg 4875 | ykidgfs 4876 | ykidgsf 4877 | ykidsfg 4878 | ykidsgf 4879 | ykifdgs 4880 | ykifdsg 4881 | ykifgds 4882 | ykifgsd 4883 | ykifsdg 4884 | ykifsgd 4885 | ykigdfs 4886 | ykigdsf 4887 | ykigfds 4888 | ykigfsd 4889 | ykigsdf 4890 | ykigsfd 4891 | ykisdfg 4892 | ykisdgf 4893 | ykisfdg 4894 | ykisfgd 4895 | ykisgdf 4896 | ykisgfd 4897 | yksdfgi 4898 | yksdfig 4899 | yksdgfi 4900 | yksdgif 4901 | yksdifg 4902 | yksdigf 4903 | yksfdgi 4904 | yksfdig 4905 | yksfgdi 4906 | yksfgid 4907 | yksfidg 4908 | yksfigd 4909 | yksgdfi 4910 | yksgdif 4911 | yksgfdi 4912 | yksgfid 4913 | yksgidf 4914 | yksgifd 4915 | yksidfg 4916 | yksidgf 4917 | yksifdg 4918 | yksifgd 4919 | yksigdf 4920 | yksigfd 4921 | ysdfgik 4922 | ysdfgki 4923 | ysdfigk 4924 | ysdfikg 4925 | ysdfkgi 4926 | ysdfkig 4927 | ysdgfik 4928 | ysdgfki 4929 | ysdgifk 4930 | ysdgikf 4931 | ysdgkfi 4932 | ysdgkif 4933 | ysdifgk 4934 | ysdifkg 4935 | ysdigfk 4936 | ysdigkf 4937 | ysdikfg 4938 | ysdikgf 4939 | ysdkfgi 4940 | ysdkfig 4941 | ysdkgfi 4942 | ysdkgif 4943 | ysdkifg 4944 | ysdkigf 4945 | ysfdgik 4946 | ysfdgki 4947 | ysfdigk 4948 | ysfdikg 4949 | ysfdkgi 4950 | ysfdkig 4951 | ysfgdik 4952 | ysfgdki 4953 | ysfgidk 4954 | ysfgikd 4955 | ysfgkdi 4956 | ysfgkid 4957 | ysfidgk 4958 | ysfidkg 4959 | ysfigdk 4960 | ysfigkd 4961 | ysfikdg 4962 | ysfikgd 4963 | ysfkdgi 4964 | ysfkdig 4965 | ysfkgdi 4966 | ysfkgid 4967 | ysfkidg 4968 | ysfkigd 4969 | ysgdfik 4970 | ysgdfki 4971 | ysgdifk 4972 | ysgdikf 4973 | ysgdkfi 4974 | ysgdkif 4975 | ysgfdik 4976 | ysgfdki 4977 | ysgfidk 4978 | ysgfikd 4979 | ysgfkdi 4980 | ysgfkid 4981 | ysgidfk 4982 | ysgidkf 4983 | ysgifdk 4984 | ysgifkd 4985 | ysgikdf 4986 | ysgikfd 4987 | ysgkdfi 4988 | ysgkdif 4989 | ysgkfdi 4990 | ysgkfid 4991 | ysgkidf 4992 | ysgkifd 4993 | ysidfgk 4994 | ysidfkg 4995 | ysidgfk 4996 | ysidgkf 4997 | ysidkfg 4998 | ysidkgf 4999 | ysifdgk 5000 | ysifdkg 5001 | ysifgdk 5002 | ysifgkd 5003 | ysifkdg 5004 | ysifkgd 5005 | ysigdfk 5006 | ysigdkf 5007 | ysigfdk 5008 | ysigfkd 5009 | ysigkdf 5010 | ysigkfd 5011 | ysikdfg 5012 | ysikdgf 5013 | ysikfdg 5014 | ysikfgd 5015 | ysikgdf 5016 | ysikgfd 5017 | yskdfgi 5018 | yskdfig 5019 | yskdgfi 5020 | yskdgif 5021 | yskdifg 5022 | yskdigf 5023 | yskfdgi 5024 | yskfdig 5025 | yskfgdi 5026 | yskfgid 5027 | yskfidg 5028 | yskfigd 5029 | yskgdfi 5030 | yskgdif 5031 | yskgfdi 5032 | yskgfid 5033 | yskgidf 5034 | yskgifd 5035 | yskidfg 5036 | yskidgf 5037 | yskifdg 5038 | yskifgd 5039 | yskigdf 5040 | yskigfd 5041 | -------------------------------------------------------------------------------- /Idemia/testx.txt: -------------------------------------------------------------------------------- 1 | dfgiksy -------------------------------------------------------------------------------- /Idemia/word_puz.py: -------------------------------------------------------------------------------- 1 | class wd_matrix(): 2 | def __init__(self, w, t): 3 | self.w = w 4 | self.t = t 5 | self.tr = ''.join(reversed(t)) 6 | self.lt = len(t) 7 | self.lw = len(w[0]) 8 | self.lwx = len(w) 9 | self.lc = self.lw - self.lt 10 | self.lr = self.lwx - self.lt 11 | 12 | def wcount(self, wc): 13 | return(wc.count(self.t) + wc.count(self.tr)) 14 | 15 | def puz_hor(self): 16 | x = "" 17 | wx = [] 18 | 19 | for s in self.w: 20 | for _ in range((len(s)-self.lt)+1): 21 | for j in range(self.lt): 22 | x += (s[_+j]) 23 | wx.append(x) 24 | x = "" 25 | return self.wcount(wx) 26 | 27 | def puz_ver(self): 28 | x = "" 29 | wx = [] 30 | 31 | for s in range(self.lr + 1): 32 | for _ in range(self.lw): 33 | for j in range(self.lt): 34 | x += (self.w[s+j][_]) 35 | wx.append(x) 36 | x = "" 37 | return self.wcount(wx) 38 | 39 | def puz_dig(self): 40 | x = "" 41 | y = "" 42 | wx = [] 43 | z = [] 44 | 45 | for _ in range(len(self.w)): 46 | z.append(self.w[_][::-1]) 47 | 48 | for s in range(self.lr + 1): 49 | for _ in range(self.lc + 1): 50 | for j in range(self.lt): 51 | x += (self.w[s+j][_+j]) 52 | y += (z[s+j][_+j]) 53 | wx.append(x) 54 | wx.append(y) 55 | x = "" 56 | y = "" 57 | return self.wcount(wx) 58 | 59 | f = open('input_puz.txt','r') 60 | j = [] 61 | w = [] 62 | for _ in f: 63 | _ = _.replace('\n','') 64 | t = _.isdigit() 65 | if t != True: 66 | j.append(_) 67 | else: 68 | if j != []: 69 | w.append(j) 70 | j = [] 71 | x = [] 72 | i = 0 73 | for _ in w: 74 | i += 1 75 | x = _[:-1] 76 | t = _[-1] 77 | wmatrix = wd_matrix(x, t) 78 | print("Case " + str(i) + ": " + str(wmatrix.puz_hor() + wmatrix.puz_ver() + wmatrix.puz_dig())) -------------------------------------------------------------------------------- /Javascript/count_items_loop_in_array.js: -------------------------------------------------------------------------------- 1 | function numDuplicates(arr) { 2 | res = {}; 3 | d = 0; 4 | arr.forEach(ye => { 5 | arr.forEach(xe => { 6 | if (xe === ye){ 7 | d++; 8 | } 9 | }); 10 | res[ye]=d; 11 | d=0; 12 | }); 13 | return res; 14 | } 15 | 16 | n = ['ball','ball','mango','coconut','mango','mango']; 17 | console.log(numDuplicates(n)); -------------------------------------------------------------------------------- /Javascript/remove_duplicates_in_array.js: -------------------------------------------------------------------------------- 1 | function remDuplicates(arr) { 2 | r = []; 3 | 4 | arr.forEach(element => { 5 | r[element]=0; 6 | }); 7 | 8 | y = []; 9 | for (i in r){ 10 | y.push(i); 11 | } 12 | 13 | return y; 14 | } 15 | 16 | arr = ['ball','ball','mango','coconut','mango','mango']; 17 | console.log(remDuplicates(arr)); -------------------------------------------------------------------------------- /JumpingOnTheCloud/jumpCloud.py: -------------------------------------------------------------------------------- 1 | def jumpingOnClouds(c): 2 | ct = 0 3 | jm = 0 4 | c.append(1) 5 | for _ in range( len(c)): 6 | if c[_] == 0: 7 | ct += 1 8 | else: 9 | jm += (ct//2)+1 10 | ct = 0 11 | return(jm-1) 12 | 13 | ## Test 14 | c = [0, 0, 0, 0, 1, 0, 0] 15 | # c = [0, 0, 0, 1, 0, 0] 16 | print(jumpingOnClouds(c)) -------------------------------------------------------------------------------- /JumpingOnTheCloud/readme.md: -------------------------------------------------------------------------------- 1 | ## Problems 2 | > Emma is playing a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus 1 or 2. She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma to jump from her starting postion to the last cloud. It is always possible to win the game. 3 | For each game, Emma will get an array of clouds numbered 0 if they are safe or 1 if they must be avoided. For example, c = [0, 1, 0, 0, 0, 1, 0] indexed from 0 ... 6. The number on each cloud is its index in the list so she must avoid the clouds at indexes 1 and 5. She could follow the following two paths: 0->2->4->6 or 0->2->3->4->6. The first path takes 3 jumps while the second takes 4. 4 | 5 | ### Output Format 6 | > Print the minimum number of jumps needed to win the game. 7 | -------------------------------------------------------------------------------- /LeftRotation/leftRot.py: -------------------------------------------------------------------------------- 1 | def rotLeft(a, d): 2 | r = [] 3 | for _ in range(len(a)): 4 | x = (_ + d) 5 | if x >= len(a): x = x - len(a) 6 | r.append(a[x]) 7 | return(r) 8 | 9 | ## test 10 | a = [1, 2, 3, 4, 5] 11 | d = 4 12 | print(rotLeft(a, d)) -------------------------------------------------------------------------------- /LeftRotation/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | A left rotation operation on an array shifts each of the array's elements *1* unit to the left. For example, if *2* left rotations are performed on array *[1, 2, 3, 4, 5]*, then the array would become *[3, 4, 5, 1, 2]*. 3 | Given an array *a* of *n* integers and a number, *d*, perform *d* left rotations on the array. Return the updated array to be printed as a single line of space-separated integers. 4 | 5 | ## Input 6 | - An array of integers *a*. 7 | - An integer *d*, the number of rotations. 8 | 9 | ## Output Format 10 | Print a single line of *n* space-separated integers denoting the final state of the array after performing *d* left rotations. 11 | 12 | ## Sample 13 | Input 14 | ``` 15 | d = 4 16 | a = [1, 2, 3, 4, 5] 17 | ``` 18 | Output 19 | ``` 20 | [5, 1, 2, 3, 4] 21 | ``` 22 | ## Explanation 23 | When we perform *d = 4* left rotations, the array undergoes the following sequence of changes: 24 | ``` 25 | [1, 2, 3, 4, 5] -> [2, 3, 4, 5, 1] -> [3, 4, 5, 1, 2] -> [4, 5, 1, 2, 3] -> [5, 1, 2, 3, 4] 26 | ``` 27 | 28 | 29 | 30 | 31 | -------------------------------------------------------------------------------- /MinimumSwaps/minSwaps.py: -------------------------------------------------------------------------------- 1 | def minimumSwaps(arr): 2 | r = 0 3 | _ = 0 4 | while _ < len(arr): 5 | if (_+1) == (arr[_]): 6 | _ += 1 7 | continue 8 | arr[arr[_]-1], arr[_] = arr[_], arr[arr[_]-1] 9 | r += 1 10 | return(r) 11 | 12 | ## test 13 | arr = [2, 3, 4, 1, 5] 14 | #arr = [4, 3, 1, 2] 15 | #arr = [1, 3, 5, 2, 4, 6, 7] 16 | print(minimumSwaps(arr)) 17 | #minimumSwaps(arr) -------------------------------------------------------------------------------- /MinimumSwaps/readme.md: -------------------------------------------------------------------------------- 1 | You are given an unordered array consisting of consecutive integers [1, 2, 3, ..., n] without any duplicates. You are allowed to swap any two elements. You need to find the minimum number of swaps required to sort the array in ascending order. 2 | For example, given the array *arr = [7, 1, 3, 2, 4, 5, 6]* we perform the following steps: 3 | ``` 4 | i arr swap (indices) 5 | -------------------------------------------- 6 | 0 [7, 1, 3, 2, 4, 5, 6] swap (0,3) 7 | 1 [2, 1, 3, 7, 4, 5, 6] swap (0,1) 8 | 2 [1, 2, 3, 7, 4, 5, 6] swap (3,4) 9 | 3 [1, 2, 3, 4, 7, 5, 6] swap (4,5) 10 | 4 [1, 2, 3, 4, 5, 7, 6] swap (5,6) 11 | 5 [1, 2, 3, 4, 5, 6, 7] 12 | ``` 13 | It took *5* swaps to sort the array. 14 | 15 | ## Input 16 | - arr: an unordered array of integers. 17 | 18 | ## Output 19 | Return the minimum number of swaps to sort the given array. -------------------------------------------------------------------------------- /NewYearChaos/NewYearChaos.py: -------------------------------------------------------------------------------- 1 | def minimumBribes(q): 2 | r = 0 3 | for i, P in enumerate(q): 4 | if P - (i+1) > 2: 5 | print("Too chaotic") 6 | return 7 | for j in range(max(0, (P-2)), i+1): 8 | if q[j] > q[i]: 9 | r += 1 10 | print(r) 11 | 12 | ## test 13 | #q = [[2, 1, 5, 3, 4], [2, 5, 1, 3, 4]] 14 | q = [[5, 1, 2, 3, 7, 8, 6, 4], [1, 2, 5, 3, 7, 8, 6, 4]] 15 | for _ in range (len(q)): 16 | minimumBribes(q[_]) -------------------------------------------------------------------------------- /NewYearChaos/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | It's New Year's Day and everyone's in line for the Wonderland rollercoaster ride! There are a number of people queued up, and each person wears a sticker indicating their initial position in the queue. Initial positions increment by *1* from *1* at the front of the line to *n* at the back. 3 | 4 | Any person in the queue can bribe the person directly in front of them to swap positions. If two people swap positions, they still wear the same sticker denoting their original places in line. One person can bribe at most two others. For example, if *n = 8* and *Person = 5* bribes *Person = 4*, the queue will look like this: *1, 2, 3, 5, 4, 6, 7, 8*. 5 | 6 | Fascinated by this chaotic queue, you decide you must know the minimum number of bribes that took place to get the queue into its current state! 7 | 8 | ## Input 9 | - q: an array of integers 10 | 11 | ## Output 12 | Print an integer denoting the minimum number of bribes needed to get the queue into its final state. Print **Too chaotic** if the state is invalid, i.e. it requires a person to have bribed more than *2* people. 13 | 14 | ## Sample 15 | Input 16 | ``` 17 | q = [[5, 1, 2, 3, 7, 8, 6, 4], [1, 2, 5, 3, 7, 8, 6, 4]] 18 | ``` 19 | Output 20 | ``` 21 | Too chaotic 22 | 7 23 | ``` -------------------------------------------------------------------------------- /Pallindrome/pallindrome.py: -------------------------------------------------------------------------------- 1 | def pallindrome(str): 2 | x = 0 3 | a = [] 4 | for _ in range(len(str),0,-1): 5 | for j in range(len(str), 0, -1): 6 | if str[x:j] == str[x:j][::-1]: 7 | return (str[x:j][::-1]) 8 | x += 1 9 | 10 | print(pallindrome("babad")) -------------------------------------------------------------------------------- /Pallindrome/readme.md: -------------------------------------------------------------------------------- 1 | #Logic Practice 2 | Find the longest Pallindrome -------------------------------------------------------------------------------- /PythonCertified/EncryptMsg/chiper.py: -------------------------------------------------------------------------------- 1 | 2 | class chiper(): 3 | abj = 'abcdeghijklmnopqrstuvwxyz' 4 | abx = abj.upper() 5 | def encrypt(m, k=1): 6 | cipher = '' 7 | cchar = '' 8 | for char in m: 9 | if char in list(chiper.abj): 10 | code = chiper.abj.index(char) + k 11 | if code > 24: 12 | while code > 24: 13 | code = code-25 14 | elif code < -25: 15 | while code <- 25: 16 | code = code+25 17 | cchar = chiper.abj[code] 18 | elif char in list(chiper.abx): 19 | code = chiper.abx.index(char) + k 20 | if code > 24: 21 | while code > 24: 22 | code = code-25 23 | elif code < -25: 24 | while code <- 25: 25 | code = code+25 26 | cchar = chiper.abx[code] 27 | else: 28 | cchar = char 29 | cipher += cchar 30 | return(cipher) 31 | 32 | def decrypt(m, k=1): 33 | text = '' 34 | for char in m: 35 | if char in list(chiper.abj): 36 | code = chiper.abj.index(char) - k 37 | if code > 24: 38 | while code > 24: 39 | code = code-25 40 | elif code < -25: 41 | while code <- 25: 42 | code = code+25 43 | cchar = chiper.abj[code] 44 | elif char in list(chiper.abx): 45 | code = chiper.abx.index(char) - k 46 | if code > 24: 47 | while code > 24: 48 | code = code-25 49 | elif code < -25: 50 | while code <- 25: 51 | code = code+25 52 | cchar = chiper.abx[code] 53 | else: 54 | cchar = char 55 | text += cchar 56 | return(text) 57 | 58 | 59 | # Encrypting Caesar cipher 60 | def enc(): 61 | try: 62 | msg = input("Enter your message: ") 63 | key = (int(input("Enter your key: "))) or 1 64 | print(chiper.encrypt(msg, key)) 65 | except ValueError: 66 | print("Please input number only for the key !") 67 | 68 | # Caesar cipher - decrypting a message 69 | def dec(): 70 | try: 71 | chip = input('Enter your cryptogram: ') 72 | key = (int(input("Enter your key: "))) or 1 73 | print(chiper.decrypt(chip, key)) 74 | except ValueError: 75 | print("Please input number only for the key !") 76 | 77 | 78 | q = (input('(0) Exit, (1) Encrypt, (2) Decrypt (Default (1)): ')) or '1' 79 | if q == '1': 80 | enc() 81 | elif q == '2': 82 | dec() 83 | elif q == '0': 84 | exit() 85 | else: 86 | pass -------------------------------------------------------------------------------- /PythonCertified/EncryptMsg/readme.md: -------------------------------------------------------------------------------- 1 | ## The Caesar Cipher: encrypting a message 2 | We're going to show you four simple programs in order to present some aspects of string processing in Python. They are purposefully simple, but the lab problems will be significantly more complicated. 3 | 4 | The first problem we want to show you is called the Caesar cipher - more details here: [Wikipedia](https://en.wikipedia.org/wiki/Caesar_cipher). 5 | 6 | This cipher was (probably) invented and used by Gaius Julius Caesar and his troops during the Gallic Wars. The idea is rather simple - every letter of the message is replaced by letter in position *k* from the original letter, which *k* is the *chiper key* (ex. letter = ABCZ, key = 2, A becomes C, B becomes D, C becomes E and Z becomes B). 7 | 8 | We've written it using the following assumptions: 9 | 10 | - it accepts Latin letters only. 11 | - all letters of the message are in original case. 12 | - the key accept number only. 13 | 14 | The code, fed with this message: 15 | ``` 16 | msg = AVE caesar 123 ! 17 | key = 2 18 | ``` 19 | outputs: 20 | ``` 21 | CXH echuct 123 ! 22 | ``` -------------------------------------------------------------------------------- /PythonCertified/Sudoku/readme.md: -------------------------------------------------------------------------------- 1 | ## Estimated time 2 | 60 minutes 3 | 4 | ## Level of difficulty 5 | Hard 6 | 7 | ## Objectives 8 | - improving the student's skills in operating with strings and lists; 9 | - converting strings into lists. 10 | 11 | ## Scenario 12 | As you probably know, Sudoku is a number-placing puzzle played on a 9x9 board. The player has to fill the board in a very specific way: 13 | - each row of the board must contain all digits from 0 to 9 (the order doesn't matter) 14 | - each column of the board must contain all digits from 0 to 9 (again, the order doesn't matter) 15 | - each of the nine 3x3 "tiles" (we will name them "sub-squares") of the table must contain all digits from 0 to 9. 16 | 17 | If you need more details, you can find them [here](https://en.wikipedia.org/wiki/Sudoku). 18 | 19 | Your task is to write a program which: 20 | - reads 9 rows of the Sudoku, each containing 9 digits (check carefully if the data entered are valid) 21 | - outputs Yes if the Sudoku is valid, and No otherwise. 22 | 23 | ## Test data 24 | Sample input: 25 | ``` 26 | 295743861 27 | 431865927 28 | 876192543 29 | 387459216 30 | 612387495 31 | 549216738 32 | 763524189 33 | 928671354 34 | 154938672 35 | ``` 36 | Sample output: 37 | ``` 38 | Yes 39 | ``` 40 | Sample input: 41 | ``` 42 | 195743862 43 | 431865927 44 | 876192543 45 | 387459216 46 | 612387495 47 | 549216738 48 | 763524189 49 | 928671354 50 | 254938671 51 | ``` 52 | Sample output: 53 | ``` 54 | No 55 | ``` -------------------------------------------------------------------------------- /PythonCertified/Sudoku/sudoku.py: -------------------------------------------------------------------------------- 1 | 2 | class sudoku(): 3 | b = [] 4 | sud = 'Yes' 5 | def board(s): 6 | x = '' 7 | s = 'x' + s 8 | for _ in range(1,len(s)): 9 | x += s[_] 10 | if (_ % 9) == 0: 11 | sudoku.b.append(x) 12 | x = '' 13 | return(sudoku.b) 14 | 15 | def hor(b): 16 | for _ in b: 17 | for q in _: 18 | if _.count(q) > 1: 19 | sudoku.sud = 'No' 20 | break 21 | 22 | def ver(b): 23 | n = [] 24 | j = '' 25 | for _ in range(len(b[0])): 26 | for x in range(len(b)): 27 | j += b[x][_] 28 | n.append(j) 29 | j ='' 30 | sudoku.hor(n) 31 | 32 | def box(b): 33 | n = [] 34 | j = '' 35 | for _ in range(0, len(b), 3): 36 | for x in range(0, len(b[0]), 3): 37 | for q in range(3): 38 | for i in range(3): 39 | j += (b[_+q][x+i]) 40 | n.append(j) 41 | j = '' 42 | sudoku.hor(n) 43 | 44 | 45 | ## Example 46 | 47 | #s = "295743861431865927876192543387459216612387495549216738763524189928671354154938672" 48 | s = "195743862431865927876192543387459216612387495549216738763524189928671354254938671" 49 | 50 | sd = sudoku.board(s) 51 | sudoku.hor(sd) 52 | sudoku.ver(sd) 53 | sudoku.box(sd) 54 | print(sudoku.sud) -------------------------------------------------------------------------------- /PythonCertified/anagrams/anagrams.py: -------------------------------------------------------------------------------- 1 | a = list((input('text 1 :')).lower()) 2 | b = list((input('text 2 :')).lower()) 3 | r = 'Anagrams' 4 | 5 | for _ in b: 6 | if _ not in a: 7 | r = 'Not anagrams' 8 | break 9 | print(r) -------------------------------------------------------------------------------- /PythonCertified/anagrams/readme.md: -------------------------------------------------------------------------------- 1 | ## Estimated time 2 | 10-15 minutes 3 | 4 | ## Level of difficulty 5 | Easy 6 | 7 | ## Objectives 8 | - improving the student's skills in operating with strings; 9 | - converting strings into lists, and vice versa. 10 | 11 | ## Scenario 12 | An anagram is a new word formed by rearranging the letters of a word, using all the original letters exactly once. For example, the phrases "rail safety" and "fairy tales" are anagrams, while "I am" and "You are" are not. 13 | 14 | Your task is to write a program which: 15 | - asks the user for two separate texts; 16 | - checks whether, the entered texts are anagrams and prints the result. 17 | 18 | Note: 19 | - assume that two empty strings are not anagrams; 20 | - treat upper- and lower-case letters as equal; 21 | - spaces are not taken into account during the check - treat them as non-existent 22 | 23 | ## Test data 24 | Sample 1 25 | input: 26 | ``` 27 | Listen 28 | Silent 29 | ``` 30 | Output 31 | ``` 32 | Anagrams 33 | ``` 34 | Sample 2 35 | input: 36 | ``` 37 | modern 38 | norman 39 | ``` 40 | Output 41 | ``` 42 | Not anagrams 43 | ``` -------------------------------------------------------------------------------- /PythonCertified/err_exc.py: -------------------------------------------------------------------------------- 1 | def readint(prompt, min, max): 2 | try: 3 | x = int(input(prompt)) 4 | assert x >= min and x <= max 5 | return x 6 | except AssertionError: 7 | print("Error: the value is not within permitted range (min..max)") 8 | q() 9 | 10 | def q(): 11 | try: 12 | v = readint("Enter a number from -10 to 10: ", -10, 10) 13 | assert v != None 14 | print("The number is:", v) 15 | except ValueError: 16 | print("Error: wrong input") 17 | q() 18 | except AssertionError: 19 | return 20 | 21 | if __name__ == "__main__" : 22 | q() -------------------------------------------------------------------------------- /PythonCertified/file/fdata.py: -------------------------------------------------------------------------------- 1 | class sdata(): 2 | def __init__(self, data, fname): 3 | self.fn = [_[0] for _ in data] 4 | self.ln = [_[1] for _ in data] 5 | self.sp = [_[2] for _ in data] 6 | self.fname = fname 7 | self.__idata() 8 | self.__rdata() 9 | 10 | def __idata(self): 11 | fopen = open(self.fname, 'wt') 12 | for _ in range(len(self.fn)): 13 | fopen.write(self.fn[_] + '\t' + self.ln[_] + '\t' + str(self.sp[_]) + '\n') 14 | fopen.close 15 | 16 | def __rdata(self): 17 | dTxt = [] 18 | r = {} 19 | with open(self.fname, 'rt') as fread: 20 | x = str(fread.read()) 21 | 22 | for _ in x.split('\n'): 23 | if _ != '': 24 | dTxt.append(_) 25 | 26 | for _ in range(len(dTxt)): 27 | dTxt[_] = dTxt[_].split('\t') 28 | dTxt[_] = [(dTxt[_][0] + ' ' + dTxt[_][1]), float(dTxt[_][2])] 29 | 30 | dTxt.sort() 31 | 32 | for _ in dTxt: 33 | r[_[0]] = 0 34 | 35 | for _ in r: 36 | for q in dTxt: 37 | if q[0] == _: 38 | r[_] += q[1] 39 | print(_, r[_]) 40 | 41 | 42 | 43 | dt = [['John','Smith',5], 44 | ['Anna','Boleyn',4.5], 45 | ['John','Smith',2], 46 | ['Anna','Boleyn',11], 47 | ['Andrew','Cox',1.5]] 48 | 49 | fname = input('Input file name : ') 50 | 51 | sd = sdata(dt, fname) 52 | sd.__idata() -------------------------------------------------------------------------------- /PythonCertified/file/tes.txt: -------------------------------------------------------------------------------- 1 | John Smith 5 2 | Anna Boleyn 4.5 3 | John Smith 2 4 | Anna Boleyn 11 5 | Andrew Cox 1.5 6 | -------------------------------------------------------------------------------- /PythonCertified/led/led.py: -------------------------------------------------------------------------------- 1 | from termcolor import colored 2 | 3 | def leds(n=0): 4 | led = [ ('###','# #','# #','# #','###'), 5 | (' #',' #',' #',' #',' #'), 6 | ('###',' #','###','# ','###'), 7 | ('###',' #','###',' #','###'), 8 | ('# #','# #','###',' #',' #'), 9 | ('###','# ','###',' #','###'), 10 | ('###','# ','###','# #','###'), 11 | ('###',' #',' #',' #',' #'), 12 | ('###','# #','###','# #','###'), 13 | ('###','# #','###',' #','###')] 14 | #print('\n') ## whitespace 15 | for _ in range(5): 16 | for s in n: 17 | print (colored(led[int(s)][_], color='green'), end=' ') 18 | print('') 19 | 20 | def ledq(): 21 | try: 22 | x = (input(colored("Input number (>= 0), default (0) : ",color="yellow"))) or 0 23 | assert int(x) >= 0 24 | q = list(str(x)) 25 | leds(q) 26 | except ValueError: 27 | print(colored("The Number you entered is Invalid\n", color="red")) 28 | ledq() 29 | except AssertionError: 30 | print(colored("The Number must >= 0\n","lightred")) 31 | ledq() 32 | 33 | if __name__ == "__main__": 34 | print('\n') ## whitespace 35 | ledq() 36 | print('\n') ## whitespace -------------------------------------------------------------------------------- /PythonCertified/led/readme.md: -------------------------------------------------------------------------------- 1 | ## Estimated time 2 | 30 minutes 3 | 4 | ## Level of difficulty 5 | Medium 6 | 7 | ## Objectives 8 | - improving the student's skills in operating with strings; 9 | - using strings to represent non-text data. 10 | 11 | # Scenario 12 | You've surely seen a *seven-segment* display. 13 | 14 | It's a device (sometimes electronic, sometimes mechanical) designed to present one decimal digit using a subset of seven segments. If you still don't know what it is, refer to the following Wikipedia article. 15 | 16 | Your task is to write ***a program which is able to simulate the work of a seven-display device***, although you're going to use single LEDs instead of segments. 17 | 18 | Each digit is constructed from 13 LEDs (some lit, some dark, of course) - that's how we imagine it: 19 | ``` 20 | # ### ### # # ### ### ### ### ### ### 21 | # # # # # # # # # # # # # # 22 | # ### ### ### ### ### # ### ### # # 23 | # # # # # # # # # # # # # 24 | # ### ### # ### ### # ### ### ### 25 | ``` 26 | Note: the number 8 shows all the LED lights on. 27 | 28 | Your code has to display any non-negative integer number entered by the user. 29 | 30 | Tip: using a list containing patterns of all ten digits may be very helpful. 31 | 32 | # Test data 33 | Sample input: 34 | ``` 35 | 123 36 | ``` 37 | Sample output: 38 | ``` 39 | # ### ### 40 | # # # 41 | # ### ### 42 | # # # 43 | # ### ### 44 | ``` 45 | Sample input: 46 | ``` 47 | 9081726354 48 | ``` 49 | Sample output: 50 | ``` 51 | ### ### ### # ### ### ### ### ### # # 52 | # # # # # # # # # # # # # # 53 | ### # # ### # # ### ### ### ### ### 54 | # # # # # # # # # # # # # 55 | ### ### ### # # ### ### ### ### # 56 | ``` -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # practice makes perfect 2 | > Collection Of programming test for job interviews in various programming languange. Enjoy it !! -------------------------------------------------------------------------------- /RepeatedString/RepStr.py: -------------------------------------------------------------------------------- 1 | import math 2 | def repeatedString(s, n): 3 | sl = len(s) 4 | sa = s.count('a') 5 | nx = math.floor(n/ sl) 6 | ny = n - (sl * nx) 7 | xa = (s[:ny].count('a')) 8 | a = (nx * sa) + xa 9 | return(a) 10 | 11 | ## Test 12 | s = 'bcbccacaacbbacabcabccacbccbababbbbabcccbbcbcaccababccbcbcaabbbaabbcaabbbbbbabcbcbbcaccbccaabacbbacbc' 13 | n = 649606239668 14 | # the result should be = 162401559918 15 | print(repeatedString(s, n)) 16 | 17 | 18 | 19 | -------------------------------------------------------------------------------- /RepeatedString/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | Lilah has a string, *s*, of lowercase English letters that she repeated infinitely many times. Given an integer, *n*, find and print the number of letter a's in the first *n* letters of Lilah's infinite string. 3 | For example, if the string *s* = *'abcac'* and *n* = 10, the substring we consider is *abcacabcac*, the first 10 characters of her infinite string. There are 4 occurrences of a in the substring. 4 | 5 | ## Function Description 6 | Complete the repeatedString function in the editor below. It should return an integer representing the number of occurrences of a in the prefix of length in the infinitely repeating string. 7 | repeatedString has the following parameter(s): 8 | - s: a string to repeat 9 | - n: the number of characters to consider 10 | 11 | ## Input Format 12 | The first line contains a single string, *s*. 13 | The second line contains an integer, *n*. 14 | 15 | ## Output Format 16 | Print a single integer denoting the number of letter a's in the first letters of the infinite string created by repeating infinitely many times. -------------------------------------------------------------------------------- /RollTheStrings/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | > We define a single roll operation on a string to be the circular increment of each character by one. In other words, each character is rolled forward and overwritten with the next alphabetic character. Looking at the English alphabet, characters in the range ascii[a-z], a becomes b, b becomes c, and z becomes a. 3 | > Given an array of integers named roll, we want to perform a roll operation on the first roll[i] characters of s for each element i in the array. Given a zero indexed string, an operation roll[i] affects characters at positions 0 through (roll[i]-1). 4 | 5 | > For example, if string s = abz and roll = [3, 2, 1], we perform the following sequence of operations: 6 | - roll[0] = 3: Roll all three characters so abz becomes bca. 7 | - roll[1] = 2: Roll the first two characters so bca becomes cda. 8 | - roll[2] = 1: Roll the first character so cda becomes dda. 9 | > After performing all the operations, the final value of s is dda. -------------------------------------------------------------------------------- /RollTheStrings/rollStrings.py: -------------------------------------------------------------------------------- 1 | def rollTheString(s, roll): 2 | ab = 'abcdefghijklmnopqrstuvwxyz' 3 | r = '' 4 | abi = 0 5 | x = '' 6 | for i in roll: 7 | for j in range(int(i)): 8 | abi = (ab.index(s[j])+1) 9 | if abi > 25: 10 | abi = 0 11 | r += (ab[abi]) 12 | 13 | for _ in range(int(i), len(s)): 14 | x += s[_] 15 | 16 | s = (r + x) 17 | r = '' 18 | x = '' 19 | 20 | return(s) 21 | 22 | ## test 23 | s = 'vwxyz' 24 | roll = '12345' 25 | print(rollTheString(s, roll)) -------------------------------------------------------------------------------- /SockMerchant/SockMerchant.py: -------------------------------------------------------------------------------- 1 | def sockMerchant(n, ar): 2 | x = [] 3 | r = 0; 4 | for _ in ar: 5 | t = ar.count(_) 6 | if (_ not in x) and (t > 1): 7 | x.append(_) 8 | 9 | for _ in x: 10 | d = ar.count(_) 11 | if (d % 2) != 0: 12 | d -= 1 13 | r += d 14 | 15 | return(round(r/2)) 16 | 17 | #test case 18 | n = 9 19 | arr = [10, 20, 20, 10, 10, 30, 50, 10, 20] 20 | #arr = [1, 1, 3, 1, 2, 1, 3, 3, 3, 3] 21 | 22 | print(sockMerchant(n, arr)) 23 | -------------------------------------------------------------------------------- /SockMerchant/readme.md: -------------------------------------------------------------------------------- 1 | ## Problems 2 | > John works at a clothing store. He has a large pile of socks that he must pair by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. 3 | 4 | > For example, there are n = 7 socks with colors ar = [1, 2, 1, 2, 1, 3, 2]. There is one pair of color 1 and one of color 2. There are three odd socks left, one of each color. The number of pairs is 2. 5 | 6 | ### Output Format 7 | > Return the total number of matching pairs of socks that John can sell. -------------------------------------------------------------------------------- /SockMerchant/sockMerchant.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | function sockMerchant(n, ar) { 3 | let c = {}; 4 | let d = 0; 5 | ar.forEach(e => { 6 | ar.forEach(f => { 7 | if (e == f) { 8 | d++; 9 | } 10 | }); 11 | 12 | if (d > 1) { 13 | if ((d % 2) != 0) { 14 | d -= 1; 15 | } 16 | d /= 2; 17 | c[e] = d; 18 | } 19 | d = 0; 20 | }); 21 | 22 | let r = 0; 23 | let _; 24 | for (_ in c) { 25 | r += c[_]; 26 | } 27 | return r; 28 | } 29 | 30 | //test case 31 | let n = 9 32 | let arr = [10, 20, 20, 10, 10, 30, 50, 10, 20] 33 | //arr = [1, 1, 3, 1, 2, 1, 3, 3, 3, 3] 34 | 35 | console.log(sockMerchant(n, arr)); -------------------------------------------------------------------------------- /TuringTest/exam.py: -------------------------------------------------------------------------------- 1 | from platform import * 2 | print(system()) -------------------------------------------------------------------------------- /TuringTest/listmax.js: -------------------------------------------------------------------------------- 1 | 2 | function listMax(n, operations){ 3 | //Please write your code here. 4 | let x = []; 5 | for (i=0; i max_num){ 20 | max_num = x[r]; 21 | }; 22 | } 23 | return(max_num); 24 | } 25 | 26 | let n = 5; 27 | let operations = [[1, 2, 100],[2, 5, 100], [3, 4, 100]]; 28 | console.log(listMax(n, operations)); -------------------------------------------------------------------------------- /TuringTest/listmax.py: -------------------------------------------------------------------------------- 1 | class GetListMax: 2 | @staticmethod 3 | def listMax(n, operations): 4 | #Please write your code here. 5 | x = [] 6 | for _ in range(n): 7 | x.append(0) 8 | 9 | for _ in operations: 10 | for q in range(len(_)-1): 11 | x[_[q]-1] += _[-1] 12 | return(max(x)) 13 | return None 14 | 15 | 16 | n = 5 17 | operations = [[1, 2, 100],[2, 5, 100], [3, 4, 100]] 18 | print(GetListMax.listMax(n, operations)) -------------------------------------------------------------------------------- /TuringTest/max_num.py: -------------------------------------------------------------------------------- 1 | def find_max(nums): 2 | max_num = float("-inf") # smaller than all other numbers 3 | for num in nums: 4 | if num > max_num: 5 | # (Fill in the missing line here) 6 | max_num = num 7 | return max_num 8 | 9 | nums = (3,2,1) 10 | print (find_max(nums)) -------------------------------------------------------------------------------- /TuringTest/pallindrom.js: -------------------------------------------------------------------------------- 1 | function isPalindrome(word) 2 | { 3 | x = word.toLowerCase(); 4 | y = '' 5 | // Please write your code here. 6 | for (var i = x.length - 1; i >= 0; i--) { 7 | y += x[i]; 8 | } 9 | 10 | if (x == y){ 11 | return true; 12 | } else { 13 | return false; 14 | } 15 | } 16 | 17 | var w = ['oppO', 'samsung'] 18 | 19 | for (i = 0; i < w.length; i++){ 20 | console.log(w[i] + ' : ' + isPalindrome(w[i])) 21 | } -------------------------------------------------------------------------------- /TuringTest/pallindrom.py: -------------------------------------------------------------------------------- 1 | class Palindrome: 2 | @staticmethod 3 | def is_palindrome(word): 4 | #Please write your code here. 5 | x = word.lower() 6 | y = x[::-1] 7 | r = False 8 | if x == y: 9 | r = True 10 | return(word + ' : %s' % r) 11 | return None 12 | 13 | print('Input the word : ') 14 | word = input() 15 | print(Palindrome.is_palindrome(word)) -------------------------------------------------------------------------------- /UtopianTree/readme.md: -------------------------------------------------------------------------------- 1 | ## Problem 2 | The Utopian Tree goes through 2 cycles of growth every year. Each spring, it doubles in height. Each summer, its height increases by 1 meter. 3 | Laura plants a Utopian Tree sapling with a height of 1 meter at the onset of spring. How tall will her tree be after growth cycles? 4 | For example, if the number of growth cycles is *n = 5*, the calculations are as follows: 5 | ``` 6 | Period Height 7 | 0 1 8 | 1 2 9 | 2 3 10 | 3 6 11 | 4 7 12 | 5 14 13 | ``` 14 | 15 | ## Output Format 16 | For each test case, print the height of the Utopian Tree after *n* cycles. Each height must be printed on a new line. 17 | 18 | ## Sample Input 19 | ``` 20 | 3 21 | 0 22 | 1 23 | 4 24 | ``` 25 | 26 | ## Sample Output 27 | ``` 28 | 1 29 | 2 30 | 7 31 | ``` 32 | -------------------------------------------------------------------------------- /UtopianTree/utopTree.py: -------------------------------------------------------------------------------- 1 | def utopianTree(n): 2 | x = 0 3 | for _ in range(n+1): 4 | if (x%2) == 0: 5 | x += 1 6 | else: 7 | x += x 8 | return(x) 9 | 10 | ## test 11 | n = [4, 3] 12 | for _ in range(len(n)): 13 | print(utopianTree(n[_])) 14 | -------------------------------------------------------------------------------- /array-left-rotation/array-left-rotation-English.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/michaelwp/hacker-rank/c94cf418376f0ad04b8c1f531e089bb84bf7453d/array-left-rotation/array-left-rotation-English.pdf -------------------------------------------------------------------------------- /array-left-rotation/array-left-rotation.js: -------------------------------------------------------------------------------- 1 | /* 2 | * Complete the 'rotateLeft' function below. 3 | * 4 | * The function is expected to return an INTEGER_ARRAY. 5 | * The function accepts following parameters: 6 | * 1. INTEGER d 7 | * 2. INTEGER_ARRAY arr 8 | */ 9 | 10 | function rotateLeft(d, arr) { 11 | // Write your code here 12 | const newPos = []; 13 | 14 | for (let i=0; i < arr.length; i++) { 15 | let n = i - d; 16 | 17 | if (n < 0) { 18 | n += arr.length 19 | } 20 | 21 | newPos[n] = arr[i]; 22 | } 23 | 24 | return newPos; 25 | } 26 | 27 | const d = 4; 28 | const arr = [1, 2, 3, 4, 5]; 29 | 30 | console.log(rotateLeft(d, arr)); -------------------------------------------------------------------------------- /itemku/README.md: -------------------------------------------------------------------------------- 1 | # itemku online test 2 | -------------------------------------------------------------------------------- /itemku/q1_chat.js: -------------------------------------------------------------------------------- 1 | 2 | function solution(record) { 3 | //set the variables 4 | var answer = []; 5 | var res = []; //list of words parsed in record 6 | var stat = {'Enter': 'Came in', 7 | 'Leave': 'has left'} //user status dictionary 8 | var user = {}; //list of user in the chat room 9 | 10 | //parsing record and capturing the user inside 11 | for (var i in record){ 12 | res.push(record[i].split(" ")); 13 | if (res[i][2] != undefined){ 14 | user[res[i][1]] = res[i][2] 15 | } 16 | } 17 | 18 | //set the answer 19 | for (var i in res){ 20 | var x = stat[res[i][0]] 21 | var y = user[res[i][1]] 22 | if ((x && y) != undefined){ 23 | answer.push(y + ' ' + x) 24 | } 25 | } 26 | 27 | //return the answer; 28 | return answer; 29 | } -------------------------------------------------------------------------------- /itemku/q2_moba.js: -------------------------------------------------------------------------------- 1 | function solution(N, users) { 2 | // set the variables 3 | var answer = []; 4 | var i = 0; //stage level 5 | var u = 0; //number of users in or up of current stage 6 | var f = 0; //number of users in current stage 7 | 8 | //count the failure rate 9 | while(i < N){ 10 | i++; 11 | for(var j in users){ 12 | if(users[j] >= i){ 13 | u++; 14 | } 15 | 16 | if(users[j] == i){ 17 | f++; 18 | } 19 | } 20 | answer.push([i, (f/u)]); 21 | u = 0; 22 | f = 0; 23 | } 24 | 25 | //sorting answer 26 | answer.sort((stage, fRate) => fRate[1] - stage[1]); 27 | 28 | //pick the stage only 29 | for(a in answer){ 30 | answer[a] = answer[a][0]; 31 | } 32 | 33 | //return the answer 34 | return answer; 35 | } -------------------------------------------------------------------------------- /itemku/q3_key.js: -------------------------------------------------------------------------------- 1 | function solution(relation) { 2 | var answer = 0; 3 | var parse = []; 4 | var att = []; 5 | var dic = {}; 6 | 7 | for(i=0; i { 17 | if(!dic[item]){ 18 | dic[item] = 0; 19 | } 20 | dic[item] += 1; 21 | }); 22 | 23 | //if duplicate item found, the column remove and if no duplicate found answer add 1 24 | if (Object.keys(dic).length == relation.length){ 25 | delete att[i]; 26 | answer += 1; 27 | } 28 | dic = {}; 29 | } 30 | //fix att array to attx (if you delete item in array it will return to undefined item) 31 | attx = [] 32 | for (items in att){ 33 | if (att[items] != undefined){attx.push(att[items])} 34 | } 35 | 36 | //create 2 column combination for the rest column if any 37 | att = []; 38 | col = {}; 39 | for(i=0; i<(attx.length-1); i++){ 40 | for(j=1; j<=(attx.length-(i+1)); j++){ 41 | for(item in attx[i]){ 42 | att.push(attx[i][item]+attx[i+j][item]); 43 | } 44 | //check if any duplicate in the column combination 45 | att.forEach(item => { 46 | if(!dic[item]){ 47 | dic[item] = 0; 48 | } 49 | dic[item] += 1; 50 | }); 51 | 52 | //if no duplicate found, then answer add 1 53 | if (Object.keys(dic).length == relation.length){ 54 | answer += 1; 55 | } 56 | att = []; 57 | dic = {}; 58 | } 59 | } 60 | 61 | return answer; 62 | } -------------------------------------------------------------------------------- /k-Difference/kDiff.py: -------------------------------------------------------------------------------- 1 | 2 | def kDifference(a, k): 3 | x = list(set(a)) 4 | y = [] 5 | r = 0 6 | for _ in x: 7 | for a in x: 8 | if (_ != a): 9 | c, d = max(_, a), min(_, a) 10 | if [c, d] not in y: 11 | y.append([c, d]) 12 | for _ in y: 13 | if (_[0]-_[1])==k: r += 1 14 | return(r) 15 | 16 | 17 | ##test 18 | #a = [5, 1, 5, 3, 4, 2] 19 | a = [6, 2, 4, 6, 8, 10, 12] 20 | k = 2 21 | print(kDifference(a, k)) -------------------------------------------------------------------------------- /k-Difference/readme.md: -------------------------------------------------------------------------------- 1 | # Instructions 2 | In this challenge, you will be given an array of integers, each unique within the array, and an integer representing a target difference. Determine the number of pairs of elements in the array that have a difference equal to the target difference. 3 | 4 | # Sample 5 | **Input :** 6 | ``` 7 | a = [6, 2, 4, 6, 8, 10, 12] 8 | k = 2 9 | ``` 10 | **Output :** 11 | ``` 12 | 5 13 | ``` 14 | **Explanation :** 15 | ``` 16 | 1. ( 6 - 4) = 2 17 | 2. ( 4 - 2) = 2 18 | 3. ( 8 - 6) = 2 19 | 4. (10 - 8) = 2 20 | 5. (12 - 10) = 2 21 | 22 | So There are 5 pairs have difference equal to k value, which in this case k = 2 23 | ``` --------------------------------------------------------------------------------