Warning
THIS IS MORE LIKE PERSONAL ENGINEER-DEVELOPER NOTEBOOK RATHER THAN REPO WITH BEST-AND-OPTIMAL SOLUTIONS!
Created this to track and motivate myself to "keep in programming shape".
Problem description might be under the circle (C and C++) or name, followed by link to my solution. Some solutions "might" look ancient because some problems provide part of code to work with.
π’ Easy π Medium π΄ Hard
Algorithms
-
Warmup β
- π’ 1xπSolve Me First - C++
- π’ 10xπ Simple Array Sum - C++
- π’ 10xπ Compare the Triplets - C++
- π’ 10xπ A Very Big Sum - C++
- π’ 10xπ Diagonal Difference - C++
- π’ 10xπ Plus Minus - C++
- π’ 10xπ Staircase - C++
- π’ 10xπ Mini-Max Sum - C++
- π’ 10xπ Birthday Cake Candles - C++
- π’ 15xπ Time Conversion - C++
-
Implementation
- π’ 10xπ Grading Students - C++
- π’ 10xπ Apple and Orange - C++
- π’ 10xπ Number Line Jumps - C++
- π’ 10xπ Breaking the Records - C++
- π’ 10xπ Subarray Division - C++
- π’ 10xπ Bill Division - C++
- π’ 10xπ Sales by Match - C++
-
Strings
-
Sorting
- π’ 15xπ Big Sorting - C++
- π’ 15xπ tutorial-intro - C++
-
Search
-
Graph Theory
-
Greedy
-
Dynamic Programming
-
Constructive Algorithms
-
Bit Manipulation
-
Recursion
-
Game Theory
-
NP Complete
-
Debugging
Data Structures
- Arrays β
- π’ 10xπ Arrays - DS - C++
- π’ 15xπ 2D Array - DS - C++
- π’ 15xπ Dynamic Array - C++
- π’ 20xπ Left Rotation - C++
- π 25xπ Sparse Arrays - C++
- π΄ 60xπ Array Manipulation - C++
- Linked Lists
- π’ 5xπ Print the Elements of a Linked List - C++
- π’ 5xπ Insert a node at the tail of a Linked List - C++
- π’ 5xπ Insert a node at the head of a linked list - C++
- π’ 5xπ Insert a node at a specific position in a linked list - C++
- π’ 5xπ Delete a Node - C++
- π’ 5xπ Print in Reverse - C++
- π’ 5xπ Reverse a linked list - C++
- π’ 5xπ Compare two linked lists - C++
- π’ 5xπ Get Node Value - C++
- π’ 5xπ Delete duplicate-value nodes from a sorted linked list - C++
- π’ 5xπ Inserting a Node Into a Sorted Doubly Linked List - C++
- π’ 5xπ Reverse a doubly linked list - C++
- Trees
- π’ 10xπ Tree: Preorder Traversal - C++
- π’ 10xπ Tree: Postorder Traversal - C++
- π’ 10xπ Tree: Inorder Traversal - C++
- π’ 10xπ Tree: Height of a Binary Tree - C++
- Introduction β
- π’ 5x:cherries: Say "Hello, World!" With C++
- π’ 5x:cherries: Input and Output
- π’ 10x:cherries: Basic Data Types
- π’ 10x:cherries: Conditional Statements
- π’ 10x:cherries: For Loop
- π’ 10x:cherries: Functions
- π’ 10x:cherries: Pointer
- π’ 10x:cherries: Arrays Introduction
- π’ 30x:cherries: Variable Sized Arrays
- Strings
- π’ 10x:cherries: StringStream
- π’ 10x:cherries: Strings
- π§ π’ 10x:cherries: Attribute Parser π§
- Classes β
- π’ 10x:cherries: Structs
- π’ 10x:cherries: Class
- π’ 20x:cherries: Classes and Objects
- π’ 30x:cherries: Box It!
- π 30x:cherries: Inherited Code
- π 30x:cherries: Exceptional Server
- π 40x:cherries: Virtual Functions
- π΄ 60x:cherries: Abstract Classes - Polymorphism
- STL β
- π’ 10x:cherries: Vector-Sort
- π’ 10x:cherries: Vector-Erase
- π’ 15x:cherries: Lower Bound-STL
- π’ 15x:cherries: Sets-STL
- π’ 15x:cherries: Maps-STL
- π’ 20x:cherries: Print Pretty
- π 50x:cherries: Deque-STL optimum sliding window algorithm
- Inheritance β
- π’ 20x:cherries: Inheritance Introduction
- π’ 25x:cherries: Rectangle Area
- π’ 25x:cherries: Multi Level Inheritance
- π 30x:cherries: Accessing Inherited Functions
- π΄ 40x:cherries: Magic Spells Longest Common Subsequence algorithm (dynamic_cast in original problem)
- Debugging β
- π 15x:cherries: Hotel Prices
- π 20x:cherries: Cpp exception handling
- π 20x:cherries: Overloading Ostream Operator
- π 40x:cherries: Messages Order
- Other Concepts β
- π’ 20x:cherries: C++ Class Templates
- π’ 25x:cherries: Preprocessor Solution
- π 25x:cherries: Operator Overloading
- π’ 30x:cherries: Overload Operators
- π 35x:cherries: Attending Workshops
- π 35x:cherries: C++ Class Template Specialization
- π΄ 80x:cherries: C++ Variadics Variadics and range based loop
- π΄ 80x:cherries: Bit Array poorly described cycle detection...
- Introduction β
- π’ 5x:cherries: "Hello World!" in C
- π’ 5x:cherries: Playing With Characters
- π’ 5x:cherries: Sum and Difference of Two Numbers
- π’ 10x:cherries: Functions in C
- π’ 10x:cherries: Pointers in C
- Conditionals and Loops
- π’ 10x:cherries: Conditional Statements in C
- π’ 10x:cherries: For Loop in C
- π’ 15x:cherries: Sum of Digits of a Five Digit Number
- π’ 15x:cherries: Bitwise Operators
- Arrays and Strings β
- π 10x:cherries: 1D Arrays in C
- π 20x:cherries: Array Reversal
- π 20x:cherries: Printing Tokens
- π 25x:cherries: Digit Frequency
- π 40x:cherries: Dynamic Array in C
- Functions
- π’ 15x:cherries: Calculate the Nth term
- π’ 20x:cherries: Students Marks Sum
- π 50x:cherries: Variadic functions in C
- Structs and Enums
- π’ 25x:cherries: Boxes through a Tunnel
- π 30x:cherries: Small Triangles, Large Triangles
- Bash
- π’ 1x:cherries: Let's Echo
- π’ 1x:cherries: Looping and Skipping
- π’ 1x:cherries: A Personalized Echo
- π’ 1x:cherries: Looping with Numbers for loop with range
- π’ 1x:cherries: The World of Numbers arithmetic expansion
- π’ 1x:cherries: Comparing Numbers if elseif else
- π’ 1x:cherries: Getting started with conditionals
- π’ 1x:cherries: More on Conditionals
- π’ 1x:cherries: Arithmetic Operations printf and bc -l
- π’ 1x:cherries: Compute the Average for loop like C++