#leetcode

Follow to get notified about new posts with this tag

simplestack

2y

!Low reputation account with an unverified outbound link, Reveal content

F*ck Leetcode! Why Roy’s Story Matters

F*ck Leetcode! Why Roy’s Story Matters

A 21 year old exposing how broken the hiring system is, at least for the Big Boys

$ 0.000

6

lochard

3y

Leetcode - 139. Word Break

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 the same word in the dictionary may be

$ 0.000

0

lochard

3y

Leetcode - 1089. Duplicate Zeros

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 the original array are not written. Do the

lilacse

Programming & Dev

4y

Little Leetcode Adventures 3: Pow(x, n)

Little Leetcode Adventures 3: Pow(x, n)

What do you do when the power is over 9000?

tonyz

Black And White

4d

Oude Gracht. Monomad Challenge.

Oude Gracht. Monomad Challenge.

The Oudegracht ("Old Canal") in Utrecht/the Netherlands is a 2-kilometer-long inner-city waterway with roots stretching back to Roman times and the Early Middle Ages.

life-hacker

Programming & Dev

5y

LeetCode Challenge (Python3). Problem#3

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 have much programming experience and

life-hacker

Programming & Dev

5y

LeetCode Challenge (Python3). Problem 2

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 have much programming experience and

life-hacker

Programming & Dev

5y

LeetCode Challenge (Python3). Problem#1

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 and this is my first time using LeetCode,

shiziwen

7y

!Low reputation account with an unverified outbound link, Reveal content

one simple implementation of trie in python3

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 your data structure here.

misijos142018

5d

A Saturday Without Power, But Full of Life (Phone Photography)

A Saturday Without Power, But Full of Life (Phone Photography)

Good morning, everyone in this community! The day begins, it's already Saturday, and everything is very quiet. There is no electricity; I think almost the entire country is without power 😔, but the day

gaottantacinque

7y

JavaScript interview questions [with solutions]

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 in my company. Here is the simple exercise

blackanger

8y

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

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

Rust Quiz 解读： Quiz 20 #quiz Read More LeetCode already supports Rust @rustlang @LeetCode #leetcode 中国版和美国版都支持了，另外了解到的消息是，目前是基于Rust stable 1.31版，而且还会持续跟进Rust Stable版本。在未来会逐渐加入常用的crate，这个看使用者反馈来持续改进。刷Leetcode

jacobyu

8y

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

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

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

jacobyu

8y

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

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

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

darth-azrael

5d

Byte: The Small Systems Journal (November 1980)

Byte: The Small Systems Journal (November 1980)

You had to be pretty hardcore to be computing in 1980. However, Byte was there to help you along. It covered all kinds of systems and much of the content was highly technical. The November 1980 issue includes:

jacobyu

8y

[Leetcode] 100.same-tree

[Leetcode] 100.same-tree

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

juneepa

9y

!Low reputation account with an unverified outbound link, Reveal content

[LeetCode] 677. Map Sum Pairs (Python3)

[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 __init__(self): self.wdict = {} ## Insert

elsyr

9y

!Low reputation account with an unverified outbound link, Reveal content

LeetCode 1. Two Sum: CPP Solution

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++ vector<int> twoSum(vector<int> input,

nbfuhao

10y

[LeetCode] Objective C — Reverse a NSString

[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 = @""; for (int i =

apnigrich

5d

Getting to Know The History of Minsk

Getting to Know The History of Minsk

Getting to know the history of Minsk

Greetings, friends. In the second half of September, I traveled to Belarus. This was my first trip through a travel agency. I planned this trip back in April. On the morning of April 22, I was standing

nbfuhao

10y

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

[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 substringWithRange:NSMakeRange(i,1)]; if

nbfuhao

10y

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

[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 *)sortedArrayToBST:(NSArray *array)

nbfuhao

10y

[LeetCode] Validate Binary Search Tree in Objective C

[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 *)node { return (valid:node

nbfuhao

10y

[LeetCode] Balanced Binary Tree in Objective C

[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 *)node { if (!node) return true; return