## Advantages of cracking GATE from Indian Perspective

If you get very good marks in GATE say above 70 (may vary from year to year), then you have got fair some amount of… Read More »

- Courses @ GeeksforGeeks
- Internships @ GeeksforGeeks
- Coding Practice
- How to write an Interview Experience?
- Must Do Coding Questions Company-wise
- Must Do Coding Questions Topic-wise
- Basic
- Easy
- Medium
- Hard
- Expert
- Step by Step Preparation
- Company Preparation
- Top Topics
- Company Specific Practice
- Software Design Patterns
- Placements Preparation Course
- Interview Corner
- Recent Interview Experiences
- GQ Home Page
- Quiz Corner
- LMNs
- What's New ?
- Leaderboard !!
- Topic-wise Practice
- Subjective Problems
- Difficulty Level - School
- Difficulty Level - Basic
- Difficulty Level - Easy
- Difficulty Level - Medium
- Difficulty Level - Hard
- Explore More...
- C
- C++
- Java
- Python
- SQL
- PHP
- JavaScript
- School Programming
- Operating Systems
- DBMS
- Computer Networks
- Engineering Mathematics
- Design Patterns
- Common Interview Puzzles
- Web Technology
- G-Facts
- Computer Graphics
- Image Processing
- Project Ideas

If you get very good marks in GATE say above 70 (may vary from year to year), then you have got fair some amount of… Read More »

Problem – Implement a recognizer for pascal identifiers based on a DFA that accepts strings belonging to the definition of the language of the same.… Read More »

System Integration Testing (SIT): For better understanding of what is SIT first, we must understand what is System integration? so basically as the name itself… Read More »

Ever heard of Facebook? Well, unless you have been living under a rock this past decade, I’m sure you have. And in case you haven’t,… Read More »

Round 1: It consisted of a single coding question to be solved under 3 hrs. There were two slots – First slot recieved this question-… Read More »

Kotlin HashSet is a generic unordered collection of elements and it does not contain duplicate elements. It implements the set interface. hashSetOf() is a function… Read More »

Given two number N and M. The task is to find the number of shortest paths to reach the cell(i, j) in the grid of… Read More »

Given an array of values. The task is to implement a Binary Search Tree using values of the array where every node stores the maximum… Read More »

Given two trees each of N nodes. Removing an edge of the tree partitions the tree in two subsets. Find the total maximum number of… Read More »

Given a binary string str, the task is to find the minimum number of operations required to make all the characters of the string same… Read More »

Given a grid of size H*W with all cells initially white. Given N pairs (i, j) in an array, for each pair, paint cell (i,… Read More »

Given a and b which represents the location of two factors of N whose product is equal to the number N when the factors are… Read More »

Given a string S of length N, and M queries of the following type: Type 1: 1 L x, Indicates update Lth index of string… Read More »

Given two integers L and R (L < = R). The task is to find all square free semiprimes in the range L to R… Read More »

Consider a BST(Binary Search Tree) where duplicates are not allowed. Given a key present in the BST. The task is to find its pre-order successor… Read More »