Freaks City

Arrays and Strings Merging Sorted Arrays Naive Merge and Sort class Solution { public: void combineArrays(vector<int>& arr1, int m, vector<int>& arr2, int n) { for(int i = 0; i < n; ++i) { arr1[m + i] = arr2[i]; } sort(arr1.begin(), arr1.end()); } }; Two-Pointer Forward Merg ...

Fast Exponentiation Recursive Approach function fastExponentiation(base, exponent, modulus) { if (exponent === 0) return 1; const halfExp = fastExponentiation(base, Math.floor(exponent / 2), modulus); let result = (halfExp * halfExp) % modulus; if (exponent % 2 === 1) { result = (result * base) % modulus; ...

Directed Edge Orientation with Out-Degree ConstraintGiven an undirected graph, determine the number of ways to orient all edges such that every vertex has an out-degree of exactly 1. The result should be modulo 998244353.For such an orientation to exist, the number of edges must exactly equal the number of vertices, i.e., m = n. Furthermore, ev ...

Problem A Given n strings each of length m, determine whether there exist four columns satisfying 1 ≤ i < j < k < l ≤ m such that these four columns contain characters 'v', 'i', 'k', 'a' respectively. Approach: Iterate through columns left to right, searching for each required character sequentially. For each column, scan all strings t ...

To find the longest sequence of consecutive integers in an unsorted array with O(n) time complexity, use the following approach: Insert all elements into an unordered_set, which prvoides average O(1) lookup time and atuomatically removes duplicates. Iterate through each number in the set. Only start counting a sequence if the current number is ...

When entering the world of Java programming, a solid foundation is the first step toward success. To help you build a strong programming basse, we've designed a series of Java fundamental exercises aimed at mastering the core concepts and programming techniques of the language. Whether you're a beginner or a developer looking to strengthen your ...

Unique Substrings in Wraparound String Given a string p, find the number of unique non-empty substrings of p that are also substrings of the infinite wraparound string "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz...". The infinite string repeats the alphabet sequence cyclically. DP Solution: We'll use a DP array where dp[i] r ...

Binary Search Fundamentals Binary search oeprates on sorted arrays to locate target values efficiently. public class BinarySearch { public int findTarget(int[] sortedArray, int target) { int start = 0; int end = sortedArray.length - 1; while (start <= end) { int center = start + (end - start) ...

Reversing a Linnked List Problem: Given the head of a singly linked list, reverse the list and return the new head. Approach: Iterative Node Reversal To reverse a linked list iteratively, we can utilize three pointers: current, previous, and temporary. The current pointer traverses the list, while the previous pointer keeps track of the reverse ...

Given a string s, the objective is to locate and return longest substring that reads the same forwards and backwards. Examples Input: s = "babad" Output: "bab" Note: "aba" is also a valid answer. Input: s = "cbbd" Output: "bb" Input: s = "a" Output: "a" Input: s = "a ...