• 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

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are sequences of contiguous characters separated by any of
the characters that are part of delimiters

Example

/* strtok example */


int main ()
{
  char str[] ="This-is Go,Hired Site.";
  char * pch;
  printf ("Splitting string "%s" into tokens:n",str);
  printf ("--------");
  pch = strtok (str," ,.-"); // ',' '.' and '-' will be removed
  while (pch != NULL)
  {
    printf ("%sn",pch);
    pch = strtok (NULL, " ,.-");
  }
  return 0;
}
Output:
Splitting string “This-is Go,Hired Site.” into tokens:
——–
This is Go Hired Site

Similar Articles

Filed Under: problem Tagged With: Array, string

Reader Interactions

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

The Magic HackerEarth Nirvana solutions Hiring Challenge

Printing Longest Common Subsequence

Facebook Interview Question : Interleave List

Binary Tree in Java

Naurki.com Security Breach

How strtok() Works

Right view of Binary tree

Urban Ladder Written Test.

CodeChef Code SGARDEN

Edit Distance ( Dynamic Programming )

Diagonal Traversal of Binary Tree

Maximum occurred Smallest integer in n ranges

Cisco Hiring Event 21st – 22nd Feb 2015

Maximum difference between two elements s.t larger element appears after the smaller number

Hackerearth : Counting Subarrays

1014 Practice Question of New GRE – Princeton

Python String and numbers

Printing each word reverse in string

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Circular Linked List

Generate next palindrome number

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

Leetcode: Edit Distance

Sort Stack in place

Find Pythagorean Triplets in an array in O(N)

BlueStone E-commerce Interview Experience

ADOBE Aptitude C Language Test

Spanning Tree

Print vertical sum of all the axis in the given binary tree

FizzBuzz Solution C C++

Copyright © 2026 · Genesis Framework · WordPress · Log in