Algorithm Notes

Monday, August 21, 2017

561. Array Partition I

Posted by Sunil Patil at 5:36 PM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: array, leetcode

Monday, August 14, 2017

Partitioning and sorting array with many repeated entries

Posted by Sunil Patil at 8:58 AM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: eip, sort

Compute the integer square root

Posted by Sunil Patil at 8:40 AM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: eip, searching

Sunday, August 13, 2017

Compute the Levenshtein distance

Posted by Sunil Patil at 5:38 PM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: dynamicprogramming, eip

Find the longest nondecreasing subsequence

Posted by Sunil Patil at 5:24 PM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: dynamicprogramming, eip

Leetcode 80 Remove Duplicates from Sorted Array I

Posted by Sunil Patil at 4:49 PM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: array, eip

Dutch National Flag Problem/Can reach end

Posted by Sunil Patil at 4:41 PM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: array, eip
Older Posts Home
Subscribe to: Posts (Atom)

Blog Archive

  • ▼  2017 (206)
    • ▼  August (66)
      • 561. Array Partition I
      • Partitioning and sorting array with many repeated ...
      • Compute the integer square root
      • Compute the Levenshtein distance
      • Find the longest nondecreasing subsequence
      • Leetcode 80 Remove Duplicates from Sorted Array I
      • Dutch National Flag Problem/Can reach end
      • The knapsack problem
      • Compute the binomial coefficient
      • Search for a sequence in 2D array
      • Count the number of moves to climb stair
      • Minimum cost to travel from one station to another
      • Compute the right sibling tree
      • Write a program that computes exterior of binary tree
      • Calculate binary tree from preorder and inorder tr...
      • Reconstruct a binary tree from preorder traversal ...
      • Implement an inorder traversal with o(1) space
      • Compute the kth node in an inorder traversal
      • Compute the successor
      • Implement locking in a binary tree
      • Sum the root-to-leaf paths in a binary tree
      • Find the longest subarray with distinct entries
      • Find the smallest subarray sequentially covering a...
      • Find the smallest subarray covering all values
      • Count the number of score combinations
      • Calculate fibonacci sequence number for given numb...
      • Rectangle intersection
      • Check if a decimal integer is a palindrome
      • Reverse digits
      • Find a closest integer with the same weight
      • Reverse Bits
      • Swap Bits
      • Computer parity of words
      • Generate a program which returns all distinct bina...
      • Given a collection of candidate numbers (C) and a ...
      • Given a set of candidate numbers (C) (without dupl...
      • Generate all subsets of size k
      • Implement a sudoku solver
      • Compute the diameter of a tree
      • Generate palindrom deompositions
      • Compute rows in Pascal's Triangle
      • Create list of leaf nodes in left to right order
      • Find a root to leaf path with specified sum
      • Compute the lowest common ancestor in a binary tree
      • Compute the LCA when nodes have parent pointers
      • Leet Code 75 Sort Color
      • Generate all nonattacking placements of queens
      • The tower of hanoi problem
      • Generate strings of matched parerns
      • Leetcode 259: Three sum smaller
      • Leetcode 167: Two Sum
      • LeetCode 15: Three Sum
      • LeetCode 229 Majority Elements 2
      • The gasup problem
      • The 3-Sum problem
      • The interval covering problem
      • Schedule for minimizing waiting time
      • Compute an optimum assignment of tasks
      • Imlement list pivoting
      • Test whether a singly linked list is palindromic
      • Implement even-odd merge
      • Implement cyclic right shift for singllly linked list
      • Reverse Linked List
      • Search for a pair-sum in an abs-sorted array
      • Trapping Water
      • Rotate a 2D array
    • ►  July (140)
  • ►  2014 (3)
    • ►  March (1)
    • ►  February (2)
  • ►  2013 (1)
    • ►  October (1)
  • ►  2012 (5)
    • ►  June (5)
Simple theme. Powered by Blogger.