## Immediate smallest number after re-arranging the digits of a given number

Given a number print the immediate smallest number formed by re-arranging the digits of a given number. Print “Not Possible” if it is not possible… Read More »

- Largest Sum Contiguous Subarray
- Level Order Tree Traversal
- Search an element in a sorted and rotated array
- Queue using Stacks
- Find the number of islands | Set 1 (Using DFS)
- Trapping Rain Water
- Print a given matrix in spiral form
- Trie | (Insert and Search)
- Implement Stack using Queues
- Write a function to get the intersection point of two Linked Lists.
- Given a string, find its first non-repeating character
- Median of two sorted arrays of same size
- Majority Element
- Intersection of two Sorted Linked Lists
- Technical Test Patterns of Samsung, Microsoft, Deloitte, etc
- Check if two trees are Mirror
- A Product Array Puzzle
- Find the largest BST subtree in a given Binary Tree | Set 1
- Find the element that appears once in a sorted array
- Word Break Problem using Backtracking
- Print all nodes that don't have sibling
- Count BST nodes that lie in a given range
- Program to find amount of water in a given glass
- DE Shaw On-Campus for FTE
- Iterative method to check if two trees are mirror of each other
- A product array puzzle | Set 2 (O(1) Space)
- Given a matrix of 'O' and 'X', find the largest subsquare surrounded by 'X'
- D. E. Shaw Interview Experience
- Copy set bits in a range
- D.E. Shaw Interview Experience for Software Developer (Full Time)

Given a number print the immediate smallest number formed by re-arranging the digits of a given number. Print “Not Possible” if it is not possible… Read More »

DE Shaw One coding question (Graph BFS – Number of islands ) 10MCQS( Technical) Samsung Semiconductor(Bangalore) 3 Hour 1 coding question Samsung research(Bangalore) 1.5 hours… Read More »

Round 1: Online coding round conducted on Hacker Rank (60 minutes) Four Sections – First section, Time – 20 minutes 1 coding question Given… Read More »

ROUND-I: Time allotted : 1hr 10mins 20 Technical Aptitude-very basic questions were asked. 12 General Aptitude-questions are little hard. 8 Logical Aptitude-questions are little hard.… Read More »

Online [Coding] Round: The test had three sections – Coding, Technical and Aptitude. It was hosted on HackerRank. Coding round had 2 questions – Time… Read More »

Round 1: This was a coding round. There were two coding questions on the online platform(Hackerrank). Test Duration was 50 minutes. First Question You are… Read More »

Given a binary string find the longest substring which contains 1’s more than 0’s. Examples: Input : 1010 Output : 3 Substring 101 has 1… Read More »

Round 1: Online Round This round was conducted on Hackerrank platform. It had 3 sections. First section consisted of 2 coding questions and time allotted… Read More »

Round 1: It was a coding test on HackerRank platform. Two simple algorithmic questions were asked there which required basic knowledge on STL (for C++)… Read More »

Online Round: First round consisted of one coding question: There is an array of pile of chocolates, in every iteration Ayushi chose pile with maximum… Read More »

Round 1: It was an online coding round. Two problems in 45 minutes – An easy problem. Simply based on sorting the given data based on some indices… Read More »

DE Shaw came to my college for recruiting Systems and Operations Engineer interns. Round 1: Online test The first round was an online test which… Read More »

Technical Test: 1. Given a matrix consisting of ‘*’ and characters, print the character having maximum number of stars aside it (including diagonal elements too).… Read More »

I applied for DE Shaw off campus through their site. Round 1 (Online round): After a few weeks, a hackerrank link was provided for an online… Read More »

Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that prod[i] is equal to the product of all… Read More »