- Fork this repo
- Star this repo
- Go to your respective folder (Language) or click the link in Table
- Create a file with the language title
- Submit your solution with respective extension
- Please mark Done or ✅ in the README.md Table
- Make your successful pull request
./codes/
| codes | other language | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Sum & Avg array | ✅ | |||||||||
| Min & Max array | ✅ | Done | ||||||||
| Linear Search | ✅ |
Done | ✅ | |||||||
| Reverse array | ✅ |
Done | ✅ |
|||||||
| Frequency array | ✅ | |||||||||
| Insert array | ✅ | |||||||||
| Marge array | ||||||||||
| Remove element array | ||||||||||
| Print prime | Done | |||||||||
| Sum prime array | ||||||||||
| Read & Display string | ✅ |
|||||||||
| Count char in string | ✅ |
Done | ||||||||
| Merge strings | ✅ | |||||||||
| Password check | ||||||||||
| Reverse string | ✅ |
Done | ✅ |
|||||||
| Anagram check | Done | |||||||||
| Deleting elements | ||||||||||
| Sort string | ||||||||||
| Read & Display structures | ||||||||||
| Sum, Avg structure | ||||||||||
| Palindrome check | ✅ |
✅ |
Done | |||||||
| String Compare | ||||||||||
| Read & Display files | ||||||||||
| Search in file | ||||||||||
| Compare files | ||||||||||
| Copy files | ✅ | |||||||||
| Count char in file | ||||||||||
| File overwrite | ||||||||||
| Operations linked list | ||||||||||
| insert at beg, end | ||||||||||
| Delete at beg, end | ||||||||||
| Insert & Delete at pos | ||||||||||
| Search & count | ||||||||||
| Doubly linked List | ||||||||||
| Basic Operations Stacks | ||||||||||
| Denomination | ||||||||||
| Palindrome stack integer | ||||||||||
| Palindrome stack string | ||||||||||
| Infix to postfix | ✅ |
|||||||||
| Evaluate Postfix Expression | Done |
|||||||||
| Sorting queues | ||||||||||
| Search, Count queues | ||||||||||
| Inserting Queues | ||||||||||
| Deleting queues | ||||||||||
| Left View Binary Tree | ||||||||||
| Top View Binary Tree | ||||||||||
| Right View Binary Tree | ||||||||||
| Bottom View Binary Tree |



