Loading repository data…
black-shadows / repository
The repository contains solutions to various problems on leetcode. The code is merely a snippet (as solved on LeetCode) & hence is not executable in a c++ compiler. The code written is purely original and completely my own.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
My solutions to algorithmic problems in leetcode written in C++ and Python
I have solved quite a number of problems from several topics. See the below table for further details.
One day in the foreseeable future I will have solved all the challenges on leetcode. Then this repository will mostly become a static one.
Constructive criticisms or code reviews of any kind are very much welcome.
If you have any questions about the solutions you can find here, feel free to contact me abhisheksharma.0517@gmail.com.
| n | Complexity | Possible Algorithms & Techniques |
|---|---|---|
| 1018+ | O(1) | Math |
| 1018 | O(logn) | Binary & Ternary Search / Matrix Power / Cycle Tricks / Big Simulation Steps / Values Reranking / Math |
| 1016 | O(n1/2) | Math |
| 108 | O(n) | Greedy / Ad-hoc / DP |
| 4×107 | O(nlogn) | Linear # Calls to Binary & Ternary Search / Pre-processing & Querying / Divide and Conquer |
| 104 | O(n2) | Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound |
| 500 | O(n3) | Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound |
| 90 | O(n4) | Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound |
| 50 | O(n5) | Branch and Bound |
| 40 | O(n×2n/2) | Meet in the Middle |
| 20 | O(n×2n) | Backtracking / Generating 2n Subsets / Bitmask Technique |
| 11 | O(n!) | Factorial / Permutation / Combination Algorithm |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1310 | XOR Queries of a Subarray | C++ Python | O(n) | O(1) | Medium | ||
| 1318 | Minimum Flips to Make a OR b Equal to c | C++ Python | O(1) | O(1) | Medium | ||
| 1342 | Number of Steps to Reduce a Number to Zero | C++ Python | O(logn) | O(1) | Easy | ||
| 1558 | Minimum Numbers of Function Calls to Make Target Array | C++ Python | O(nlogn) | O(1) | Medium | Greedy | |
| 1707 | Maximum XOR With an Element From Array | C++ Python |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1002 | Find Common Characters | C++ Python | O(n * l) | O(1) | Easy | ||
| 1007 | Minimum Domino Rotations For Equal Row | C++ Python | O(n) | O(1) | Medium | ||
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | C++ Python | O(n) | O(1) | Easy | ||
| 1013 | Partition Array Into Three Parts With Equal Sum | C++ Python | O(n) | O(1) | Easy | ||
| 1014 | Best Sightseeing Pair | C++ Python |
Selected from shared topics, language and repository description—not editorial ratings.
wisdompeak /
This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.
80/100 healthgoogle /
The repository contains Google's robots.txt parser and matcher as a C++ library (compliant to C++11).
86/100 healthbrandonprry /
This repository contains full code examples from the book Gray Hat C#
/100 health| O(nlogn + mlogm + nlogk + mlogk) |
| O(nlogk) |
| Hard |
| variant of Maximum XOR of Two Numbers in an Array |
| Greedy, Trie |
| 1720 | Decode XORed Array | C++ Python | O(n) | O(1) | Easy |
| 1734 | Decode XORed Permutation | C++ Python | O(n) | O(1) | Medium |
| 1829 | Maximum XOR for Each Query | C++ Python | O(n) | O(1) | Medium |
| 2151 | Maximum Good People Based on Statements | C++ Python | O(n^2 * 2^n) | O(1) | Hard | Bitmasks, Brute Force |
| 2212 | Maximum Points in an Archery Competition | C++ Python | O(n * 2^n) | O(n) | Medium | Bitmasks, Brute Force |
| 2220 | Minimum Bit Flips to Convert Number | C++ Python | O(logn) | O(1) | Easy | Bit Manipulation |
| O(1) |
| Medium |
| 1018 | Binary Prefix Divisible By 5 | C++ Python | O(n) | O(1) | Easy |
| 1030 | Matrix Cells in Distance Order | C++ Python | O(m * n) | O(1) | Easy |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | C++ Python | O(n) | O(1) | Medium |
| 1051 | Height Checker | C++ Python | O(nlogn) | O(n) | Easy |
| 1052 | [Grumpy Bookstore Owner](https://leetcode |
black-shadows /
The repository contains solutions to various problems on interviewbit. The code is merely a snippet (as solved on InterviewBit) & hence is not executable in a c++ compiler. The code written is purely original and completely my own.
62/100 healthevgenkarlson /
| SCHOOL_42_UPDATE 2020 | This repository contains many versions of completed and commented out tasks for each day of the very first "Piscine C"( Program | Course | Programing | Coding | School 42 | Ecole 42 | School 21 | Школа 42 | Школа 21 ) Этот репозиторий содержит множество версий выполненных и закомментированных задач на каждый день самого первого "Бассейна по Си".
85/100 healthYou can run it on pynq z1. The repository contains the relevant Verilog code, Vivado configuration and C code for sdk testing. The size of the systolic array can be changed, now it is 16X16.
67/100 health