• 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

Maximum sum contiguous subarray of an Array

Find min element in Sorted Rotated Array (With Duplicates)

The greedy coins game Dynamic Programming

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Connect n ropes with minimum cost

Leetcode: Merge Intervals

Max Sum in circularly situated Values

Common Ancestor in a Binary Tree or Binary Search Tree

Generic Object Oriented Stack with Template

VMWare Openings

Difference between a LinkedList and a Binary Search Tree BST

Count number of ways to reach a given score in a game

Amazon Interview On-Campus For Internship – 1

Binary Tree in Java

Sequence Finder Dynamic Programming

Advanced SQL Injection

Right view of Binary tree

Find Pythagorean Triplets in an array in O(N)

Find Percentage of Words matching in Two Strings

Walmart Labs Interview Experience

Printing Longest Common Subsequence

Calculate price of parking from parking start end time prices

VMWare SDEII Interview

Spanning Tree

Find the element that appears once others appears thrice

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Practo Hiring Experience

BFS (Breath First Search)

1014 Practice Question of New GRE – Princeton

Copyright © 2025 · Genesis Framework · WordPress · Log in