Alexey Berezin

@beraliv

Frontend developer, video dev, OSS enthusiast, work . He / him.

Moscow, Russia
Vrijeme pridruživanja: siječanj 2012.

Tweetovi

Blokirali ste korisnika/cu @beraliv

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @beraliv

  1. Prikvačeni tweet
    10. sij 2019.

    Hey mates! 👋 I'm FE dev, super duper enthusiastic about OSS 💻 Currently lead of 🥑 Trying my best at writing Medium articles 📝

    Poništi
  2. 29. sij

    This is all I wanted to tell you 👨‍💻 If you have any questions ❓, please ask 🖐

    Prikaži ovu nit
    Poništi
  3. 29. sij

    3️⃣ All local answers require to be saved in the array ☂️ so you can return to that case if no answer is found Link 🔗: That's why I added condition to find another solution 🔗:

    Prikaži ovu nit
    Poništi
  4. 29. sij

    2️⃣ All parameters can be redeclared at the beginning of the function or being accessed and mutated as I have Link 🔗: So all changes of parameters are transformed to manual reassignment 🔗: and continue at the end

    Prikaži ovu nit
    Poništi
  5. 29. sij

    1️⃣ Body of the function is added with `while (repeat)` Link 🔗 You need to imitate the work so you decide when you continue and when you need to stop with correct answer ✅ or no answer ❌ Correct or no answers mean you return value like you did before

    Prikaži ovu nit
    Poništi
  6. 29. sij

    So I decided why wouldn't I try that way and found out later that it's not that difficult 👌 So step by step:

    Prikaži ovu nit
    Poništi
  7. 29. sij

    The answers were correct though so I started to find a way how to implement the same **iterative** algorithm At the moment I recalled plugin with the sum recursive example and how it is transformed to iterative one:

    Prikaži ovu nit
    Poništi
  8. 29. sij

    There was a task that can be easily solved by writing a recursive function but the order of magnitude was quite high so I got: picture below 🖼⬇️ The code of the task (spoiler 🙈):

    Prikaži ovu nit
    Poništi
  9. 29. sij

    Today solving the task from I recalled plugin and wanted to use it as I wanted to get rid of Maximum call stack size exceeded error Below the thread about that 🚀

    Prikaži ovu nit
    Poništi
  10. 26. sij

    There is a refactoring of the default name of the production dir at , isn't there? As I don't get why I get error for the same commit which was successfully published some time ago 😂

    Poništi
  11. 23. sij
    Poništi
  12. proslijedio/la je Tweet

    Мы тут обсуждали, можно ли такой крутой «новый простой скевоморфизм» сверстать на CSS, а взял и сверстал

    Prikaži ovu nit
    Poništi
  13. 15. sij
    Poništi
  14. Poništi
  15. 7. sij

    What do you know about WebVTT, statistics and DRM in video players? I had several hours to have a look at player

    Poništi
  16. proslijedio/la je Tweet
    6. sij

    From now on, all sandboxes with React 16.9.0 or later inside will have React Fast Refresh enabled by default! 😄 React Fast Refresh allows you to get near-instant feedback for code changes in your components. Eg. hooks state is now properly preserved on changes! 🔥

    Prikaži ovu nit
    Poništi
  17. 6. sij

    Do you remember when you joined Twitter? I do!

    Poništi
  18. proslijedio/la je Tweet

    These Amazon writing tips are fantastic. 👏

    Poništi
  19. 23. pro 2019.

    План проходить задачки с утра на пока не провален, хоть мозг стал быстрее просыпаться

    Poništi
  20. 22. pro 2019.

    Finally I unlocked an ability to post my own katas!

    Poništi
  21. 22. pro 2019.

    Doing my best running from Russia, but it turns out it's not available from here. How identifies you're from the different country? The link to an article for more details

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·