Skip to content

interviewcoder/lintcode

Repository files navigation

Build Status

Selected problems that are included in LintCode but are not included in Leetcode (until 08.23.2015).

  • written in Java
  • OJ-accepted solutions (may contain different solutions for one problem)
  • unit tests for solutions
  • not too brief explanation for problem
problem solution tags note
03.01 Insert Node in Binary Search Tree Binary Search Tree
03.02 Search Range In Binary Search Tree Binary Search Tree in-order + pruning
04.01 Longest Increasing Subsequence Dynamic Programming
05.01 Longest Common Substring Dynamic Programming
05.02 Longest Common Subsequence Dynamic Programming
07.01 Topological Sort Topological Sort

About

problems in Lintcode and not in Leetcode (Java)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy