Profile

Cover photo
Nishant Raj
Works at Amazon.com
Attended Bansal classes
Lives in Hyderabad
252 followers|772,143 views
AboutPostsPhotosVideos+1'sReviews

Stream

Nishant Raj

Shared publicly  - 
 
Number Steps Given below code is for nsteps spoj or number steps spoj. #include <bits/stdc++.h> using namespace std; int main(){ int t; cin>>t; while(t--){ int x , y; cin>>x>>y; if(y > x or y < (x - 2) or y == x - 1)...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
NSTEPS-Number Steps
Number Steps Given below code is for nsteps spoj or number steps spoj. #include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int x , y;
cin>>x>>y;
if(y > x or y < (x - 2) or y == x - 1){
cout<<"No Number\n";
con...
Number Steps Given below code is for nsteps spoj or number steps spoj. #include <bits/stdc++.h> using namespace std; int main(){ int t; cin>>t; while(t--){ int x , y; cin>>x>>y; if(y > x or y < (x - 2) or y == x - 1)...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
Lexicographical Substring Search Given below code is for sublex spoj or Lexicographical substring search spoj. Hint :- It can be done using Suffix array and LCP array. Let p[] denote suffix array lcp[] denote L...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
EIUASSEMBLY-Assembly line
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /*
===================================================
Name :- Nishant Raj
Email :- raj.nishant360@gmail.com
College :- Indian Scho...
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /* =================================================== Name :- Nishant Raj Email :- raj.nis...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
Lexicographical Substring Search Given below code is for sublex spoj or Lexicographical substring search spoj. Hint :- It can be done using Suffix array and LCP array. Let p[] denote suffix array lcp[] denote L...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /* =================================================== Name :- Nishant Raj Email :- raj.nishan...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
Number Steps Given below code is for nsteps spoj or number steps spoj. #include <bits/stdc++.h> using namespace std; int main(){ int t; cin>>t; while(t--){ int x , y; cin>>x>>y; if(y > x or y < (x - 2) or y == x - 1)...
1
Add a comment...

Nishant Raj

commented on a post on Blogger.
Shared publicly  - 
 
Hey sorry there was an error in blog. Now you can see the solutions.
Solution to BWIDOW below given code is for bwidow spoj or black widow ring spoj. #include int main() { int t; scanf("%d",&t); while(t--) { int N,i,j,count=0,flage=0,index; scanf("%d",&N); long r[N],R[N]; for(i=0;iR[j]) count+...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
EIUASSEMBLY-Assembly line
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /*
===================================================
Name :- Nishant Raj
Email :- raj.nishant360@gmail.com
College :- Indian Scho...
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /* =================================================== Name :- Nishant Raj Email :- raj.n...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
test

1
Add a comment...

Nishant Raj

Shared publicly  - 
 
SUBLEX - Lexicographical Substring Search
Lexicographical Substring Search Given below code is for sublex spoj or Lexicographical substring search spoj. Hint :- It can be done using Suffix array and LCP array. Let  p[]  denote suffix array  lcp[]  denote LCP array. create a array which store the nu...
Lexicographical Substring Search Given below code is for sublex spoj or Lexicographical substring search spoj. Hint :- It can be done using Suffix array and LCP array. Let p[] denote suffix array lcp[] denote L...
1
Add a comment...

Nishant Raj

Shared publicly  - 
 
EIUASSEMBLY-Assembly line
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /*
===================================================
Name :- Nishant Raj
Email :- raj.nishant360@gmail.com
College :- Indian Scho...
Assembly line Given below c++ code is for EIUASSEMBLY spoj or Assembly line spoj. Hint:- Simple Binary Search Implementation. /* =================================================== Name :- Nishant Raj Email :- raj.nishan...
1
Add a comment...
Work
Occupation
Software Development Engineer
Skills
programmer(c/c++,little bit of python)
Employment
  • Amazon.com
    Software Development Engineer, 2016 - present
Places
Map of the places this user has livedMap of the places this user has livedMap of the places this user has lived
Currently
Hyderabad
Previously
Kumarkhand - Dhanbad, Jharkhand, India
Contact Information
Home
Email
Address
Hyderabad
Story
Tagline
computer science and engineering student at ISM dhanbad
Education
  • Bansal classes
    Intermediate, 2010 - 2011
  • ALLEN Career Institute, Indra vihar
    Intermediate, 2011 - 2012
  • mithila public school
    Schooling, 2001 - 2010
  • Indian School of Mines
    Computer Science & Engineering, 2012 - 2016
Basic Information
Gender
Male
Birthday
November 13, 1994
Relationship
Single
Links
Contributor to
Nishant Raj's +1's are the things they like, agree with, or want to recommend.
NSTEPS-Number Steps
spoj-solutions.blogspot.com

Number Steps Given below code is for nsteps spoj or number steps spoj. #include using namespace std; int main(){ int t; cin&gt;&gt;t; while(t--){

SUBLEX - Lexicographical Substring Search
spoj-solutions.blogspot.com

Lexicographical Substring Search Given below code is for sublex spoj or Lexicographical substring search spoj. Hint :- It can be done using

Practo - Your Health App – Android Apps on Google Play
play.google.com

★Voted the best app at Google Think Mobile Conference 2014★ ★Asia’s #1 Health Portal★ ★Now Integrated with Uber - Find a Ubercab near you an

Ultimate Free Cheats - Get Free Hacks, Cheats, Games, Tools and Generators!
www.ultimatefreecheats.com

On UltimateFreeCheats you are able to get Free Cheats and Hacks for your favorite PC, Android, iOS and Facebook Games. And also Full Game Re

BSHEEP-Build the Fence
spoj-solutions.blogspot.com

Build the Fence Given below code is for bsheep spoj or build the fence spoj. Hint:- Simple implementation of any O(N log N) algorithm for Co

INS14A-BSTRING
spoj-solutions.blogspot.com

BSTRING Given below c++ code is for ins14a spoj or bstring spoj. Hint :- Think of bringing all one's to it median in windows of 'm' ones. /*

PATULJCI-Snow White and the N dwarfs
spoj-solutions.blogspot.com

Snow White and the N dwarfs Given below code is for patuljci spoj or snow white and the N dwarfs spoj . Hint:- source( http://hsin.hr/ ) For

SID-Search Insert Delete
spoj-solutions.blogspot.com

Search Insert Delete Given below c++14 code is for sid spoj or search insert delete spoj. Hint:- I just uses unordered_multimap container an

AIBOHP-Aibohphobia
spoj-solutions.blogspot.com

Aibohphobia Given below code is for AIBHOP spoj or aibohphobia spoj. /* =================================================== Name :- Nishant

BVAAN-Balika Vadhu and Alok Nath
spoj-solutions.blogspot.com

Balika Vadhu and Alok Nath given below c++14 code is for BVAAN spoj or balika vadhu and alok nath spoj. hint :- 3D Dynamic programming probl

PLD-Palindromes
spoj-solutions.blogspot.com

Palindromes Given below code is for pld spoj or palindromes spoj. Hint :- Simple implementation of Rolling Hash. /* ========================

RMID2-Running Median Again
spoj-solutions.blogspot.com

Running Median Again Given below code is for rmid2 spoj or Running Median Again spoj. Hint:- Think of MinHeap and MaxHeap to maintain median

SMILEY1807-1807
spoj-solutions.blogspot.com

1807 Given below c++ code is for smiley1807 spoj or 1807 spoj. Hint :- This is a basic Dynamic Programming problem , Just use pen and paper

DSUBSEQ-Distinct Subsequences
spoj-solutions.blogspot.com

Distinct Subsequences Given below c++ code is for DSUBSEQ spoj or Distinct Subsequences spoj. Hint:- This is one of basic DP problem you can

EKO-Eko
spoj-solutions.blogspot.com

Eko Given below code is for EKO spoj or Eko spoj. Simple Binary Search implementation. /* ==================================================

KOPC12A-K12 - Building Construction
spoj-solutions.blogspot.com

K12 - Building Construction Given Below c++ code is for kopc12a spoj or k12-building construction spoj. Simple Binary Search question. /* ==

RMID - Running Median Revisited
spoj-solutionsnr.blogspot.com

Link to the question Actually, its same RMID spoj question but Nishant Raj has already posted it. The Time taken by the code mentioned befor

INS14I-Infinite Sequence
spoj-solutionsnr.blogspot.com

Infinite Sequence below given code is for ins14i spoj or infinite sequence spoj. if you want proof of solution please mail me @ raj.nishant3

66 reviews
Map
Map
Map
This is place for rich guys . They usually visit there for snacks in drive-in cafe. There you can rent bike and cars also.
Public - 2 months ago
reviewed 2 months ago
Nice place to have drink and dance floor is small but good. Crowd is rally good not like that of pune or mumbai but better than rest of the club of hyd.
Public - 2 months ago
reviewed 2 months ago
A nice 5 star hotel . I like more of lemon tea which you get out side that hotel.
Public - 2 months ago
reviewed 2 months ago