All Medium Articles
DatagramSockets are Java’s mechanism for network communication via UDP instead of TCP. Java provides DatagramSocket to communicate over UDP instead of TCP. It is also… Read More
Given an array of numbers where every number is represented as string. The numbers may be very large (may not fit in long long int),… Read More
Given two integers n and k. Consider first permutation of natural n numbers, P = “1 2 3 … n”, print a permutation “Result” such… Read More
Given two numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find the difference… Read More
1st Round (Online coding round) 2 Questions 1) Standard DP problem. 2) I don’t remember it completely. It was a recursive problem with strings. 2nd… Read More
Given an undirected tree which has even number of vertices, we need to remove the maximum number of edges from this tree such that each… Read More
Prerequisite: Socket Programming in Java Networking just doesn’t conclude with a one-way communication between the client and server. For example consider a time telling server… Read More
Given a grid which consists of 4 types of characters : ‘B’ ‘.’ ‘S’ and ‘D’. We need to reach D starting from S, at… Read More
Given a length n, count the number of strings of length n that can be made using ‘a’, ‘b’ and ‘c’ with at most one… Read More
Morgan Stanley had hiring drive where around 150 people came for interview. First Round:(Coding Round)-45 Minutes Here we have to code 2 problems 1) first… Read More
Given an undirected tree whose each node is associated with a weight. We need to delete an edge in such a way that difference between… Read More
Given two integers n and k, Find the lexicographical nth palindrome of k digits.Examples:   Input : n = 5, k = 4 Output : 1441… Read More
Given an array the task is to largest divisible subset in array. A subset is called divisible if for every pair (x, y) in subset,… Read More
Consider an array of size n with all initial values as 0. We need to perform the following m range increment operations. increment(a, b, k)… Read More
A big big thanks to geeks for geeks for constructing this platform where candidates find suitable question sets. 1. 1st Round (Coding round on hacker… Read More
Given a string containing all digits, we need to convert this string to a palindrome by changing at most K digits. If many solutions are… Read More
Prerequisite – Garbage Collection in Java Difficulty level : Intermediate In Java, object destruction is taken care by the Garbage Collector module and the objects… Read More
Given a string with lowercase repeated characters, the task is to rearrange characters in a string so that no two adjacent characters are the same.… Read More
Consider a highway of M miles. The task is to place billboards on the highway such that revenue is maximized. The possible sites for billboards… Read More
1st Round : Machine Coding Round It was machine coding round having two coding questions. Based on tree. (Solved using Brute force, didn’t pass all… Read More