Code With Sri

19/06/2017

In today's post, we will be seeing on how to convert a given string to another with the minimum number of insertions, deletions or updations. I'm considering the fact that converting string A to string B will take the same number of operations as converting string B to string A, only the nature of the operation is different (insertion instead of deletion).

http://www.codewithsri.com/2017/06/minimum-number-of-insertion-deletion-to-convert-one-string-to-another.html

In today's post, we will be seeing on how to convert a given string to another with the minimum number of insertions, deletions or updation...

03/04/2017

In today's problem we are given 3 sorted arrays. Let A, B, C be the 3 arrays. We need to find a value such that max(abs(A[i] - B[j]), abs(B[j] - C[k]), abs(C[k] - A[i])) is minimum.

http://www.codewithsri.com/2017/04/array-of-3-pointers.html

In today's problem we are given 3 sorted arrays. Let A, B, C be the 3 arrays. We need to find a value such that max(abs(A[i] - B[j]), abs(B...

01/04/2017

Trees look kind of complicated when you get started with them. But they are really fun when you are a master of recursion concepts. In today's problem we are given a binary search tree and a number N. We have to find the sum of the N biggest elements in the BST, given N

Trees look kind of complicated when you get started with them. But they are really fun when you are a master of recursion concepts. In toda...

28/03/2017

We are given a character matrix and we need to find the list of all the palindromic strings in that matrix starting from the top left corner to the bottom right corner i.e the first character of all the strings must be the top left character in the matrix and the last character must be the bottom right character. Find the solution here.

http://www.codewithsri.com/2017/03/printing-all-palindromic-strings-in-a-matrix.html

We are given a character matrix and we need to find the list of all the palindromic strings in that matrix starting from the top left corne...

27/03/2017

In this post we would discuss of finding the number of minimum hops required to reach the end of an array where the array elements represent the length of the hop possible from that particular element.

Each element of an array indicates the length of the hop from that particular index. For example : if A[i] is 3 then you can jump to A[i+1]...

07/01/2017

Factorial of a number is one of the most basic sums that you'll be doing whenever you learn a programming language. Finding the number of t...

28/12/2016

Ever came across this problem ? Well here is your solution. A dynamic approach to finding the longest palindrome in a string.

Hey ! Finding the longest palindrome in a string is one of the most commonly asked interview questions if you're aspiring to be a software...

05/02/2016

Write a simple program using C++ that will let you check the validity of your Credit Card ! It is done using the Luhn's Algorithm :)

I'm Srivathsan from India and I am basically a programmer and a web developer. This is my half-personal blog and I'll be sharing small and interesting code snippets here. Stay Tuned. :)

11/01/2016

Are you into Web Design ? Then this is something that you should definitely take a look at. The CSS Flexbox is one of the most powerful feature that will allow you to create responsive layouts very easily without worrying about floats or ordering or even the width percentages. So make sure you take a look at it. :)

In this video we will deal with what is flexbox and how to get started using flexbox.

09/01/2016

Every heard of ? Well it is one of the coolest Web Design languages out there. Have you ever seen those fade out and fade in effects in Web Pages ? Well those are done mostly using jQuery ! So wanna do some animated web pages with ease ? Go check out jQuery :)

28/12/2015

Ever wondered how to implement a stack like data structure using a queue ? This is one of the most asked interview question by those IT companies. Here is how you do it.

Ever wondered how to implement a stack like data structure using a queue ? This is one of the most asked interview question. Here is how to do so.