Intermediate | Algorithms

Add two numbers represented by a linked list, Numbers are Stored in REVERSE order

May 21, 2020September 16, 2014 by Sumit Jain

Objective: Two numbers represented by a linked list where each node contains single digit. The digits are stored in REVERSE order, means head is pointing to the first digit of the number.

Input: Two numbers represented by Linked Lists

Output: Addition of two numbers represented by a Linked List.

Example:

First Number in REVERSE order: 5957
Second Number in REVERSE order : 59
Addition in REVERSE order : 0967
Actual Result in FORWARD ORDER : 9670

Approach:

Reverse the binary representation of a number.

May 21, 2020September 16, 2014 by Sumit Jain

Objective: Write a program to Reverse the binary representation of a number

Example:

Input : 30
Output : 15

Explanation:

binary representation of 30 is : 11110
reverse of binary representation : 01111
decimal of reversed binary representation is : 15

Input: A Number

Output: Decimal of reversed binary representation of a number.

Approach:

Swap Every Kth Node in a LinkedList

May 21, 2020September 14, 2014 by Sumit Jain

Objective: Given a linked list, swap every kth node in that. If at the end of the list remaining nodes are less than k, leave them untouched.

Input: A linked list, A number k.

Example:

Input : ->1->2->3->4->5->6->7->8->9->10 , K = 4
Output: ->4->2->3->1->8->6->7->5->9->10

Approach:

Replace all spaces in a String with ‘%20’

August 14, 2020September 8, 2014 by Sumit Jain

Objective: Write an algorithm to replace all spaces in a given string with ‘%20’. You can consider that string has enough space at the end of the string to hold the extra characters.

Input: A String and true length of a string

Output: Updated string in which each space is replaced by the ‘%20’

Example: 

Input String : I am Sumit Jain    

Output String : I%20am%20Sumit%20Jain

Approach:

Find Intersection Point in Two Linked List

August 14, 2020September 6, 2014 by Sumit Jain

Objective: Given Two linked list, check whether both list intersect each other, if yes then find the starting node of the intersection.

Intersection point means end of one linked list is linked with some node in another linked list and it forms a Y shape.

Input: Two Linked List

Output: Intersection Node or point

Example:

Find Intersection Point in Two Linked List

Approach:

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

May 21, 2020September 5, 2014 by Sumit Jain

Objective: In a given linked list, check whether it contains 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 not point to the null, instead it points to some node in the list.

Input: A Linked List

Output: Linked list contains loop or not, if yes its length and linked list after breaking the loop.

Example: 

Input : ->10->20->30->40->50->60->30->40->50->60->30->40->50->60->30

here you can see that 30->40->50->60 are repeating ,that means it has a loop

Approach:

Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths

August 14, 2020August 25, 2014 by Sumit Jain

Objective: Count all the paths from left top corner to right bottom corner in two dimensional array.

Input: Two Dimensional array

Output: No of paths.

Approach :

1. Recursive

Recursive solution to this problem is similar to Print All Paths from Top left to bottom right in Two Dimensional Array

But the Time complexity will be exponential because there will be many sub problems which will be solved again and again to get the final solution. read this : “Dynamic programming vs Recursion

2. Dynamic Programming (Better Solution)

Print All Paths from Top left to bottom right in Two Dimensional Array

May 21, 2020August 13, 2014 by Sumit Jain

Objective: Print all the paths from left top corner to right bottom corner in two dimensional array.

Input: Two Dimensional array

Output: Print all the paths.

Note: At the End of the article you will know what needs to be included if you want to print the diagonal paths as well.

Example:

Approach:

Merge or Combine Two Sorted Linked Lists

August 14, 2020August 12, 2014 by Sumit Jain

Objective: Given two sorted linked lists, objective is to merge both the lists in sorted order.

Input: Two sorted linked list List a, List b.

Example: 

List a : ->2->6->18

Listb: ->1->3->17->19

Merged List: ->1->2->3->6->17->18->19

Approach:

Print All Elements of Two Dimensional Array in Spiral

May 21, 2020August 4, 2014 by Sumit Jain

Objective: This question was asked in Amazon interview for the Software development Engineer position, Write an algorithm to print all the elements of two dimensional array in spiral.
Example :

Input: Two dimensional array

Output: All array elements printed in spiral.

Approach:

Quick Sort Implementation

August 14, 2020August 3, 2014 by Sumit Jain

Objective: Write an algorithm to sort an array in increasing or decreasing order using Quick Sort.

Input: An Array arrA[]

Output: A sorted array.

Approach:

Choose any element from the array and call it as pivot element, Example here we have selected middle element as pivot
Place all the elements smaller than pivot in the left side of pivot.
Place all the elements greater than pivot in the right side of pivot.
Sort left side and right side recursively.

Example:

Valid or Well Formed Parentheses | Part – 1

August 14, 2020July 23, 2014 by Sumit Jain

Objective: You have been asked to Write an algorithm to find Whether Given the Sequence of parentheses are well formed. This question was asked in the Amazon Interview.

Input: A String contains a sequence of parentheses

Output: true or false on whether parentheses are well formed or not

Approach:

Idea is to have two counters, one for open parentheses ‘{‘ and one for close ‘}’
Read one character at a time and increment one of the counters
If any given point of time count of close parentheses is greater than the open one, return false
If at the end both counters are equal, return true

Example: { { } { } } – Well formed

{ { } { = Not well formed