tannishk / competitive

Competitive Programming Question Practise

Competitive Programming Questions

Introduction

This repository is a collection of competitive programming questions that could be asked on interviews. You can always contribute by adding your solution to these questions in the correct folder.

Rules

Feel free to submit answers in a language of your liking.
Only one submission per request will be accepted.
New questions will be posted in issues.
You are also welcome to post new questions in issues
Kindly contribute!

competitive's Issues

Triple Sum in An array

I have given the solution in python kindly try to implement it in different languages . Feel Free to alter my solution if you find them not upto the mark

https://github.com/tannishk/competitive/blob/master/questions/triple-sum-in-array.txt

A Function to Test whether a Tree is a complete binary tree or not ?

You may answer in any language you feel comfortable but only 1 submission per request will be accepted .

XOR LinkedList

An XOR linked list is a more memory efficient doubly linked list. Instead of each node holding next and prev fields, it holds a field named both, which is an XOR of the next node and the previous node. Implement an XOR linked list; it has an add(element) which adds the element to the end, and a get(index) which returns the node at index.

If using a language that has no pointers (such as Python), you can assume you have access to get_pointer and dereference_pointer functions that converts between nodes and memory addresses.

Can anyone give the solution of this question in Python with explanation?

Amazon Interview

Print a sequence of numbers starting with N, without using loop, in which A[i+1] = A[i] - 5, if A[i]>0, else A[i+1]=A[i] + 5 repeat it until A[i]=N.

Input:
First line contains number of test cases T. Then following T lines contains an integer N.

Output:
Single line with pattern .

Constraints:
0< N < 10000

Example:
Input:
2
16
10

Output:
16 11 6 1 -4 1 6 11 16
10 5 0 5 10

Explanation:
We basically first reduce 5 one by one until we reach a negative or 0. After we reach 0 or negative, we one by one add 5 until we reach N.

Stack Min Solution in Python

class MinStack(object):

    def __init__(self):
        self.stack = []
        self.min_stack = []
        
    def push(self, x):
        self.stack.append(x)
        if not self.min_stack or x <= self.min_stack[-1]:
            self.min_stack.append(x)
        
    def pop(self):
        n = self.stack.pop()
        if self.min_stack[-1] == n:
            self.min_stack.pop()
        
    def top(self):
        return self.stack[-1]
        
    def getMin(self):
        return self.min_stack[-1]
        

Directed Graph Question

https://github.com/tannishk/competitive/blob/master/questions/Directed_graph.txt

Write a standalone function that returns the count of nodes in a linked list given a pointer to the head node

Write a standalone function that returns the count of nodes in a linked list given a pointer to the head node