Flipzone is a concept that is very similar to the strategy called DARVAS BOX strategy. Which was developed by Nicolas Darvas.

**Nicolas Darvas** (1920–1977) was a dancer, self-taught investor and author. He is best known for his book, “How I Made $2,000,000 in the Stock Market.”

This is a continuation of my story from part1.

After learning about futures contract. I had an insane amount of success. I grew to over 2.5 Laksh in 3 weeks. Learnt all kinds of technical analysis. And they were all working for me. This was the month of January 2021…

This is a continuation of the story I wrote here.

After realising that the stocks given to me by my employer has doubled. I decided that I should also start investing some money on stocks. I wanted to invest in the stock exchanges of USA. Since I already saw the…

It’s been a long time since I last wrote a story on my medium page. This post tells you my story of how I started writing options on the stock market.

After graduating with my Computer Science(CS) degree from NIT-Trichy I got a full time job at PayPal in 2019…

Given a number A. Remove some *k* length consecutive digits (substring) *d(i),d(i+1),d(i+2)…..d(i+k) *concatinate the rest of the digits. Find some of all such concatinated numbers after removing all possible non empty substrings less than n

Problem link *here*

1021

All possible substring 1,10,102,021,21,1,02. 1021 is a substring but its length…

Given an array A let’s define minima as all an element that is smaller than both its neighbours a[i] < a[i+1] and a[i] < a[i-1].

Given an Array A find an ordering that gives maximum minima’s.

Link to problem here.

The maximum number of minimas possible is n/2 — (n%2==0)…

Given an array find the subsequence that gives maximum alternate sum.

*Alternate sum of A = [5,4,3,2,1] = 5–4+3–2+1*

Example :

A = [3,1,5,9,10,4,6,8,7,2] the subsequence that gives maximum would be [3,1,10,4,8]

Brute force would be to consider adding +/- sign to each index or not have…

Given a vector of numbers. Find the next permutation.

This is a frequently asked interview question. Most people who have read the solution once would find this quite straight forward to answer when asked in an interview coding round or face to face one.

But those who are interested in…

Codeforces 231-C

find problem statement here.

codeforces 246-D

You’ve got an undirected graph, consisting of *n* vertices and *m* edges. We will consider the graph’s vertices numbered with integers from 1 to *n*. Each vertex of the graph has a color. The color of the *i*-th vertex is an integer *c_i*.

Let’s consider all vertices of…