Naive approach
For each word of forgotten language check in modern language phrases that whether that word is present or not
For each word of forgotten language check in modern language phrases that whether that word is present or not
if found
YES
else
NO
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
NO
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
NO
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
NO
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
NO
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
NO
| abd | mjs | ksjd |
|---|
| ann | abd | klr | nfjdl | ksjd | mo |
|---|
Forgotten words
Modern words
YES
NO
YES
OPTIMISED APPROACH
We can reduce the time complexity of the solution by using unordered set
We can reduce the time complexity of the solution by using unordered set
It will efficiently insert and check all the words in O(log(size))
Approach
1. Input all the forgotten language words.
2. Insert all the modern language words in an unordered set.
3. Traverse each forgotten word and check whether it is present in the set or not.
Naive approach
By Chirayu Jain
Naive approach
- 64
