id int32 1 500 | topic stringclasses 10 values | link stringlengths 13 13 | question stringlengths 41 507 | answer stringclasses 17 values | pattern stringlengths 31 1.28k ⌀ | source stringclasses 59 values | image imagewidth (px) 240 2.53k |
|---|---|---|---|---|---|---|---|
101 | Anagrams 5 Test | image_101.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | sraau can be re-written as usara, rluht can be re-written as thulr, vuogl can be re-written as vogul, rtota can be re-written as torta, muasl can be re-written as lamus, abajn can be re-written as bajan, sryna can be re-written as snary, mtroa can be re-written as morat, iylrd can be re-written as lyrid. Consequently, there are 9 valid words hidden in this grid. | null | |
102 | Anagrams 5 Test | image_102.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | kcoaj can be re-written as jacko, lachs can be re-written as clash, ortax can be re-written as taxor, zepir can be re-written as prize, kcesn can be re-written as sneck, flroo can be re-written as floor, debti can be re-written as bidet, tiesp can be re-written as stipe. Consequently, there are 8 valid words hidden in this grid. | null | |
103 | Anagrams 5 Test | image_103.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | bordo can be re-written as brood, msuwa can be re-written as wamus, sawer can be re-written as seraw, hlecp can be re-written as chelp, nsese can be re-written as sense, luers can be re-written as sluer, erkce can be re-written as creek, maond can be re-written as nomad, ennir can be re-written as inner, aaply can be re-written as playa. Consequently, there are 10 valid words hidden in this grid. | null | |
104 | Anagrams 5 Test | image_104.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 4 | kifei can be re-written as fikie, ochut can be re-written as thuoc, tname can be re-written as meant, sueca can be re-written as sauce. Consequently, there are 4 valid words hidden in this grid. | null | |
105 | Anagrams 5 Test | image_105.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | ifygg can be re-written as figgy, atchy can be re-written as cathy, ctyli can be re-written as lytic, rtoco can be re-written as troco, hlyap can be re-written as haply, omibt can be re-written as timbo, mdeia can be re-written as media, eadfd can be re-written as faded, smeob can be re-written as besom, nexan can be re-written as annex. Consequently, there are 10 valid words hidden in this grid. | null | |
106 | Anagrams 5 Test | image_106.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | neirs can be re-written as risen, rhtow can be re-written as throw, gjana can be re-written as ganja, adhen can be re-written as henad, opata can be re-written as tapoa, gruaa can be re-written as guara, eaxrt can be re-written as taxer. Consequently, there are 7 valid words hidden in this grid. | null | |
107 | Anagrams 5 Test | image_107.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | imudr can be re-written as murid, kakna can be re-written as kakan, ykiee can be re-written as kieye, sceer can be re-written as scree, bntao can be re-written as baton. Consequently, there are 5 valid words hidden in this grid. | null | |
108 | Anagrams 5 Test | image_108.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | radyv can be re-written as vardy, nunic can be re-written as nucin, ueqak can be re-written as quake. Consequently, there are 3 valid words hidden in this grid. | null | |
109 | Anagrams 5 Test | image_109.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 2 | ihtsw can be re-written as wisht, genmi can be re-written as minge. Consequently, there are 2 valid words hidden in this grid. | null | |
110 | Anagrams 5 Test | image_110.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | alibr can be re-written as brail, arbem can be re-written as embar, ocecb can be re-written as bocce, nkoal can be re-written as kalon, ugost can be re-written as gusto, nteos can be re-written as stone, endal can be re-written as eland, fogoy can be re-written as goofy. Consequently, there are 8 valid words hidden in this grid. | null | |
111 | Anagrams 5 Test | image_111.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | rbola can be re-written as boral, dsgre can be re-written as dregs, nroag can be re-written as groan, eamkl can be re-written as kamel, peetr can be re-written as erept, aoakt can be re-written as takao, ogsyt can be re-written as stogy, arnat can be re-written as antra. Consequently, there are 8 valid words hidden in this grid. | null | |
112 | Anagrams 5 Test | image_112.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | ienma can be re-written as manei, godog can be re-written as doggo, naond can be re-written as donna, tpnua can be re-written as untap, kolfc can be re-written as flock, bybmo can be re-written as mobby, rreok can be re-written as roker, neuti can be re-written as unite, yrbra can be re-written as barry. Consequently, there are 9 valid words hidden in this grid. | null | |
113 | Anagrams 5 Test | image_113.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | ckicr can be re-written as crick, pcila can be re-written as plica, oklaa can be re-written as koala, mggey can be re-written as meggy, iberr can be re-written as berri, udrly can be re-written as duryl, hcaeh can be re-written as hache. Consequently, there are 7 valid words hidden in this grid. | null | |
114 | Anagrams 5 Test | image_114.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | euxns can be re-written as unsex, doble can be re-written as bodle, tviuo can be re-written as uvito, eyirf can be re-written as reify, caotp can be re-written as coapt, tehal can be re-written as leath, gelar can be re-written as large. Consequently, there are 7 valid words hidden in this grid. | null | |
115 | Anagrams 5 Test | image_115.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | urcib can be re-written as urbic, aestn can be re-written as stane, dnuoe can be re-written as unode, ahwrt can be re-written as wrath, vpese can be re-written as vepse, nsteg can be re-written as steng, iugns can be re-written as suing, aeicr can be re-written as erica, sbars can be re-written as brass. Consequently, there are 9 valid words hidden in this grid. | null | |
116 | Anagrams 5 Test | image_116.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | dfeeu can be re-written as feued, atere can be re-written as arete, mytar can be re-written as marty, iabmh can be re-written as biham, astri can be re-written as trias, burte can be re-written as tuber, nuaks can be re-written as ankus, ootys can be re-written as sooty, eprar can be re-written as raper. Consequently, there are 9 valid words hidden in this grid. | null | |
117 | Anagrams 5 Test | image_117.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | glneu can be re-written as lunge, ymbpu can be re-written as bumpy, khwis can be re-written as whisk, hcetr can be re-written as chert, cksip can be re-written as spick, fnkse can be re-written as fenks. Consequently, there are 6 valid words hidden in this grid. | null | |
118 | Anagrams 5 Test | image_118.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | lujus can be re-written as julus, nynel can be re-written as lynne, lmtae can be re-written as metal, kcoeg can be re-written as gecko, owrds can be re-written as sword, ekaly can be re-written as leaky. Consequently, there are 6 valid words hidden in this grid. | null | |
119 | Anagrams 5 Test | image_119.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 1 | kwosn can be re-written as snowk. Consequently, there are 1 valid words hidden in this grid. | null | |
120 | Anagrams 5 Test | image_120.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | crpye can be re-written as percy, etarn can be re-written as retan, esolo can be re-written as loose, apyst can be re-written as patsy, ochol can be re-written as cohol, dfibi can be re-written as bifid, ydbdu can be re-written as buddy, anmai can be re-written as amnia. Consequently, there are 8 valid words hidden in this grid. | null | |
121 | Anagrams 5 Test | image_121.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | yotbx can be re-written as boxty, ckfor can be re-written as frock, hinys can be re-written as shiny, gnora can be re-written as angor, ruyeq can be re-written as query, hyotc can be re-written as cothy, rchum can be re-written as churm, rsosg can be re-written as gross, doyen can be re-written as doney, white can be re-written as white. Consequently, there are 10 valid words hidden in this grid. | null | |
122 | Anagrams 5 Test | image_122.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | ilobi can be re-written as bilio, tamle can be re-written as metal, seall can be re-written as salle, hshcu can be re-written as schuh, ahlch can be re-written as halch, nagsh can be re-written as gnash, ibthg can be re-written as bight. Consequently, there are 7 valid words hidden in this grid. | null | |
123 | Anagrams 5 Test | image_123.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | arrly can be re-written as larry, ulary can be re-written as auryl, gilud can be re-written as guild, cimun can be re-written as mucin, rhpal can be re-written as ralph. Consequently, there are 5 valid words hidden in this grid. | null | |
124 | Anagrams 5 Test | image_124.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | tprao can be re-written as aport, ysodd can be re-written as soddy, tenoc can be re-written as cento, noayn can be re-written as nonya, ysohr can be re-written as horsy, dsemo can be re-written as demos, kefar can be re-written as freak, ristu can be re-written as sruti, bname can be re-written as beman, hgart can be re-written as garth. Consequently, there are 10 valid words hidden in this grid. | null | |
125 | Anagrams 5 Test | image_125.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | apoad can be re-written as adpao, foasr can be re-written as sofar, hacsr can be re-written as crash, eycoj can be re-written as joyce, uabzz can be re-written as abuzz, rpsew can be re-written as sprew, tsras can be re-written as trass, tolen can be re-written as olent, irnen can be re-written as inner. Consequently, there are 9 valid words hidden in this grid. | null | |
126 | Anagrams 5 Test | image_126.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | nhdoi can be re-written as dhoni, cloah can be re-written as olcha, atbla can be re-written as tabla, rhsgu can be re-written as shrug, otrsh can be re-written as horst, itaec can be re-written as caite, btboa can be re-written as abbot, erigv can be re-written as vergi, soorc can be re-written as scroo, attlw can be re-written as twalt. Consequently, there are 10 valid words hidden in this grid. | null | |
127 | Anagrams 5 Test | image_127.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | gaunj can be re-written as juang, alynu can be re-written as unlay, baycb can be re-written as cabby, sciom can be re-written as osmic, rnaec can be re-written as crena, eurna can be re-written as urnae. Consequently, there are 6 valid words hidden in this grid. | null | |
128 | Anagrams 5 Test | image_128.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | jadio can be re-written as daijo, numot can be re-written as mount, hostr can be re-written as horst, yepgg can be re-written as peggy, wcnlo can be re-written as clown, ctuni can be re-written as cutin. Consequently, there are 6 valid words hidden in this grid. | null | |
129 | Anagrams 5 Test | image_129.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | vkdao can be re-written as vodka, tripy can be re-written as tripy, drrye can be re-written as ryder, yejkr can be re-written as jerky, zmaia can be re-written as zamia, zzieb can be re-written as bezzi, tssoc can be re-written as scots. Consequently, there are 7 valid words hidden in this grid. | null | |
130 | Anagrams 5 Test | image_130.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 2 | oturc can be re-written as court, ygoim can be re-written as goyim. Consequently, there are 2 valid words hidden in this grid. | null | |
131 | Anagrams 5 Test | image_131.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | ruckn can be re-written as crunk, ahgra can be re-written as agrah, clear can be re-written as clear. Consequently, there are 3 valid words hidden in this grid. | null | |
132 | Anagrams 5 Test | image_132.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | yoven can be re-written as nevoy, wnlua can be re-written as unlaw, ortsk can be re-written as torsk. Consequently, there are 3 valid words hidden in this grid. | null | |
133 | Anagrams 5 Test | image_133.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | tunsr can be re-written as turns, ahamf can be re-written as faham, ontsu can be re-written as stoun, khsua can be re-written as kusha, ivarl can be re-written as rival. Consequently, there are 5 valid words hidden in this grid. | null | |
134 | Anagrams 5 Test | image_134.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 4 | sarte can be re-written as aster, tyitb can be re-written as bitty, ruchr can be re-written as churr, niset can be re-written as stine. Consequently, there are 4 valid words hidden in this grid. | null | |
135 | Anagrams 5 Test | image_135.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | cbalk can be re-written as black, erhma can be re-written as harem, pueys can be re-written as upsey, linen can be re-written as linne, cwouh can be re-written as wouch, alras can be re-written as salar. Consequently, there are 6 valid words hidden in this grid. | null | |
136 | Anagrams 5 Test | image_136.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 2 | deryd can be re-written as reddy, rqaue can be re-written as quare. Consequently, there are 2 valid words hidden in this grid. | null | |
137 | Anagrams 5 Test | image_137.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 2 | nveai can be re-written as vinea, rfeia can be re-written as feria. Consequently, there are 2 valid words hidden in this grid. | null | |
138 | Anagrams 5 Test | image_138.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | heckc can be re-written as check, kaets can be re-written as steak, htryi can be re-written as yirth, uevol can be re-written as ovule, kahle can be re-written as lekha, ciong can be re-written as incog, mmyma can be re-written as mammy, bying can be re-written as bingy. Consequently, there are 8 valid words hidden in this grid. | null | |
139 | Anagrams 5 Test | image_139.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | nikte can be re-written as inket, iermp can be re-written as prime, ecalm can be re-written as clame, lruat can be re-written as ultra, aahrr can be re-written as arrah, ualms can be re-written as musal, ccoha can be re-written as chaco. Consequently, there are 7 valid words hidden in this grid. | null | |
140 | Anagrams 5 Test | image_140.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | mehru can be re-written as rheum, hachl can be re-written as halch, ktewa can be re-written as tweak, rgeul can be re-written as gluer, mroag can be re-written as morga, ciobr can be re-written as orbic, lgarn can be re-written as gnarl, edinr can be re-written as rinde, ktrai can be re-written as rakit, toorl can be re-written as ortol. Consequently, there are 10 valid words hidden in this grid. | null | |
141 | Anagrams 5 Test | image_141.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | exyip can be re-written as pyxie, hfilt can be re-written as filth, umerf can be re-written as fumer, lerse can be re-written as sleer, iasic can be re-written as isiac, bwore can be re-written as bower, caaps can be re-written as capsa, magor can be re-written as morga, bdbau can be re-written as dubba, aeplt can be re-written as pelta. Consequently, there are 10 valid words hidden in this grid. | null | |
142 | Anagrams 5 Test | image_142.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 4 | lafuw can be re-written as awful, lreas can be re-written as laser, snoci can be re-written as oscin, maman can be re-written as amman. Consequently, there are 4 valid words hidden in this grid. | null | |
143 | Anagrams 5 Test | image_143.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | pkeor can be re-written as proke, mcauk can be re-written as amuck, ombuk can be re-written as kombu, muors can be re-written as mosur, ypasl can be re-written as palsy, nbgei can be re-written as binge, nirkc can be re-written as crink. Consequently, there are 7 valid words hidden in this grid. | null | |
144 | Anagrams 5 Test | image_144.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | ninae can be re-written as inane, yalyp can be re-written as yaply, byrof can be re-written as forby, yymno can be re-written as onymy, fndiu can be re-written as fundi. Consequently, there are 5 valid words hidden in this grid. | null | |
145 | Anagrams 5 Test | image_145.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | aopat can be re-written as opata, aattb can be re-written as batta, ppawa can be re-written as papaw, aoenc can be re-written as canoe, xerte can be re-written as exert, ftooa can be re-written as afoot, raluy can be re-written as auryl, eromt can be re-written as moter. Consequently, there are 8 valid words hidden in this grid. | null | |
146 | Anagrams 5 Test | image_146.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | mosos can be re-written as smoos, dahse can be re-written as sadhe, ianad can be re-written as naiad, mader can be re-written as armed, eeelm can be re-written as melee, amkua can be re-written as makua, orlba can be re-written as boral, ifedy can be re-written as edify, ftiur can be re-written as fruit. Consequently, there are 9 valid words hidden in this grid. | null | |
147 | Anagrams 5 Test | image_147.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 4 | lndau can be re-written as lunda, istmh can be re-written as smith, imebx can be re-written as bemix, amaly can be re-written as malay. Consequently, there are 4 valid words hidden in this grid. | null | |
148 | Anagrams 5 Test | image_148.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | eytea can be re-written as teaey, nnudo can be re-written as undon, onoyc can be re-written as coony, reolp can be re-written as poler, oemag can be re-written as omega, uborr can be re-written as burro, eravc can be re-written as carve. Consequently, there are 7 valid words hidden in this grid. | null | |
149 | Anagrams 5 Test | image_149.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | iegbl can be re-written as bilge, licyr can be re-written as cyril, jbula can be re-written as jabul, lueva can be re-written as value, ggpui can be re-written as puggi, otrnh can be re-written as thorn, joitr can be re-written as jitro. Consequently, there are 7 valid words hidden in this grid. | null | |
150 | Anagrams 5 Test | image_150.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | aaerv can be re-written as avera, aoatl can be re-written as talao, atosc can be re-written as ascot, wunno can be re-written as unown, ucsma can be re-written as camus, bsore can be re-written as boser, caosd can be re-written as cados. Consequently, there are 7 valid words hidden in this grid. | null | |
151 | Anagrams 3 Test | image_151.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 11 | oka can be re-written as oka, owt can be re-written as wot, tro can be re-written as ort, tar can be re-written as tra, teu can be re-written as tue, deb can be re-written as deb, ghu can be re-written as hug, nda can be re-written as and, ash can be re-written as ash, hsi can be re-written as his, epg can be re-written as peg. Consequently, there are 11 valid words hidden in this grid. | null | |
152 | Anagrams 3 Test | image_152.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | eef can be re-written as fee, ewo can be re-written as woe, rma can be re-written as ram, nsi can be re-written as sin, ieh can be re-written as hei, ohd can be re-written as hod, dog can be re-written as dog. Consequently, there are 7 valid words hidden in this grid. | null | |
153 | Anagrams 3 Test | image_153.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | luu can be re-written as ulu, rus can be re-written as sur, boh can be re-written as hob, sae can be re-written as sea, erb can be re-written as reb, ndo can be re-written as don. Consequently, there are 6 valid words hidden in this grid. | null | |
154 | Anagrams 3 Test | image_154.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | tbu can be re-written as but, ami can be re-written as ami, wem can be re-written as wem, ate can be re-written as eat, sma can be re-written as sma, udo can be re-written as udo. Consequently, there are 6 valid words hidden in this grid. | null | |
155 | Anagrams 3 Test | image_155.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | tki can be re-written as kit, rag can be re-written as gra, uth can be re-written as hut, eaf can be re-written as fae, coe can be re-written as coe, erp can be re-written as per, alr can be re-written as lar, vem can be re-written as mev. Consequently, there are 8 valid words hidden in this grid. | null | |
156 | Anagrams 3 Test | image_156.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | oks can be re-written as sok, cam can be re-written as cam, vea can be re-written as ave, wtu can be re-written as wut, vog can be re-written as vog, oan can be re-written as ona. Consequently, there are 6 valid words hidden in this grid. | null | |
157 | Anagrams 3 Test | image_157.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | eew can be re-written as wee, bwe can be re-written as web, pos can be re-written as sop. Consequently, there are 3 valid words hidden in this grid. | null | |
158 | Anagrams 3 Test | image_158.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | arl can be re-written as lar, psa can be re-written as spa, twa can be re-written as wat, dgo can be re-written as dog, iih can be re-written as ihi, eho can be re-written as hoe, nka can be re-written as nak. Consequently, there are 7 valid words hidden in this grid. | null | |
159 | Anagrams 3 Test | image_159.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | myo can be re-written as yom, lof can be re-written as lof, dna can be re-written as and, awa can be re-written as awa, nok can be re-written as kon, nbo can be re-written as bon. Consequently, there are 6 valid words hidden in this grid. | null | |
160 | Anagrams 3 Test | image_160.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | rta can be re-written as tar, rto can be re-written as ort, awh can be re-written as haw, wlo can be re-written as low, rig can be re-written as rig. Consequently, there are 5 valid words hidden in this grid. | null | |
161 | Anagrams 3 Test | image_161.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | iev can be re-written as vei, fou can be re-written as fou, nni can be re-written as inn. Consequently, there are 3 valid words hidden in this grid. | null | |
162 | Anagrams 3 Test | image_162.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | udb can be re-written as bud, urn can be re-written as urn, bid can be re-written as dib, gra can be re-written as gra, eco can be re-written as coe, opb can be re-written as pob, ubr can be re-written as rub, rik can be re-written as irk. Consequently, there are 8 valid words hidden in this grid. | null | |
163 | Anagrams 3 Test | image_163.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | sex can be re-written as sex, ubt can be re-written as tub, nja can be re-written as jan, lli can be re-written as ill, nyi can be re-written as yin, hat can be re-written as hat, rla can be re-written as lar, ede can be re-written as dee, tou can be re-written as out. Consequently, there are 9 valid words hidden in this grid. | null | |
164 | Anagrams 3 Test | image_164.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | aok can be re-written as oka, wma can be re-written as mwa, xre can be re-written as rex, oej can be re-written as joe, tze can be re-written as tez, ila can be re-written as lai, gae can be re-written as age, inp can be re-written as pin, hup can be re-written as phu. Consequently, there are 9 valid words hidden in this grid. | null | |
165 | Anagrams 3 Test | image_165.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | nna can be re-written as nan, orc can be re-written as cro, oks can be re-written as kos, dan can be re-written as and, egr can be re-written as ger, who can be re-written as how, obl can be re-written as blo, cro can be re-written as cro. Consequently, there are 8 valid words hidden in this grid. | null | |
166 | Anagrams 3 Test | image_166.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | fie can be re-written as fie, ung can be re-written as gnu, oof can be re-written as foo, tca can be re-written as cat, gov can be re-written as vog. Consequently, there are 5 valid words hidden in this grid. | null | |
167 | Anagrams 3 Test | image_167.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | wol can be re-written as lwo, sur can be re-written as urs, hub can be re-written as hub, ish can be re-written as his, jti can be re-written as tji, itw can be re-written as twi. Consequently, there are 6 valid words hidden in this grid. | null | |
168 | Anagrams 3 Test | image_168.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | bfu can be re-written as fub, eam can be re-written as ame, nfi can be re-written as fin. Consequently, there are 3 valid words hidden in this grid. | null | |
169 | Anagrams 3 Test | image_169.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | okl can be re-written as kol, adg can be re-written as dag, eci can be re-written as ice, bwo can be re-written as wob, man can be re-written as nam, rma can be re-written as arm, nke can be re-written as ken, yee can be re-written as eye, old can be re-written as dol. Consequently, there are 9 valid words hidden in this grid. | null | |
170 | Anagrams 3 Test | image_170.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | yob can be re-written as boy, unr can be re-written as urn, akw can be re-written as kaw, pur can be re-written as pur, adi can be re-written as aid, pat can be re-written as apt, uka can be re-written as auk, ign can be re-written as ing. Consequently, there are 8 valid words hidden in this grid. | null | |
171 | Anagrams 3 Test | image_171.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | lga can be re-written as gal, the can be re-written as the, par can be re-written as par, tiw can be re-written as wit, ses can be re-written as ess, lam can be re-written as lam. Consequently, there are 6 valid words hidden in this grid. | null | |
172 | Anagrams 3 Test | image_172.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | ilk can be re-written as ilk, ttu can be re-written as tut, kat can be re-written as kat, baa can be re-written as baa, dma can be re-written as dam. Consequently, there are 5 valid words hidden in this grid. | null | |
173 | Anagrams 3 Test | image_173.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | ayw can be re-written as way, bae can be re-written as bea, rpy can be re-written as pry, tty can be re-written as tyt, too can be re-written as too. Consequently, there are 5 valid words hidden in this grid. | null | |
174 | Anagrams 3 Test | image_174.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | gge can be re-written as egg, inn can be re-written as inn, obb can be re-written as bob, akd can be re-written as dak, zod can be re-written as odz, coo can be re-written as coo, tao can be re-written as tao, bee can be re-written as bee, dob can be re-written as bod. Consequently, there are 9 valid words hidden in this grid. | null | |
175 | Anagrams 3 Test | image_175.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | ilk can be re-written as kil, tem can be re-written as met, wow can be re-written as wow, rta can be re-written as rat, ojy can be re-written as joy, uky can be re-written as kyu, nak can be re-written as nak. Consequently, there are 7 valid words hidden in this grid. | null | |
176 | Anagrams 3 Test | image_176.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | cup can be re-written as cup, uop can be re-written as upo, izp can be re-written as zip, eyl can be re-written as lye, efn can be re-written as fen, nli can be re-written as lin, get can be re-written as get, new can be re-written as new, gde can be re-written as deg. Consequently, there are 9 valid words hidden in this grid. | null | |
177 | Anagrams 3 Test | image_177.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | akr can be re-written as kra, auk can be re-written as auk, der can be re-written as erd, cup can be re-written as cup, tik can be re-written as kit, uyg can be re-written as guy, oza can be re-written as zoa. Consequently, there are 7 valid words hidden in this grid. | null | |
178 | Anagrams 3 Test | image_178.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | pda can be re-written as pad, orh can be re-written as rho, mlo can be re-written as olm, ele can be re-written as lee, eif can be re-written as fie. Consequently, there are 5 valid words hidden in this grid. | null | |
179 | Anagrams 3 Test | image_179.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | tnh can be re-written as nth, ils can be re-written as lis, urf can be re-written as fur. Consequently, there are 3 valid words hidden in this grid. | null | |
180 | Anagrams 3 Test | image_180.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | kle can be re-written as elk, was can be re-written as saw, ebl can be re-written as bel, sur can be re-written as rus, had can be re-written as dha, xra can be re-written as rax, iol can be re-written as oil, dee can be re-written as dee. Consequently, there are 8 valid words hidden in this grid. | null | |
181 | Anagrams 3 Test | image_181.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | uwp can be re-written as wup, hus can be re-written as ush, aob can be re-written as boa, emo can be re-written as moe, dca can be re-written as cad. Consequently, there are 5 valid words hidden in this grid. | null | |
182 | Anagrams 3 Test | image_182.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | wta can be re-written as twa, our can be re-written as uro, pay can be re-written as yap, car can be re-written as arc, bar can be re-written as rab, tsp can be re-written as pst, gfa can be re-written as fag, ako can be re-written as oka, ahp can be re-written as pah. Consequently, there are 9 valid words hidden in this grid. | null | |
183 | Anagrams 3 Test | image_183.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 4 | bbu can be re-written as bub, pmi can be re-written as imp, eav can be re-written as ave, ply can be re-written as ply. Consequently, there are 4 valid words hidden in this grid. | null | |
184 | Anagrams 3 Test | image_184.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 11 | cum can be re-written as cum, hyw can be re-written as why, odn can be re-written as don, swa can be re-written as was, ant can be re-written as ant, sdi can be re-written as sid, hwe can be re-written as hew, tog can be re-written as got, saw can be re-written as swa, cue can be re-written as cue, kle can be re-written as elk. Consequently, there are 11 valid words hidden in this grid. | null | |
185 | Anagrams 3 Test | image_185.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | yrc can be re-written as cry, wed can be re-written as dew, aer can be re-written as are, daf can be re-written as fad, who can be re-written as who, suh can be re-written as ush, eeg can be re-written as gee, car can be re-written as car, idm can be re-written as mid. Consequently, there are 9 valid words hidden in this grid. | null | |
186 | Anagrams 3 Test | image_186.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | dco can be re-written as doc, gra can be re-written as gar, sex can be re-written as sex, kuh can be re-written as khu, gow can be re-written as wog, awj can be re-written as jaw, rub can be re-written as rub. Consequently, there are 7 valid words hidden in this grid. | null | |
187 | Anagrams 3 Test | image_187.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | ptu can be re-written as put, ocs can be re-written as cos, tur can be re-written as rut, tub can be re-written as tub, sma can be re-written as sam, oht can be re-written as tho, gto can be re-written as tog, tba can be re-written as tab. Consequently, there are 8 valid words hidden in this grid. | null | |
188 | Anagrams 3 Test | image_188.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | zao can be re-written as zoa, daa can be re-written as ada, aew can be re-written as wea, lod can be re-written as dol, jte can be re-written as jet, nil can be re-written as lin, oel can be re-written as ole, ake can be re-written as kea, sok can be re-written as kos. Consequently, there are 9 valid words hidden in this grid. | null | |
189 | Anagrams 3 Test | image_189.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | lfy can be re-written as fly, gdi can be re-written as gid, nta can be re-written as nat, pis can be re-written as psi, ich can be re-written as ich. Consequently, there are 5 valid words hidden in this grid. | null | |
190 | Anagrams 3 Test | image_190.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 5 | fyl can be re-written as fly, zan can be re-written as zan, goe can be re-written as geo, mma can be re-written as mam, vao can be re-written as ova. Consequently, there are 5 valid words hidden in this grid. | null | |
191 | Anagrams 3 Test | image_191.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | lod can be re-written as old, vli can be re-written as liv, ige can be re-written as gie, yco can be re-written as coy, leg can be re-written as leg, oeb can be re-written as obe, ush can be re-written as ush. Consequently, there are 7 valid words hidden in this grid. | null | |
192 | Anagrams 3 Test | image_192.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 10 | ugl can be re-written as lug, bbo can be re-written as bob, aro can be re-written as oar, nmu can be re-written as mun, sle can be re-written as els, sou can be re-written as sou, yan can be re-written as any, etw can be re-written as wet, ayn can be re-written as nay, ugd can be re-written as gud. Consequently, there are 10 valid words hidden in this grid. | null | |
193 | Anagrams 3 Test | image_193.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | ydr can be re-written as dry, ece can be re-written as cee, urd can be re-written as rud, ias can be re-written as sai, koy can be re-written as yok, mam can be re-written as mam, ttu can be re-written as tut, rju can be re-written as jur. Consequently, there are 8 valid words hidden in this grid. | null | |
194 | Anagrams 3 Test | image_194.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 3 | sgo can be re-written as sog, miw can be re-written as wim, ofa can be re-written as oaf. Consequently, there are 3 valid words hidden in this grid. | null | |
195 | Anagrams 3 Test | image_195.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | eca can be re-written as ace, tam can be re-written as mat, lit can be re-written as til, fie can be re-written as fei, uki can be re-written as kui, urs can be re-written as urs, rxe can be re-written as rex, nac can be re-written as can, apr can be re-written as par. Consequently, there are 9 valid words hidden in this grid. | null | |
196 | Anagrams 3 Test | image_196.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 8 | weo can be re-written as woe, lta can be re-written as lat, ekl can be re-written as lek, gud can be re-written as dug, dou can be re-written as udo, ojb can be re-written as job, dap can be re-written as pad, siy can be re-written as yis. Consequently, there are 8 valid words hidden in this grid. | null | |
197 | Anagrams 3 Test | image_197.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 9 | bti can be re-written as bit, lot can be re-written as lot, lle can be re-written as ell, inm can be re-written as nim, esc can be re-written as sec, lil can be re-written as ill, ari can be re-written as ria, ego can be re-written as ego, diw can be re-written as wid. Consequently, there are 9 valid words hidden in this grid. | null | |
198 | Anagrams 3 Test | image_198.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | tup can be re-written as put, laa can be re-written as aal, awl can be re-written as law, nfa can be re-written as fan, oes can be re-written as soe, owp can be re-written as wop. Consequently, there are 6 valid words hidden in this grid. | null | |
199 | Anagrams 3 Test | image_199.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 6 | enp can be re-written as nep, ywn can be re-written as wyn, rai can be re-written as air, umg can be re-written as mug, myg can be re-written as gym, eyt can be re-written as yet. Consequently, there are 6 valid words hidden in this grid. | null | |
200 | Anagrams 3 Test | image_200.png | Some of the options are anagrams and can be reordered to form English words.
Count the number of sets that hide a dictionary-approved word.
Example: ENW is an anagram for NEW and RCA is an anagram for CAR. Both options should be selected.
Finally, answer with JUST a number of this question: How many sets that hide a dictionary-approved word? | 7 | gea can be re-written as age, imm can be re-written as mim, awe can be re-written as wae, awy can be re-written as yaw, sar can be re-written as ras, erd can be re-written as red, tlo can be re-written as lot. Consequently, there are 7 valid words hidden in this grid. | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.