• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Unix

C Program for TAIL command of UNIX

April 27, 2015 by Dhaval Dave

/*
* usage: myTail [-n] [<filename>] */

#include <stdio.h>
#include <stdlib.h>

#define MAX_LINE_LEN 1024
#define DEFAULT_N 10

int main(int argc, char *argv[]) {
char **tail;
int count = DEFAULT_N, n, i, headX = 0, tailX 
… Read More

Filed Under: Adobe Interview Questions, Interview Questions, problem Tagged With: c, Unix

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Leetcode: Edit Distance

Find min element in Sorted Rotated Array (With Duplicates)

Level order traversal in Spiral form

Find position of the only set bit

Skiing on Mountains Matrix

Printing intermediate Integers between one element & next element of array

Apriori algorithm C Code Data Mining

Circular Linked List

Reversal of LinkedList

Maximum of all subarrays of size k

Count Possible Decodings of a given Digit Sequence

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Maximum path sum between two leaves

Spanning Tree

Flipkart Set 1 On Campus with Answers

CodeChef Code SGARDEN

Binary Tree in Java

Add Sub Multiply very large number stored as string

BFS (Breath First Search)

CodeChef’ RRCOPY

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Reliance Jio Software Developer Interview Experience

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Binary Tree in Java

Maximum occurred Smallest integer in n ranges

Check if an array has duplicate numbers in O(n) time and O(1) space

Sort Stack in place

DFS (Depth First Search)

Minimum insertions to form a palindrome

Copyright © 2026 · Genesis Framework · WordPress · Log in