# All Medium Articles Basic Easy Medium Hard Expert All Categories Arrays Misc Program Output Strings Linked List Bit Magic Articles Tree MCQ GFacts Interview Experiences GBlog Stack Queue Algorithms Analysis Dynamic Programming Greedy Backtracking Pattern Searching Divide and Conquer Searching Sorting Mathematical Geometric Heap Hash Randomized Combinatorial Matrix Binary Search Tree Advanced Data Structure Project Technical Scripter Python Competitive Programming Internship Experienced TechTips Geek on the Top Branch and Bound Game Theory Computer Subject Computer Networks Operating Systems DBMS GATE CS Programming Language SQL Java Compiler Design Recursion Puzzles C C++ Data Structures Graph School Programming Design Pattern Articles Placements QA – Placements Reasoning – Placements English – Placements CS – Placements DI – Placements Quizzes Aptitude Web technologies Questions Engineering Mathematics Questions Python-Quizzes QA – Placement Quizzes C Quiz C++ Quiz Java Quiz GATE Operating Systems Questions DBMS Quiz Computer Networks Quiz Data Structures Algorithms Quiz Compiler Design Computer Organization and Architecture Theory of Computation Digital Electronics & Logic Design Theory of Computation & Automata Computer Organization & Architecture Engineering Mathematics Difference Between Advanced Computer Subject C Programs C++ Programs Java Programs Python Programs Web Technologies JavaScript Linux-Unix GeeksforGeeks Initiatives ISRO UGC-NET Software Engineering C# Perl Ruby PHP JS++ PHP Programs Machine Learning C# Programs Scala Hadoop Go Language HTML

## Testimonials – Words that keep us going 3.1

Drop your Testimonial here Hello, I have been practicing questions on this site for the last 2 years and recently I got placed at Google.… Read More »

## Gomory-Hu Tree | Set 1 (Introduction) 3.3

Background : In a flow network, an s-t cut is a cut that requires the source ‘s’ and the sink ‘t’ to be in different… Read More »

## Find Recurring Sequence in a Fraction 3.6

Given a fraction, find recurring sequence of digits if exists, otherwise print “No recurring sequence”. Examples: Input : Numerator = 8, Denominator = 3 Output… Read More »

## Weighted Job Scheduling in O(n Log n) time 3.3

Given N jobs where every job is represented by following three elements of it. Start Time Finish Time Profit or Value Associated Find the maximum… Read More »

## Construct a Binary Search Tree from given postorder 3.5

Given postorder traversal of a binary search tree, construct the BST. For example, if the given traversal is {1, 7, 5, 50, 40, 10}, then… Read More »

## Commonly Asked Java Programming Interview Questions | Set 1 3.1

Why is Java called the ‘Platform Independent Programming Language’?   Platform independence means that execution of your program does not dependent on type of… Read More »

## Bin Packing Problem (Minimize number of used Bins) 3.5

Given n items of different weights and bins each of capacity c, assign each item to a bin such that number of total used bins… Read More »

## Print all palindrome permutations of a string 3.4

Given a string, we need to print all possible palindromes that can be generated using letters of that string. Examples: Input: str = “aabcb” Output:… Read More »

## Lexicographically next permutation in C++ 3.7

Given a word, find lexicographically greater permutation of it. For example, lexicographically next permutation of “gfg” is “ggf” and next permutation of “acb” is “bac”.… Read More »

## What’s the difference between Scripting and Programming Languages? 3

Basically, all scripting languages are programming languages. The theoretical difference between the two is that scripting languages do not require the compilation step and are… Read More »

## Bootstrap (Part-5) | DropDowns and Responsive Tabs 3.5

Introduction and Installation Grid System Buttons, Glyphicons, Tables Vertical Forms, Horizontal Forms, Inline Forms Progress Bar and Jumbotron Dropdowns In bootstrap, dropdowns are created using… Read More »

## Nearbuy(Groupon) Interview Experience | Set 3 (For Android Developer’) 3

Hacker Rank round 13 MCQ on java and android Find count of given words in the list of sentences Skype round (interview started late) 2… Read More »

## Applications of Catalan Numbers 3.8

Background : Catalan numbers are defined using below formula: Catalan numbers can also be defined using following recursive formula. The first few Catalan numbers for… Read More »

## Mathematics | Lagrange’s Mean Value Theorem 3

Suppose f(x) be a function satisfying three conditions: 1) f(x) is continuous in the closed interval a <= x <= b 2) f(x) is differentiable… Read More »

## Frobenius coin problem 3.5

Given two coins of denominations “X” and “Y” respectively, find the largest amount that cannot be obtained using these two coins (assuming infinite supply of… Read More »

## Number of Integral Points between Two Points 3.4

Given two points p (x1, y1) and q (x2, y2), calculate the number of integral points lying on the line joining them. Example : If… Read More »

## Function Interposition in C with an example of user defined malloc() 3

Function interposition is the concept of replacing calls to functions in dynamic libraries with calls to user-defined wrappers. What are applications? We can count number… Read More »

## SAP Labs Interview Experience | Set 21 (On-Campus for Associate Developer) 3.2

Round 1: Online Test The online test was comprised of 107 MCQ questions including 2 programming codes to be done in 90 minutes. Platform used was… Read More »

## Gray to Binary and Binary to Gray conversion 3

Binary Numbers is default way to store numbers, but in many applications binary numbers are difficult to use and a variation of binary numbers is… Read More »

## Maximum difference between node and its ancestor in Binary Tree 3.1

Given a binary tree, we need to find maximum value we can get by subtracting value of node B from value of node A, where… Read More »