GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - stevencoding/abc: Online coding puzzle
BranchesTags
Open more actions menu
 
 

Latest commit

 

History

265 Commits
265 Commits

Folders and files

NameName
Last commit message
Last commit date
Regular-Expression-Matching.javapublic-class-Solution-public-boolean-isMatch-String-s-String-p-/-Start-typing-your-Java-solution-below-/-DO-NOT-write-main-function-if-p.length-==0-return-s.length-==0;-int-startS=0-startP=0;-
Regular-Expression-Matching.javapublic-class-Solution-public-boolean-isMatch-String-s-String-p-/-Start-typing-your-Java-solution-below-/-DO-NOT-write-main-function-if-p.length-==0-return-s.length-==0;-int-startS=0-startP=0;-
 
 
3Sum Closest.java
3Sum Closest.java
 
 
3Sum.cpp
3Sum.cpp
 
 
3Sum.java
3Sum.java
 
 
4Sum.java
4Sum.java
 
 
Add Binary.java
Add Binary.java
 
 
Add Two Numbers.java
Add Two Numbers.java
 
 
Add two numbers without using arithmetic operators.cpp
Add two numbers without using arithmetic operators.cpp
 
 
Anagrams.java
Anagrams.java
 
 
Balanced Binary Tree_recursive.java
Balanced Binary Tree_recursive.java
 
 
Best Time to Buy and Sell Stock II.java
Best Time to Buy and Sell Stock II.java
 
 
Best Time to Buy and Sell Stock III.java
Best Time to Buy and Sell Stock III.java
 
 
Best Time to Buy and Sell Stock.java
Best Time to Buy and Sell Stock.java
 
 
Binary Tree Inorder Traversal.java
Binary Tree Inorder Traversal.java
 
 
Binary Tree Level Order Traversal II.java
Binary Tree Level Order Traversal II.java
 
 
Binary Tree Level Order Traversal.java
Binary Tree Level Order Traversal.java
 
 
Binary Tree Maximum Path Sum.java
Binary Tree Maximum Path Sum.java
 
 
Binary Tree Zigzag Level Order Traversal.java
Binary Tree Zigzag Level Order Traversal.java
 
 
Binary Tree to Doubly Linked List.java
Binary Tree to Doubly Linked List.java
 
 
Calculate Logn.java
Calculate Logn.java
 
 
Check all leaves at same level.java
Check all leaves at same level.java
 
 
Check for Children Sum Property in a Binary Tree.java
Check for Children Sum Property in a Binary Tree.java
 
 
Climbing Stairs.java
Climbing Stairs.java
 
 
Combination Sum II.java
Combination Sum II.java
 
 
Combination Sum.java
Combination Sum.java
 
 
Combinations.java
Combinations.java
 
 
Construct Binary Tree from Inorder and Postorder Traversal.java
Construct Binary Tree from Inorder and Postorder Traversal.java
 
 
Construct Binary Tree from Preorder and Inorder Traversal.java
Construct Binary Tree from Preorder and Inorder Traversal.java
 
 
Container With Most Water.java
Container With Most Water.java
 
 
Convert DI String
Convert DI String
 
 
Convert Sorted Array to Binary Search Tree.java
Convert Sorted Array to Binary Search Tree.java
 
 
Convert Sorted List to Binary Search Tree.java
Convert Sorted List to Binary Search Tree.java
 
 
Copy a Linklist.java
Copy a Linklist.java
 
 
Count and Say.java
Count and Say.java
 
 
Count the Number of Block 1.java
Count the Number of Block 1.java
 
 
Decode Ways.java
Decode Ways.java
 
 
Delete nodes which have a greater value on right side.java
Delete nodes which have a greater value on right side.java
 
 
Diameter of Tree.java
Diameter of Tree.java
 
 
Distinct Subsequences.java
Distinct Subsequences.java
 
 
Divide Two Integers.java
Divide Two Integers.java
 
 
Double To Binary.java
Double To Binary.java
 
 
Double Tree Node.java
Double Tree Node.java
 
 
Edit Distance.java
Edit Distance.java
 
 
Find the Missing Number.cpp
Find the Missing Number.cpp
 
 
Find the kth largest value in a BST.java
Find the kth largest value in a BST.java
 
 
Find the maximum sum leaf to root path in a Binary.java
Find the maximum sum leaf to root path in a Binary.java
 
 
Find the most frequent element in the BST.java
Find the most frequent element in the BST.java
 
 
First Missing Positive.java
First Missing Positive.java
 
 
Flatten Binary Tree to Linked List.java
Flatten Binary Tree to Linked List.java
 
 
Generate Parentheses.java
Generate Parentheses.java
 
 
Gray Code.java
Gray Code.java
 
 
Implement strStr().java
Implement strStr().java
 
 
Insert Interval.java
Insert Interval.java
 
 
Integer to Roman.java
Integer to Roman.java
 
 
Interleaving String.java
Interleaving String.java
 
 
Jump Game II.java
Jump Game II.java
 
 
Jump Game II_2.java
Jump Game II_2.java
 
 
Jump Game.java
Jump Game.java
 
 
Langford sequence.java
Langford sequence.java
 
 
Largest Binary Search Tree (BST) in a Binary Tree.java
Largest Binary Search Tree (BST) in a Binary Tree.java
 
 
Largest Rectangle in Histogram.java
Largest Rectangle in Histogram.java
 
 
Largest Subtree Which is a Binary Search Tree (BST).java
Largest Subtree Which is a Binary Search Tree (BST).java
 
 
Length of Last Word.java
Length of Last Word.java
 
 
Letter Combinations of a Phone Number.java
Letter Combinations of a Phone Number.java
 
 
Longest Common Prefix.java
Longest Common Prefix.java
 
 
Longest Common Substring.java
Longest Common Substring.java
 
 
Longest Consecutive Sequence.java
Longest Consecutive Sequence.java
 
 
Longest Palindromic Substring.java
Longest Palindromic Substring.java
 
 
Longest Substring Without Repeating Characters.java
Longest Substring Without Repeating Characters.java
 
 
Longest Valid Parentheses.java
Longest Valid Parentheses.java
 
 
Matrix Chain Multiplication.cpp
Matrix Chain Multiplication.cpp
 
 
Maximal Rectangle.java
Maximal Rectangle.java
 
 
Maximal Rectangle_V2.java
Maximal Rectangle_V2.java
 
 
Maximum Depth of Binary Tree.java
Maximum Depth of Binary Tree.java
 
 
Maximum Length Bitonic Subarray.java
Maximum Length Bitonic Subarray.java
 
 
Maximum Subarray.java
Maximum Subarray.java
 
 
Median of Two Sorted Arrays.java
Median of Two Sorted Arrays.java
 
 
Merge Sorted Array.java
Merge Sorted Array.java
 
 
Merge Sorted Linkedlist.java
Merge Sorted Linkedlist.java
 
 
Merge Two Sorted Lists.java
Merge Two Sorted Lists.java
 
 
Merge k Sorted Lists.java
Merge k Sorted Lists.java
 
 
Minimum Depth of Binary Tree.java
Minimum Depth of Binary Tree.java
 
 
Minimum Path Sum.java
Minimum Path Sum.java
 
 
Minimum Window Substring.java
Minimum Window Substring.java
 
 
Multiply Strings.java
Multiply Strings.java
 
 
N-Queens II.java
N-Queens II.java
 
 
N-Queens.java
N-Queens.java
 
 
Next Greater Element.java
Next Greater Element.java
 
 
Next Permutation.java
Next Permutation.java
 
 
Nodes in the Range.java
Nodes in the Range.java
 
 
Number of Set Bit
Number of Set Bit
 
 
Palindrome Number.java
Palindrome Number.java
 
 
Palindrome Partitioning II.java
Palindrome Partitioning II.java
 
 
Palindrome Partitioning.java
Palindrome Partitioning.java
 
 
Partition List.java
Partition List.java
 
 
Pascal's Triangle II.java
Pascal's Triangle II.java
 
 
Pascal's Triangle.java
Pascal's Triangle.java
 
 
Path Sum II.java
Path Sum II.java
 
 
Path Sum.java
Path Sum.java
 
 
Permutation Sequence.java
Permutation Sequence.java
 
 

Repository files navigation

This repo is used for exercising

About

Online coding puzzle

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.