GitHub - prashantkhurana/Algorithms_Questions: SPOJ Contest Questions

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 106 Commits
.gitattributes		.gitattributes
.gitignore		.gitignore
10582_subarrays_ARRAYSUB.java		10582_subarrays_ARRAYSUB.java
ABA12B.cpp		ABA12B.cpp
ABCPATH.cpp		ABCPATH.cpp
ABSYS.java		ABSYS.java
ACODE.java		ACODE.java
ACPC11C.cpp		ACPC11C.cpp
ACS.cpp		ACS.cpp
ADDREV.java		ADDREV.java
AE00.java		AE00.java
AIBOHP.java		AIBOHP.java
ALIEN.cpp		ALIEN.cpp
AMR10G.java		AMR10G.java
AMSC01.cpp		AMSC01.cpp
ANARC05H.cpp		ANARC05H.cpp
ANARC08B.cpp		ANARC08B.cpp
ANARC09A.cpp		ANARC09A.cpp
ANARC09A.java		ANARC09A.java
ANARCO7G.cpp		ANARCO7G.cpp
ANGELS.cpp		ANGELS.cpp
APS.cpp		APS.cpp
ARBITRAG.cpp		ARBITRAG.cpp
ARMY.java		ARMY.java
ASSIST.cpp		ASSIST.cpp
ATOMS.cpp		ATOMS.cpp
Alicesie.cpp		Alicesie.cpp
BEADS.cpp		BEADS.cpp
BEHAPPY.cpp		BEHAPPY.cpp
BENEFACT.cpp		BENEFACT.cpp
BITMAP.java		BITMAP.java
BLINNET.cpp		BLINNET.cpp
BOMARBLE.cpp		BOMARBLE.cpp
BRCKTS.cpp		BRCKTS.cpp
BRDGHRD.cpp		BRDGHRD.cpp
BROKEN.cpp		BROKEN.cpp
BUGLIFE.cpp		BUGLIFE.cpp
BWIDOW.cpp		BWIDOW.cpp
BYECAKES.cpp		BYECAKES.cpp
Balife.cpp		Balife.cpp
Bitmap.cpp		Bitmap.cpp
CADYDIST.cpp		CADYDIST.cpp
CAM5.cpp		CAM5.cpp
CANDY.java		CANDY.java
CANDY3.java		CANDY3.java
CANDYSTN.cpp		CANDYSTN.cpp
CANTON.java		CANTON.java
CHICAGO.cpp		CHICAGO.cpp
CLONE.cpp		CLONE.cpp
CMEXPR_2.cpp		CMEXPR_2.cpp
CMPLS.cpp		CMPLS.cpp
COINS.java		COINS.java
CONGA.cpp		CONGA.cpp
CSTREET.cpp		CSTREET.cpp
CUBEFR.cpp		CUBEFR.cpp
CartesianTree.cpp		CartesianTree.cpp
CircleLand.cpp		CircleLand.cpp
Cmexpr.cpp		Cmexpr.cpp
DCEPC206.cpp		DCEPC206.cpp
DCEPC504.cpp		DCEPC504.cpp
DCEPC702.cpp		DCEPC702.cpp
DIEHARD.cpp		DIEHARD.cpp
DISUBSTR.cpp		DISUBSTR.cpp
DONALDO.cpp		DONALDO.cpp
DSUBSEQ.cpp		DSUBSEQ.cpp
EC_CONB.cpp		EC_CONB.cpp
EDIST.java		EDIST.java
EDIT.cpp		EDIT.cpp
EGYPIZZA.cpp		EGYPIZZA.cpp
EGYPIZZA.java		EGYPIZZA.java
ELEVTRBL.cpp		ELEVTRBL.cpp
ENCONDIN.cpp		ENCONDIN.cpp
Expression Tree.cpp		Expression Tree.cpp
Expression Tree_accepted.cpp		Expression Tree_accepted.cpp
FARIDA.java		FARIDA.java
FASHION.java		FASHION.java
FCTRL.java		FCTRL.java
FENCE1.java		FENCE1.java
FISHER.cpp		FISHER.cpp
FREQUENT.cpp		FREQUENT.cpp
GARPHCUT.cpp		GARPHCUT.cpp
GCPC11c.cpp		GCPC11c.cpp
GIRLSNBS.java		GIRLSNBS.java
GNYR09F.cpp		GNYR09F.cpp
GSS1.cpp		GSS1.cpp
GSS1_TLE.java		GSS1_TLE.java
GSS3.cpp		GSS3.cpp
GUESSTHE.cpp		GUESSTHE.cpp
Graph_DFS.cpp		Graph_DFS.cpp
HANGOVER.java		HANGOVER.java
HERDING.cpp		HERDING.cpp
HOTELS.cpp		HOTELS.cpp
HUBULLU.java		HUBULLU.java
IITKWPCF.cpp		IITKWPCF.cpp
INVCNT.cpp		INVCNT.cpp
INVCNT.java		INVCNT.java
IOIPALIN.cpp		IOIPALIN.cpp
InputReader.java		InputReader.java
JAVAC.java		JAVAC.java
JULKA.java		JULKA.java

Repository files navigation

Some of My Spoj Solutions.


Some might give a TLE because of the approach used. O(n) is not always faster than O(nlogn) because of the constant.

Also, multiple solutions for many questions can be found as I have started to start writing in Java.