Solve Again

Solve these problems again another time:

1. Yet Another Substring Reverse (1)

2. Special Permutations (1) 

3. E. New Year Tree (1) 

4. D. Powerful array (2) 

5. F - Distinct Numbers (1) 

6. F - Xor Sum 3 (1) 

6. E. Rock Is Push (1) 

7. F. Tree Factory (1) 

8. F. Daniel and Spring Cleaning(1) 

Share:

Read More

Hashing

 Resources:

Threads @ IIIT Hyderabad

Palindrome Substring Queries

Palindrome Substring Queries Implementation

CF blog

CF blog

E-maxx

uniqeSubstring Implementation 

group identical implementation 

Problems:

Substring Search 

1517. Freedom of Choice

ADAPHOTO - Ada and Terramorphing 

Minimal Shift 

Cyclic Shifts 

Sub-palindromes

Manacher's Algorithm 

Strings - 3 

Suffixes 

Jitu and Strings   

A2 online 

H. Queries for Number of Palindromes

Implementation:

 

Share:

Read More

ICPC Dhaka Regional Preliminary Contest, 2019

B. The Social Network

Share:

Read More

RabinKarp

Resource:

Tushar Roy

Abdul Bari

GeeksForGeeks

E-maxx

Implementation:

 

Problems:

NAJPF - Pattern Find      SOLUTION

D. Good Substrings 

D. Palindromic characteristics 

Share:

Read More

Lowest Common Ancestor

 Resource:

লোয়েস্ট কমন অ্যানসেস্টর

Lowest Common Ancestor, Binary Lifting and HLD 

copsiitbhu.co.in 

Lowest Common Ancestor - O(N−−√) and O(logN) with O(N) preprocessing

Lowest Common Ancestor - Binary Lifting

Lowest Common Ancestor - Farach-Colton and Bender Algorithm

Solve RMQ (Range Minimum Query) by finding LCA (Lowest Common Ancestor)

Lowest Common Ancestor - Tarjan's off-line algorithm

topcoder

Lowest Common Ancestor

CF 

Lowest Common Ancestor in a Binary Search Tree. 

[Tutorial] Searching Binary Indexed Tree in O(log(N)) using Binary Lifting 

CF blog 

Youtube Video:

Gaurav Sen 

Rachit jain 

TusharRoy

Algorithms Live 

ACM Advanced Training 2018 - Lecture 2-2 - LCA and Sparse Table

 Problem:

Problems 

LCA problems 

Codechef

E-maxx blog problem list  

LCA   SOLUTION   

Code:

Share:

Read More

E. Tetrahedron

Explanation: tetrahedron, rachitJain

Share:

Read More

CodeMonk (Dynamic Programming Part- I )

CodeMonk (Dynamic Programming Part- I )

 

Share:

Read More

Cut the sticks

Problem link: Cut the sticks

Share:

Read More

Find if a string is interleaved of two other strings

 Find if a string is interleaved of two other strings

Share:

Read More

Cutting a Rod

Cutting a Rod

Tushar Roy Video 

Medium blog post 

Implementation 01:

 

 Aplication:

 

Share:

Read More