Minimum number of insertions required to make a String Palindrome.
-
Updated
May 6, 2017 - C++
Minimum number of insertions required to make a String Palindrome.
Contains solutions to simple puzzles useful for beginners to contribute to!
Implementation of the 196-algorithm to find palindromes in a predetermined sequence of instructions.
I'm taking a crack at finding a non-Lychrel number that goes palindromic in more than 261 iterations. See https://en.wikipedia.org/wiki/Lychrel_number .
Permutation, Palindrom, smallest number through a recursive interface
Sample Programs and Practice Codes for Data Structures, Singly-Doubly-LinkedLists-Stack-Queue etc.
This is a palindrome checker program which determines if a word or a sentence reads the same way forwards and backwards. It is implemented using stacks and queues data structure.
C application that counts letters, checks if the word is a palindrome and prints out the reversed order
C++ application telling whether input string is a palindrome or not
A portfolio filled with smaller personal projects made just for fun.
This project solves the certain problems of Data Structures using Stacks and Queues.
Simple c++ codes with suitable example
This Repo contains code for Tokenizer, Removing Epsilon Production, Left Recursion, Parsing through LL(1) Parser through a specified grammer. It also contains RD parser for language of Palindromes and Equal a's abd b's.
Algorithms and Common Problems
Solving a few tasks with palidromes and near-palindromes.
Add a description, image, and links to the palindrome topic page so that developers can more easily learn about it.
To associate your repository with the palindrome topic, visit your repo's landing page and select "manage topics."