EUNO.NEWS EUNO.NEWS
  • All (20292) +229
  • AI (3103) +13
  • DevOps (906) +6
  • Software (10480) +161
  • IT (5755) +49
  • Education (48)
  • Notice
  • All (20292) +229
    • AI (3103) +13
    • DevOps (906) +6
    • Software (10480) +161
    • IT (5755) +49
    • Education (48)
  • Notice
  • All (20292) +229
  • AI (3103) +13
  • DevOps (906) +6
  • Software (10480) +161
  • IT (5755) +49
  • Education (48)
  • Notice
Sources Tags Search
한국어 English 中文
  • 1个月前 · software

    134. 加油站 | LeetCode | Top Interview 150 | 编码题目

    问题链接 https://leetcode.com/problems/gas-station/https://leetcode.com/problems/gas-station/ !leetcode 134https://media2.dev.to/dynamic/image/width=800%2C...

    #leetcode #algorithm #greedy #array #interview-prep #java #coding-challenge
  • 1个月前 · software

    238. 数组除自身以外的乘积 | LeetCode | Top Interview 150 | 编程题

    问题链接 https://leetcode.com/problems/product-of-array-except-self/ https://leetcode.com/problems/product-of-array-except-self/ !leetcode 238https://media2...

    #leetcode #product-of-array-except-self #algorithm #array #java #interview-prep
  • 1个月前 · software

    274. H-Index | LeetCode | Top Interview 150 | 编程题目

    问题链接: https://leetcode.com/problems/h-index/ 解决方案 Java 类 Solution { public int hIndex(int citations) { int n = citations.length; int[] arr = new int... } }

    #leetcode #h-index #algorithm #java #interview-prep #coding-problem
  • 1个月前 · software

    第64天:Python 深度优先搜索(DFS)在树上的堆栈式迭代遍历,实现无递归的深度探索

    欢迎来到 80DaysOfChallenges 旅程的第 64 天!本次中级挑战在树结构上实现了深度优先搜索(DFS),使用迭代栈。

    #python #depth-first-search #dfs #iterative-algorithm #stack #tree-traversal #recursion-avoidance #algorithm #interview-prep
  • 1个月前 · software

    55. Jump Game | LeetCode | Top Interview 150 | 编码题目

    Forem 标志https://media2.dev.to/dynamic/image/width=65,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%...

    #leetcode #jump-game #algorithm #dynamic-programming #interview-prep #coding-challenge
  • 1个月前 · software

    121. 买卖股票的最佳时机 | LeetCode | Top Interview 150 | Coding Questions

    !Forem 标志 https://media2.dev.to/dynamic/image/width=65,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%...

    #leetcode #algorithm #interview-prep #stock-problem #coding-challenge
  • 1个月前 · software

    第60天:Python 删除链表倒数第N个节点,双指针技巧一次遍历删除(LeetCode #19 风格)

    欢迎来到 80DaysOfChallenges 之旅的第 60 天!这个中等挑战解决了标志性的 Remove Nth Node From End of Linked List 问题(LeetCode 19)。

    #python #linked-list #leetcode #two-pointer #interview-prep #data-structures
  • 1个月前 · software

    80. 从已排序数组中删除重复项 II | LeetCode | Top Interview 150 | Coding Questions

    Forem 标志 https://media2.dev.to/dynamic/image/width=65,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%...

    #leetcode #algorithm #arrays #duplicate-removal #interview-prep
  • 1个月前 · software

    88. 合并排序数组 | LeetCode | Top Interview 150 | 编程题

    问题链接 Merge Sorted Array – LeetCode https://leetcode.com/problems/merge-sorted-array/ 解决方案 Java java class Solution { public void merge(int[] nums1, int ...

    #leetcode #merge-sorted-array #java #arrays #algorithm #interview-prep
  • 1个月前 · software

    如何在 LeetCode 上使用栈将递归解法转换为迭代

    最初发表于 LeetCopilot Blog https://leetcopilot.dev/blog/convert-recursive-solution-to-iterative-leetcode-using-stack 面试官经常会让你…

    #recursion #iteration #stack #LeetCode #algorithm #interview-prep #DFS #backtracking
  • 1个月前 · software

    如何在编码面试中口头解释你的 LeetCode 解法

    面试时的沉默表明你在挣扎。学习一个结构化的框架来口头表达你的思考过程——从问题澄清到解答演示……

    #coding-interview #leetcode #interview-prep #communication-skills #problem-solving #technical-interview
  • 1个月前 · software

    第12天:Python 编程

    第1部分:LIST – 高级概念 List Comprehension - With condition Nested List Comprehension List Slicing 重要的 List 方法 示例:python 示例...

    #python #collections #list-comprehension #tuple-unpacking #set-operations #dictionary #interview-prep #data-structures

Newer posts

Older posts
EUNO.NEWS
RSS GitHub © 2026