Solutions

การสร้างโปรดักท์บังคับให้เราต้องเผชิญหน้ากับปัญหาสองแบบ เทคนิค ธุรกิจ ธุรกิจอยากได้แบบนี้ แต่ให้ตายเถอะ ทางเทคนิคทำไม่ได้ เทคนิคมองว่านี่คือฟีเจอร์ที่เทพสุดๆ แต่ อืม ทำไปก็ตอบโจทย์ลูกค้าอยู่ไม่กี่คน และหลายครั้งเราก็จะเจอความท้าทายแบบนี้ “นี่มันเป็นปัญหาทางเทคนิคแล้ว ถ้าทำได้นะยอดขายพุ่งกระฉูดแน่นอน” หรือ “ผมตอบไม่ได้หรอก มันเป็นคำถามให้ทีมธุรกิจ เพราะตรงนี้มันทำได้ทางเทคนิคอยู่แล้ว” นี่คือจุดเริ่มต้นของการจัดลำดับความสำคัญกับการแก้ปัญหา

Developing applications is a huge task. The framework that is utilized has a significant impact on the project. I want to put this to rest once and for all. And also, here I share my experience of working on a software development team as a Developer. When we develop a…

Shortest Path in Binary Matrix - LeetCode Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear…leetcode.com 문제 내용 8 방향 최단 거리 구하는 문제 Example 1: Input: grid = [[0,1],[1,0]] Output: 2 Example 2:

ISSA SOLUTION!

Overview of the Project The main objective of this project is to create a web application for research project management. 🧐 Here some tasks are allowed to be done automatically and easily. A project management tool allows to quickly create a task hierarchy that will help complete projects effectively and…

Deepest Leaves Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared…leetcode.com 문제 내용 가장 깊은 level의 노드들의 합을 구하는 문제 Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Output: 15 Example 2: Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5] Output: 19 Constraints: The number of nodes in the tree is in the range [1, 10^4].

Network Delay Time - LeetCode You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed…leetcode.com 문제 내용 출발점이 주어지는 데 모든 네트워크에 도달 할 때 드는 시간 구하기 Example 1: Input: times = [[2,1,1],[2,3,1],[3,4,1]], n = 4, k = 2 Output: 2 Example 2: Input: times = [[1,2,1]], n = 2, k = 1 Output: 1 Exa …

Populating Next Right Pointers in Each Node II - LeetCode Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point…leetcode.com 문제 내용 next 노드 추가 Example 1: Input: root = [1,2,3,4,5,null,7] Output: [1,#,2,3,#,4,5,7,#] Explanation: Given the above binary tree (Figure A), your function should populate each next …