leetcode

leetcode copied to clipboard

Willing to collaborate

2

Hi there @neetcode-gh, thanks for this repo! I just started contributing, and I would like to be a collaborator too. I am wishing to give some JS, TS and maybe...

nickap

**File Modified**: _0005-longest-palindromic-substring.py_ - **Language Used**: _python_ - **Submission URL**: _https://leetcode.com/problems/longest-palindromic-substring/submissions/945080908/_ - **Reason**: - Optimizing the space complexity: the substring slice operation created extra space. Before O(N) extra space, after...

shafiemukhre

[//]: # "Pull Request Template" [//]: # "Replace the placeholder values in the template below" - **File(s) Modified**: _0147-insertion-sort-list.go_ - **Language(s) Used**: _golang_ - **Submission URL**: _https://leetcode.com/problems/insertion-sort-list/submissions/943903925/_ ### Description Added...

Rohijit-Sinha

- **File(s) Modified**: _1929-concatenation-of-arrays.go_ - **Language(s) Used**: _go_ - **Submission URL**: _https://leetcode.com/problems/concatenation-of-array/submissions/938569700/_

galfudim

- **File(s) Modified**: _0707-design-linked-list.js_ - **Language(s) Used**: _javascript_ - **Submission URL**: _https://leetcode.com/problems/design-linked-list/submissions/939959146/_ ### Important Please make sure the file name is lowercase and a duplicate file does not already exist...

rzvl

Add optimized solution with O(n) - javascript/0347-top-k-frequent-elements.js

1

The changes include a new solution that does the job in O(n) as described in the video without sorting the frequency array taking O(logN) [//]: # "Pull Request Template" [//]:...

tayyabferozi

[//]: # "Pull Request Template" [//]: # "Replace the placeholder values in the template below" - **File(s) Modified**: 0347-top-k-frequent-elements.py - **Language(s) Used**: _python_ - **Submission URL**: _https://leetcode.com/problems/top-k-frequent-elements/submissions/941791599/_ [//]: # "Getting...

Devansh-Agarwal

``` for n in nums: # check if its the start of a sequence if (n - 1) not in numSet: length = 1 while (n + length) in numSet:...

chasevanb

- **File(s) Modified**: _1929-concatenation-of-array.rs_ - **Language(s) Used**: _rust_ - **Submission URL**: _https://leetcode.com/problems/concatenation-of-array/submissions/938046151/_

galfudim

- **File(s) Modified**: _0110-balanced-binary-tree.rs_ - **Language(s) Used**: _rust_ - **Submission URL**: _https://leetcode.com/problems/balanced-binary-tree/submissions/932158588/_

galfudim