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:
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:
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:
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:
Approach:
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:
Read moreFind the Loop in a Linked list, find its length and Break the Loop
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)
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:
Read morePrint All Paths from Top left to bottom right in Two Dimensional Array
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:
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:
Read morePrint All Elements of Two Dimensional Array in Spiral
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:
Example:
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:
Example: { { } { } } – Well formed
{ { } { = Not well formed
Objective : Write an algorithm to find an Element in 2 dimensional array where rows and columns are sorted respectively.
Input: A two dimensional sorted array, arrA[][].
Output : True or false based on whether element exists and its location
Approach:
Objective : Write Merge Sort algorithm to sort elements in an array
Input: A unsorted array, arrA[].
Output : A sorted array.
Approach:
Divide and Conquer: In this approach we divide the main problems into smaller problems, solve them and merge the results to get the final result.
How Divide and conquer works in Merge Sort:
We divide the elements into two half’s by middle of the array. We solve the left half and right half recursively and merge the results.
Merging:
Read moreMerge Sort – Updated – Most Efficient ways to Implement