There's an interesting problem I recently solved on leetcode based on dynamic programming. My Github repository contains list of all problems that I have solved.
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array.1..
I recently came across a simple telephonic interview problem. The problem was to sort an array recursively. But even numbers need to be placed before odd numbers. At first glance it was obvious that it was a simple case of implementation of merge sort.
Given an input array, produce the following output array…..
Merge two sorted linked lists and return it as a new list.1. The new list should be made by splicing together the nodes of the first two lists.
It’s an easy problem in Leetcode for practicing linked list. It’s similar to the merge step of the Merge sort. ..
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.1..
Imagine a sunset, with a tired sun sinking over a meadow. The chirping of birds steals your attention as they return to their homes. And while the sun disappears, you sink back and relish your sourrounding.
Well the sunset is beautiful because it’s obvious to your eyes. Similarly programming is beautiful for those who enjoy it. Below is the poem which which eulogises lisp programming language, but it may be bland for those who have no experience with lisp...