Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Command Line Argument Print String or Integer with Java, C++](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Command-Line-Argument-Print-String-or-Integer-with-Java-C.png "[Solved] Command Line Argument Print String or Integer with Java, C++")
Command Line Argument Print String or Integer: Write a program to accept an integer or string as command line argument and print whether the given input is string or integer Sample Input (Command Line Argument) 1:abc Sample Output 1:The given…
![[Solved] Command Line Argument Count with Java, C++](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Command-Line-Argument-Count-with-Java-C.png "[Solved] Command Line Argument Count with Java, C++")
Command Line Argument Count: Write a program to accept strings as command line argument and print the number of arguments entered. Sample Input (Command Line Argument) 1:Command Arguments Sample Output 1:Arguments :CommandArgumentsNumber of arguments is 2 Sample Input (Command Line…
![[Solved] Subarray With Elements Greater Than Varying Threshold LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Subarray-With-Elements-Greater-Than-Varying-Threshold-LeetCode-Contest.png "[Solved] Subarray With Elements Greater Than Varying Threshold LeetCode Contest")
Subarray With Elements Greater Than Varying Threshold: You are given an integer array nums and an integer threshold. Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k. Return the size of any such subarray. If there is no such subarray, return -1. A subarray is a contiguous non-empty…
![[Solved] Minimum Sum of Squared Difference LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Minimum-Sum-of-Squared-Difference-LeetCode-Contest.png "[Solved] Minimum Sum of Squared Difference LeetCode Contest")
Minimum Sum of Squared Difference: You are given two positive 0-indexed integer arrays nums1 and nums2, both of length n. The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] – nums2[i])2 for each 0 <= i < n. You are also given two positive integers k1 and k2. You can modify any…
![[Solved] The Latest Time to Catch a Bus LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-The-Latest-Time-to-Catch-a-Bus-LeetCode-Contest.png "[Solved] The Latest Time to Catch a Bus LeetCode Contest")
The Latest Time to Catch a Bus: You are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed integer array passengers of length m, where passengers[j] represents the arrival time of the jth passenger. All bus departure times are unique. All passenger…
![[Solved] Evaluate Boolean Binary Tree LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Evaluate-Boolean-Binary-Tree-LeetCode-Contest.png "[Solved] Evaluate Boolean Binary Tree LeetCode Contest")
Evaluate Boolean Binary Tree: You are given the root of a full binary tree with the following properties: Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True. Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND. The evaluation of a node is as follows: If the node is…
![[Solved] Best Mobile Plan with C++](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Best-Mobile-Plan-with-C.png "[Solved] Best Mobile Plan with C++")
Best Mobile Plan: St. Patrick Convent organizes a project exhibition “Innovative Minds” every year with an objective to provide the platform and unleash the potential of the students by showcasing their innovative projects.Albert is a science expert and is a…
![[Solved] Insomnia cure with Java, C++, Python](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Insomnia-cure-with-Java-C-Python.png "[Solved] Insomnia cure with Java, C++, Python")
Insomnia cure: One dragon. Two dragon. Three dragon, the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine. However, just counting dragons was boring as well, so she entertained herself…
![[Solved] Level them All Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Level-them-All-Contest-Problem.png "[Solved] Level them All! Contest Problem")
Level them All!: You are given a binary tree and an integer L. Count the number of nodes on that level.Note: L may be greater than maximum possible level. In such case answer is 0 nodes. Input Format:The first line of input…
![[Solved] Strange Median Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Strange-Median-Contest-Problem.png "[Solved] Strange Median Contest Problem")
Strange Median!: You are given a binary search tree. You task is to find the median of sub tree of Kth smallest node of the tree. Input Format:The first line of input contains T denoting the number of testcases. T testcases follow.…