Algorithms – Page 8 – Ritambhara Technologies

Print a circular linked list

Write a function that prints all the elements of a circular linked list. (or traverse a circular linked list)

Binary Heap

Binary heap is used to implement Priority queue. It is an array object, visualized as an almost complete binary tree. Binary heap comes in two flavours Max-Heap Min-Heap A […]

Almost complete Binary Tree

A complete Binary tree of height h has 2h-1 nodes. Out of these 2h-1 are leaf nodes and rest (2h-1-1 are non-leaf. Read more about complete binary trees here […]

Minimum edit distance of two strings

Given two strings of size m and n respectively, find the minimum number of operations required to transform one string into another. The following thee […]

Check if array can be divided in two parts with equal sum

Given an array of integers, write a function that returns true if it can be divided in two parts having equal sum. For example: If […]

Print permutations of string replaced with digits

Given a string, print the variation of string as shown below Input String: ‘hat’ Replace one character with numeric one(‘1’): ‘1at‘, ‘h1t‘, ‘ha1‘ Replace two characters with […]

Helper Function: Return the terminating number in a string

Given a string that is terminating with digits (eg. ‘Kamal1234’). Write a function which accept this string and return the integer at the end. Input […]

Helper Function: Convert String to Number

Given a String. Write a function that convert it to number. Such functions are used in larger programs as helper functions. Input: char* str = […]

Helper Function: Check if character is a digit or not

Write a Simple function that accepts a character and return true if it is a digit else return false:

Helper Function: Reverse a Number

Sometimes we need helper functions in our code. One such helper function needed is to reverse a number. i.e a function which returns me ‘321’ if […]