Разработка • dev.to • 26 мая 2024 г. 16:57
Hi guys, this is my second personal blog about learning Python. I am happy to say I am already in an advanced topic. Python is easier than I thought. If you are scared of programming you should definitely start with Python. So far, Harvard CS50 has...... читать далее
python machinelearning webdev beginnersРазработка • dev.to • 26 мая 2024 г. 16:37
Let’s be honest, the tech world is a treadmill on fast-forward. By the time you master one programming language like Python, there’s a hot new framework like Django out there threatening to make it seem outdated. Cloud platforms shift from on-premise...... читать далее
Разработка • dev.to • 26 мая 2024 г. 8:29
Disclosure: This post includes affiliate links; I may receive compensation if you purchase products or services from the different links provided in this article. image_credit - ByteByteGo Hello friends, In System design, efficiency and speed are...... читать далее
programming systemdesign development softwaredevelopmentРазработка • dev.to • 26 мая 2024 г. 6:43
Introduction Becoming a Java backend developer is a rewarding journey that opens doors to numerous opportunities in the tech industry. This detailed roadmap will guide you through the essential skills, tools, and technologies you need to master to...... читать далее
webdev beginners programming tutorialРазработка • dev.to • 25 мая 2024 г. 16:13
140. Word Break II Hard Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order. Note that the same word in the dict...... читать далее
php leetcode algorithms programmingРазработка • dev.to • 25 мая 2024 г. 13:59
class Solution { int resSum = 0; public int sumNumbers(TreeNode root) { getSumRoot(root, 0); return resSum; } void getSumRoot(TreeNode node, int sum){ if(node==null) return; sum = sum * 10...... читать далее
leetcode java beginners algorithmsРазработка • dev.to • 24 мая 2024 г. 19:55
The description for this problem is: A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomple...... читать далее
computerscience algorithms typescript javascriptРазработка • dev.to • 24 мая 2024 г. 19:42
1255. Maximum Score Words Formed by Letters Hard Given a list of words, list of single letters (might be repeating) and score of every character. Return the maximum score of any valid set of words formed by using the given letters (words[i] canno...... читать далее
php leetcode algorithms programmingРазработка • dev.to • 23 мая 2024 г. 23:17
O objetivo desse post é demonstrar como eu pensei e solucionei o desafio citado usando uma técnica chamada two pointers. Desafio Dado um array de números inteiros, mova os números 5 para o final dele. Exemplo: [1, 5, 2, 5, 3] Como resulta...... читать далее
twopointers algorithms pythonРазработка • dev.to • 23 мая 2024 г. 21:12
The trie data structure gets its name from the word retrieval — and it's usually pronounced as "try," so that we don't get confused with another familiar and friendly data structure, "tree." However, a trie is still a tree (or tree-like) data struct...... читать далее
computerscience algorithms javascript learningРазработка • dev.to • 22 мая 2024 г. 17:39
The data science field is booming, with numerous reports highlighting the escalating demand for skilled professionals. However, this surge in demand also translates to heightened competition for sought-after positions. To secure your dream data scien...... читать далее
datascience interview career learningРазработка • dev.to • 22 мая 2024 г. 17:12
131. Palindrome Partitioning Medium Given a string s, partition s such that every substring1 of the partition is a palindrome2. Return all possible palindrome partitioning of s. Example 1: Input: s = "aab" Output: [["a","a","b"],["aa","b"]]...... читать далее
php leetcode algorithms programmingРазработка • dev.to • 22 мая 2024 г. 11:03
Introduction Struggling to create a professional-looking portfolio website? Look no further! With this GitHub Portfolio template, you can easily create a personalized portfolio using just your GitHub username. Whether you're a developer or a freela...... читать далее
nextjs github portfolio javascriptРазработка • dev.to • 21 мая 2024 г. 16:50
78. Subsets Medium Given an integer array nums of unique elements, return all possible subsets1 (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example 1: Input: nums = [1,2,3] Output: [...... читать далее
php leetcode algorithms programmingРазработка • dev.to • 21 мая 2024 г. 2:57
Delve into an in-depth understanding of parameters in coding, including what a parameter is, practical examples of parameters in programming, and the distinction between parameters and arguments. Welcome back, visitor! In today's post, I will cover...... читать далее
programming career tutorial beginnersРазработка • dev.to • 20 мая 2024 г. 23:11
The description for Word Search is: Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally o...... читать далее
computerscience algorithms typescript javascriptРазработка • dev.to • 20 мая 2024 г. 17:28
1863. Sum of All Subset XOR Totals Easy The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty. For example, the XOR total of the array [2,5,6] is 2 XOR 5 XOR 6 = 1. Given an array nums, return t...... читать далее
php leetcode algorithms programmingРазработка • dev.to • 19 мая 2024 г. 22:08
Let's start with the description for Combination Sum: Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the comb...... читать далее
computerscience algorithms typescript javascriptРазработка • dev.to • 19 мая 2024 г. 19:07
3068. Find the Maximum Sum of Node Values Hard There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 0-indexed 2D integer array edges of length n - 1, where edges[i] = [ui, vi] indicates that there is an edge between nod...... читать далее
php leetcode algorithms programmingРазработка • dev.to • 19 мая 2024 г. 9:41
Disclosure: This post includes affiliate links; I may receive compensation if you purchase products or services from the different links provided in this article. image_credit - DesignGuru Hello devs, if you are preparing for Coding interviews in...... читать далее
programming softwaredevelopment development rest
