Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Minimum and Maximum with C++](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Minimum-and-Maximum-with-C.png "[Solved] Minimum and Maximum with C++")
The ExConFair is the region’s largest trade fair on Construction Equipments & Technology. The Event organizers hired college students as volunteers to work at the fair as the event is targeted to be attended by approx. 30 million visitors. At…
![[Solved] Four Seasoners with C++](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Four-Seasoners-with-C.png "[Solved] Four Seasoners with C++")
Four Seasoners: Dinesh also joined the group of 3 idiots and now their group is called Four Seasoners. Meanwhile, Binoy has moved to a new house in the same locality. Now the houses of Ajay, Binoy and Chandru are in…
![[Solved] Minimum Score After Removals on a Tree LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Minimum-Score-After-Removals-on-a-Tree-LeetCode-Contest-Problem.png "[Solved] Minimum Score After Removals on a Tree LeetCode Contest Problem")
Minimum Score After Removals on a Tree: There is an undirected connected tree with n nodes labeled from 0 to n – 1 and n – 1 edges. You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n -…
![[Solved] Maximum Score Of Spliced Array LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Maximum-Score-Of-Spliced-Array-LeetCode-Contest-Problem.png "[Solved] Maximum Score Of Spliced Array LeetCode Contest Problem")
You are given two 0-indexed integer arrays nums1 and nums2, both of length n. You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left…right] with the subarray nums2[left…right]. For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15]. You may choose to apply…
![[Solved] Count Number of Ways to Place Houses LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Count-Number-of-Ways-to-Place-Houses-LeetCode-Contest-Problem.png "[Solved] Count Number of Ways to Place Houses LeetCode Contest Problem")
Count Number of Ways to Place Houses: There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed. Return the…
![[Solved] Check if Matrix Is X-Matrix LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Check-if-Matrix-Is-X-Matrix-LeetCode-Contest-Problem.png "[Solved] Check if Matrix Is X-Matrix LeetCode Contest Problem")
Check if Matrix Is X-Matrix: A square matrix is said to be an X-Matrix if both of the following conditions hold: All the elements in the diagonals of the matrix are non-zero. All other elements are 0. Given a 2D integer array grid of size n x n representing…
Create a class Stack and implement push and pop operations in it. Output: 10 pushed into stack 20 pushed into stack 30 pushed into stack 30 Popped from stack Top element is : 20 Elements present in stack : 20…
Create a class, Date, having the data members, dd, mm, yy. Create the following functions in Date class: Default Constructor Parameterised Constructor Copy Constructor getDate() showDate()
1. Which of the following extension is valid for a file containing assembly code? .i .exe .s .obi Ans: .obj 2. Which of the following characteristics is not desired in a good algorithm? Abstraction Simplicity Correctness Ambiguity Abs: Ambiguity 3.…
![[Solved] Langford Pairing Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Langford-Pairing-Contest-Problem.png "[Solved] Langford Pairing Contest Problem")
Langford Pairing: You are given a positive integer N. Return a list of integers of size 2N containing all the integers from 1 to N (both inclusive) twice arranged according to Langford pairing. If no such pairing exists return -1 is…