#	Problem Description	Solution
1	Divide two integers without using multiplication, division, and mod operator	divide.c
2	Palindrome number - Given an integer x, return true if x is a palindrome, and false otherwise	palindrome.c
3	Convert Roman letters to integers for I to X (1 to 10)	Convert Roman to Interger.c
4	Display auto-biography numbers in the given range a to b	AutoBiography Number.c
5	Valid parenthesis - Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid	Balanced or Unbalanced.c
6	Remove all occurrences of val in nums in-place	removeElement.c
7	Given a sorted array of distinct integers and a target value, return the index if the target is found	searchInsert.c
8	Given two binary strings a and b, return their sum as a binary string	addBinary.c
9	A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward
10	Return the smallest character in letters that is lexicographically greater than target
11	Given two strings s and t, return true if t is an anagram of s, and false otherwise	isAnagram.c
12	Return the minimum number of moves to make every value in nums unique	miniIncrement.c
13	Replace exactly one character with any lowercase English letter so that the resulting string is not a palindrome and that it is the lexicographically smallest one possible	Notpalindrome.c
14	Return the minimum number of candies you need to have to distribute the candies to the children
15	Sort the set of n numbers using pointers	Sorting.c
16	Print the address of, and value stored in, and the memory size (in bytes) of each of the six variables	pointers-id.c