leetcode Tag Posts Index

F*ck Leetcode! Why Roy’s Story Matters

Today, let’s dive into something that’s been buzzing around the tech world: the case of Roy and why it’s a wake-up call for our industry. This 21-year-old has

Leetcode - 139. Word Break

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that

Leetcode - 1089. Duplicate Zeros

Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements beyond the length of

Little Leetcode Adventures 3: Pow(x, n)

Raising numbers to their powers... this has to be mathematics, right? Photo by Thomas T on Unsplash. It's been some time since the last post! I'm actually still

LeetCode Challenge (Python3). Problem#3

Source Introduction of this challenge: I recently decided to improve my programming skills, so I started using LeetCode to achieve this goal. However, since I don't

LeetCode Challenge (Python3). Problem 2

Source Introduction of this challenge: I recently decided to improve my programming skills, so I started using LeetCode to achieve this goal. However, since I don't

LeetCode Challenge (Python3). Problem#1

Source I recently decided to improve my programming skills, so I decided to use LeetCode to achieve this goal. However, since I don't have much programming experience

one simple implementation of trie in python3

This is the implementation of trie in python3, you can get the question from implement-trie-prefix-tree. class Trie: def __init__(self): """ Initialize

JavaScript interview questions [with solutions]

I have been a software engineer for almost 5 years now but (for one reason or another) only today for the first time I interviewed another developer for a position

【Rust每日新闻】 2018-12-20

Rust Quiz 解读： Quiz 20 #quiz Read More LeetCode already supports Rust @rustlang @LeetCode #leetcode 中国版和美国版都支持了，另外了解到的消息是，目前是基于Rust stable 1.31版，而且还会持续跟进Rust

[Coding study (leetcode)] Tree problems. 105, 106

이야기 Leetcode에서 트리관련 문제를 이어서 풀고 있습니다. Leetcode와 유사한 서비스로 Hackerank도 있는데요. Hackerank도 잘 되어있어 둘다 활용하여 코딩테스트 공부를 하고있습니다. 문제 Given inorder and postorder traversal of

[Leetcode] 94, 144, 145. binary tree traversal

서론 Leetcode를 아시나요? Leetcode는 여러 프로그래밍 언어로 자료구조를 공부할 수 있고, 코딩문제들을 풀어볼 수 있습니다. Leetcode에서는 easy, medium, hard로 분류되는 총 804개의 코딩 문제가 있습니다. 804개에서 자신이 원하는 키워드를 검색해서 풀

[Leetcode] 100.same-tree

문제 [100] Same Tree Easy (47.95%) Total Accepted: 270.6K Total Submissions: 564.2K 두 개의 트리가 있을 때, 같은 트리인지 확인하라. 풀이 과정 같은 트리인지 어떻게 확인하지? 트리 구조가 같은지 체크한다. 두 개의 트리에서

[LeetCode] 677. Map Sum Pairs (Python3)

Implement a MapSum class with insert, and sum methods. Check the website above for more details Medium, 44ms, 100% class MapSum: ## Initialize the dictionary def

LeetCode 1. Two Sum: CPP Solution

Problem Statement Given an integer array of size N, return indices of the two numbers such that they add up to a specific target. Function Signature: C++

[LeetCode] Objective C — Reverse a NSString

[LeetCode: reverse a string] ( NSString* reverseString(NSString *originalString) { // use a new string to append the chars from the old one NSString *newString =

[LeetCode] Objective C — Check If a String Has Duplicate Characters

BOOL checkDuplicates(NSString *str) { NSMutableArray *storageArray = [NSMutableArray array]; for (int i = 0; i < str.length; i++) { NSString *charStr = [str

[LeetCode] Convert Sorted Array to Binary Search Tree in Objective C

LeetCode Convert Sorted Array to Binary Search Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; -(TreeNode

[LeetCode] Validate Binary Search Tree in Objective C

LeetCode: Validate Binary Search Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; -(BOOL)isValidBST:(TreeNode

[LeetCode] Balanced Binary Tree in Objective C

LeetCode: Balanced Binary Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; - (BOOL)isBalanced:(TreeNode