Just Read Question And Try YourSelf In Any Language.
!! Have FUN !!
I will post Solution Of Problem Quetion which i will Encounter.
You Can Send Me Quetions I willbe Interested In Solving That

Number is said tobe Automorphic number if and only if its sqaure ends in the same digits as the number itself.

76 is Automorphic as in 76*76=5776, 76=76(last two digit of square of number)

45 is not Automorphic as in 45*45=2025, 45!=25

It takes sides of triangle as input and finds the type of Triangle

like

if Three sides are equal

if two sides are equal

if all three sides are different

if one of three angles equals 90

Program to Find a point whether it is inside the area of Triangle or outside.

The Coordinates of Random Point P(x,y) & Points of Triangle is Taken as Input like Point A(x1,y1), B(x2,y2), C(x3,y3) if point found inside the Area output "Inside" otherwise "Outside"

BFS is an Algorithm that Searches through graphs, Queue DataStructure is used.

In BFS user can decide the starting point to begin the search and also can decide the end point but for simplicity,here first node is selected as starting point and last node is selected as end point.

adjacency matrix of order nxn (n is total number of node) is used to store the info of edges

'1' if there is edge, '0' if no edges(default)

Function is Similar to BFS to search through graphs, Stack DataStructure is used.

The DFS algorithm is a recursive algorithm that uses the idea of backtracking. It involves exhaustive searches of all the unvisited nodes by going ahead in depth in one path, if no unvisited node avalaible then it start backtracking means move backwards on the same path to find adjacent unvisited nodes if unvisited node found then that path will be selected for the search ..... till all nodes are visited it will repeat searching & backtracking.