Nikunj Banka

Nikunj Banka has asked 41 questions and find answers to 21 problems.

Stats

About

I am an undergraduate student at NSIT, Delhi pursuing Computer Engineering. I can be reached at [email protected].

Nikunj Banka questions

Is it compulsory that the 'reduction of p‌r‌o‌b‌l‌e‌m be done in polynomial time' for it to be NP complete?
How to add a string containg a double quote to a sql database?
How to efficiently implement hashCode() for a singly linked list node in Java?
Where is Bottom Up merge sort useful?
How to compute a minimum bottleneck spanning tree in linear time?
What is the value of an uninitialized string in c? [duplicate]
Why must I cast the result from malloc?
Are multiple conditions allowed in a for loop?
Find a monotonic shortest path in a graph in O(E logV)
Double exponential problems? [closed]

Nikunj Banka answers

Understanding Kadane's Algorithm for 2-D Array
Looping in a spiral outside-in
What algorithm is this? Best way to distribute limited resources
efficiently find amount of integers in a sorted array
Given an array of sorted integers, how can I find if there exists a set of 3 elements that sum to K? [duplicate]
Dynamic Programming: top down versus bottom up comparison
Finding the path with the maximum minimal weight
Sort 3x3 grid by rotating 2x2 subgrids
Given the exp() function, how to implement the ln() function?
Find whether a minimum spanning tree contains an edge in linear time?