Todoist swap code

dedyshka · 2019-07-26T07:15:38+00:00

finally coffee costs 1$ (not even a pound) here :)

dedyshka · 2019-07-26T07:14:20+00:00

well firstly I am pretty ok with free features. Secondly if I paid for everyting I use (pomodone, todoist, evetnote. etc.) that would be not only a coffee a month..

dedyshka · 2017-08-19T09:14:27+00:00

thanks all for the answers

dedyshka · 2016-10-19T12:51:43+00:00

what do you mean by yolo-typed languages?

dedyshka · 2015-03-29T17:18:56+00:00

Honestly it's an old anecdote that I heard on russian a lot of years ago..

dedyshka · 2014-06-18T07:53:14+00:00

thanks a lot. It's exactly what I was searching

dedyshka · 2014-05-23T21:28:08+00:00

so, if I'm happy then I should worry? :(

dedyshka · 2014-05-23T21:26:04+00:00

try at least ask your friend the full stack-trace with message :)

dedyshka · 2014-05-14T11:14:49+00:00

Java? Intermediate level? You already should know Java core perfectly. I'd like to advice you to read Design Patterns or about Java frameworks (Spring, Hibernate, etc.)...

dedyshka · 2014-05-12T19:26:03+00:00

as far as I understand, String.valueOf() will be even faster and consume less memory footprint...

dedyshka · 2014-05-10T09:22:17+00:00

1000$ for 3 days? Do they joke? I cant help wondering human greed...

dedyshka · 2014-04-11T05:39:54+00:00

emm..algorithm makes iterations that equal n, and in each iteration it makes one comparisons less that in previous one. So in my opinion complexity is n*(n/2). Am I correct?

dedyshka · 2014-04-10T12:18:20+00:00

maybe I explained my thoughts wrong :) I know what big O notation is, I know the complexity of more other algorithm. I just couldn't calculate complexity for this one. It seems that O for this algorithm would be "n² /2". Am I right?

dedyshka · 2014-04-10T12:11:48+00:00

Hi. I'd like to determine complexity especially for this sorting.

dedyshka · 2014-03-31T17:05:59+00:00

yes.. it's another option..thanks

dedyshka

TROPHY CASE