Home
About
Privacy Policy
Contact

Tutorials
Books
Interview Corner
- Articles
- Interview Questions
Articles
Competitive Programming
Search

Contact us

Contact us

Contact Us

If you have any query regrading Site, Advertisement and any other issue, please feel free to contact at nikita.paliwal.560@gmail.com

If you have any doubts or any new insights, please share ConversionConversion EmoticonEmoticon

Subscribe to: Posts (Atom)

Sum of Subarray Minimums

Given an array A of integers, find the sum of min(B), where B ranges over every (contiguous) subarray of A. Since the answer may be large, r...

Labels

Competitive coding (5)
interview question (4)
Array (3)
string (2)
BFS (1)
Books (1)
Brainteaser (1)
Breadth first search (1)
Interview Preparation Books (1)
Math (1)
dynamic programming (1)
greedy (1)
stack (1)

Popular Posts

Swapping adjacents in LR string

We are given a string that is composed of characters "X", "L", "R", like "XXLRXLRXXX", where L repr...
Cinema seat allocation

A cinema has n rows, numbered from 1 to n. There are 10 seats in each row, labelled from 1 to n as shown above. We are given an array occupi...
Can make palindrome from substring

We are given a string s, we make queries on it. For each query queries[i] = [left,right,x], the substring from s[left] to s[right] can be r...
Path with maximum probability

We have an undirected weighted graph with n nodes are (0-indexed), represented by an edge list where edges[i] = [a, b] is an undirected ...
Finding number of Unique strings in wraparound string

Given a string s which is an infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look something like this: ...
Remove comments

From a C++ program remove all the comments. The program source is an array where source[i] is the i-th line of source code. The array repres...
Interview Preparation Books

Cracking the Coding Interview (Indian Edition) by Caree...
Reach a Number

You are standing at 0 on an infinite number line, you have to reach the target. On each move, you can either move to the right or to left. D...
Sum of Subarray Minimums

Given an array A of integers, find the sum of min(B), where B ranges over every (contiguous) subarray of A. Since the answer may be large, r...

Recent

Popular

Swapping adjacents in LR string

We are given a string that is composed of characters "X", "L", "R", like "XXLRXLRXXX", where L repr...
Cinema seat allocation

A cinema has n rows, numbered from 1 to n. There are 10 seats in each row, labelled from 1 to n as shown above. We are given an array occupi...
Can make palindrome from substring

We are given a string s, we make queries on it. For each query queries[i] = [left,right,x], the substring from s[left] to s[right] can be r...

Comments

Subscribe Here

Pages

Privacy policy
Contact us

Labels

Competitive coding
interview question
Array
string
BFS
Books
Brainteaser
Breadth first search
Interview Preparation Books
Math
dynamic programming
greedy
stack

Copyright © 2014 Programming Ninja All Right Reserved

Blogger Templates Created by Arlina Design Powered by Blogger