Peace505:

You are welcome. Is it in UT?

yes. comp sci

Peace505:

You have gotten an offer. Congrats

Thank you

Mukkie:

I was given admission but no fee waiver and grant

Are you taking the offer up?

Mukkie:


Same here also, I'm waiting for the software engineering admission announcement

I didn't get the software engr.

pickatyou:


Thanks just got the regret mail right now

You didn't get at all

pickatyou:
Any msc computer science unitartu applicant in the house.
Please lemme know if you have gotten ur conditional admission letter.

I applied for software engr and comp sci. I got the offer for comp sci today. no scholarship.

Waiting for the software engr

pickatyou:


Have u gotten any response

Not yet

pickatyou:


Cos I haven't gotten a response although I applied for MSC comp sci.

I also applied for comp sci

engrchris77:
Hello, just want to know if any one had done his or her Skype interview and how long does it take to get response from tartu. Done mine like 2weeks ago. Thanks

MSc or BSC? Which course

Rave90:


Hi bro, by reply, I guess you mean the admission decision right? We are all still waiting. I reckon it's gonna be anytime from next week.

Wishing you the best.

Thanks. Wish you the best too

Hello has anyone gotten a reply from university of tartu Msc program? I applied for computer science/ software eng

Price :75,000 negotiable

Check pics for specifications

Cal or WhatsApp 0815 871 0769

If you are looking for a tech friendly place to work, and you can do web design.

We are a Data analytics startup currently supported by Fbstart

We are located at no 8 Montgomery road yaba

brainiac228:
I contacted MTNF about our re-imbursement stipend that was promised to be sent to us after exam and they said the reason why they've not sent it is because of some people DYA account was incorrect and they have to send it in group. that we should expect late this month or early june.
And the beneficiary list will be out by june or july.

thanks Man

have they paid the travel costs yet?

65. wat is the highest you heard and which venue?

Me first.

In my 300level, a friend referred me for a desktop job.The client wanted it for her Mac project. I got paid 60,000.

francollimasso:
start with your github profile, from there they can check your code base, your can also list they projects you have worked on. that's why people always seek for avenue to showcase their talent, like working for free so as to build a profile

Thank you

I am C# developer. I keep getting show me your portfolio replies whenever I apply for a job. I am curious to know from fellow programmers, how do u show desktop apps to prospective clients who are messaging you.

fancytboy:


Thanks for replying. I have a Digita persona 4500 and I purchased the SDK but it doesn't work. I won't bring out my fingerprint pattern . It just times out. Please I need your help. What I'm I missing ?

sorry. i think i made a mistake. i didnt use flexcode because i didnt want to buy it. what i used was the sdk that came with the digita persona 4500. i used the cd inside it to run my project. is it the persona sdk u r having a problem with or flexcode?

fancytboy:
Hi, Is there anyone here that has successfully implemented Flexcode SDK on any platform. WEB or System Application ?

Yeah. Used it to create an e registration software. Either in c# or vb.net. i can't remember which language i used

orimion:
Haskell

dirReduce :: [Direction] -> [Direction]
dirReduce xs =
  case reduce 0 [] xs of
    (0, ds) -> reverse ds
    (_, ds) -> dirReduce $ reverse ds

reduce :: Int -> [Direction] -> [Direction] -> (Int, [Direction])
reduce t acc [] = (t, acc)
reduce t acc (North:South:ds) = reduce (t + 1) acc ds
reduce t acc (South:North:ds) = reduce (t + 1) acc ds
reduce t acc (West:East:ds) = reduce (t + 1) acc ds
reduce t acc (East:West:ds) = reduce (t + 1) acc ds
reduce t acc (d:ds) = reduce t (d : acc) ds

i dont understand this haskell one bit... but it works though

nsimageorge:


https://codepen.io/nsimageorge/pen/VMpeVB

This is my solution on code pen...
How did it not pass??

run it here https://www.codewars.com/kata/directions-reduction/train/javascript.

that is where i got the question from

nsimageorge:
Using JavaScript

function dirReduc(arr){
var string = arr.join( " " );
var wrongMatch = /NORTHSOUTH|SOUTHNORTH|EASTWEST|WESTEAST/;
while(wrongMatch.test(string)) {
string = string.replace(wrongMatch, '');
}
return string.match(/NORTH|SOUTH|EAST|WEST/) || [];
}

Your code didnt pass it... sorry

Once upon a time, on a way through the old wild west,…

… a man was given directions to go from one point to another. The directions were "NORTH", "SOUTH", "WEST", "EAST". Clearly "NORTH" and "SOUTH" are opposite, "WEST" and "EAST" too. Going to one direction and coming back the opposite direction is a needless effort. Since this is the wild west, with dreadfull weather and not much water, it's important to save yourself some energy, otherwise you might die of thirst!

How I crossed the desert the smart way.

The directions given to the man are, for example, the following:

["NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH", "WEST"].
or

{ "NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH", "WEST" };
or (haskell)

[North, South, South, East, West, North, West]
You can immediatly see that going "NORTH" and then "SOUTH" is not reasonable, better stay to the same place! So the task is to give to the man a simplified version of the plan. A better plan in this case is simply:

["WEST"]
or

{ "WEST" }
or (haskell)

[West]
or (rust)

[WEST];
Other examples:

In ["NORTH", "SOUTH", "EAST", "WEST"], the direction "NORTH" + "SOUTH" is going north and coming back right away. What a waste of time! Better to do nothing.

The path becomes ["EAST", "WEST"], now "EAST" and "WEST" annihilate each other, therefore, the final result is [] (nil in Clojure).

In ["NORTH", "EAST", "WEST", "SOUTH", "WEST", "WEST"], "NORTH" and "SOUTH" are not directly opposite but they become directly opposite after the reduction of "EAST" and "WEST" so the whole path is reducible to ["WEST", "WEST"].

Task

Write a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).

The Haskell version takes a list of directions with data Direction = North | East | West | South. The Clojure version returns nil when the path is reduced to nothing. The Rust version takes a slice of enum Direction {NORTH, SOUTH, EAST, WEST}.

Examples

dirReduc({"NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH", "WEST"}) => {"WEST"}
dirReduc({"NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH"}) => {}
See more examples in "Example Tests"

Note

Not all paths can be made simpler. The path ["NORTH", "WEST", "SOUTH", "EAST"] is not reducible. "NORTH" and "WEST", "WEST" and "SOUTH", "SOUTH" and "EAST" are not directly opposite of each other and can't become such. Hence the result path is itself : ["NORTH", "WEST", "SOUTH", "EAST"].

bet9ja:

I don't mind to go further, i was only playing around thinking what i could develop with my C++ knowledge. I would like to develop this same program with more functionalities on mobile App using ionic framework, i will also appreciate collaborators.

I dont code in c++. I code C# and python. If u need collaborators, i am up for it

08079768288

currently in my second year.

C#, Python, Asp.Net, Arduino

Bros1:
Yes i do. I do develop with it. Fantastic tool. Though it appears not very popular in our clime yet

Whatsapp me lets share ideas. 08079768288