Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
Accelerator
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Type
/
to search
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
rewertt
/
My-Leetcode-Solutions
Public
forked from
meliksahyorulmazlar/My-Leetcode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
main
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
429 Commits
429 Commits
1. Two Sum (Leetcode)
1. Two Sum (Leetcode)
1002. Find Common Characters (Leetcode)
1002. Find Common Characters (Leetcode)
1009. Complement of Base 10 Integer (Leetcode)
1009. Complement of Base 10 Integer (Leetcode)
1017. Convert to Base -2 (Leetcode)
1017. Convert to Base -2 (Leetcode)
1030. Matrix Cells in Distance Order (Leetcode)
1030. Matrix Cells in Distance Order (Leetcode)
104. Maximum Depth of Binary Tree (Leetcode)
104. Maximum Depth of Binary Tree (Leetcode)
1050. Actors and Directors Who Cooperated At Least Three Times (Leetcode)
1050. Actors and Directors Who Cooperated At Least Three Times (Leetcode)
1051. Height Checker (Leetcode)
1051. Height Checker (Leetcode)
1099. Two Sum Less Than K (Leetcode)
1099. Two Sum Less Than K (Leetcode)
1108. Defanging an IP Address (Leetcode)
1108. Defanging an IP Address (Leetcode)
1109. Corporate Flight Bookings
1109. Corporate Flight Bookings
1119. Remove Vowels from a String
1119. Remove Vowels from a String
1137. N-th Tribonacci Number (Leetcode)
1137. N-th Tribonacci Number (Leetcode)
1148. Article Views I (Leetcode)
1148. Article Views I (Leetcode)
1154. Day of the Year (Leetcode)
1154. Day of the Year (Leetcode)
118. Pascal's Triangle (Leetcode)
118. Pascal's Triangle (Leetcode)
1185. Day of the Week (Leetcode)
1185. Day of the Week (Leetcode)
1189. Maximum Number of Balloons (Leetcode)
1189. Maximum Number of Balloons (Leetcode)
119. Pascal's Triangle II (Leetcode)
119. Pascal's Triangle II (Leetcode)
12. Integer to Roman (Leetcode)
12. Integer to Roman (Leetcode)
1206. Design Skiplist
1206. Design Skiplist
1207. Unique Number of Occurrences
1207. Unique Number of Occurrences
1232. Check If It Is a Straight Line (Leetcode)
1232. Check If It Is a Straight Line (Leetcode)
1244. Design A Leaderboard (Leetcode)
1244. Design A Leaderboard (Leetcode)
125. Valid Palindrome (Leetcode)
125. Valid Palindrome (Leetcode)
1281. Subtract the Product and Sum of Digits of an Integer (Leetcode)
1281. Subtract the Product and Sum of Digits of an Integer (Leetcode)
1290. Convert Binary Number in a Linked List to Integer (Leetcode)
1290. Convert Binary Number in a Linked List to Integer (Leetcode)
1295. Find Numbers with Even Number of Digits (Leetcode)
1295. Find Numbers with Even Number of Digits (Leetcode)
13. Roman to Integer (Leetcode)
13. Roman to Integer (Leetcode)
1303. Find the Team Size (Leetcode)
1303. Find the Team Size (Leetcode)
1304. Find N Unique Integers Sum up to Zero (Leetcode)
1304. Find N Unique Integers Sum up to Zero (Leetcode)
1317. Convert Integer to the Sum of Two No-Zero Integers (Leetcode)
1317. Convert Integer to the Sum of Two No-Zero Integers (Leetcode)
1342. Number of Steps to Reduce a Number to Zero (Leetcode)
1342. Number of Steps to Reduce a Number to Zero (Leetcode)
1344. Angle Between Hands of a Clock (Leetcode)
1344. Angle Between Hands of a Clock (Leetcode)
1346. Check If N and Its Double Exist (Leetcode)
1346. Check If N and Its Double Exist (Leetcode)
1350. Students With Invalid Departments (Leetcode)
1350. Students With Invalid Departments (Leetcode)
1351. Count Negative Numbers in a Sorted Matrix (Leetcode)
1351. Count Negative Numbers in a Sorted Matrix (Leetcode)
1357. Apply Discount Every n Orders (Leetcode)
1357. Apply Discount Every n Orders (Leetcode)
136. Single Number (Leetcode)
136. Single Number (Leetcode)
1360. Number of Days Between Two Dates
1360. Number of Days Between Two Dates
1365. How Many Numbers Are Smaller Than the Current Number (Leetcode)
1365. How Many Numbers Are Smaller Than the Current Number (Leetcode)
137. Single Number II (Leetcode)
137. Single Number II (Leetcode)
1374. Generate a String With Characters That Have Odd Counts (Leetcode)
1374. Generate a String With Characters That Have Odd Counts (Leetcode)
1378. Replace Employee ID With The Unique Identifier (Leetcode)
1378. Replace Employee ID With The Unique Identifier (Leetcode)
1381. Design a Stack With Increment Operation
1381. Design a Stack With Increment Operation
1390. Four Divisors (Leetcode)
1390. Four Divisors (Leetcode)
1398. Customers Who Bought Products A and B but Not C (Leetcode)
1398. Customers Who Bought Products A and B but Not C (Leetcode)
1399. Count Largest Group (Leetcode)
1399. Count Largest Group (Leetcode)
141. Linked List Cycle (Leetcode)
141. Linked List Cycle (Leetcode)
142. Linked List Cycle II (Leetcode)
142. Linked List Cycle II (Leetcode)
1431. Kids With the Greatest Number of Candies
1431. Kids With the Greatest Number of Candies
1436. Destination City
1436. Destination City
144. Binary Tree Preorder Traversal (Leetcode)
144. Binary Tree Preorder Traversal (Leetcode)
1445. Apples & Oranges (Leetcode)
1445. Apples & Oranges (Leetcode)
1446. Consecutive Characters (Leetcode)
1446. Consecutive Characters (Leetcode)
145. Binary Tree Postorder Traversal (Leetcode)
145. Binary Tree Postorder Traversal (Leetcode)
1451. Rearrange Words in a Sentence (Leetcode)
1451. Rearrange Words in a Sentence (Leetcode)
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence (Leetcode)
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence (Leetcode)
1464. Maximum Product of Two Elements in an Array (Leetcode)
1464. Maximum Product of Two Elements in an Array (Leetcode)
147. Insertion Sort List (Leetcode)
147. Insertion Sort List (Leetcode)
1470. Shuffle the Array (Leetcode)
1470. Shuffle the Array (Leetcode)
1472. Design Browser History (Leetcode)
1472. Design Browser History (Leetcode)
148. Sort List (Leetcode)
148. Sort List (Leetcode)
1480. Running Sum of 1d Array (Leetcode)
1480. Running Sum of 1d Array (Leetcode)
1486. XOR Operation in an Array (Leetcode)
1486. XOR Operation in an Array (Leetcode)
1491. Average Salary Excluding the Minimum and Maximum Salary (Leetcode)
1491. Average Salary Excluding the Minimum and Maximum Salary (Leetcode)
1492. The kth Factor of n (Leetcode)
1492. The kth Factor of n (Leetcode)
1502. Can Make Arithmetic Progression From Sequence (Leetcode)
1502. Can Make Arithmetic Progression From Sequence (Leetcode)
1507. Reformat Date (Leetcode)
1507. Reformat Date (Leetcode)
151. Reverse Words in a String (Leetcode)
151. Reverse Words in a String (Leetcode)
1512. Number of Good Pairs (Leetcode)
1512. Number of Good Pairs (Leetcode)
1517. Find Users With Valid E-Mails (Leetcode)
1517. Find Users With Valid E-Mails (Leetcode)
1523. Count Odd Numbers in an Interval Range (Leetcode)
1523. Count Odd Numbers in an Interval Range (Leetcode)
1527. Patients With a Condition (Leetcode)
1527. Patients With a Condition (Leetcode)
1528. Shuffle String (Leetcode)
1528. Shuffle String (Leetcode)
1534. Count Good Triplets (Leetcode)
1534. Count Good Triplets (Leetcode)
1539. Kth Missing Positive Number (Leetcode)
1539. Kth Missing Positive Number (Leetcode)
155. Min Stack
155. Min Stack
1550. Three Consecutive Odds (Leetcode)
1550. Three Consecutive Odds (Leetcode)
1570. Dot Product of Two Sparse Vectors
1570. Dot Product of Two Sparse Vectors
1571. Warehouse Manager (Leetcode)
1571. Warehouse Manager (Leetcode)
1572. Matrix Diagonal Sum (Leetcode)
1572. Matrix Diagonal Sum (Leetcode)
1582. Special Positions in a Binary Matrix (Leetcode)
1582. Special Positions in a Binary Matrix (Leetcode)
1598. Crawler Log Folder
1598. Crawler Log Folder
160. Intersection of Two Linked Lists (Leetcode)
160. Intersection of Two Linked Lists (Leetcode)
1603. Design Parking System
1603. Design Parking System
1633. Percentage of Users Attended a Contest
1633. Percentage of Users Attended a Contest
1636. Sort Array by Increasing Frequency
1636. Sort Array by Increasing Frequency
164. Maximum Gap (Leetcode)
164. Maximum Gap (Leetcode)
1641. Count Sorted Vowel Strings (Leetcode)
1641. Count Sorted Vowel Strings (Leetcode)
1652. Defuse the Bomb (Leetcode)
1652. Defuse the Bomb (Leetcode)
1662. Check If Two String Arrays are Equivalent (Leetcode)
1662. Check If Two String Arrays are Equivalent (Leetcode)
1667. Fix Names in a Table (Leetcode)
1667. Fix Names in a Table (Leetcode)
167. Two Sum II - Input Array Is Sorted
167. Two Sum II - Input Array Is Sorted
1672. Richest Customer Wealth (Leetcode)
1672. Richest Customer Wealth (Leetcode)
1683. Invalid Tweets (Leetcode)
1683. Invalid Tweets (Leetcode)
1684. Count the Number of Consistent Strings (Leetcode)
1684. Count the Number of Consistent Strings (Leetcode)
1688. Count of Matches in Tournament (Leetcode)
1688. Count of Matches in Tournament (Leetcode)
169. Majority Element (Leetcode)
169. Majority Element (Leetcode)
17. Letter Combinations of a Phone Number (Leetcode)
17. Letter Combinations of a Phone Number (Leetcode)
View all files
Repository files navigation
README
More
items
sekti.2
About
LeetCode solutions in Python and C++
leetcode.com/u/melikatrensselaer/
Resources
Readme
Activity
Stars
1
star
Watchers
0
watching
Forks
0
forks
Report repository
Releases
Packages
Used by
Contributors
Languages
You can’t perform that action at this time.