niraj002 Goto Github PK

javaswing-simpleapplicationdesktoptemplate

:computer: Basic Template for Desktop Application Window with Java Swing

maximum-subarray-leetcode-53

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

merge-intervals-leetcode-56

Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]

minimum-path-sum-leetcode-problem-64

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time. Example 1: [[1,3,1], [1,5,1], [4,2,1]] Given the above grid map, return 7. Because the path 1→3→1→1→1 minimizes the sum.

partition-of-an-array-around-a-given-number

Given an array and a range [lowVal, highVal], the array is partitioned around the range such that array is divided in three parts. 1) All elements smaller than lowVal come first. 2) All elements in range lowVal to highVVal come next. 3) All elements greater than highVVal appear in the end. The individual elements of three sets can appear in any order.

passing-data-between-screens-use-navigator-in-react-native

Passing data between screens use Navigator in React Native

react-nativegraphql-auth-client

remove-duplicates-from-a-sorted-array-ii-leetcode-problem-80

What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,2,3], Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

sort-colors-leetcode-problem-75

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively. Note: You are not suppose to use the library's sort function for this problem.

ts-project-template

Template project for TypeScript applications

unique-paths-leetcode-problem-62

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below). How many possible unique paths are there?