## Subset Sum Problem in O(sum) space

Given an array of non-negative integers and a value sum, determine if there is a subset of the given set with sum equal to given… Read More »

## Drishti-Soft Solutions Interview | Set 7 (Off-Campus)

Had applied Off campus. They had asked us to bring our own laptops. Round 1 – Online round. 3 hours 30 MCQ questions based on… Read More »

## Drishti-Soft Solutions Interview | Set 6 (On-Campus)

DrishtiSoft came to our college. Here is my interview experience. There were total 5 rounds. Round 1 (3 hours):      section 1:          30 Aptitude… Read More »

## Drishti-Soft Solutions Interview | Set 5 (On-Campus)

Drishti Soft Solutions Interview Experience (On Campus): Round 1: (3 hours) Section 1: 30 general Aptitude MCQ questions. Section 2: 2 coding questions, 1 Bugger… Read More »

## Drishti-Soft Solutions Interview | Set 4 (On-Campus)

Drishti-soft solutions came in our college.here is my interview experience. There were total 5 rounds 1. First round It was an online round. It comprised… Read More »

## Drishti-Soft Solutions Interview | Set 3 (On-Campus)

This test consisted of two sections MCQ and PROGRAMMING. The section MCQ had 30 questions and was supposed to be solved in 30 minutes. It… Read More »

## Drishti-Soft Solutions Interview | Set 2 (On-Campus Written)

This test consisted of two sections MCQ and PROGRAMMING. The section MCQ had 30 questions and was supposed to be solved in 30 minutes.It included… Read More »

## Count numbers from 1 to n that have 4 as a digit

Given a number n, find count of all numbers from 1 to n that have 4 as a digit. Examples : Input: n = 5… Read More »

## Drishti-Soft Solutions Interview | Set 1

Location: Guagaon Position: Software Developer I decided to write this post because when i was preparing, I didn’t find any help on google about the… Read More »

## Subset Sum Problem | DP-25

Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given… Read More »

Given a linked list where every node represents a linked list and contains two pointers of its type: (i) Pointer to next node in the… Read More »

## Partition problem | DP-18

Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is… Read More »

## Subset Sum | Backtracking-4

Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up to a given number K. We… Read More »

## Rat in a Maze | Backtracking-2

We have discussed Backtracking and Knight’s tour problem in Set 1. Let us discuss Rat in a Maze as another example problem that can be… Read More »