Showing : codenationreset
CODENATION OA: 14/08/22
3 Votes | 1 Reply
7 weeks ago
rajat_singh0805
• 0
• updated 7 weeks ago
admin
920
Triology Innoivations (CodeNation) OA 09-08-2022
1 Vote | 0 Replies
8 weeks ago
Savan
• 30
• updated 8 weeks ago
admin
920
Codenation 03/07/2022
2 Votes | 0 Replies
3 months ago
luckyjain1271
• 140
• updated 3 months ago
admin
920
Codenation - 14 august
4 Votes | 6 Replies
13 months ago
saitama_26
• 20
• updated 13 months ago
megatron123
• 30
Codenation : 14 Aug 2021 : On - Campus
0 Votes | 0 Replies
13 months ago
2019csb1070
• 10
• updated 13 months ago
admin
920
CodeAgon | 2020 | Problem Sets | 27th September
13 Votes | 12 Replies
2.0 years ago
mod2
• 770
• updated 2.0 years ago
test
• 50
8 results • Page 1 of 1
Join us on Telegram for instant updates
Recent Locations • All
Bengaluru, 7 days ago
India/Pune, 6 weeks ago
delhi, 11 weeks ago
Gaya, 3 months ago
India, 4 months ago
Recent Replies
Answer: PayPal | 23rd September | Online Assessments by Manas 60
**Question 3** Since we are getting strings, we can split the string by space and that way for each entry we will get three things : `user…
Answer: Hexaware | 6th October | Online Asessements by Akshay Sharma • 170
**Question 3** **Overview** - Given an integer number we have to check if the number is odd or even and perform the operation based on t…
Answer: PayPal | 23rd September | Online Assessments by Akshay Sharma • 170
**Question 2** **Overview** - Given us the list of two customers that contains some string values in it that the order they placed in ever…
Answer: Amazon | Online Assessments | 1st October by Manas 60
**Question 3** The question in short is asking for X points closest to the origin. An easy and intuitive method would be to take all the p…
Answer: PayPal | 23rd September | Online Assessments by Akshay Sharma • 170
**Question1** **Overview** - We are given a list of packets in form of integer values we have to assign each packet a number based on th…
Answer: Virtusa | 3rd October | Online Assessments by Yash Sahijwani • 10
## Solution for Anagrams ## ### Analysis ### Two strings are anagrams, if one string can be formed from the other just by rearranging the …
Answer: Virtusa | 3rd October | Online Assessments by Yash Sahijwani • 10
## Solution for Problem 2 Nick's Check ## ### Analysis ### The marks need to be sorted in increasing order first so we can sort the array …
Answer: Virtusa | 3rd October | Online Assessments by Yash Sahijwani • 10
## Solution for Birthday Treat Problem ## ### Analysis ### The city can be viewed as a graph, where each block is a node, and a road conne…
Answer: JP Morgan | 5th October | Online Assessments by Akshay Sharma • 170
**Question 2** **Overview** - We are given two strings A and B string B is given as a subsequence of string A. - we are given a string as…
Answer: JP Morgan | 5th October | Online Assessments by Akshay Sharma • 170
**Question 1** **Overview** - We are given two arrays one hard has the start timing of the event and another has the end timing of the p…
Answer: Goldman Sachs | 30th September | Online Coding Rounds by Ayush Kumar Shaw • 0
**Solution to Question 3** This is a simple variation of the standard problem **dp on profiles**. So, we solve it using dynamic programmin…
Answer: Uber | 28th September | Online Assessments by Ayush Gangwani • 70
Solution to problem 2 ===================== Analysis -------- The problem can be solved simply by using the following dynamic programming…
Answer: Uber | 28th September | Online Assessments by Dolton Fernandes 20
**Solution for Problem 1:** Due to the cost calculation constraint, for a particular node 'a', the edge in the optimal case can be from 'a…
Answer: Atlassian | 27th September | Online Assessments | SDE by Manas 60
**Question 1** **Naive Approach** : The naive approach is to generate all possible subarrays and simultaneously checking for the subarrays…
Answer: Google | L3 | 30th September by Akshay Sharma • 170
**Question 1** **Assumptions** - we are not given the number of players participating or we are given char from a to z or there can be mo…