johny doe

i found a way how to find the word which have a pair of the same letter

but what i am looking for is the opposite thing
word wich the pair of the same letters are separated
like:

baby

i looked in the manual of this command
i didnt find there any clues
with option to work??
can you give me a hint
[ January 11, 2008: Message edited by: johny doe ]

how many words in the file /usr/share/dict/american-english have exactly two letters x?

print all the words in the file /usr/share/dict/american-english that have exactly two letters b, but not together. For example: baby is OK, while lobby is not

i was told to use egrep

i am not sure its the right way

anyway i cant get it done
i lloked in the man nothing was tald about those problems
what option of egrep to use


how do i build it?

if i got the variable of this
int d;

and in the method as a paramemter it also recieves d

wich variable will it take if i wright the line

temp=d;

???

where do i put the path of the file here

the purpose is to take a txt file (which contains a continues line of chars)
and convert it into string

in your code i dont recognize the place where to put the path of the txt file
and the output String variable
??

i looked for it
but i dont know how to recognise and remove
the messange box parts and
instead to put the txt reader thing

i am realy new to this applet thing
this massage box mechanism

that why i want some one to lokk on my project to help me with that

i realy dont mind to share it the second after the dead line


???

ok lets start from the problem that it gets its input from a text box
and i want it to take the input from txt file

how do i do that??

another point is how to change it from applet to normal form

what parts do you want me to post for this tasks??
[ January 07, 2008: Message edited by: johny doe ]

my big problem in that software is an applet

that takes it input from a text box

and outputs to another text box
and i want to change it so it will take
its input from a text file and return the output
into a text file
and so it will not be an applet but a normal code
with
public static void main(String []args)

can you guide me threw the proccess??

can i send you the code privately??

[ January 06, 2008: Message edited by: johny doe ]
[ January 06, 2008: Message edited by: johny doe ]

it will be much yeasier to understand if ill send you privately the
code
it that ok?

how do i build a tree with 27 branches??

maybe i'll find a similar stucture
[ January 05, 2008: Message edited by: johny doe ]

i realy dont know where to look its a lot of code
some of the comments are

/* We store the tree as a parent-pointer tree, hashed */
/* Code adapted from _The_Data_Compression_Book_ */

i got my program solved
its solving much more cases then needed

i was asked to solve it for chars a-z and space char
27

and i was told that in each root of the tree i will get
27 branches (one branch for each char)

but my version solves for every kind of char
i dont know how to check how many branches are there in that tree.

how to take a string input from a text file

so its only the methods which are mentioned int the interface
??

so my variable takes only the methods which are
mentioned in the Stack interface
from StackasArray class

and puts them into the variable
what about public variables that where written in the class
are they included too
??