Skip to content

My solutions to LeetCode, Hackerrank problems

Notifications You must be signed in to change notification settings

fritzrehde/competitive-programming

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

48 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Competitive Programming

This repository contains my solutions to competitive programming problems from various online platforms.

Each of the code solution files contains the problem description, several (differently performing) implementations, as well as time and space complexity analysis.

Table of Contents

# Difficulty Problem Title Implementation
1 Easy Two Sum Python
2 Medium Add Two Numbers Python
3 Medium Longest Substring Without Repeating Characters Python
4 Hard Median Of Two Sorted Arrays Python
5 Medium Longest Palindromic Substring Python
6 Medium Zigzag Conversion Python
7 Medium Reverse Integer Python
8 Medium String To Integer (Atoi) Python
11 Medium Container With Most Water Python
14 Easy Longest Common Prefix Python
15 Medium 3Sum Python
20 Easy Valid Parentheses Python
22 Medium Generate Parentheses Python
28 Easy Find The Index Of The First Occurrence In A String Python
45 Medium Jump Game II Python
50 Medium Pow(X, N) Python
51 Hard N-Queens Python
53 Medium Maximum Subarray Python
70 Easy Climbing Stairs Python
94 Easy Binary Tree Inorder Traversal Python
144 Easy Binary Tree Preorder Traversal Python
292 Easy Nim Game Python
1137 Easy N-Th Tribonacci Number Python

Array

Difficulty Problem Title Implementation
Easy Arrays - DS Python
Easy Array Left Rotation Python

Linked Lists

Difficulty Problem Title Implementation
Easy Reverse a Linked List Python

Programming Language Choices

Why Python? I think Python is a good language for quickly writing elegant and readable programs. Of course, performance will be compromised, but performance is not the main goal of this project (for now). I am mostly solving these puzzles to improve my knowledge in Algorithms and Data Structures.