KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#developer-tools #codex #typescript #ai-agents #ai-agent #cli #claude-code #open-source #deepseek-harness #dsh-plugin #python #mcp

Competitive-Coding

★ 17 Open GitHub ↗

No description available.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Competitive-Coding

![Language](https://img.shields.io/badge/language-C++11-orange.svg)  ![Progress](https://img.shields.io/badge/progress-30%20%2F%201594-ff69b4.svg)
 ![Visitors](https://visitor-badge.laobi.icu/badge?page_id=skjha1.Competitive-Coding)

This Section contains competitive coding form different different coding plateform...
<p align="center">
  <img width="460" height="300" src="https://github.com/skjha1/Competitive-Coding/blob/main/Codechef/IMG/cp.png">
</p>

## Topics

* [Array](https://github.com/skjha1/Competitive-Coding#array)
* [Linked List](https://github.com/skjha1/Competitive-Coding#LinkedList)

## Array
|  S.No  | Title           |  Solution       |  Time           | Space           | Difficulty    |
|-----|---------------- | --------------- | --------------- | --------------- | ------------- |
1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/01%20Two%20Sum.cpp)  | _O(n)_       | _O(n)_          | Easy         |
 2 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/02%20Contains%20Duplicate.cpp)  | _O(n)_       | _O(1)_          | Easy         |
3 | [Missing Number](https://leetcode.com/problems/missing-number/) |  [souece](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/03%20Missing%20Number.cpp) | _O(n)_       | _O(1)_          | Easy         |
4 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/04%20Find%20All%20Numbers%20Disappeared%20in%20an%20Array.cpp)  | _O(n)_       | _O(n)_          | Easy         |
5 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/05%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted.cpp)  | _O(n)_       | _O(n)_          | Easy         |
6 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/06%20%20Remove%20Duplicates%20from%20Sorted%20Array.cpp)  | _O(n)_       | _O(n)_          | Easy         |
7 | [Remove element](https://leetcode.com/problems/remove-element/) | [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/07%20Remove%20element.cpp)  | _O(n)_       | _O(n)_          | Easy         |
8 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) |  [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/08%20Search%20Insert%20Position.cpp) | _O(n)_       | _O(n)_          | Easy         |
9 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) |  [source](https://github.com/skjha1/Competitive-Coding/blob/main/Leetcode/Easy/09%20Maximum%20Subarray.cpp) | _O(n)_       | _O(n)_          | Easy         |

Competitive-Coding

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README