Create a program to calculate GPA from grades of a student on the scale of 10.

Sample Input: "AAA+BCADE"
Sample Output: 7.87

Here: A+ represents 10, A represents 9, B represents 8 and son on till E representing 5.

Give Implementation for the following STLs:--

1. Sequence Containers: implement data structures which can be accessed in a sequential manner.

• vector
• list
• deque
• arrays
• forward_list( Introduced in C++11)

2. Container Adaptors : provide a different interface for sequential containers.

• queue
• priority_queue
• stack

3. Associative Containers : implement sorted data structures that can be quickly searched (O(log n) complexity).

• set
• multiset
• map
• multimap

4. Unordered Associative Containers : implement unordered data structures that can be quickly searched

• unordered_set (Introduced in C++11)
• unordered_multiset (Introduced in C++11)
• unordered_map (Introduced in C++11)
• unordered_multimap (Introduced in C++11)

1. Implement Queue using Stacks
2. LRU Cache Implementation
3. Implement Stack using Queues
4. Queue (Linked List Implementation)
5. How to efficiently implement k Queues in a single array?
6. Implement a stack using single queue
7. Implementation of Deque using circular array
8. Circular Queue (Circular Linked List Implementation)
9. Implement Stack and Queue using Deque
10. Priority Queue using Linked List
11. Priority Queue using doubly linked list
12. Implementation of Deque using doubly linked list

Stack operations may involve initializing the stack, using it and then de-initializing it. Apart from these basic stuffs, a stack is used for the following two primary operations −

push() − Pushing (storing) an element on the stack.

pop() − Removing (accessing) an element from the stack.

When data is PUSHed onto stack.

To use a stack efficiently, we need to check the status of stack as well. For the same purpose, the following functionality is added to stacks −

peek() − get the top data element of the stack, without removing it.

isFull() − check if stack is full.

isEmpty() − check if stack is empty.

Implement programs for following functions.

Before making a PR do take the review for the implementation you will be going to make a PR for.

1. Longest Common Subsequence
2. Longest Increasing Subsequence
3. Edit Distance
4. Minimum Partition
5. Ways to Cover a Distance
6. Longest Path In Matrix
7. Subset Sum Problem
8. Optimal Strategy for a Game
9. 0-1 Knapsack Problem
10. Boolean Parenthesization Problem
11. Shortest Common Supersequence
12. Matrix Chain Multiplication
13. Partition problem
14. Rod Cutting
15. Coin change problem
16. Word Break Problem
17. Maximal Product when Cutting Rope
18. Dice Throw Problem
19. Box Stacking
20. Egg Dropping Puzzle

• Selection Sort,
• Bubble Sort,
• Recursive Bubble Sort,
• Insertion Sort,
• Recursive Insertion Sort,
• Merge Sort,
• Iterative Merge Sort,
• Quick Sort,
• Iterative Quick Sort,
• Heap Sort,
• Counting Sort,
• Radix Sort,
• Bucket Sort,
• ShellSort,
• TimSort,
• Comb Sort,
• Pigeonhole Sort,
• Cycle Sort,
• Cocktail Sort,
• Strand Sort,
• Bitonic Sort,
• Pancake sorting,
• Binary Insertion Sort,
• BogoSort or Permutation Sort,
• Gnome Sort,
• Sleep Sort – The King of Laziness / Sorting while Sleeping,
• Structure Sorting (By Multiple Rules) in C++,
• Stooge Sort,
• Tag Sort (To get both sorted and original),
• Tree Sort,
• Cartesian Tree Sorting,
• Odd-Even Sort / Brick Sort,
• QuickSort on Singly Linked List,
• QuickSort on Doubly Linked List,
• 3-Way QuickSort (Dutch National Flag),
• Merge Sort for Linked Lists,
• Merge Sort for Doubly Linked List,
• 3-way Merge Sort

Create a folder for graph algorithms and add algorithms like

• bfs
• dfs
• dijkstra's algorithm
• kruskal's minimum spanning tree

Write a program to convert GPA from 10 scale to scale of 4, 5, and 3 which can be used for different purposes.

Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
Sublist Search (Search a linked list in another list)
Fibonacci Search
The Ubiquitous Binary Search
Recursive program to linearly search an element in a given array
Recursive function to do substring search
Unbounded Binary Search Example (Find the point where a monotonically increasing function becomes positive first time)

An optimized implementation is preferred.

Implement a function which when given an entry point to a tree, prints its preorder, inorder and postorder traversal.

Write a sample use of the checker function in the main function of your program. Also, specify the data structure used for the tree.

Hint: Use recursion for succinct code. For the really adventurous, try doing the same iteratively (you will need to use a stack).

The only exception if something needs to be there and we have missed it out.

Implement a program to demonstrate Extract min(), Deletion() and Decrease key() operations on a Fibonacci Heap.

1. • Smallest number with sum of digits as N and divisible by 10^N
2. • Minimum sum of squares of character counts in a given string after removing k characters
3. • Maximum and minimum sums from two numbers with digit replacements
4. • Check if a given string is sum-string
5. • Sum of two large numbers
6. • Calculate sum of all numbers present in a string
7. • Extract maximum numeric value from a given string
8. • Calculate maximum value using ‘+’ or ‘*’ sign between two numbers in a string
9. • Maximum segment value after putting k breakpoints in a number
10. • Difference of two large numbers
11. • Check if a large number is divisible by 4 or not
12. • Check if a large number is divisible by 11 or not
13. • Number of substrings divisible by 6 in a string of integers
14. • Decimal representation of given binary string is divisible by 5 or not
15. • Number of substrings divisible by 8 but not by 3
16. • To check divisibility of any large number by 999
17. • Multiply Large Numbers represented as Strings
18. • Divide large number represented as string
19. • Remainder with 7 for large numbers
20. • Given two numbers as strings, find if one is a power of other
21. • Check whether a given number is even or odd
22. • Product of nodes at k-th level in a tree represented as string
23. • Program to find remainder when large number is divided by 11
24. • Ways to remove one element from a binary string so that XOR becomes zero
25. • Find the maximum subarray XOR in a given array
26. • Calculate the difficulty of a sentence
27. • Minimum Index Sum for Common Elements of Two Lists

• GCD and LCM
• Prime Factorization and Divisors
• Fibonacci Numbers
• Catalan Numbers
• Modular Arithmetic
• Euler Totient Function
• nCr Computations
• Set Theory
• Chinese Remainder Theorem
• Factorial
• Prime numbers and Primality Tests
• Sieve Algorithms
• Divisibility and Large Numbers
• Series
• Number Digits
• Triangles
• Algebra
• Number System

Standard Greedy Algorithms

1. Activity Selection Problem
2. Egyptian Fraction
3. Job Sequencing Problem
4. Job Sequencing Problem (Using Disjoint Set)
5. Job Sequencing Problem – Loss Minimization
6. Job Selection Problem – Loss Minimization Strategy | Set 2
7. Huffman Coding
8. Efficient Huffman Coding for sorted input
9. Huffman Decoding
10. Water Connection Problem
11. Policemen catch thieves
12. Minimum Swaps for Bracket Balancing
13. Fitting Shelves Problem
14. Assign Mice to Holes

Implementation of the above is required in any language of your choice as logic only matters.

Here you need to create a kotlin program where User will insert their Age in Int and you need to check whether that person can Vote or not.
Minimum age is 18.

I guess we need separate repo for Devlopment, in this repo we can create according to need.

Like for Web, App etc.

Implement a program that solves the tower of Hanoi puzzle using recursion.

User will give you the number of slabs in income tax layer and amount of tax to be charged (mean to say these values are variable).
Create a program to implement these and also given the same inputs you have to calculate the salary from the tax paid.

You can break this program into parts to solve. But should be under one file.