kittyK's blog

By kittyK, history, 2 days ago, In English

There was a Problem in November cook off of codechef. This problem requires partition dp. I have known that partition dp is kind of masking. Can anyone suggest me some similar problems and from where I can learn this topic. Thanks

Read more »

 
 
 
 
  • Vote: I like it
  • -2
  • Vote: I do not like it

By kittyK, history, 3 months ago, In English

I have just known about google kickstart . I have noticed that it is said , Google may offer job or internship through google kickstart performance . But , how much well one has to perform to get this ? I meant anyone in this community got interview offer from this ? What rank you achieved ?

(sorry for bad English and thanks in advance)

Read more »

 
 
 
 
  • Vote: I like it
  • -18
  • Vote: I do not like it

By kittyK, history, 3 months ago, In English

For 768C - Джон Сноу и его любимое число , what is the intuition to solve it ? At first for small constraint I made brute force solution and noticed that there is a pattern , there can be two different arrays — when k is even and when k is odd.

But this is not working . Here is my code .

Read more »

 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

By kittyK, history, 3 months ago, In English

In this UVA 10755 — Garbage Heap , we have to find maximum sum of any sub range.

I have seen the solution and editorial available online . But I don't understand the insight . How 2d max sum and kadane algorithm is applying to get the ans. I meant How it is working actually .

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By kittyK, history, 4 months ago, In English

Anyone please help me with this problem

Here, you are asked to find second shortest path.

Read more »

 
 
 
 
  • Vote: I like it
  • +12
  • Vote: I do not like it

By kittyK, history, 4 months ago, In English

Please suggest any tutorial for MST(minimum spanning tree) on directed graph. I will be grateful if anyone would share the implementation of the algorithm of MST on Directed Graph.

Read more »

 
 
 
 
  • Vote: I like it
  • +4
  • Vote: I do not like it

By kittyK, history, 4 months ago, In English

Can anyone explain how to solve this 687B - Remainders Game . I don't understand how to come with ideas for such problems and I did not understand the editorial well.

Read more »

 
 
 
 
  • Vote: I like it
  • +2
  • Vote: I do not like it

By kittyK, history, 4 months ago, In English

Given a graph with n nodes and m edges . n ≤ 100,000 and m ≤ 1,000,000 . We have to find any odd cycle.

Question Link

How to solve this problem ? I tried in naive way. I just stored the nodes when I get any cycle of odd length . But it will obviously TLE.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By kittyK, history, 4 months ago, In English

It might be silly question for pro coders. It is very basic question .I actually googled but could not understand well.

So the question is why the way of finding cycle is different for directed and undirected graph ?

Read more »

 
 
 
 
  • Vote: I like it
  • +11
  • Vote: I do not like it

By kittyK, history, 4 months ago, In English

Hi everyone . I practice from another account and can do 1600 rated problem by myself. Sometimes I cannot and then I read editorial. But in the contest time my most time is eaten by either B or A or any C that needs a quick observation . How should I keep practicing ? Normally I pick 1400 to 1700 problems and solve . But I don't know how to get the A,B in contest time fastly . Once I solved lot of A , B . and after that I could not solve C in the contest . How I can practice more efficiently or what mindset I should build in myself ?

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By kittyK, history, 5 months ago, In English

Hello good people. I am struggling with mind fast solving . How can I practice to increase mind fast solving skill ?

Read more »

 
 
 
 
  • Vote: I like it
  • -3
  • Vote: I do not like it