Creative Problems

It is a compilation of all the real world significant problems expressed in a language and solved by computer.

Text Buffer

A text editor uses a data structure called text buffer to load the data of a file in the text editor in editable mode. A user can move the cursor inside the text in left or right direction and can add or delete data at the cursor position, anywhere in the text. Devise an efficient implementation of Text Buffer, which can be used inside a text editor for same purpose. An efficient implementation guarantees that text editor software will not freeze/ hang up while loading and editing the large text files in MBs. #Buffer

Redo/Undo Operation

Many software in our PC provides an option to undo the most recently performed operation and redo the undone operation. Devise a data structure that abstracts this feature by providing simplified API by assuming the necessary details about the operations being performed. #Checkpoint

Humping Duming Game

Implement an algorithm for a swapping game - 'Humping Dumping'. This game contains an unsorted list of integers; and swaps the entries of the list, such that value of a[n] will be a[a[n]]. #HumpingDumping

Identicals

Implement an algorithm to print the identical integers found in two given sorted arrays of integers. The expectation is to perform this task at T(N) ~ N for worst case. #Identicals

Fix the Infix

InfixExpression is an application of stack. An input is given as an infix expression with left parenthesis removed. Implement an algorithm that accepts this input and produce a well parenthesized infix expression as output to the user. #InfixExpression

Josephus Problem

Josephus problem is a theoretical computer science problem or a counting-out game in which N number of people are waiting in a circle to be executed. The executor will pick every Mth person and executes him. The only one left in the end will survive. #Josephus