Skip to content
/ Problems-Solving Public

My implementation of useful data structures, algorithms, as well as my solutions to programming puzzles.

4 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

hienmv/Problems-Solving

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

140 Commits
C++
C++
 
 
C
C
 
 
Java
Java
 
 
Python
Python
 
 
Tools
Tools
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 

Repository files navigation

Problems-Solving

My implementation of useful data structures, algorithms, as well as my solutions to programming puzzles.

Number of problems : 376
- acm.timus.ru : 1
- codechef.com : 2
- codeforces.com : 115
- codingcompetitions.withgoogle.com : 1
- developers.google.com : 1
- hackerearth.com : 18
- hackerrank.com : 10
- icpcarchive.ecs.baylor.edu : 3
- interviewbit.com : 18
- leetcode.com : 130
- lightoj.com : 8
- oeis.org : 1
- onlinejudge.org : 4
- spoj.com : 28
- urionlinejudge.com.br : 2
- uva.onlinejudge.org : 34
pie
	title Category by sources
	"acm.timus.ru" : 1
	"codechef.com" : 2
	"codeforces.com" : 115
	"codingcompetitions.withgoogle.com" : 1
	"developers.google.com" : 1
	"hackerearth.com" : 18
	"hackerrank.com" : 10
	"icpcarchive.ecs.baylor.edu" : 3
	"interviewbit.com" : 18
	"leetcode.com" : 130
	"lightoj.com" : 8
	"oeis.org" : 1
	"onlinejudge.org" : 4
	"spoj.com" : 28
	"urionlinejudge.com.br" : 2
	"uva.onlinejudge.org" : 34
Loading

#01knapsack (3)

#ad-hoc-1 (3)

#array (39)

  • CheckIfItIsAStraightLine (java)
  • CombinationSumII (java)
  • ConstructBinaryTreeFromInorderAndPostorderTraversal (java)
  • ConstructBinaryTreeFromPreorderAndInorderTraversal (java)
  • CountSquareSubmatricesWithAllOnes (java)
  • CountingElements (java)
  • FindDuplicateInArray (java)
  • FindtheDuplicateNumber (cpp)
  • FirstMissingInteger (java)
  • FirstMissingPositive (java)
  • GetMaximumInGeneratedArray (java)
  • HeightChecker (java)
  • InsertDeleteGetRandomO1 (java)
  • JumpGame (java)
  • LeftmostColumnWithAtLeastAOne (java)
  • MajorityElement (java)
  • MaximalRectangle (java)
  • MaximumAbsoluteDifference (java)
  • MaximumLengthOfRepeatedSubarray (java)
  • MaximumSubarray (java)
  • MaximumSumCircularSubarray (java)
  • MedianOfTwoSortedArrays (java)
  • MinStepsInInfiniteGrid (java)
  • MinimumPathSum (java)
  • NextPermutation (java)
  • NumberOfSubmatricesThatSumToTarget (java)
  • Pascal'sTriangleII (py)
  • PerformStringShifts (java)
  • ProductOfArrayExceptSelf (java)
  • RemoveDuplicatesFromSortedArray (cpp)
  • RemoveDuplicatesFromSortedArrayII (java)
  • RotateImage (java)
  • SearchInRotatedSortedArray (java)
  • SearchInsertPosition (java)
  • SortColors (java)
  • SubarraySumEqualsK (java)
  • SubsetsII (java)
  • TwoSum (cpp)
  • UniquePaths (java)

#backtracking (12)

#bellman-ford (7)

#bfs (24)

#binary-search (49)

#binary-search-tree (5)

#bit-manipulation (23)

#brute-force (6)

#constructive-algorithms (3)

#deque (2)

#dfs (32)

#dijkstra (13)

#divide-and-conquer (15)

#dsu (17)

#dynamic-programming (65)

#floyd-warshall (4)

#geometry (3)

#graph (7)

#greedy (45)

#hash-table (29)

#heap (12)

#implementation (44)

#kmp (6)

#knapsack (2)

#lcs (10)

#linked-list (7)

#lis (6)

#map (6)

  • FindTwoNumbersWithPredictedSum (cpp)
  • HandOfStraights (py)
  • MonkAndFriends (java)
  • NMaxPairCombinations (java)
  • RemoveDuplicatesFromSortedArray (cpp)
  • Towers (java)

#math (28)

#mst (4)

#number-theory (13)

#optimized (1)

#pointer (1)

#prim (8)

#priority-queue (9)

#queue (11)

#recursion (3)

#refactor (4)

#segment-tree (7)

#shortest-path (24)

#simple-way (2)

#slicing-window (1)

#sorting (30)

#special-problem (2)

#stack (18)

#string (19)

#todo (22)

#topological-sort (8)

#tree (29)

  • BinaryTreeInorderTraversal (java)
  • BinaryTreeMaximumPathSum (java)
  • BinaryTreeZigzagLevelOrderTraversal (java)
  • Bipartiteness (java)
  • CheckIfAStringIsAValidSequenceFromRootToLeavesPathInABT (java)
  • ConstructBinarySearchTreeFromPreorderTraversal (java)
  • ConstructBinaryTreeFromInorderAndPostorderTraversal (java)
  • ConstructBinaryTreeFromInorderAndPreorder (java)
  • ConstructBinaryTreeFromPreorderAndInorderTraversal (java)
  • CousinsInBinaryTree (java)
  • DiameterOfBinaryTree (java)
  • FlattenBinaryTreeToLinkedList (java)
  • IdenticalBinaryTrees (java)
  • InorderTraversal (java)
  • InvertBinaryTree (java)
  • InvertTheBinaryTree (java)
  • KthSmallestElementInABST (java)
  • KthSmallestElementInTree (java)
  • LeastCommonAncestor (java)
  • LowestCommonAncestorOfABinaryTree (java)
  • MaxDepthOfBinaryTree (java)
  • OldBerlandLanguage (java)
  • PathToGivenNode (java)
  • PostorderTraversal (java)
  • PreorderTraversal (java)
  • SearchInABinarySearchTree (java)
  • SymmetricTree (java)
  • ValidBSTFromPreorder (java)
  • ValidateBinarySearchTree (java)

#trie (8)

#two-pointer (34)

About

My implementation of useful data structures, algorithms, as well as my solutions to programming puzzles.

Topics

algorithms trie backtracking bit-manipulation greedy dfs binary-search-tree dijkstra big-o dynamic-programming bfs topological-sort floyd-warshall prim-algorithm divide-and-conquer bellman-ford two-pointers dsu problems-solving

Resources

Readme
Activity

Stars

4 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages