HA simple way would be with Linq.
Hwords.Where(x => x.Length == 3).GroupBy(x => x).OrderByDescending(x => x.Count()).Take(10).ToArray()
RThank you! that is one-liner but i generally don't like linq, can i do it someway else?
HGenerally, anything you can do with Linq you can do without it aswell. But why don't you want to use Linq for this?
Ri assume it is not allowed since we weren't taught it yet
Rand i don't like it in general, it feels old
HWell, if you want to do it manually, the first step would be to replace the array with a List for example, since you don't know the maximum number of valid words to begin with.
HIt's really not that old though 
HIt's perfectly valid modern C#, but I understand that it might look odd if you aren't doing Linq yet.
Risn't linq a part of .net framework which is old and worse than dot net core
HLinq can be slower sometimes, but I think performance increased quite a bit with one of the more recent language versions so it's not as slow as it might be.
HAnd unless you have specific performance concerns, it probably won't matter for your usecase.
HBut if you are learning it's probably a decent idea to just do the task manually
HWhat is
pattern btw?R---g-am to find program diagram etc.
HAh, I see
Rit is a simple AI where you ask questions and get the answer from corpus.txt which has the words
Ri think it'd be okay to use string array with max possible size to store all possible words, performance doesn't matter for now.-list isn't allowed either. But i can't think of a way to sort the words manually
HDamn, that's rough
HI mean you could use
Array.Resize() when you have reached capacity, that's basically what List does internally anyway.HMaybe not with that function, but it just doubles its internal size when needed.
HHow are you keeping track of the count of each individual word?
Ri am not now
Rjust getting the word, and if it's repeated not getting it again
Ri can get the count in else if statement there but how do i know the index
HCurrently you are just getting the first 10 words that match the pattern.
Roh right
HYou are just using count to check if every character matched atm?
Ryes
HMaybe a first step to make it a bit more readable would be to make a
MatchPattern function?HTakes the string and the pattern, then you can
return false early if any char doesnt match, so you dont have to do this count business.HI would normally have suggested to maybe use a
Dictionary<string,int> to keep track of word counts but if thats off the table...Ri actually normally use functions a lot but not sure if a functions that will be used only once is good for performance
Rall those indents look bad too like this
HDon't fall into the trap of premature optimization.
HThe compiler is pretty good at taking care of that sort of thing. I would be very surprised if it made any measurable difference to your program.
HI find all these teaching methods very confusing. I don't quite get what the point is of telling you not to use the thing that was made specifically for your usecase just because. But maybe I'm just not educated enough to understand 
HJust use a second array to keep track of counts?
HOr make it an array of tuples (string, int)[] 
Ri agree
Ri tried that but can't get the index right for counts - not the tuple, int array
HYou would have to search the word array every single time for the index of the word you are trying to increase the count on
Ewhew wow linq is NOT old, it's probably the objectively best (in terms of completeness, features, performance) collection of extension methods that exists
Esorry, just had to chime in on that one
RH@Ero It can be a little slower sometimes as opposed to the manual way, but as I said, it's unlikely to be relevant for most people
Eoh absolutely
HAnd, obviously, writing slick one-liners means you are a better programmer.
Rit feels like cheating and slowish, one line of queries doing all the job for you
Ethat's. what programming is
