Skip to content
  • Home
  • Categories
  • Recent
  • Tags
  • Popular
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (Lux)
  • No Skin
Collapse
Ukraine Tryzub and Canada Leaf
  1. UKRAINIANS ON THE CANADA MAP
  2. Categories
  3. Вільне спілкування
  4. (UA) IT/Tech Ukrainians in Canada

(UA) IT/Tech Ukrainians in Canada

Scheduled Pinned Locked Moved Вільне спілкування
647.4k Posts 3.6k Posters 372.0k Views
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570648
    leetcode.com/problems/distance-between-bus-stops/description/
    1 Reply Last reply
    0
  • T Offline
    T Offline
    Vadym Serdiuk
    wrote on last edited by
    #570649
    Не треба 😂
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570650
    зараз пошукаю щось на дейкстру
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570651
    тощо що це алгоритми, а не читабельний код
    1 Reply Last reply
    0
  • T Offline
    T Offline
    Vadym Serdiuk
    wrote on last edited by
    #570652
    Навіщо викликати log декілька разів, якщо там все закоментовано?)
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570653
    нічо не робить)
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570654
    leetcode.com/problems/sum-of-prefix-scores-of-strings/description/ - хард, 10 хвилин
    1 Reply Last reply
    0
  • T Offline
    T Offline
    Vadym Serdiuk
    wrote on last edited by
    #570655
    Відверто кажучи 2,5 хв для редюса це забагато якось 🤣
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570656
    leetcode.com/problems/walking-robot-simulation/description/ - 10 хвилин
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570657
    то частина редюса
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570658
    leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/ хард, 17 хвилин, дейкстра
    1 Reply Last reply
    0
  • T Offline
    T Offline
    Vadym Serdiuk
    wrote on last edited by
    #570659
    Немає там мап
    1 Reply Last reply
    0
  • T Offline
    T Offline
    Vadym Serdiuk
    wrote on last edited by
    #570660
    Ні, це фолд або редюс
    1 Reply Last reply
    0
  • t304000159T Offline
    t304000159T Offline
    Gleb
    wrote on last edited by
    #570661
    (a, b) => a+b, 0
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570662
    де мап?)
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570663
    там тільки редюс)
    1 Reply Last reply
    0
  • t304000159T Offline
    t304000159T Offline
    Gleb
    wrote on last edited by
    #570664
    map reduce?😃
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570665
    function distanceBetweenBusStops(arr: number[], start: number, destination: number): number { const dir = arr.slice(Math.min(start, destination), Math.max(start, destination)).reduce((a, b) => a+b, 0) return Math.min( dir, arr.reduce((a, b) => a+b, 0) - dir ) };
    1 Reply Last reply
    0
  • t304000159T Offline
    t304000159T Offline
    Gleb
    wrote on last edited by
    #570666
    хочеться пописати коменти
    1 Reply Last reply
    0
  • t385897444T Offline
    t385897444T Offline
    Max Vedeneev
    wrote on last edited by
    #570667
    leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/description/ 13 хвилин
    1 Reply Last reply
    0

  • Login

  • Don't have an account? Register

  • Login or register to search.
  • First post
    Last post
0
  • Home
  • Categories
  • Recent
  • Tags
  • Popular
  • Users
  • Groups