# Tagged: Intermediate

## Replace all spaces in a String with ‘%20′

Objec­tive: Write an algo­rithm to replace all spaces in a given string with ‘%20′. You can con­sider that string has enough space at the end of the string to hold the extra char­ac­ters. Input:…

## Find Intersection Point in Two Linked List

Objec­tive: Given Two linked list, check whether both list inter­sect each other, if yes then find the start­ing node of the inter­sec­tion. Inter­sec­tion point means end of one linked list is linked with some…

## Find the Loop in a Linked list, find its length and Break the Loop

Objec­tive: In a given linked list, check whether it con­tains the loop in it, if yes then find the Loop length and break the loop. Loop in a linked list means the last node does…

## Find Whether Given Sequence of parentheses are well formed.

Objec­tive: You have been asked to Write an algo­rithm to find Whether Given the Sequence of paren­the­ses are well formed. This ques­tion was asked in the Ama­zon Inter­view. Input: A String con­tains a sequence…

## Find an Element in 2 dimensional sorted array

Objec­tive : Write an algo­rithm to find an Ele­ment in 2 dimen­sional array where rows and columns are sorted respec­tively. Input: A two dimen­sional sorted array, arrA[][].   Out­put : True or false based…

## Merge Sort — Updated — Most Efficient ways to Implement

Objec­tive : Write Merge Sort algo­rithm to sort ele­ments in an array Input: A unsorted array, arrA[]. Out­put : A sorted array. Approach: Divide and Con­quer: In this approach we divide the main prob­lems into…