Code With Sri

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

Array of 3 Pointers 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...

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

Finding the sum of N Biggest elements in Binary Search Tree 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...

Finding the Number of Trailing Zero's in Factorial of a Number 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...

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

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...

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 :)

jQuery Tutorials For Beginners